Computational Management Science

, Volume 3, Issue 3, pp 207–223

Numerical Modelling of Autonomous Agent Movement and Conflict

Original Paper


The world that we live in is filled with large scale agent systems, from diverse fields such as biology, ecology or finance. Inspired by the desire to better understand and make the best out of these systems, we propose to build stochastic mathematical models, in particular G-networks models. With our approach, we aim to provide insights into systems in terms of their performance and behavior, to identify the parameters which strongly influence them, and to evaluate how well individual goals can be achieved. Through comparing the effects of alternatives, we hope to offer the users the possibility of choosing an option that address their requirements best. We have demonstrated our approach in the context of urban military planning and analyzed the obtained results. The results are validated against those obtained from a simulator (Gelenbe et al. in simulating the navigation and control of autonomous agents, pp 183–189, 2004a; in Enabling simulation with augmented reality, pp 290–310, 2004b) that was developed in our group and the observed discrepancies are discussed. The results suggest that the proposed approach has tackled one of the classical problems in modeling multi-agent systems and is able to predict the systems’ performance at low computational cost. In addition to offering the numerical estimates of the outcome, these results help us identify which characteristics most impact the system. We conclude the paper with potential extensions of the model.


Mathematical modeling G-Networks Military strategy and planning Multi-agent systems 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Amin KA, Mikler AR (2002) Dynamic agent population in agent-based distance vector routing. In: Proceedings of the 2nd international workshop on Intelligent systems design and application, pp 195–200Google Scholar
  2. Burmeister B (1996) Models and methodology for agent-oriented analysis and design. In: Fischer K. (ed) Working notes of the KI’96 workshop on agent-oriented programming and distributed systemsGoogle Scholar
  3. Cysneiros LM, Yu E (2003) Requirements engineering for large-scale multi agent systems. Software engineering for large-scale multi-agent systems: research issues and practical applications, 2603, pp 39–56Google Scholar
  4. Gelenbe E. (1989a)Rseaux stochastiques ouverts avec clients ngatifs et positifs, et rseaux neuronaux. Comptes-Rendus Acad. Sciences de Paris, t. 309, Srie II, pp 979–982Google Scholar
  5. Gelenbe E (1989b) Random neural networks with positive and negative signals and product form solution. Neural Comput 1(4): 502–510CrossRefGoogle Scholar
  6. Gelenbe E (1993a) G-networks with instantaneous customer movement. J Appl Probab 30(3):742–748CrossRefGoogle Scholar
  7. Gelenbe E (1993b) G-Networks with signals and batch removal. Probability in the Eng Inf Sci 7: 335–342CrossRefGoogle Scholar
  8. Fourneau JM, Gelenbe E, Suros R (1996) G-networks with multiple classes of positive and negative customers. Theor Comput Sci 155: 141–156CrossRefGoogle Scholar
  9. Gelenbe E, Labed A (1998) G-networks with multiple classes of signals and positive customers. Eur J Operat Res 108(2): 293–305CrossRefGoogle Scholar
  10. Gelenbe E, Hussain K, Kaptan V (2004a) Simulating the navigation and control of autonomous agents. In: Proceedings of the 7th international conference on information fusion, pp 183–189Google Scholar
  11. Gelenbe E, Hussain K, Kaptan V (2004b) Enabling simulation with augmented reality. In: Proceedings of the international symposium on modeling, analysis and simulation of computer and telecommunication systems, pp 290–310Google Scholar
  12. Gelenbe E, Wang Y (2004) A Trade-off between Agility and Resilience. In: Proceedings of the 13th Turkish symposium on artificial intelligence and neural networks, pp 209–217Google Scholar
  13. Gelenbe E, Kaptan V, Wang Y (2004c) Biological metaphors for agent behaviour. In: Proceedings of the 19th international symposium on computer and information sciences. Lecture Notes in Computer Science, Vol LNCS 3280. Springer 667–675Google Scholar
  14. Gelenbe E, Kaptan V, Wang Y (2005) Simulation and modelling of adversarial games. In: Proceedings of the 6th European GAME-ON conference on simulation and AI in computer games, pp 40–44Google Scholar
  15. Huang G, Abur A, Tsai WK (1998) A multi-level graded-precision model of large scale power systems for fast parallel computation. Math Comput Model 11: 325–330CrossRefGoogle Scholar
  16. Kinny D, Georgeff M, Rao A (1996) A methodology and modelling technique for systems for BDI agents. In: van der Velde W, Perram J (eds) Agents breaking away: proceedings of the 7th European workshop on modelling autonomous agents in a multi-agent world MAAMAW’96, (LANI vol 1038), pp 56–71Google Scholar
  17. Liu Z, Ang MH, Seah WKG (2003) A potential field based approach for multi-robot tracking of multiple moving targets. Environment and Management International ConferenceGoogle Scholar
  18. Liu CQ, Ang MH, Yong LS (2000) Virtual obstacle concept for local-minimum-recovery in potential-field based navigation. In: Proceedings of the 2000 IEEE International conference on robitics and automation, pp 983–988Google Scholar
  19. Reif JH, Wang HY (1995) Social potential fields: A distributed behavioral control for autonomous robots. The Algorithmic Foundations of Robotics, pp 331–345Google Scholar
  20. Yun XP, Tan KC (1997) A wall-following method for escaping local minima in potential field based motion planning. In: Proceedings of 8th international conference on advanced robotics, pp 421–426Google Scholar

Copyright information

© Springer-Verlag 2006

Authors and Affiliations

  1. 1.Electrical and Electronic Engineering DepartmentImperial College LondonLondonUK

Personalised recommendations