Motion planning with time-varying polyhedral obstacles based on graph search and mathematical programming
- 4 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Time-minimal paths among moving obstaclesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Fast motion planning for multiple moving robotsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A hierarchical strategy for path planning among moving obstacles (mobile robot)IEEE Transactions on Robotics and Automation, 1989
- On multiple moving objectsAlgorithmica, 1987
- New lower bound techniques for robot motion planning problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- Toward Efficient Trajectory Planning: The Path-Velocity DecompositionThe International Journal of Robotics Research, 1986
- Real-Time Obstacle Avoidance for Manipulators and Mobile RobotsThe International Journal of Robotics Research, 1986
- Distance functions and their application to robot path planning in the presence of obstaclesIEEE Journal on Robotics and Automation, 1985
- On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriersCommunications on Pure and Applied Mathematics, 1983
- Spatial Planning: A Configuration Space ApproachIEEE Transactions on Computers, 1983