Abstract | ||
---|---|---|
This contribution proposes a model for argumentation-based multi-agent planning, with a focus on cooperative scenarios. It consists in a multi-agent extension of DeLP-POP, partial order planning on top of argumentation-based defeasible logic programming. In DeLP-POP, actions and arguments (combinations of rules and facts) may be used to enforce some goal, if their conditions (are known to) apply and arguments are not defeated by other arguments applying. In a cooperative planning problem a team of agents share a set of goals but have diverse abilities and beliefs. In order to plan for these goals, agents start a stepwise dialogue consisting of exchanges of plan proposals, plus arguments against them. Since these dialogues instantiate an A* search algorithm, these agents will find a solution if some solution exists, and moreover, it will be provably optimal (according to their knowledge). |
Year | DOI | Venue |
---|---|---|
2011 | 10.5555/2034396.2034407 | AAMAS |
Keywords | Field | DocType |
argumentation-based defeasible logic programming,multi-agent extension,cooperative planning problem,multiagent argumentation,plan proposal,provably optimal,search algorithm,argumentation-based multi-agent planning,partial order planning,cooperative scenario,diverse ability,argumentation,cooperation | Defeasible logic programming,Partial-order planning,Search algorithm,Computer science,Argumentation theory,Artificial intelligence,Management science | Conference |
ISBN | Citations | PageRank |
0-9826571-7-X | 12 | 0.66 |
References | Authors | |
12 | 5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Pere Pardo | 1 | 47 | 8.63 |
Sergio Pajares | 2 | 43 | 2.65 |
Eva Onaindia | 3 | 534 | 55.65 |
Lluís Godo | 4 | 888 | 56.28 |
Pilar Dellunde | 5 | 156 | 22.63 |