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

Adaptive finite-time optimised impedance control for robotic manipulators with state constraints

Author

Listed:
  • Chengpeng Li
  • Qinyuan Ren
  • Zuhua Xu
  • Jun Zhao
  • Chunyue Song

Abstract

In this paper, an adaptive finite-time impedance control strategy based on optimised backstepping (OB) technique is proposed for robotic manipulators subject to state constraints. The existing OB methods approximately solve the intractable Hamilton-Jacobi-Bellman equation by reinforcement learning (RL) with Bellman residual error, which has intricate actor-critic updating laws and persistence excitation requirement. To overcome this drawback, we construct the simplified RL updating laws by converting the problem to the solution of a positive-definite function, which is composed of actor-critic network weights. Then, the simplified RL updating laws can significantly reduce the controller complexity and relax the persistence excitation. Based on the barrier Lyapunov function, a barrier-type performance index function is constructed for the optimised controller under state constraints. The finite-time stability theory can guarantee the finite-time convergence property of the closed loop system without violating the prescribed constraints. Finally, we demonstrate the effectiveness of the proposed method in the simulation example with environment-robot interaction.

Suggested Citation

  • Chengpeng Li & Qinyuan Ren & Zuhua Xu & Jun Zhao & Chunyue Song, 2023. "Adaptive finite-time optimised impedance control for robotic manipulators with state constraints," International Journal of Systems Science, Taylor & Francis Journals, vol. 54(9), pages 2040-2058, July.
  • Handle: RePEc:taf:tsysxx:v:54:y:2023:i:9:p:2040-2058
    DOI: 10.1080/00207721.2023.2213230
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/00207721.2023.2213230?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:54:y:2023:i:9:p:2040-2058. 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.