Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
471732 | Computer Science Review | 2007 | 10 Pages |
Abstract
This paper presents some of the recent improvements in sampling-based robot motion planning. Emphasis is placed on work that brings motion-planning algorithms closer to applicability in real environments. Methods that approach increasingly difficult motion-planning problems including kinodynamic motion planning and dynamic environments are discussed. The ultimate goal for such methods is to generate plans that can be executed with few modifications in a real robotics mobile platform.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Konstantinos I. Tsianos, Ioan A. Sucan, Lydia E. Kavraki,