Computer Science – Artificial Intelligence
Scientific paper
2012-02-13
Computer Science
Artificial Intelligence
21 pages, 5 algorithms, 3 figures. This is the full version of an extended abstract published in Proceedings of the 11th Inter
Scientific paper
Achieving joint objectives by teams of cooperative planning agents requires significant coordination and communication efforts. For a single-agent system facing a plan failure in a dynamic environment, arguably, attempts to repair the failed plan in general do not straightforwardly bring any benefit in terms of time complexity. However, in multi-agent settings the communication complexity might be of a much higher importance, possibly a high communication overhead might be even prohibitive in certain domains. We hypothesize that in decentralized systems, where coordination is enforced to achieve joint objectives, attempts to repair failed multi-agent plans should lead to lower communication overhead than replanning from scratch. The contribution of the presented paper is threefold. Firstly, we formally introduce the multi-agent plan repair problem and formally present the core hypothesis underlying our work. Secondly, we propose three algorithms for multi-agent plan repair reducing the problem to specialized instances of the multi-agent planning problem. Finally, we present results of experimental validation confirming the core hypothesis of the paper.
Komenda Antonín
Novák Peter
Pěchouček Michal
No associations
LandOfFree
Decentralized Multi-agent Plan Repair in Dynamic Environments does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Decentralized Multi-agent Plan Repair in Dynamic Environments, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decentralized Multi-agent Plan Repair in Dynamic Environments will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-682743