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

Single-network based adaptive dynamic programming optimal control for robotic manipulator with joint limitation under input saturation

Author

Listed:
  • Bin Li
  • Hong Zhan
  • Xiuyu Zhang
  • Chenguang Yang

Abstract

This paper proposes an optimal control method based on adaptive dynamic programming (ADP) for manipulators with joint limitation under input saturation. The asymmetric input saturation problem is solved by introducing a smooth function, by which the saturation and nonsmooth issues of the input caused by the actuators can be handled. Joint limitation of the manipulator is transformed through a transfer function, which is incorporated into the cost function of the whole robotic system, to guarantee the joint limitation will not be violated. Meanwhile, due to the difficulty in solving Hamilton-Jacobi-Bellman (HJB) equation, the critic network is constructed utilising radial basis function neural networks (RBFNNs) to approximate the cost function. This approach effectively overcomes the curse of dimensionality problem associated with dynamic programming. Subsequently, an ADP-based optimal controller is designed for the robotic system. Lyapunov synthesis is used in the stability analysis to prove all the signals are convergent and ultimately uniformly bounded (UUB). Simulations are conducted on a planar 3-DOF manipulator to validate the effectiveness of the proposed method. The results demonstrate the improved performance and feasibility of the developed ADP-based optimal control strategy in handling joint limitations and input saturation challenges in robotic systems.

Suggested Citation

  • Bin Li & Hong Zhan & Xiuyu Zhang & Chenguang Yang, 2024. "Single-network based adaptive dynamic programming optimal control for robotic manipulator with joint limitation under input saturation," International Journal of Systems Science, Taylor & Francis Journals, vol. 55(16), pages 3355-3370, December.
  • Handle: RePEc:taf:tsysxx:v:55:y:2024:i:16:p:3355-3370
    DOI: 10.1080/00207721.2024.2370301
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/00207721.2024.2370301?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:16:p:3355-3370. 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.