Multi-Agent Planning with Planning Graph

Share/Save/Bookmark

Bui, The Duy and Jamroga, Wojciech (2003) Multi-Agent Planning with Planning Graph. In: EUNITE 2003, 10 - 12 July 2003, Oulu, Finland (pp. pp. 558-564).

open access
[img]
Preview
PDF
176kB
Abstract:In this paper, we consider planning for multi-agents situations in STRIPS-like domains with planning graph. Three possible relationships between agents' goals are considered in order to evaluate plans: the agents may be collaborative, adversarial or indifferent entities. We propose algorithms to deal with each situation. The collaborative situations can be easily dealt with the original Graphplan algorithm by redefining the domain in a proper way. Forward-chaining and backward chaining algorithms are discussed to find infallible plans in adversarial situations. In case such plans cannot be found, the agent can still attempt to find a plan for achieving some part of the goals. A forward-chaining algorithm is also proposed to find plans for agents with independent goals.
Item Type:Conference or Workshop Item
Research Group:
Link to this item:http://purl.utwente.nl/publications/60385
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 216273