HIERARCHICAL COORDINATION - Towards Scheme based on Problem Splitting

Said Brahimi, Ramdane Maamri, Zaidi Sahnoun

Abstract

Using multi-agent planning in real and complex environments requires using a flexible coordination scheme. The aim of this paper is to give a principle of coordination scheme for systems that work in these environments. This scheme is viewed as a hierarchical structure of coordination cells (CC). Each cell is controlled by meta-level agent, and is occupied to coordinating a sub-set of plans. The structure of coordination scheme, that is dynamically formed, can be purely centralized, purely distributed, or hierarchical according to interdependency degree of plans. The idea, behind of, is based on problem splitting techniques. This technique that is embodied in the coordination process, allows to reorganizing structure of CC. there are two mains operation on CC: split and merge. Each CC will be split if the problem of coordination can be divided. The CCs should be merged according failure of a cell to find a solution.

References

  1. Clement, B. J. 2002. Abstract Reasoning for Multiagent Coordination and Planning. P.H.D. Dept. of Computer Science, university of Michigan.
  2. Clement, B. J., and Durfee, E. H. 1999. Theory for Coordinating Concurrent Hierarchical Planning Agents Using Summary Information. Proceedings of the Sixteenth National Conference on Artificial intelligence, pp 495-502
  3. Durfee, E. H., and Lesser, V. R. 1991. "Partial Global Planning: A Coordination Framework for Distributed Hypothesis Formation." IEEE Transactions on Systems, Man, and Cybernetics, Special Issue on Distributed Sensor Networks, SMC-21(5):1167-1183.
  4. Durfee, E. H. 1999. Distributed problem solving and planning. In G.Weiss (ed.), In G. weib, Editor, A modern approach to the distributed Artificial Inteligence, chapter 3,
  5. DesJardins, M., and Wolverton, M. 1999. Coordinating planning Activity and Information Flow in a Distributed planning system. AI Magazine, Volume 20, Number 4.
  6. Hayashi, H. 2007. Stratified Multi-agent HTN Planning in Dynamic Environments. KES-AMSTA 2007, LNAI 4496, pp. 189-198.
  7. Lotem, A., and Nau, D. S. 2000. New Advances in GraphHTN: Identifying Independent Subproblems in Large HTN Domains. In Proc. Fifth International Conference on Artificial Intelligence Planning and Scheduling pp. 206-215. Breckenridge, CO, April 14- 17.
  8. Mailler R., Victor R. Lesser. 2006. Asynchronous Partial Overlay: A New Algorithm for Solving Distributed Constraint Satisfaction Problems. Journal of Artificial Intelligence research 25.
  9. Sims M., Mostafa H., Horling B., Haizheng, V. Lesser. 2006, Daniel Corkill, and John Phelps. Lateral and Hierarchical Partial Centralization for Distributed Coordination and Scheduling of Complex Hierarchical Task Networks. American Association for Artificial Intelligence.
Download


Paper Citation


in Harvard Style

Brahimi S., Maamri R. and Sahnoun Z. (2010). HIERARCHICAL COORDINATION - Towards Scheme based on Problem Splitting . In Proceedings of the 2nd International Conference on Agents and Artificial Intelligence - Volume 2: ICAART, ISBN 978-989-674-022-1, pages 327-331. DOI: 10.5220/0002728403270331


in Bibtex Style

@conference{icaart10,
author={Said Brahimi and Ramdane Maamri and Zaidi Sahnoun},
title={HIERARCHICAL COORDINATION - Towards Scheme based on Problem Splitting },
booktitle={Proceedings of the 2nd International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,},
year={2010},
pages={327-331},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002728403270331},
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 - HIERARCHICAL COORDINATION - Towards Scheme based on Problem Splitting
SN - 978-989-674-022-1
AU - Brahimi S.
AU - Maamri R.
AU - Sahnoun Z.
PY - 2010
SP - 327
EP - 331
DO - 10.5220/0002728403270331