Abstract
We assume that a number of agents have to work together on some joint task T consisting of a number of elementary tasks t j , partially ordered by a set of precedence constraints. The elementary tasks are allocated to the agents using some given task allocation protocol (cf. [2]). We assume that (i) to perform its set of tasks, an agent needs to make a plan, and that (ii) each agent wishes to retain full planning autonomy, i.e., to retain the freedom to decide how to best perform its tasks.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Decker, K.S., Lesser, V.R.: Designing a family of coordination algorithms. In: Proceedings of the Thirteenth International Workshop on Distributed Artificial Intelligence (DAI 1994), pp. 65–84 (1994)
Shehory, O., Kraus Methods, S.: for task allocation via agent coalition formation. Artificial Intelligence (1998)
ter Mors, A., Valk, J., Witteveen, C.: Complexity of coordinating autonomous planning agents: Technical report (2004)
Valk, J., Witteveen, C.: Multi-agent coordination in planning. In: Seventh Pacific Rim International Conference on Artificial Intelligence, Tokyo, Japan, August 2002, pp. 335–344. Springer, Heidelberg (2002)
von Martial, F.: Coordinating Plans of Autonomous Agents. LNCS(LNAI), vol. 610. Springer, Heidelberg (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
ter Mors, A., Valk, J., Witteveen, C. (2004). Complexity of Coordinating Autonomous Planning Agents. In: Zhang, C., W. Guesgen, H., Yeap, WK. (eds) PRICAI 2004: Trends in Artificial Intelligence. PRICAI 2004. Lecture Notes in Computer Science(), vol 3157. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28633-2_131
Download citation
DOI: https://doi.org/10.1007/978-3-540-28633-2_131
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22817-2
Online ISBN: 978-3-540-28633-2
eBook Packages: Springer Book Archive