Show simple item record

dc.contributor.authorDong, Yi
dc.contributor.authorHuang, Jie
dc.date.accessioned2019-02-28T11:12:55Z
dc.date.available2019-02-28T11:12:55Z
dc.date.copyright4/30/2018 12:00:00 AM
dc.date.issued2018
dc.identifier.issn0022-0434
dc.identifier.otherds_140_09_091011.pdf
dc.identifier.urihttp://yetl.yabesh.ir/yetl1/handle/yetl/4253915
dc.description.abstractThe consensus problem for multiple Euler–Lagrange systems has been extensively studied under various assumptions on the connectivity of the communication graph. In practice, it is desirable to enable the control law the capability of maintaining the connectivity of the communication graph, thus achieving consensus without assuming the connectivity of the communication graph. We call such a problem as consensus with connectivity preservation. In this paper, we will study this problem for multiple uncertain Euler–Lagrange systems. By combining the adaptive control technique and potential function technique, we will show that such a problem is solvable under a set of standard assumptions. By employing different potential functions, our approach will also lead to the solution of such problems as rendezvous and flocking.
dc.publisherThe American Society of Mechanical Engineers (ASME)
dc.titleConsensus and Flocking With Connectivity Preservation of Uncertain Euler–Lagrange Multi-Agent Systems
dc.typeJournal Paper
dc.journal.volume140
dc.journal.issue9
dc.journal.titleJournal of Dynamic Systems, Measurement, and Control
dc.identifier.doi10.1115/1.4039666
dc.journal.fristpage91011
dc.journal.lastpage091011-8
dc.treeJournal of Dynamic Systems, Measurement, and Control:;2018:;volume( 140 ):;issue: 009
dc.contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record