Minimum time robot path planning in the presence of obstacles
- 1 December 1985
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
An approach to minimum time robotic path planning in the presence of obstacles is given. It is formulated in an optimal control context with obstacle avoidance expressed in terms of the distances between potentially colliding parts. Procedures for computing the distances between general part shapes in three-dimensional space are discussed. Numerical examples involving manipulators operating in two and three-dimensional workspaces are described.Keywords
This publication has 10 references indexed in Scilit:
- Minimum-time control of robotic manipulators with geometric path constraintsIEEE Transactions on Automatic Control, 1985
- Distance functions and their application to robot path planning in the presence of obstaclesIEEE Journal on Robotics and Automation, 1985
- Minimum distance collision-free path planning for industrial robots with a prismatic jointIEEE Transactions on Automatic Control, 1984
- An anatomy of industrial robots and their controlsIEEE Transactions on Automatic Control, 1983
- Spatial Planning: A Configuration Space ApproachIEEE Transactions on Computers, 1983
- Efficient Dynamic Computer Simulation of Robotic MechanismsJournal of Dynamic Systems, Measurement, and Control, 1982
- Remark on “Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]”ACM Transactions on Mathematical Software, 1980
- On-Line Computational Scheme for Mechanical ManipulatorsJournal of Dynamic Systems, Measurement, and Control, 1980
- Finding the nearest point in A polytopeMathematical Programming, 1976
- Some efficient algorithms for a class of abstract optimization problems arising in optimal controlIEEE Transactions on Automatic Control, 1969