Abstract
Multiagent planning deals with the problem of generating plans for multiple agents. It requires formalizing ways for the agents to interact and cooperate, in order to achieve their goals. One way for the agents to interact is through negotiations. Integration of negotiation in multiagent planning has not been extensively investigated and a systematic way for this task has yet to be found. We develop a generic model for negotiation in dynamic environments and apply it to generate joint-plans with negotiation for multiple agents. We identify the minimal requirements for such a model and propose a general scheme for one-to-one negotiations. This model of negotiation is instantiated to deal with dynamic knowledge of planning agents. We demonstrate how logic programming can be employed as a uniform platform to support both planning and negotiation, providing an ideal testbed for experimenting with multiagent planning with negotiations.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Amgoud, L., Dimopoulos, Y., Moraitis, P.: A unified and general framework for argumentation-based negotiation. In: AAMAS, pp. 1018–1025. ACM Press, New York (2006)
Boutilier, C., Brafman, R.I.: Partial-order planning with concurrent interacting actions. J. Artif. Intell. Res. 14, 105–136 (2001)
Castro, L., et al.: XASP: Answer Set Programming with XSB and Smodels (2007)
Chen, W., Zhang, M., Foo, N.: Repeated negotiation of logic programs. In: Workshop on Nonmonotonic Reasoning, Action and Change (2006)
Cox, J.S., Durfee, E.H.: An efficient algorithm for multiagent plan coordination. In: AAMAS, pp. 828–835. ACM, New York (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)
El-Khatib, O., Pontelli, E., Son, T.: ASP-Prolog: A System for Reasoning about Answer Set Programs in Prolog. In: Jayaraman, B. (ed.) PADL 2004. LNCS, vol. 3057, pp. 148–162. Springer, Heidelberg (2004)
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. JLP 17(2,3,4), 301–323 (1993)
Gelfond, G., Watson, R.: Modeling Cooperative Multi-Agent Systems. In: ASP 2007 (2007)
Ghallab, M., Nau, D., Traverso, P.: Automated Planning. Morgan Kaufmann, CA (2004)
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)
Kakas, A., Moraitis, P.: Adaptive agent negotiation via argumentation. In: AAMAS, pp. 384–391. ACM Press, New York (2006)
Kakas, A., Torroni, P., Demetriou, N.: Agent planning, negotiation and control of operation. In: ECAI, pp. 28–32. IOS Press, Amsterdam (2004)
Kraus, S.: Negotiation and cooperation in multi-agent environments. AI J. 94(1-2) (1997)
Lifschitz, V.: Answer set programming and plan generation. Artificial Intelligence 138(1–2), 39–54 (2002)
Rahwan, I., et al.: Argumentation-based negotiation. Knowledge Engineering Review 18, 343–375 (2003)
Parsons, S., et al.: Agents that reason and negotiate by arguing. JLC 8(3), 261–292 (1998)
Sadri, F., Toni, F., Torroni, P.: An abductive logic programming architecture for negotiating agents. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol. 2424, pp. 419–431. Springer, Heidelberg (2002)
Sakama, C., Inoue, K.: Negotiation by abduction and relaxation. In: AAMAS, pp. 1018–1025. ACM Press, New York (2007)
Simons, P., Niemelä, N., Soininen, T.: Extending and Implementing the Stable Model Semantics. Artificial Intelligence 138(1–2), 181–234 (2002)
Son, T.C., Baral, C., Tran, N., McIlraith, S.: Domain-dependent knowledge in answer set planning. ACM Trans. Comput. Logic 7(4), 613–657 (2006)
Subrahmanian, V., Zaniolo, C.: Relating stable models and AI planning domains. In: Proceedings of the International Conference on Logic Programming, pp. 233–247 (1995)
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
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Son, T.C., Pontelli, E., Sakama, C. (2009). Logic Programming for Multiagent Planning with Negotiation. In: Hill, P.M., Warren, D.S. (eds) Logic Programming. ICLP 2009. Lecture Notes in Computer Science, vol 5649. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02846-5_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-02846-5_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02845-8
Online ISBN: 978-3-642-02846-5
eBook Packages: Computer ScienceComputer Science (R0)