Skip to main content

Partially Centralized Hierarchical Plans Merging

  • Conference paper
Recent Developments in Computational Collective Intelligence

Part of the book series: Studies in Computational Intelligence ((SCI,volume 513))

  • 682 Accesses

Abstract

In multi-agent systems evolving in complex and dynamic environments, it is difficult to ensure an efficient coordination of agents plans. To deal with this issue searchers have exploited the concept of the abstraction for defining adequate plan representations, and also for providing algorithms serving to planning, coordination, and execution. By ignoring some less important details, a solution can be found more simply. In this paper we provide an adequate plan representation model, by taking advantage of hierarchical plans and the ability to reason on abstract tasks. We use the obtained model to provide some principles for implementing Partially Centralized scheme for Hierarchical Plans merging. Based on summary information and the ability to localize the interference between tasks supported by our model, the global plan is dynamically decomposed to a set of partial-global-plan that may be analysed in decentralized manner. This hybridization, between centralized and distributed coordination, can favour the interleaving of planning and execution, some part of global plan can be repaired when others are in execution.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brahimi, S., Maamri, R., Sahnoun, Z.: Hierarchical coordination - towards scheme based on problem splitting. In: Filipe, J., Fred, A.L.N., Sharp, B. (eds.) ICAART 2010 - Proceedings of the International Conference on Agents and Artificial Intelligence, vol. 2, pp. 327–331. INSTICC Press (2010)

    Google Scholar 

  2. Brahimi, S., Maamri, R., Sahnoun, Z.: Model of petri net for representing an agent plan in dynamic environment. In: O’Shea, J., Nguyen, N.T., Crockett, K., Howlett, R.J., Jain, L.C. (eds.) KES-AMSTA 2011. LNCS, vol. 6682, pp. 113–122. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  3. Clement, B.J., Durfee, E.H.: Theory for coordinating concurrent hierarchical planning agents using summary information. In: Proceedings of the Sixteenth National Conference on Artificial Intelligence and the Eleventh Innovative Applications of Artificial Intelligence, AAAI 1999, pp. 495–502. American Association for Artificial Intelligence, Menlo Park (1999)

    Google Scholar 

  4. Clement, B.J., Durfee, E.H., Barrett, A.C.: Abstract reasoning for planning and coordination. Journal of Ai Research 28, 453–515 (2007)

    MATH  Google Scholar 

  5. Corkill, D.D.: Hierarchical planning in a distributed environment. In: Proceedings of the 6th International Joint Conference on Artificial Intelligence, IJCAI 1979, vol. 1, pp. 168–175. Morgan Kaufmann Publishers Inc., San Francisco (1979)

    Google Scholar 

  6. desJardins, M., Wolverton, M.: Coordinating planning activity and information flow in a distributed planning system. AI Magazine 20(4) (Winter 1999)

    Google Scholar 

  7. Erol, K., Hendler, J., Nau, D.: Semantics for hierarchical task network planning. Tech. rep. CS-TR-3239, University of Maryland (1994)

    Google Scholar 

  8. Erol, K., Hendler, J.A., Nau, D.S.: Umcp: A sound and complete procedure for hierarchical task-network planning. In: Hammond, K.J. (ed.) AIPS, pp. 249–254. AAAI (1994)

    Google Scholar 

  9. Hayashi, H.: Stratified multi-agent HTN planning in dynamic environments. In: Nguyen, N.T., Grzech, A., Howlett, R.J., Jain, L.C. (eds.) KES-AMSTA 2007. LNCS (LNAI), vol. 4496, pp. 189–198. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  10. Lotem, A., Nau, D.S.: New advances in graphhtn: Identifying independent subproblems in large htn domains. In: Chien, S., Kambhampati, S., Knoblock, C.A. (eds.) AIPS, pp. 206–215. AAAI (2000)

    Google Scholar 

  11. Sacerdott, E.D.: Planning in a hierarchy of abstraction spaces. In: Proceedings of the 3rd International Joint Conference on Artificial Intelligence, IJCAI 1973, pp. 412–422. Morgan Kaufmann Publishers Inc., San Francisco (1973)

    Google Scholar 

  12. Thangarajah, J., Padgham, L., Winikoff, M.: Detecting and avoiding interference between goals in intelligent agents. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pp. 721–726. Academic Press (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Said Brahimi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Brahimi, S., Maamri, R., Sahnoun, Z. (2014). Partially Centralized Hierarchical Plans Merging. In: Badica, A., Trawinski, B., Nguyen, N. (eds) Recent Developments in Computational Collective Intelligence. Studies in Computational Intelligence, vol 513. Springer, Cham. https://doi.org/10.1007/978-3-319-01787-7_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-01787-7_6

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-01786-0

  • Online ISBN: 978-3-319-01787-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics