Decentralized planning for complex missions with dynamic communication constraints

Citations Over TimeTop 10% of 2010 papers

Abstract

This paper extends the consensus-based bundle algorithm (CBBA), a distributed task allocation framework previously developed by the authors, to address complex missions for a team of heterogeneous agents in a dynamic environment. The extended algorithm proposes appropriate handling of time windows of validity for tasks, fuel costs of the vehicles, and heterogeneity in the agent capabilities, while preserving the robust convergence properties of the original algorithm. An architecture to facilitate real-time task replanning in a dynamic environment is also presented, along with methods to handle varying communication constraints and dynamic network topologies. Simulation results and experimental flight tests in an indoor test environment verify the proposed task planning methodology for complex missions.

Related Papers

• → Bundles = discount? Revisiting complex theories of bundle effects(2007)48 cited
• → Strategy-aware Bundle Recommender System(2023)25 cited
• → Generating realistic ISP-level network topologies(2003)27 cited
• → A survey on topologies of multilevel converters and study of two novel topologies(2009)24 cited
• → Analysis and Simulation of Various Parameters of Mixed CNT Bundle for Interconnect Applications(2022)