A Multi-Agent Coverage Algorithm with Connectivity Maintenance
- Authors
- Choi, Sungjoon; Lee, Kyungjae; Oh, Songhwai
- Issue Date
- Nov-2017
- Publisher
- IEEE
- Citation
- 2017 IEEE INTERNATIONAL CONFERENCE ON MULTISENSOR FUSION AND INTEGRATION FOR INTELLIGENT SYSTEMS (MFI), pp 512 - 517
- Pages
- 6
- Journal Title
- 2017 IEEE INTERNATIONAL CONFERENCE ON MULTISENSOR FUSION AND INTEGRATION FOR INTELLIGENT SYSTEMS (MFI)
- Start Page
- 512
- End Page
- 517
- URI
- https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/59374
- DOI
- 10.1109/MFI.2017.8170372
- Abstract
- This paper presents a connectivity control algorithm of a multi-agent system. The connectivity of the multi-agent system can be represented by the second smallest eigenvalue lambda(2) of the Laplacian matrix L-G and it is also referred to as algebraic connectivity. Unlike many of the existing connectivity control algorithms which adapt convex optimization technique to maximize algebraic connectivity, we first show that the algebraic connectivity can be maximized by minimizing the weighted sum of distances between the connected agents. We implement a hill-climbing algorithm that minimizes the weighted sum of distances. Semi-definite programming (SDP) is used for computing proper weight w(star). Our proposed algorithm can effectively be mixed with other cooperative applications such as covering an unknown area or following a leader.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Software > Department of Artificial Intelligence > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/59374)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.