By Topic

Cooperation by iterated plan revision

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Moree, B.J. ; Fac. of Inf. Technol. & Syst., Delft Univ. of Technol., Netherlands ; Bos, A. ; Tonino, H. ; Witteveen, Cees

A simple framework is developed for representing plans, goals and resources of agents in order to model cooperative planning behavior. Plans are represented as acyclic networks of skills that, given adequate initial resources, can realize special resources (goals). Given the storage costs of resources, application costs of skills, and values of goals we can reason about the profits of a plan for an agent. We then model two forms of cooperative planning behavior between two agents, viz., fusion, aiming at the maximization of the total yield of the agents involved, and collaboration which aims at maximization of the individual yield of each agent. We present efficient polynomial algorithms for agent plan fusion and collaboration and illustrate their use with a transportation planning example

Published in:

MultiAgent Systems, 2000. Proceedings. Fourth International Conference on

Date of Conference: