Algorithmic Motion Planning in Robotics
- 1 January 1990
- book chapter
- Published by Elsevier
Abstract
No abstract availableThis publication has 66 references indexed in Scilit:
- Sharp upper and lower bounds on the length of general Davenport-Schinzel sequencesJournal of Combinatorial Theory, Series A, 1989
- Visibility problems for polyhedral terrainsJournal of Symbolic Computation, 1989
- Simplified Voronoi diagramsDiscrete & Computational Geometry, 1988
- On the shortest paths between two convex polyhedraJournal of the ACM, 1988
- On the complexity of kinodynamic planningPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- New lower bound techniques for robot motion planning problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- Some dynamic computational geometry problemsComputers & Mathematics with Applications, 1985
- Planning Collision- Free Motions for Pick-and-Place OperationsThe International Journal of Robotics Research, 1983
- Solving the find-path problem by good representation of free spaceIEEE Transactions on Systems, Man, and Cybernetics, 1983
- Quantifier elimination for real closed fields by cylindrical algebraic decompostionPublished by Springer Nature ,1975