IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-1-4757-1895-9_23.html
   My bibliography  Save this book chapter

A Survey on Advances in the Theory of Computational Robotics

In: Adaptive and Learning Systems

Author

Listed:
  • John H. Reif

    (Harvard University, Aiken Computation Laboratory Division of Applied Sciences)

Abstract

This paper describes work on the computational complexity of various movement planning problems relevant to robotics. This paper is intended only as a survey of previous and current work in this area. The generalized mover’s problem is to plan a sequence of movements of linked polyhedra through 3-dimensional Euclidean space, avoiding contact with a fixed set of polyhedra obstacles. We discuss our and other researchers’ work showing generalized mover’s problems are polynomial space hard. These results provide strong evidence that robot movement planning is computationally intractable, i.e., any algorithm requires time growing exponentially with the number of degrees of freedom. We also briefly discuss the computational complexity of four other quite different types of movement problems: (1) movement planning in the presence of friction, (2) minimal movement planning, (3) dynamic movement planning with moving obstacles and (4) adaptive movement planning problems.

Suggested Citation

  • John H. Reif, 1986. "A Survey on Advances in the Theory of Computational Robotics," Springer Books, in: Kumpati S. Narendra (ed.), Adaptive and Learning Systems, pages 331-337, Springer.
    • Handle: RePEc:spr:sprchp:978-1-4757-1895-9_23
    DOI: 10.1007/978-1-4757-1895-9_23
    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_23. 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.