IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v41y1996i5p627-637.html
   My bibliography  Save this article

An on-line cartesian space obstacle avoidance scheme for robot arms

Author

Listed:
  • Yu, J.S.
  • Müller, P.C.

Abstract

This paper presents an on-line obstacle avoidance scheme for robot arms. This method is directly formulated in the Cartesian space and uses complete information about the workspace. The strategy is to detect the collision and to plan the motion of each link successively, starting from the base link. Each robot link in 3D Cartesian space will be mapped into two 2D planes such that the collision detection and motion planning can be executed in 2D spaces. Depending on its spatial shape, the end-effector can be approached as further robot links. Thus, the obstacle avoidance is more effectively including the consideration of end-effector. The proposed algorithm is implemented on a transputer network which simulates the control system of a six-link robot PUMA 560.

Suggested Citation

  • Yu, J.S. & Müller, P.C., 1996. "An on-line cartesian space obstacle avoidance scheme for robot arms," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 41(5), pages 627-637.
    • Handle: RePEc:eee:matcom:v:41:y:1996:i:5:p:627-637
    DOI: 10.1016/0378-4754(95)00106-9
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0378475495001069
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/0378-4754(95)00106-9?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.

    Citations

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


    Cited by:

    1. Menasri, R. & Nakib, A. & Daachi, B. & Oulhadj, H. & Siarry, P., 2015. "A trajectory planning of redundant manipulators based on bilevel optimization," Applied Mathematics and Computation, Elsevier, vol. 250(C), pages 934-947.

    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:eee:matcom:v:41:y:1996:i:5:p:627-637. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.