Please use this identifier to cite or link to this item: http://cmuir.cmu.ac.th/jspui/handle/6653943832/76332
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAdsadang Himakalasaen_US
dc.contributor.authorSuttida Wongkaewen_US
dc.date.accessioned2022-10-16T07:08:28Z-
dc.date.available2022-10-16T07:08:28Z-
dc.date.issued2021-01-01en_US
dc.identifier.issn10990526en_US
dc.identifier.issn10762787en_US
dc.identifier.other2-s2.0-85115032194en_US
dc.identifier.other10.1155/2021/5545551en_US
dc.identifier.urihttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85115032194&origin=inwarden_US
dc.identifier.urihttp://cmuir.cmu.ac.th/jspui/handle/6653943832/76332-
dc.description.abstractThe Cucker and Smale model is a well-known flocking model that describes the emergence of flocks based on alignment. The first part focuses on investigating this model, including the effect of time delay and the presence of a leader. Furthermore, the control function is inserted into the dynamics of a leader to drive a group of agents to target. In the second part of this work, leadership-based optimal control is investigated. Moreover, the existence of the first-order optimality conditions for a delayed optimal control problem is discussed. Furthermore, the Runge-Kutta discretization method and the nonlinear conjugate gradient method are employed to solve the discrete optimality system. Finally, the capacity of the proposed control approach to drive a group of agents to reach the desired places or track the trajectory is demonstrated by numerical experiment results.en_US
dc.subjectComputer Scienceen_US
dc.subjectMultidisciplinaryen_US
dc.titleOptimal Control through Leadership of the Cucker and Smale Flocking Model with Time Delaysen_US
dc.typeJournalen_US
article.title.sourcetitleComplexityen_US
article.volume2021en_US
article.stream.affiliationsChiang Mai Universityen_US
Appears in Collections:CMUL: Journal Articles

Files in This Item:
There are no files associated with this item.


Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.