DISTRIBUTED PLANNING THROUGH GRAPH MERGING

Damien Pellier

Abstract

In this paper, we introduce a generic and fresh model for distributed planning called ``Distributed Planning Through Graph Merging'' (DPGM). This model unifies the different steps of the distributed planning process into a single step. Our approach is based on a planning graph structure for the agent reasoning and a CSP mechanism for the individual plan extraction and the coordination. We assume that no agent can reach the global goal alone. Therefore the agents must cooperate, i.e., take in into account potential positive interactions between their activities to reach their common shared goal. The originality of our model consists in considering as soon as possible, i.e., in the individual planning process, the positive and the negative interactions between agents activities in order to reduce the search cost of a global coordinated solution plan.

References

  1. Blum, A. and Furst, M. (1997). Fast planning through planning graph analysis. Artif. Intell., 90(1-2):281-300.
  2. Cox, J. and Durfee, E. H. (2005). An efficient algorithm for multiagent plan coordination. In AAMAS, pages 828-835.
  3. D'Inverno, M., Luck, M., Georgeff, M., Kinny, D., and Wooldridge, M. (2004). The DMARS architecture: A specification of the distributed multi-agent reasoning system. JAAMAS, 9(1-2):5-53.
  4. Durfee, E. H. (2000). Multiagent Systems. A Modern Approach to Distributed Artificial Intelligence, chapter Distributed Problem Solving and Planning. MIT Press.
  5. Finke, R. and Nilsson, N. (1971). STRIPS: A new approach to the application of theorem proving to problem solving. Artif. Intell., 3-4(2):189-208.
  6. Iwen, M. and Mali, A. D. (2002). Distributed graphplan. In ICTAI, pages 138-145.
  7. Kambhampati, S. (2000). Planning graph as a (dynamic) CSP: Exploiting EBL, DDB and other CSP search techniques in graphplan. JAIR, 12(1):1-34.
  8. Pistore, M., Traverso, P., and Bertoli, P. (2005). Automated composition of web services by planning in asynchronous domains. In ICAPS, pages 2-11.
  9. Sariel, S., Balch, T., and Erdogan, N. (2008). Naval mine countermeasure missions. Robotics & Automation Magazine, IEEE, 15(1):45-52.
  10. Tonino, H., Bos, A., de Weerdt, M., and Witteveen, C. (2002). Plan coordination by revision in collective agent-based systems. Artif. Intell.I, 142(2):121-145.
  11. Wilkins, D. and desJardins, M. (2001). A call for knowledge-based planning. AI Magazine, 22:99-115.
Download


Paper Citation


in Harvard Style

Pellier D. (2010). DISTRIBUTED PLANNING THROUGH GRAPH MERGING . In Proceedings of the 2nd International Conference on Agents and Artificial Intelligence - Volume 2: ICAART, ISBN 978-989-674-022-1, pages 128-134. DOI: 10.5220/0002702601280134


in Bibtex Style

@conference{icaart10,
author={Damien Pellier},
title={DISTRIBUTED PLANNING THROUGH GRAPH MERGING},
booktitle={Proceedings of the 2nd International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,},
year={2010},
pages={128-134},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002702601280134},
isbn={978-989-674-022-1},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 2nd International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,
TI - DISTRIBUTED PLANNING THROUGH GRAPH MERGING
SN - 978-989-674-022-1
AU - Pellier D.
PY - 2010
SP - 128
EP - 134
DO - 10.5220/0002702601280134