Abstract
We discuss task planning problems where a number of agents have to work on a joint planning problem that consists of a set of interdependent, hierarchically ordered tasks. Each agent is assigned a subset of tasks to perform for which it has to construct a plan. The agents are non-cooperative in that they insist on planning autonomously and do not want to revise their individual plans when a joint plan has to be assembled. The aim of this paper is twofold: first of all to present a general formal framework to study some computational aspects of this non-cooperative coordination problem, and secondly to establish some complexity results and to identify some of the factors that contribute to the complexity of this problem.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Cox, J.S., Durfee, E.H.: Discovering and exploiting synergy between hierarchical planning agents. In: Second International Joint Conference On Autonomous Agents and Multiagent Systems, AAMAS 2003 (2003)
Ephrati, E., Rosenschein, J.S.: Multi-agent planning as the process of merging distributed sub-plans. In: Proceedings of the Twelfth International Workshop on Distributed Artificial Intelligence (DAI 1993), pp. 115–129 (1993)
Lesser, V., Decker, K., Wagner, T., Carver, N., Garvey, A., Horling, B., Neiman, D., Podorozhny, R., NagendraPrasad, M., Raja, A., Vincent, R., Xuan, P., Zhang, X.Q.: Evolution of the GPGP/TAEMS Domain-Independent Coordination Framework. Autonomous Agents and Multi-Agent Systems 9(1), 87–143 (2004)
Von Martial, F.: Coordinating Plans of Autonomous Agents. LNCS (LNAI), vol. 610. Springer, Heidelberg (1992)
Shoham, Y., Tennenholtz, M.: Emergent conventions in multi-agent systems: Initial experimental results and observations (preliminary report). In: Proceedings KR 1992, pp. 225–231 (1992)
Shoham, Y., Tennenholtz, M.: On social laws for artificial agent societies: Off-line design. Artificial Intelligence 73(1–2), 231–252 (1995)
Smith, R.G.: The contract net protocol: High-level communication and control in a distributed problem solver. IEEE Transactions on Computers C-29(12), 1104–1113 (1980)
ter Mors, A.W., Valk, J., Witteveen, C.: Complexity of coordinating autonomous planning agents. Technical Report PDS-2004-002, Delft University of Technology (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
ter Mors, A., Valk, J., Witteveen, C. (2005). Complexity of Task Coordination for Non Cooperative Planning Agents. In: Pěchouček, M., Petta, P., Varga, L.Z. (eds) Multi-Agent Systems and Applications IV. CEEMAS 2005. Lecture Notes in Computer Science(), vol 3690. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11559221_70
Download citation
DOI: https://doi.org/10.1007/11559221_70
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29046-9
Online ISBN: 978-3-540-31731-9
eBook Packages: Computer ScienceComputer Science (R0)