Path planning for a mobile robot
Authors:
- C. AlexopoulosCAC. Alexopoulos
- P.M. GriffinPGP.M. Griffin
- 1 January 1992
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics
- Vol. 22 (2) , 318-322
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- New lower bound techniques for robot motion planning problems1987
- Robot path planning using intersecting convex shapes: Analysis and simulationIEEE Journal on Robotics and Automation, 1987
- Toward Efficient Trajectory Planning: The Path-Velocity DecompositionThe International Journal of Robotics Research, 1986
- Multiresolution path planning for mobile robotsIEEE Journal on Robotics and Automation, 1986
- On Shortest Paths in Polyhedral SpacesSIAM Journal on Computing, 1986
- Constructing the visibility graph for n-line segments in O(n2) timeInformation Processing Letters, 1985
- Motion planning in the presence of moving obstacles1985
- Euclidean shortest paths in the presence of rectilinear barriersNetworks, 1984
- Solving the find-path problem by good representation of free spaceIEEE Transactions on Systems, Man, and Cybernetics, 1983
- An algorithm for planning collision-free paths among polyhedral obstaclesCommunications of the ACM, 1979