On motion planning amidst transient obstacles
- 2 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1488-1493 vol.2
- https://doi.org/10.1109/robot.1992.220041
Abstract
The author discusses important class of dynamic obstacles, that is, obstacles that appear and disappear in the environment. This formulation allows modeling of a number of time-varying situations that can arise in application domains. For example, a motion can be planned in an environment where an agent rearranges the environment by picking up an object and placing it back at another location in the same environment. An algorithm is presented to generate a motion in such a dynamic domain. The algorithm runs in O(n/sup 3/ log n) time, where n is the total number of vertices in the environment.Keywords
This publication has 13 references indexed in Scilit:
- Planning a time-minimal motion among moving obstaclesAlgorithmica, 1993
- Motion Planning in Dynamic EnvironmentsPublished by Springer Nature ,1991
- An Efficient Snell's Law Method for Optimal-Path Planning across Multiple Two-Dimensional, Irregular, Homogeneous-Cost RegionsThe International Journal of Robotics Research, 1990
- A hierarchical strategy for path planning among moving obstacles (mobile robot)IEEE Transactions on Robotics and Automation, 1989
- An algorithmic approach to some problems in terrain navigationArtificial Intelligence, 1988
- A survey of motion planning and related geometric algorithmsArtificial Intelligence, 1988
- Motion planning among time dependent obstaclesActa Informatica, 1988
- Motion planning with inertial constraintsAlgorithmica, 1987
- Toward Efficient Trajectory Planning: The Path-Velocity DecompositionThe International Journal of Robotics Research, 1986
- An algorithm for planning collision-free paths among polyhedral obstaclesCommunications of the ACM, 1979