Abstract
The ability to handle dynamic obstacles is expected to become increasingly important for intelligent mobile robots in the future. For motion planning among stationary obstacles, minimizing the total path length is frequently a major concern. The visibility graph and space decomposition are often used to generate shortest or reasonably short paths in the plane. Time-minimality is one of the critical considerations; the robot may be crushed between obstacles unless it takes a time-minimal motion from a start point to a destination point. For this reason, our primary concern in this monograph has been to generate time-minimal motions. We have studied motion planning in a variety of dynamic domains.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Tokyo
About this chapter
Cite this chapter
Fujimura, K. (1991). Conclusions. In: Motion Planning in Dynamic Environments. Computer Science Workbench. Springer, Tokyo. https://doi.org/10.1007/978-4-431-68165-6_8
Download citation
DOI: https://doi.org/10.1007/978-4-431-68165-6_8
Publisher Name: Springer, Tokyo
Print ISBN: 978-4-431-68167-0
Online ISBN: 978-4-431-68165-6
eBook Packages: Springer Book Archive