A Resource Logic for Multi-Agent Plan Merging

De Weerdt, M.M.; Bos, A.; Tonino, H.; Witteveen, C.

doi:doi:doi:10.1023/A:1020236119243

A Resource Logic for Multi-Agent Plan Merging

Title

A Resource Logic for Multi-Agent Plan Merging

Author

De Weerdt, M.M.
Bos, A.
Tonino, H.
Witteveen, C.

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Software Computer Technology

Date

2003-12-31

Abstract

In a multi-agent system, agents are carrying out certain tasks by executing plans. Consequently, the problem of finding a plan, given a certain goal, has been given a lot of attention in the literature. Instead of concentrating on this problem, the focus of this paper is on cooperation between agents which already have constructed plans for their goals. By cooperating, agents might reduce the number of actions they have to perform in order to fulfill their goals. The key idea is that in carrying out a plan an agent possibly produces side products that can be used as resources by other agents. As a result, an other agent can discard some of its planned actions. This process of exchanging products, called plan merging, results in distributed plans in which agents become dependent on each other, but are able to attain their goals more efficiently. In order to model this kind of cooperation, a new formalism is developed in which side products are modeled explicitly. The formalism is a resource logic based on the notions of resource, skill, goal, and service. Starting with some resources, an agent can perform a number of skills in order to produce other resources which suffice to achieve some given goals. Here, a skill is an elementary production process taking as inputs resources satisfying certain constraints. A service is a serial or parallel composition of skills acting as a program. An operational semantics is developed for these services as programs. Using this formalism, an algorithm for plan merging is developed, which is anytime and runs in polynomial time. Furthermore, a variant of this algorithm is proposed that handles the exchange of resources in a more flexible way. The ideas in the paper will be illustrated by an example from public transportation.

Subject

multi-agent planning
cooperation
resource logic

To reference this document use:

http://resolver.tudelft.nl/uuid:f759e320-a922-4d0d-89cb-873dd642f47a

Publisher

Springer

ISSN

1012-2443

Source

https://doi.org/doi:10.1023/A:1020236119243

Source

Annals of Mathematics and Artificial Intelligence, 37 (1-2), 2003