scispace - formally typeset
Open AccessBook

Robot Motion Planning

Reads0
Chats0
TLDR
This chapter discusses the configuration space of a Rigid Object, the challenges of dealing with uncertainty, and potential field methods for solving these problems.
Abstract
1 Introduction and Overview.- 2 Configuration Space of a Rigid Object.- 3 Obstacles in Configuration Space.- 4 Roadmap Methods.- 5 Exact Cell Decomposition.- 6 Approximate Cell Decomposition.- 7 Potential Field Methods.- 8 Multiple Moving Objects.- 9 Kinematic Constraints.- 10 Dealing with Uncertainty.- 11 Movable Objects.- Prospects.- Appendix A Basic Mathematics.- Appendix B Computational Complexity.- Appendix C Graph Searching.- Appendix D Sweep-Line Algorithm.- References.

read more

Citations
More filters
Journal ArticleDOI

Cooperative Intersection Management: A Survey

TL;DR: Major techniques and solutions for cooperative intersections are surveyed in this paper for both signalized and nonsignalized intersections, whereas focuses are put on the latter.
Journal ArticleDOI

Coverage of Known Spaces: The Boustrophedon Cellular Decomposition

TL;DR: The boustrophedon cellular decomposition is a generalization of the trapezoidal decomposition that could allow for non-polygonalobstacles, but also has the side effect of having more “efficient” coverage paths than the Trapezoid decomposition.
Proceedings ArticleDOI

A randomized roadmap method for path and manipulation planning

TL;DR: A new randomized roadmap method for motion planning for many DOF robots that can be used to obtain high quality roadmaps even when C-space is crowded, with the main novelty in the authors' approach is that roadmap candidate points are chosen on C-obstacle surfaces.
Journal ArticleDOI

Path planning for robust image-based control

TL;DR: This paper proposes a new approach to resolve difficulties in vision feedback control loop techniques by coupling path planning in image space and image-based control and ensures robustness with respect to modeling errors.