By Topic

Distributed Planning Strategies to Ensure Network Connectivity for Dynamic Heterogeneous Teams

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Ponda, S.S. ; Dept. of Aeronaut. & Astronaut., MIT, Cambridge, MA, USA ; Johnson, L.B. ; Kopeikin, A.N. ; Han-Lim Choi
more authors

This paper presents a cooperative distributed planning algorithm that ensures network connectivity for a team of heterogeneous agents operating in dynamic and communication-limited environments. The algorithm, named CBBA with Relays, builds on the Consensus-Based Bundle Algorithm (CBBA), a distributed task allocation framework developed previously by the authors and their colleagues. Information available through existing consensus phases of CBBA is leveraged to predict the network topology and to propose relay tasks to repair connectivity violations. The algorithm ensures network connectivity during task execution while preserving the distributed and polynomial-time guarantees of CBBA. By employing under-utilized agents as communication relays, CBBA with Relays improves the range of the team without limiting the scope of the active agents, thus improving mission performance. The algorithm is validated through simulation trials and through experimental indoor and outdoor field tests, demonstrating the real-time applicability of the approach.

Published in:

Selected Areas in Communications, IEEE Journal on  (Volume:30 ,  Issue: 5 )