Distributed Branch and Bound Algorithm in Coalition Planning

Authors:
Jaroslav Barta;Olga Stepánková;Michal Pechoucek
Affiliations:
-;-;-
Venue:
Proceedings of the 9th ECCAI-ACAI/EASSS 2001, AEMAS 2001, HoloMAS 2001 on Multi-Agent-Systems and Applications II-Selected Revised Papers
Year:
2002

Citing 7
Cited 1

Artificial intelligence (2nd ed.): structures and strategies for complex problem-solving

Artificial intelligence (2nd ed.): structures and strategies for complex problem-solving
KQML as an agent communication language

Software agents
Multiagent systems and societies of agents

Multiagent systems
Coalition structure generation with worst case guarantees

Artificial Intelligence
Multi-Agent Coordination through Coalition Formation

ATAL '97 Proceedings of the 4th International Workshop on Intelligent Agents IV, Agent Theories, Architectures, and Languages
Towards flexible teamwork

Journal of Artificial Intelligence Research
Task allocation via coalition formation among autonomous agents

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1

Decomposition and parallelization of multi-resource timetabling problems

PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling

Quantified Score

Hi-index	0.00

Visualization

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.