On the stochastic flocking of the Cucker-Smale flock with randomly switching topologies
DC Field | Value | Language |
---|---|---|
dc.contributor.author | DONG, JIU-GANG | - |
dc.contributor.author | HA, SEUNG-YEAL | - |
dc.contributor.author | JUNG, JINWOOK | - |
dc.contributor.author | KIM, DOHEON | - |
dc.date.accessioned | 2023-08-16T07:43:43Z | - |
dc.date.available | 2023-08-16T07:43:43Z | - |
dc.date.issued | 2020-08 | - |
dc.identifier.issn | 0363-0129 | - |
dc.identifier.issn | 1095-7138 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/114176 | - |
dc.description.abstract | We present an emergent stochastic ocking dynamics of the Cucker{Smale (CS) ensemble under randomly switching network topologies. The evolution of the CS ensemble with randomly switching topologies involves two random components (switching times and choices of network topologies at switching instants). First, we allow switching times for the network topology to be random so that the successive increments are i.i.d. processes following the common probability distribution. Second, at each switching instant, we choose a network topology randomly from a finite set of admissible network topologies whose union contains a spanning tree. Even for the fixed deterministic network topology, the CS ensemble may not exhibit a monocluster ocking, depending on the initial data and the decay mode of the communication weight functions measuring the degree of interactions between particles. For the ocking dynamics of the CS ensemble with these two random components, we first use a priori conditions on the network topologies and the uniform boundedness of the position diameter, and derive the ocking estimates via matrix theory together with a priori conditions, and then replace the a priori condition for the position diameter by some suitable condition on system parameters and communication weight. A priori conditions on the network topology will be guaranteed by the suitable spanning tree time-blocks with probability one. © 2020 Society for Industrial and Applied Mathematics. | - |
dc.format.extent | 22 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | Society for Industrial and Applied Mathematics | - |
dc.title | On the stochastic flocking of the Cucker-Smale flock with randomly switching topologies | - |
dc.type | Article | - |
dc.publisher.location | 미국 | - |
dc.identifier.doi | 10.1137/19M1279150 | - |
dc.identifier.scopusid | 2-s2.0-85092758688 | - |
dc.identifier.wosid | 000564319700024 | - |
dc.identifier.bibliographicCitation | SIAM Journal on Control and Optimization, v.58, no.4, pp 2332 - 2353 | - |
dc.citation.title | SIAM Journal on Control and Optimization | - |
dc.citation.volume | 58 | - |
dc.citation.number | 4 | - |
dc.citation.startPage | 2332 | - |
dc.citation.endPage | 2353 | - |
dc.type.docType | 정기학술지(Article(Perspective Article포함)) | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Automation & Control Systems | - |
dc.relation.journalResearchArea | Mathematics | - |
dc.relation.journalWebOfScienceCategory | Automation & Control Systems | - |
dc.relation.journalWebOfScienceCategory | Mathematics, Applied | - |
dc.subject.keywordPlus | ASYMPTOTIC FLOCKING | - |
dc.subject.keywordPlus | DYNAMICS | - |
dc.subject.keywordPlus | MODEL | - |
dc.subject.keywordPlus | SYNCHRONIZATION | - |
dc.subject.keywordPlus | LEADERSHIPCONSENSUS | - |
dc.subject.keywordPlus | NETWORKS | - |
dc.subject.keywordPlus | BEHAVIOR | - |
dc.subject.keywordPlus | SUBJECT | - |
dc.subject.keywordAuthor | Cucker-Smale model | - |
dc.subject.keywordAuthor | Directed graph | - |
dc.subject.keywordAuthor | Ocking | - |
dc.subject.keywordAuthor | Randomly switching topology | - |
dc.identifier.url | https://epubs.siam.org/doi/10.1137/19M1279150 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.