Motion Planning in Dynamic Environments
Computer Science Workbench is a monograph series which will provide you with an in-depth working knowledge of current developments in computer technology. Every volume in this series will deal with a topic of importance in computer science and elaborate on how you yourself can build systems related...
| Main Author: | |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
Tokyo
Springer Japan
1991, 1991
|
| Edition: | 1st ed. 1991 |
| Series: | Computer Science Workbench
|
| Subjects: | |
| Online Access: | |
| Collection: | Springer Book Archives -2004 - Collection details see MPG.ReNa |
Table of Contents:
- 1 Introduction
- 1.1 Dynamic environments
- 1.2 Statement of the problem
- 1.3 Scope of the monograph
- 2 Background
- 2.1 Stationary obstacles
- 2.2 Dynamic obstacles
- 2.3 Summary
- 3 Time-Minimal Motion: Basics
- 3.1 Introduction
- 3.2 Accessibility graphs
- 3.3 Planning and motion
- 3.4 Time-minimal motion theorem
- 3.5 Analysis
- 3.6 Discussions
- 3.7 Summary
- 4 Time-Minimal Motion: Applications
- 4.1 Concave obstacles
- 4.2 Convex obstacles
- 4.3 Start point and destination point
- 4.4 Piecewise linear motion of the obstacles
- 4.5 Nonlinear motion of the obstacles
- 4.6 Splitting and merging obstacles
- 4.7 Heuristics in dynamic domains
- 4.8 Unexpected obstacles
- 4.9 Summary
- 5 Time-Minimal Motion: Generalizations
- 5.1 Transient obstacles
- 5.2 Moving obstacles in three dimensions
- 5.3 Summary
- 6 Constrained Motion
- 6.1 Constraints on the motion of the robot
- 6.2 Space representation
- 6.3 Path search
- 6.4 Simulation results
- 6.5 Summary
- 7 Multiple Mobile Agents
- 7.1 Distributed approaches
- 7.2 Mobile agents
- 7.3 Simulation results
- 7.4 Summary
- 8 Conclusions
- 8.1 Summary
- 8.2 Open problems
- References