IDEAS home Printed from https://ideas.repec.org/a/taf/tsysxx/v49y2018i16p3448-3458.html
   My bibliography  Save this article

Finite-time formation of multiple agents based on multiple virtual leaders

Author

Listed:
  • Zhifeng Qiu
  • Xintao Zhao
  • Siming Li
  • Yongfang Xie
  • Chaoyang Chen
  • Weihua Gui

Abstract

The finite-time formation problem of multiple agents aims to find a control protocol to guarantee finite-time consensus, in which every agent can be in the right position and keep in the given formation configuration efficiently. However, it is hard to achieve a stable state if only by setting one virtual leader in multiple tasks system. This paper presents a formation controller design for a second-order multiple agents to address the finite-time formation problem. In the procedure, each agent has a virtual leader, and then a control law is designed so that the agents can keep pace with their virtual leaders in terms of speed and position. Accordingly, the controller can ensure that the relative positions among different agents and the trajectory of the whole formation can be specified in advance. Moreover, since the closed-loop system is finite-time stable, which implies that the required formation is attainable without a deviation in finite time. Finally, the stability analysis is proved by applying the graph theory, Lyapunov stability theory and homogeneous system theory. The effectiveness of the algorithm is demonstrated by numerical simulations.

Suggested Citation

  • Zhifeng Qiu & Xintao Zhao & Siming Li & Yongfang Xie & Chaoyang Chen & Weihua Gui, 2018. "Finite-time formation of multiple agents based on multiple virtual leaders," International Journal of Systems Science, Taylor & Francis Journals, vol. 49(16), pages 3448-3458, December.
    • Handle: RePEc:taf:tsysxx:v:49:y:2018:i:16:p:3448-3458
    DOI: 10.1080/00207721.2018.1542754
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207721.2018.1542754
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207721.2018.1542754?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tsysxx:v:49:y:2018:i:16:p:3448-3458. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TSYS20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.