Full metadata record
DC Field | Value | Language |
---|---|---|
dc.citation.endPage | 71534 | - |
dc.citation.startPage | 71525 | - |
dc.citation.title | IEEE ACCESS | - |
dc.citation.volume | 8 | - |
dc.contributor.author | Choi, Joonwon | - |
dc.contributor.author | Song, Yeongho | - |
dc.contributor.author | Lim, Seunghan | - |
dc.contributor.author | Kwon, Cheolhyeon | - |
dc.contributor.author | Oh, Hyondong | - |
dc.date.accessioned | 2023-12-21T17:41:34Z | - |
dc.date.available | 2023-12-21T17:41:34Z | - |
dc.date.created | 2020-05-25 | - |
dc.date.issued | 2020-04 | - |
dc.description.abstract | This paper proposes a formation control algorithm to create separated multiple formations for an undirected networked multi-agent system while preserving the network connectivity and avoiding collision among agents. Through the modified multi-consensus technique, the proposed algorithm can simultaneously divide a group of multiple agents into any arbitrary number of desired formations in a decentralized manner. Furthermore, the agents assigned to each formation group can be easily reallocated to other formation groups without network topological constraints as long as the entire network is initially connected; an operator can freely partition agents even if there is no spanning tree within each subgroup. Besides, the system can avoid collision without loosing the connectivity even during the transient period of formation by applying the existing potential function based on the network connectivity estimation. If the estimation is correct, the potential function not only guarantees the connectivity maintenance but also allows some extra edges to be broken if the network remains connected. Numerical simulations are performed to verify the feasibility and performance of the proposed multi-subgroup formation control. | - |
dc.identifier.bibliographicCitation | IEEE ACCESS, v.8, pp.71525 - 71534 | - |
dc.identifier.doi | 10.1109/ACCESS.2020.2987348 | - |
dc.identifier.issn | 2169-3536 | - |
dc.identifier.scopusid | 2-s2.0-85084175752 | - |
dc.identifier.uri | https://scholarworks.unist.ac.kr/handle/201301/32210 | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/9064526 | - |
dc.identifier.wosid | 000530811900007 | - |
dc.language | 영어 | - |
dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | - |
dc.title | Decentralized Multi-Subgroup Formation Control With Connectivity Preservation and Collision Avoidance | - |
dc.type | Article | - |
dc.description.isOpenAccess | TRUE | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems; Engineering, Electrical & Electronic; Telecommunications | - |
dc.relation.journalResearchArea | Computer Science; Engineering; Telecommunications | - |
dc.type.docType | Article | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordAuthor | Collision avoidance | - |
dc.subject.keywordAuthor | Multi-agent systems | - |
dc.subject.keywordAuthor | Graph theory | - |
dc.subject.keywordAuthor | Task analysis | - |
dc.subject.keywordAuthor | Laplace equations | - |
dc.subject.keywordAuthor | Transient analysis | - |
dc.subject.keywordAuthor | Shape | - |
dc.subject.keywordAuthor | decentralized control | - |
dc.subject.keywordAuthor | formation control | - |
dc.subject.keywordAuthor | graph theory | - |
dc.subject.keywordAuthor | multi-agent systems | - |
dc.subject.keywordPlus | SYSTEMS | - |
dc.subject.keywordPlus | CONSENSUS | - |
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Tel : 052-217-1404 / Email : scholarworks@unist.ac.kr
Copyright (c) 2023 by UNIST LIBRARY. All rights reserved.
ScholarWorks@UNIST was established as an OAK Project for the National Library of Korea.