Motion planning in a dynamic domain
- 4 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Time-minimal paths among moving obstaclesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Solving the two-dimensional findpath problem using a line-triangle representation of the robotJournal of Algorithms, 1988
- On multiple moving objectsAlgorithmica, 1987
- New lower bound techniques for robot motion planning problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- An output sensitive algorithm for computing visibility graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- Constructing the visibility graph for n-line segments in O(n2) timeInformation Processing Letters, 1985
- An efficient algorithm for planning collision-free translational motion of a convex polygonal object in 2-dimensional space amidst polygonal obstaclesPublished by Association for Computing Machinery (ACM) ,1985
- Motion planning in the presence of moving obstaclesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Spatial Planning: A Configuration Space ApproachIEEE Transactions on Computers, 1983
- An algorithm for planning collision-free paths among polyhedral obstaclesCommunications of the ACM, 1979