Abstract
In this paper, we investigate the multiagent planning problem in the presence of cooperative actions and agents, which have their own goals and are willing to cooperate. To this end, we extend the action language \(\mathcal A\) in [12] to represent and reason about plans with cooperative actions of an individual agent operating in a multiagent environment. We then use the proposed language to formalize the multiagent planning problem and the notion of a joint plan for multiagents in this setting. We discuss a method for computing joint plans using answer set programming and provide arguments for the soundness and completeness of the implementation.
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
Boutilier, C., Brafman, R.I.: Partial-order planning with concurrent interacting actions. JAIR 14, 105–136 (2001)
Brenner, M.: Planning for Multiagent Environments: From Individual Perceptions to Coordinated Execution. In: Work. on Multiagent Planning & Scheduling, ICAPS, pp. 80–88 (2005)
Cox, J.S., Durfee, E.H.: An efficient algorithm for multiagent plan coordination. In: AAMAS 2005, pp. 828–835 (2005)
Cox, J.S., Durfee, E.H., Bartold, T.: A Distributed Framework for Solving the Multiagent Plan Coordination Problem. In: AAMAS, pp. 821–827. ACM Press, New York (2005)
de Weerdt, M., Bos, A., Tonino, H., Witteveen, C.: A resource logic for multi-agent plan merging. Ann. Math. Artif. Intell. 37(1-2), 93–130 (2003)
de Weerdt, M., ter Mors, A., Witteveen, C.: Multi-agent planning: An introduction to planning and coordination. In: Handouts of the Euro. Agent Summer School, pp. 1–32 (2005)
desJardins, M., Durfee, E.H., Ortiz, C.L., Wolverton, M.: A survey of research in distributed, continual planning. AI Magazine 20(4), 13–22 (1999)
Dimopoulos, Y., Moraitis, P.: Multi-agent coordination and cooperation through classical planning. In: IEEE/WIC/ACM/IAT, pp. 398–402. IEEE Comp. Society, Los Alamitos (2006)
Durfee, E.: Distributed Problem Solving and Planning. In: Multiagent Systems (A Modern Approach to Distributed Artificial Intelligence), pp. 121–164. MIT Press, Cambridge (1999)
Eiter, T., Faber, W., Leone, N., Pfeifer, G., Polleres, A.: Answer Set Planning under Action Costs. Journal of Artificial Intelligence Research 19, 25–71 (2003)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Fujisaki, T., Furukawa, K., Tanaka, H. (eds.) Logic Programming 1988. LNCS, vol. 383, pp. 1070–1080. Springer, Heidelberg (1989)
Gelfond, M., Lifschitz, V.: Representing actions and change by logic programs. Journal of Logic Programming 17(2,3,4), 301–323 (1993)
Gelfond, M., Lifschitz, V.: Action languages. ETAIÂ 3(6) (1998)
Ghallab, M., Howe, A., Knoblock, C., McDermott, D., Ram, A., Veloso, M., Weld, D., Wilkins, D.: PDDL — the Planning Domain Definition Language. Ver. 1.2. TR1165, Yale (1998)
Kakas, A.C., Miller, R., Toni, F.: E-RES. Reasoning about Actions, Events and Observations. In: Eiter, T., Faber, W., Truszczyński, M. (eds.) LPNMR 2001. LNCS (LNAI), vol. 2173, pp. 254–266. Springer, Heidelberg (2001)
Lifschitz, V.: Action languages, answer sets and planning. In: The Logic Programming Paradigm: a 25-Year Perspective, pp. 357–373. Springer, Heidelberg (1999)
Lifschitz, V., Turner, H.: Splitting a logic program. In: ICLP, pp. 23–38 (1994)
Marek, V., Truszczyński, M.: Stable models and an alternative logic programming paradigm. In: The Log. Prog. Paradigm: a 25-year Perspective, pp. 375–398 (1999)
Niemelä, I.: Logic programming with stable model semantics as a constraint programming paradigm. AMAI 25(3,4), 241–273 (1999)
Niemelä, I., Simons, P., Soininen, T.: Stable model semantics for weight constraint rules. In: Proc. Logic Programming and NonMonotonic Rreasong, pp. 315–332 (1999)
Parsons, S., Sierra, C., Jennings, N.R.: Agents that reason and negotiate by arguing. J. of Log. and Comp. 8(3), 261–292 (1998)
Son, T.C., Baral, C., Tran, N., McIlraith, S.: Domain-Dependent Knowledge in Answer Set Planning. ACM Transactions on Computational Logic 7(4) (2006)
Son, T.C., Pontelli, E.: Planning with Preferences using Logic Programming. Journal of Theory and Practice of Logic Programming (TPLP) 6, 559–607 (2006)
Son, T.C., Pontelli, E., Sakama, C.: Logic Programming for Multiagent Planning with Negotiation. In: ICLP (accepted, 2009)
Son, T.C., Sakama, C.: Reasoning and Planning with Cooperative Actions for Multiagents Using Answer Set Programming. Technical Report (2008)
Tu, P.H., Son, T.C., Baral, C.: Reasoning and Planning with Sensing Actions, Incomplete Information, and Static Causal Laws using Logic Programming. TPLP 7, 1–74 (2006)
Wooldridge, M., Parsons, S.: Languages for negotiation. In: Proceedings of ECAI (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Son, T.C., Sakama, C. (2010). Reasoning and Planning with Cooperative Actions for Multiagents Using Answer Set Programming. In: Baldoni, M., Bentahar, J., van Riemsdijk, M.B., Lloyd, J. (eds) Declarative Agent Languages and Technologies VII. DALT 2009. Lecture Notes in Computer Science(), vol 5948. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11355-0_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-11355-0_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11354-3
Online ISBN: 978-3-642-11355-0
eBook Packages: Computer ScienceComputer Science (R0)