Decentralized multi-agent plan repair in dynamic environments

نویسندگان

  • Antonín Komenda
  • Peter Novák
  • Michal Pechoucek
چکیده

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.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Domain-independent multi-agent plan repair

Achieving joint objectives in distributed domain-independent planning problems by teams of cooperative agents requires signi cant coordination and communication e orts. For systems facing a plan failure in a dynamic environment, arguably, attempts to repair the failed plan in general, and especially in the worst-case scenarios, do not straightforwardly bring any bene t in terms of time complexi...

متن کامل

Reasoning about Multiple Plans in Dynamic Multi-agent Domains

Classical planning algorithms such as TWEAK (Chapman, 1987) or SNLP (McAllester and Rosenblitt 1991) were developed to solve relatively simple problems in static, single-agent environments. Remarkably, recent applications have demonstrated that this basic technique, with modest extensions, can plan for large-scale, dynamic, multi-agent environments such as intelligent tutoring (Rickel and Johns...

متن کامل

Reasoning about Multiple Plans in Dynamic Multi - agent Domains ( Extended

Classical planning algorithms such as TWEAK (Chapman, 1987) or SNLP (McAllester and Rosenblitt 1991) were developed to solve relatively simple problems in static, single-agent environments. Remarkably, recent applications have demonstrated that this basic technique, with modest extensions, can plan for large-scale, dynamic, multi-agent environments such as intelligent tutoring (Rickel and Johns...

متن کامل

Decentralized Path Planning for Multiple Agents in Complex Environments using Rapidly-exploring Random Trees

This thesis presents a novel approach to address the challenge of planning paths for real-world multi-agent systems operating in complex environments. The technique developed, the Decentralized Multi-Agent Rapidly-exploring Random Tree (DMARRT) algorithm, is an extension of the CL-RRT algorithm to the multi-agent case, retaining its ability to plan quickly even with complex constraints. Moreove...

متن کامل

CAMP-BDI An approach for Multiagent Systems Robustness through Capability-aware Agents Maintaining Plans

Rational agent behaviour is frequently achieved through the use of plans, particularly within the widely used BDI (Belief-Desire-Intention) model for intelligent agents. As a consequence, preventing or handling failure of planned activity is a vital component in building robust multiagent systems; this is especially true for realistic environments, where unpredictable exogenous change during pl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012