4.7 Conclusion
The two models presented in this paper are suitable for multi-agent planning. The Recursive Petri nets allow the plans modeling (both at the agent and multi-agents levels) and their management when abstraction and dynamic refinement are required. RPN allows. easily. the synchronization of individual agents’ plans. They are, in particular, Interesting for the multi-agent validation thanks to the reachability tree building if combined to reduction technics (in order to avoid the combinatory explosion of the the number of states). The main shortcomoing of this model is the absence of explicit handling of temporal constraints. This is why we developed a model based on Hybrid Automata that model different clocks evolving with different speeds. These Clocks may be the resources of each agent and the time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Alur and D. Dill A Theory of Timed Automata. Theoretical Computer Science. Vol. 126, n. 3, pages 183–225. (1994)
A. Barrett and D.S. Weld. Characterizing Subgoal Interactions for Planning. In Proceedings of IJCAI-93, pp 1388–1393. (1993).
A. El Fallah Seghrouchni and S. Haddad. A Recursive Model for Distributed Planning. In the proceedings of ICMAS’96. IEEE publisher. Japan (1996).
A. El Fallah-Seghrouchni, I. Degirmenciyan-Cartault and F. Marc. Framework for Multi-Agent Planning based on Hybrid Automata. In the proceedings of CEEMAS 03 (International/Eastern Europe conference on Multi-Agent System). LNAI 2691. Springer Verlag. Prague.(2003).
A. El Fallah-Seghrouchni, F. Marc and I. Degirmenciyan-Cartault. Modelling, Control and Validation of Multi-Agent Plans in Highly Dynamic Context. To appear in the proceedings of AAMAS 04. ACM Publisher. New York. (2004).
M.P. Georgeff. Planning. In Readings in Planning. Morgan Kaufmann Publishers, Inc. San Mateo, California. (1990)
T. A. Henzinger. The theory of Hybrid Automata. In the proceedings of 11th IEEE Symposium Logic in Computer Science. pages 278–292. (1996)
T. A. Henzinger, Pei-Hsin Ho and H. Wong-Toi HyTech: a model checker for hybrid systems Journal of Software Tools for Technology Transfer. Vol. 1, n. 1/2, pages 110–122. (2001)
Jensen, K. High-level Petri Nets, Theory and Application. Springer-Verlag. (1991)
Martial, V. 1990. Coordination of Plans in a Multi-Agent World by Taking Advantage of the Favor Relation. In Proceedings of the Tenth International Workshop on Distributed Artificial Intelligence.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
El Fallah-Seghrouchni, A. (2005). Multi-agent Planning for Autonomous Agents’ Coordination. In: Monitoring, Security, and Rescue Techniques in Multiagent Systems. Advances in Soft Computing, vol 28. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-32370-8_4
Download citation
DOI: https://doi.org/10.1007/3-540-32370-8_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23245-2
Online ISBN: 978-3-540-32370-9
eBook Packages: EngineeringEngineering (R0)