View in EDS

A distributed CSP approach for collaborative planning systems

Saved in:
Bibliographic Details
Title: A distributed CSP approach for collaborative planning systems
Authors: Sapena, Oscar osapena@dsic.upv.es, Onaindia, Eva1 onaindia@dsic.upv.es, Garrido, Antonio1 agarridot@dsic.upv.es, Arangu, Marlene1 marangu@dsic.upv.es
Source: Engineering Applications of Artificial Intelligence. Aug2008, Vol. 21 Issue 5, p698-709. 12p.
Subjects: Computer programming, Communication, Constraint programming
Abstract: Abstract: Distributed or multi-agent planning extends classical AI planning to domains where several agents can plan and act together. There exist many recent developments in this discipline that range over different approaches for distributed planning algorithms, distributed plan execution processes or communication protocols among agents. One of the key issues about distributed planning is that it is the most appropriate way to tackle certain kind of planning problems, specially those where a centralized solving is unfeasible. In this paper we present a new planning framework aimed at solving planning problems in inherently distributed domains where agents have a collection of private data which cannot share with other agents. However, collaboration is required since agents are unable to accomplish its own tasks alone or, at least, can accomplish its tasks better when working with others. Our proposal motivates a new planning scheme based on a distributed heuristic search and a constraint programming resolution process. [Copyright &y& Elsevier]
Copyright of Engineering Applications of Artificial Intelligence is the property of Pergamon Press - An Imprint of Elsevier Science and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:Abstract: Distributed or multi-agent planning extends classical AI planning to domains where several agents can plan and act together. There exist many recent developments in this discipline that range over different approaches for distributed planning algorithms, distributed plan execution processes or communication protocols among agents. One of the key issues about distributed planning is that it is the most appropriate way to tackle certain kind of planning problems, specially those where a centralized solving is unfeasible. In this paper we present a new planning framework aimed at solving planning problems in inherently distributed domains where agents have a collection of private data which cannot share with other agents. However, collaboration is required since agents are unable to accomplish its own tasks alone or, at least, can accomplish its tasks better when working with others. Our proposal motivates a new planning scheme based on a distributed heuristic search and a constraint programming resolution process. [Copyright &y& Elsevier]
ISSN:09521976
DOI:10.1016/j.engappai.2008.03.005