A mathematical approach for mission planning and rehearsal

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 an approach which builds stochastic mathematical models, in particular G-networks models, that allow the efficient representation of systems of agents and offer the possibility to analyze their behavior using mathematics. This work complements our previous results on the discrete event simulation of adversarial tactical scenarios. 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. With our approach, one can compare the effects of alternatives and chose the best one available. We model routine activities as well as situations such as: changing plans (e.g. destination or target), splitting forces to carry out alternative plans, or even changing on adversary group. Behaviors such as competition and collaboration are included. We demonstrate our approach with some urban military planning scenarios and analyze the results. This work can be used to model the system at different abstraction levels, in terms of the number of agents and the size of the geographical location. In doing so, we greatly reduce computational complexity and save time and resources. We conclude the paper with potential extensions of the model, for example the arrival of reinforcements, the impact of released chemicals and so on.

[1]  Anand S. Rao,et al.  A Methodology and Modelling Technique for Systems of BDI Agents , 1996, MAAMAW.

[2]  Erol Gelenbe,et al.  Biological Metaphors for Agent Behavior , 2004, ISCIS.

[3]  Erol Gelenbe,et al.  Enabling Simulation with Augmented Reality , 2003, MASCOTS Tutorials.

[4]  Birgit Burmeister,et al.  Models and Methodology for Agent-Oriented Analysis and Design , 2000 .

[5]  Ser Yong Lim,et al.  Virtual obstacle concept for local-minimum-recovery in potential-field based navigation , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[6]  Kaizar Amin,et al.  Dynamic agent population in agent-based distance vector routing , 2003, Neural Parallel Sci. Comput..

[7]  Eric S. K. Yu,et al.  Requirements Engineering for Large-Scale Multi-Agent Systems , 2002 .

[8]  Erol Gelenbe,et al.  Modelling Large Scale Autonomous Systems , 2006, 2006 9th International Conference on Information Fusion.

[9]  A. Abur,et al.  A multi-level graded-precision model of large scale power systems for fast parallel computation , 1988 .

[10]  Yu Wang Numerical Modelling of Autonomous Agent Movement and Conflict , 2006, Comput. Manag. Sci..

[11]  Erol Gelenbe,et al.  Random Neural Networks with Negative and Positive Signals and Product Form Solution , 1989, Neural Computation.

[12]  Erol Gelenbe,et al.  A trade-off between agility and resilience * , 2004 .

[13]  Erol Gelenbe G-Networks with Signals and Batch Removal , 1993 .

[14]  Erol Gelenbe,et al.  G-networks with multiple classes of signals and positive customers , 1998, Eur. J. Oper. Res..

[15]  E. Gelenbe,et al.  Simulating the Navigation and Control of Autonomous Agents ∗ , 2004 .

[16]  E. Gelenbe G-networks by triggered customer movement , 1993 .

[17]  Erol Gelenbe,et al.  G-Networks with Multiple Classes of Negative and Positive Customers , 1996, Theor. Comput. Sci..

[18]  Daimler-Benz,et al.  Models and Methodology for Agent-Oriented Analysis and Design , 2000 .