• Login
    View Item 
    •   DSpace Home
    • ASME
    • Journal of Dynamic Systems, Measurement, and Control
    • View Item
    •   DSpace Home
    • ASME
    • Journal of Dynamic Systems, Measurement, and Control
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Consensus and Flocking With Connectivity Preservation of Uncertain Euler–Lagrange Multi-Agent Systems

    Thumbnail
    View/Open
    ds_140_09_091011.pdf (589.3Kb)
    Date
    2018
    Author
    Dong, Yi
    Huang, Jie
    Metadata
    Show full item record
    Abstract
    The 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.
    URI
    http://yetl.yabesh.ir/yetl1/handle/yetl/4253915
    Collections
    • Journal of Dynamic Systems, Measurement, and Control

    DSpace software copyright © 2002-2015  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    @mire NV
     

     

    Browse

    All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    Statistics

    View Usage Statistics

    DSpace software copyright © 2002-2015  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    @mire NV