Logic programming for multiagent planning with negotiation

22Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.
Get full text

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. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Son, T. C., Pontelli, E., & Sakama, C. (2009). Logic programming for multiagent planning with negotiation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5649 LNCS, pp. 99–114). https://doi.org/10.1007/978-3-642-02846-5_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free