IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-1-4757-1895-9_24.html

Continuous Robot Motion Planning In Unknown Environment

In: Adaptive and Learning Systems

Author

Listed:
  • Vladimir J. Lumelsky

    (Yale University, Center for Systems Science Department of Electrical Engineering)

Abstract

An overview is given of a class of non-heuristic algorithms for planning collision-free motion for robotic systems (such as an autonomous vehicle or a manipulator arm) operating in an environment with obstacles, when any point of the (multi-link) robot body can be subject to collision. In this approach (called Continuous Path Planning, CPP), obstacles are considered to be unknown, and the system has a feedback providing it with information about its immediate surroundings. Such local information is shown to be sufficient to guarantee reaching a global goal, while generating reasonable (if, in general, not optimal) paths. No constraints on the shape of the robot or of the obstacles are imposed. The general idea is to reduce motion planning to the analysis of simple closed curves on the surfaces of appropriate two-dimensional manifolds. The approach is readily compatible with real-time and sensory feedback applications, and thus presents an attractive alternative to the Piano Mover’s approach [1,3] where full information about the environment is assumed. In this paper, versions of CPP algorithms are reviewed and examples are given for the cases of a point automaton and of planar and three-dimensional manipulator arms.

Suggested Citation

  • Vladimir J. Lumelsky, 1986. "Continuous Robot Motion Planning In Unknown Environment," Springer Books, in: Kumpati S. Narendra (ed.), Adaptive and Learning Systems, pages 339-358, Springer.
  • Handle: RePEc:spr:sprchp:978-1-4757-1895-9_24
    DOI: 10.1007/978-1-4757-1895-9_24
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:spr:sprchp:978-1-4757-1895-9_24. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.