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

Cooperative adaptive consensus tracking for multiple nonholonomic mobile robots

Author

Listed:
  • Lixia Liu
  • Jinwei Yu
  • Jinchen Ji
  • Zhonghua Miao
  • Jin Zhou

Abstract

This paper addresses the cooperative adaptive consensus tracking for a group of multiple nonholonomic mobile robots, where the nonholonomic robot model is assumed to be a canonical vehicle having two actuated wheels and one passive wheel. By integrating a kinematic controller and a torque controller for the nonholonomic robotic system, a cooperative adaptive consensus tracking strategy is developed for the uncertain dynamic models using Lyapunov-like analysis in combination with backstepping approach and sliding mode technique. A key feature of the developed adaptive consensus tracking algorithm is the introduction of a directed network topology into the control constraints based on algebraic graph theory to characterise the communication interaction among robots, which plays an important role in realising the cooperative consensus tracking with respect to a specific common reference trajectory. Furthermore, a novel framework is proposed for developing a unified methodology for the convergence analysis of the closed-loop control systems, which can fully ensure the desired adaptive consensus tracking for multiple nonholonomic mobile robots. Subsequently, illustrative examples and numerical simulations are provided to demonstrate and visualise the theoretical results.

Suggested Citation

  • Lixia Liu & Jinwei Yu & Jinchen Ji & Zhonghua Miao & Jin Zhou, 2019. "Cooperative adaptive consensus tracking for multiple nonholonomic mobile robots," International Journal of Systems Science, Taylor & Francis Journals, vol. 50(8), pages 1556-1567, June.
  • Handle: RePEc:taf:tsysxx:v:50:y:2019:i:8:p:1556-1567
    DOI: 10.1080/00207721.2019.1617366
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207721.2019.1617366
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207721.2019.1617366?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:50:y:2019:i:8:p:1556-1567. 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.