2010
DOI: 10.1007/978-3-642-11355-0_13
|View full text |Cite
|
Sign up to set email alerts
|

Reasoning and Planning with Cooperative Actions for Multiagents Using Answer Set Programming

Abstract: 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 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 met… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
7
0

Year Published

2010
2010
2024
2024

Publication Types

Select...
5
1
1

Relationship

1
6

Authors

Journals

citations
Cited by 11 publications
(7 citation statements)
references
References 18 publications
(26 reference statements)
0
7
0
Order By: Relevance
“…Early attempts to adapt action languages to formalize multi-agent domains can be found in [42,43,44]. In these works, the action languages A, B, and C have been extended to formalize multi-agent domains.…”
Section: Previous Work By the Authorsmentioning
confidence: 99%
See 1 more Smart Citation
“…Early attempts to adapt action languages to formalize multi-agent domains can be found in [42,43,44]. In these works, the action languages A, B, and C have been extended to formalize multi-agent domains.…”
Section: Previous Work By the Authorsmentioning
confidence: 99%
“…The works in [43,44] investigate the use of action language in multi-agent planning context and focus on the generation of decentralized plans for multiple agents, to either jointly achieve a goal or individual goals.…”
Section: Previous Work By the Authorsmentioning
confidence: 99%
“…A recent effort, along similar lines as ours, for modeling an action language for multi-agent systems, has been proposed by Son and Sakama [32], relying on the use of answer set programming (with consistency restoring rules) to address forms of synchronous communication among agents. The approach adopted in [32] is similar in spirit-it also proposes a high level action language which allows the description of multiple agents, by describing their individual capabilities. The language is quite different from B MAP ; in particular…”
Section: Related Workmentioning
confidence: 99%
“…• The language of [32] supports only Boolean fluents and it does not provide the declarative support of a constraint-based language (e.g., to express complex dependencies among fluents); • The interactions among agents in [32] are limited to explicit exchange of fluents (through actions of type request and provide); in particular, it is not obvious how to encode cooperative actions-where a shared effect is obtained only when different agents participate in the execution of an action. • The language of [32] takes the perspective of agents operating mostly independently to achieve separate goals, while B MAP allows the modeling of agents cooperating to achieve a shared goal. • The underlying technology used to plan in the action language is radically different-while B MAP is mapped to constraint solving and implemented using constraint logic programming, the language of [32] is mapped to ASP with consistency-restoring rules.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation