Show simple item record

dc.contributor.authorAtrianfar, Hajar
dc.contributor.authorHaeri, Mohammad
dc.date.accessioned2017-05-09T01:06:13Z
dc.date.available2017-05-09T01:06:13Z
dc.date.issued2014
dc.identifier.issn0022-0434
dc.identifier.otherds_136_01_011013.pdf
dc.identifier.urihttp://yetl.yabesh.ir/yetl/handle/yetl/154268
dc.description.abstractThis paper deals with a refined analysis and modification of existing results on the flocking algorithms proposed for the second order dynamic agents. In the present work, the limiting condition of ever connectivity is removed and it is proved that the flocking can be reached if only the union of the network proximity graphs during nonoverlapping time intervals becomes connected frequently enough. Also, it is proved that including a static virtual leader cannot model the group objective of achieving the desired velocity and it will stop eventually at a predefined point in the space. The convergence rate to this fixed point is determined too. The last contribution of this paper is definition of group configuration when only a fraction of agents are informed about the virtual leader.
dc.publisherThe American Society of Mechanical Engineers (ASME)
dc.titleTheoretical Analysis of Flocking Algorithms in Networks of Second Order Dynamic Agents With Switching Topologies
dc.typeJournal Paper
dc.journal.volume136
dc.journal.issue1
dc.journal.titleJournal of Dynamic Systems, Measurement, and Control
dc.identifier.doi10.1115/1.4025456
dc.journal.fristpage11013
dc.journal.lastpage11013
dc.identifier.eissn1528-9028
dc.treeJournal of Dynamic Systems, Measurement, and Control:;2014:;volume( 136 ):;issue: 001
dc.contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record