Abstract
We suggest the Distributed Branch and Bound Algorithm intended for solving problems with exponential complexity e.g. coalition planning. This technique consists of three parts: the state space distribution, effective search algorithm and partial solution expansion. We will describe CPlanT - an OOTW (operations other than war) coalition planning multi-agent system where this approach has been exploited.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Pěchouček, M., Mařík, V., and Štěpánková, O.: Towards Reducing Communication Traffic. Journal of Applied System Studies, vol. 2, No. 1, UK, 2001, pp. 152–174.
Shehory, O., and Kraus, S.: Task Allocation via Coalition Formation Among Autonomous Agents. IJCAI-95, 1995.
Sandholm, T., Larson, K., Andersson, M., Shehory, O., and Tohmé, F.: Coalition Structure Generation with Worst Case Guarantees. Artificial Intelligence, 111(1–2), 209–238, 1999.
Contreras, J., Wu, F., Klusch, M., and Shehory, O.: Coalition Formation in a Power Transmission Planning Environment. In: Proc of PAAM-97, London, UK, April 1997.
Bárta, J., Pěchouček, M., and Štěpánková, O.: Object Oriented Approach to Coalition Forming. GL 2000/100-Technical Report of The Gerstner Lab CTU Prague & FAW Linz, Hagenberg-Praha-Wien, 2000.
Shehory, O., Sycara, K., and Jha, S.: Multi-agent Coordination through Coalition Formation. LNAI1365, Intelligent Agents IV, A. Rao, M. Singh and M. Wooldridge (Eds.), Springer, Heidelberg, 1997, pp. 143–154.
Stubbefield, W., and Luger, G.: Artificial Intelligence, Structures and Strategies for Complex Problem Solving. The Benjamin/Cummins Publishing Company, 1993.
Finin, T., Labrou, Y., and Mayfield, J.: KQML as an agent communication language. In: Software Agents (Jeff Bradshaw Ed.), MIT Press, Cambridge, MA, 1995.
Pěchouček, M., Mařík, V., and Bárta, J.: Acquaintance Models in Coalition Planning for Humanitarian Relief Operation. In: The Second Asia-Pacific Conference on Intelligent Agent Technology (IAT-2001), Meabashi, Japan. October 2001, pp. 434–443.
Bárta, J., Pěchouček, M., and Mařík, V.: Sufferterra Humanitarian Crisis Scenario. GL 2001/141-Research Report of The Gerstner Lab CTU Prague & FAW Linz, Hagenberg-Praha-Wien, 2001.
Pěchouček, M., and Norrie, D.: Knowledge Structures for Reflective Multi-Agent Systems: On reasoning about other agents. Report Number 538, Department of Mechanical and Manufacturing Engineering, University of Calgary, Alberta, Canada, December 2000.
Huhns, M., and Stephens, L.: Multiagent Systems and Societies of Agents. In: Multi-Agent Systems: Modern Approach to Distributed Artificial Intelligence (Weiss G., ed.), The MIT Press, Cambridge, 1999.
Tambe M.: Towards flexible teamwork. Journal of Artificial Intelligence Research, 7:83–124, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bárta, J., Štěpánková, O., Pěchouček, M. (2002). Distributed Branch and Bound Algorithm in Coalition Planning. In: Mařík, V., Štěpánková, O., Krautwurmová, H., Luck, M. (eds) Multi-Agent Systems and Applications II. ACAI 2001. Lecture Notes in Computer Science(), vol 2322. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45982-0_8
Download citation
DOI: https://doi.org/10.1007/3-540-45982-0_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43377-4
Online ISBN: 978-3-540-45982-8
eBook Packages: Springer Book Archive