Informatics and Applications

2020, Volume 14, Issue 4, pp 77-82

CONFLICT VISUAL REPRESENTATION METHOD IN HYBRID INTELLIGENT MULTIAGENT SYSTEMS

S. B. Rumovskaya
I. A. Kirikov

Abstract

Small collectives of experts, including specialists from different fields, effectively solve complex problems by analyzing them from different points of view and obtaining a better-integrated solution. A conflict in small collectives of experts can both lead to a deadlock in the decision-making process and generate positive changes: development of the group, diagnostics of relations, and consolidation of the group. A conflict breeds debate, the depth of which allows for more thoughtful and coordinated solutions. Such collectives of experts solve problems effectively. Thus, modeling of their work and possible conflict situation with managing it allows developing a decision-support method that is relevant to solving a complex problem. Visualization of a conflict situation makes appeared contradictions contrast and observable. In the research, the authors represent a collective of agents-experts in the form of an undirected weighted graph. The methods of graph visualization are considered. To visualize problem- and process-oriented conflicts within hybrid intelligent multiagent systems, the authors propose a method based on the spring model of graph drawing.

[+] References (17)

Kolesnikov, A. V. 2013. Geterogennye estestvennye i iskusstvennye sistemy [Natural and artificial heterogeneous systems]. Integrirovannye modeli i myagkie vy- chisleniya v iskusstvennom intellekte [Integrated models and soft computing in artificial intelligence]. Moscow: Fizmatlit. 1:86-103.
Kolesnikov, A. V., I. A. Kirikov, and S.V. Listopad. 2014. Gibridnye intellektual'nye sistemy s samoorganizatsiey: ko- ordinatsiya, soglasovannost', spor [Hybrid artificial systems withself-organization: Coordination, conformance, row]. Мoscow: IPI RAN. 189 p.
Rumovskaya, S. B., and I. A. Kirikov. 2019. Metody modelirovaniya i vizual'nogo predstavleniya konflikta v malom kollektive ekspertov, reshayushchikh problemy (ob- zor) [Methods of modeling and visual representation of a conflict in small collective of experts solving problems (review)]. Informatika i ee Primeneniya - Inform. Appl. 13(3):122-130. doi: 10.14357/19922264190317.
Listopad, S.V., and I. A. Kirikov. 2019. Modelirovanie konfliktov agentov v gibridnykh intellektual'nykh mnogoagentnykh sistemakh [Modeling of agent conflicts in hybrid intelligent multiagent systems]. Sistemy i Sred- stva Informatiki - Systems and Means of Informatics 29(3):139-148. doi: 10.14357/08696527190312.
Listopad, S.V., and I. A. Kirikov. 2020. Metod identifikatsii konfliktov agentov v gibridnykh intellektual'nykh mnogoagentnykh sistemakh [Agent conflict identification method in hybrid intelligent multiagent systems]. Sistemy i Sredstva Informatiki - Systems and Means of Informatics 30(1):56- 65. doi: 10.14357/08696527200105.
Gotin, S. V., and L. P. Kalosha. 2007. Logiko-strukturnyy podkhod i ego primenenie dlya analiza i planirovaniya deyatel'nosti [Logical-structural approach and its application for the analysis and planning of activities]. Moscow: Variant. 118 p.
Novikov, D.A. 2012. Ierarkhicheskie modeli voennykh deystviy [Hierarchical models of combat]. Upravlenie bol'shimi sistemami [Control of Large Systems] 37:25- 62.
Eades, P. 1984. A heuristic for graph drawing. Congressus Numerantium 42:149-160.
Kamada, X, and S. Kawai. 1989. An algorithm for drawing general undirected graphs. Inform. Process. Lett. 31(1):7- 15. doi: 10.1016/0020-0190(89)90102-6.
Fruchterman, T, and E. Reingold. 1991. Graph drawing by force-directed placement. Software Pract. Exper. 21(11):1129-1164. doi: 10.1002/spe.4380211102.
Sugiyama, К., S. Tagawa, and M. Toda. 1981. Methods for visual understanding of hierarchical system structures. IEEE T. Syst. Man Cyb. 11(2):109-125. doi: 10.1109/TSMC.1981.4308636.
Tamassia, R., G. D. Battista, G. Ioannis, and P. Eades. 1999. Graph drawing: Algorithms for the visualization of graphs. Englewood Cliffs, NJ: Prentice Hall. 397 p.
Reingold, E., and J. Tilford. 1981. Tidier drawing of trees. IEEE T. Software Eng. SE-7(2):223-228. doi: 10.1109/TSE.1981.234519.
Tutte, W. T. 1963. How to draw a graph. P. Lond. Math. Soc. S3-13(1):743-767. doi: 10.1112/plms/s3-13.1.743.
Di Battista, G., G. Liotta, and F Vargiu. 1993. Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs. Algorithms and data structures. Eds. F. K. H.A. Dehne, J.-R. Sack, N. Santoro, and S. Whikesides. Lecture notes in computer science ser. Springer. 709:151-162. doi: 10.1007/3-540- 57155-8_244.
Kruskal, J. В., and J. B. Seery. 1980. Designing network diagrams. 1st General Conference (International) on Social Graphics Proceedings. 22-50.
Pupyrev, S. N. 2010. Modeli, algoritmy i programmnyy kompleks vizualizatsii slozhnykh setey [Models, algo-rithms and software for visualization of complex networks]. Ekaterinburg. PhD Diss. 136 p.

[+] About this article