Multi-Agent Planning with Planning Graph

T.D. Bui, W.J. Jamroga

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademic

    69 Downloads (Pure)


    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 redening the domain in a proper way. Forward-chaining and backward chaining algorithms are discussed to nd infallible plans in adversarial situations. In case such plans cannot be found, the agent can still attempt to nd a plan for achieving some part of the goals. A forward-chaining algorithm is also proposed to nd plans for agents with independent goals.
    Original languageUndefined
    Title of host publicationProceedings of eunite2003
    Number of pages7
    Publication statusPublished - 2003
    EventEUNITE 2003 - Oulu, Finland
    Duration: 10 Jul 200312 Jul 2003


    ConferenceEUNITE 2003
    Other10 - 12 July 2003


    • METIS-216273
    • EWI-6691
    • IR-60385
    • HMI-IA: Intelligent Agents

    Cite this