Access the full text.
Sign up today, get DeepDyve free for 14 days.
E. Ephrati, J. Rosenschein (1993)
Multi-Agent Planning as the Process of Merging Distributed Sub-plans
M. Weerdt, A. Bos, J. Tonino, C. Witteveen (2000)
Fusion of Plans in a Framework with Constraints
Qiang Yang, Dana Nau, J. Hendler (1992)
MERGING SEPARATELY GENERATED PLANS WITH RESTRICTED INTERACTIONSComputational Intelligence, 8
B. Clement, E. Durfee (1999)
Theory for Coordinating Concurrent Hierarchical Planning Agents Using Summary Information
D. McDermott, M. Ghallab, A. Howe, Craig Knoblock, A. Ram, M. Veloso, Daniel Weld, D. Wilkins (1998)
PDDL-the planning domain definition language
M. Masseron, C. Tollu, J. Vauzeilles (1993)
Generating Plans in Linear Logic I. Actions as ProofsTheor. Comput. Sci., 113
M. Masseron, C. Tollu, J. Vauzeilles (1990)
Generating Plans in Linear Logic
Keith Decker, V. Lesser (1997)
Designing a Family of Coordination Algorithms
V. Marek, M. Truszczynski (1994)
Revision Specifications by Means of Programs
J. Rosenschein (1982)
Synchronization of Multi-Agent Plans
M. Nivat (1988)
Fiftieth volume of theoretical computer scienceTheoretical Computer Science, 50
E. Ephrati, J. Rosenschein (1993)
Multi-Agent Planning as a Dynamic Search for Social Consensus
M. Georgeff (1983)
Communication and interaction in multi-agent planning
Bart Moree, A. Bos, H. Tonino, C. Witteveen (2000)
Cooperation by iterated plan revisionProceedings Fourth International Conference on MultiAgent Systems
M. Georgeff (1984)
A Theory of Action for MultiAgent Planning
J.-Y. Girard (1987)
Linear logicTheoretical Computer Science, 50
P. Lincoln (1992)
Linear logicSIGACT News, 23
C. Stuart (1985)
An Implementation of a Multi-Agent Plan Synchronizer
(1990)
Interactions among autonomous planning agents
O. Shehory, Sarit Kraus (1998)
Methods for Task Allocation via Agent Coalition FormationArtif. Intell., 101
Blai Bonet (1999)
Functional Strips: a More General Language for Planning and Problem Solving (preliminary Version)
E. Durfee (1988)
Coordination of distributed problem solvers
M. Georgeff (1988)
Readings in Artificial Intelligence
D. Foulser, Ming Li, Qiang Yang (1992)
Theory and Algorithms for Plan MergingArtif. Intell., 57
B. Roscoe (1986)
An Operational Semantics for CSP
E. Ephrati, J. Rosenschein (1994)
Divide and Conquer in Multi-Agent Planning
Frank Martial (1992)
Coordinating Plans of Autonomous Agents, 610
R. Fikes, N. Nilsson (1971)
STRIPS: A New Approach to the Application of Theorem Proving to Problem SolvingArtif. Intell., 2
E. Durfee, V. Lesser (1987)
Using Partial Global Plans to Coordinate Distributed Problem Solvers
B. Clement, E. Durfee (1999)
Top-down search for coordinating the hierarchical plans of multiple agents
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.
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Oct 10, 2004
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.