Plan coordination (extended abstract)

Conference paper (2003)

Authors

Department
Software Computer Technology (EEMCS) (TU Delft)
Copyright: © 2003 The Author(s)
More Info
expand_more

Published Date

09-06-2003

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Source:

ICAPS 2003: Proceedings of the International Conference on Automated Planning & Scheduling, Trento, Italy, 9-13- June 2003

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Software Computer Technology

Abstract

Autonomous agents usually plan their actions. Sometimes agents can benefit from cooperation, and sometimes they cannot even do without resources from another. We can either coordinate the plans of agents after they have constructed their plans (plan merging), or we can plan the coordination of agents. Plan merging can only be used for agents that are able to (first) create a valid plan on their own. We distinguish two ways to plan coordination. With servicebased plan coordination agents offer resources they can produce for others. With task-based coordination agents are allowed to place requests for resources thay need. These forms of coordination can be integrated in the plans, and be realized by adapting existing planning algorithms at a few points. All methods use a model of the state of the world and of actions where a proposition is extended to describe all properties of an available entity relevant for planning. Such a proposition is called a resource, and can be exchanged among plans more conveniently than propositions as used by, e.g., STRIPS. Actions consume all resources that are given as a precondition, and produce the resources designed by the post-condition.