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

A robust interpolated model predictive control based on recurrent neural networks for a nonholonomic differential-drive mobile robot with quasi-LPV representation: computational complexity and conservatism

Author

Listed:
  • Mohsen Hadian
  • W. J. Zhang
  • Danial Etesami

Abstract

This paper presents an improved Model Predictive Control (MPC) for path tracking of a nonholonomic mobile robot with a differential drive. Nonlinear dynamics and nonholonomic constraints make the optimisation problem of MPC for the robot challenging. Nonlinear dynamics of the robots are expressed by a Linear Parameter Varying (LPV), and a Recurrent Neural Network (RNN) solves the constrained optimisation problem, providing optimal velocities. Moreover, an interpolation-based approach has been introduced to augment the region of attraction. The algorithm ensures stability in the presence of bounded disturbances through the inclusion of free control moves in the control law. The controller efficiency has been evaluated in two scenarios in a hospital setting. The simulation results illustrate that the proposed method performs better than nonlinear MPC and standard LPV-based MPC in terms of computational cost, disturbance rejection, and region of attraction.

Suggested Citation

  • Mohsen Hadian & W. J. Zhang & Danial Etesami, 2024. "A robust interpolated model predictive control based on recurrent neural networks for a nonholonomic differential-drive mobile robot with quasi-LPV representation: computational complexity and conserv," International Journal of Systems Science, Taylor & Francis Journals, vol. 55(15), pages 3257-3271, November.
  • Handle: RePEc:taf:tsysxx:v:55:y:2024:i:15:p:3257-3271
    DOI: 10.1080/00207721.2024.2367711
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/00207721.2024.2367711?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:55:y:2024:i:15:p:3257-3271. 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.