Multiple leader candidate and competitive position allocation for robust formation against member robot faults

12Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

This paper proposes a Multiple Leader Candidate (MLC) structure and a Competitive Position Allocation (CPA) algorithm which can be applicable for various applications including environmental sensing. Unlike previous formation structures such as virtual-leader and actual-leader structures with position allocation including a rigid allocation and an optimization based allocation, the formation employing the proposed MLC structure and CPA algorithm is robust against the fault (or disappearance) of the member robots and reduces the entire cost. In the MLC structure, a leader of the entire system is chosen among leader candidate robots. The CPA algorithm is the decentralized position allocation algorithm that assigns the robots to the vertex of the formation via the competition of the adjacent robots. The numerical simulations and experimental results are included to show the feasibility and the performance of the multiple robot system employing the proposed MLC structure and the CPA algorithm.

Cite

CITATION STYLE

APA

Kwon, J. W., Kim, J. H., & Seo, J. (2015). Multiple leader candidate and competitive position allocation for robust formation against member robot faults. Sensors (Switzerland), 15(5), 10771–10790. https://doi.org/10.3390/s150510771

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free