IDEAS home Printed from https://ideas.repec.org/a/hin/complx/3702916.html
   My bibliography  Save this article

GA Based Adaptive Singularity-Robust Path Planning of Space Robot for On-Orbit Detection

Author

Listed:
  • Jianwei Wu
  • Deer Bin
  • Xiaobing Feng
  • Zhongpu Wen
  • Yin Zhang

Abstract

As a new on-orbit detection platform, the space robot could ensure stable and reliable operation of spacecraft in complex space environments. The tracking accuracy of the space manipulator end-effector is crucial to the detection precision. In this paper, the Cartesian path planning method of velocity level inverse kinematics based on generalized Jacobian matrix (GJM) is proposed. The GJM will come across singularity issue in path planning, which leads to the infinite or incalculable joint velocity. To solve this issue, firstly, the singular value decomposition (SVD) is used for exposition of the singularity avoidance principle of the damped least squares (DLS) method. After that, the DLS method is improved by introducing an adaptive damping factor which changes with the singularity. Finally, in order to improve the tracking accuracy of the singularity-robust algorithm, the objective function is established, and two adaptive parameters are optimized by genetic algorithm (GA). The simulation of a 6-DOF free-floating space robot is carried out, and the results show that, compared with DLS method, the proposed method could improve the tracking accuracy of space manipulator end-effector.

Suggested Citation

  • Jianwei Wu & Deer Bin & Xiaobing Feng & Zhongpu Wen & Yin Zhang, 2018. "GA Based Adaptive Singularity-Robust Path Planning of Space Robot for On-Orbit Detection," Complexity, Hindawi, vol. 2018, pages 1-11, May.
  • Handle: RePEc:hin:complx:3702916
    DOI: 10.1155/2018/3702916
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/8503/2018/3702916.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/8503/2018/3702916.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2018/3702916?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
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Li-Nan Zhu & Peng-Hang Li & Xiao-Long Zhou, 2019. "IHDETBO: A Novel Optimization Method of Multi-Batch Subtasks Parallel-Hybrid Execution Cloud Service Composition for Cloud Manufacturing," Complexity, Hindawi, vol. 2019, pages 1-21, February.

    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:hin:complx:3702916. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.