Reducing Multiple Object Motion Planning to Graph Searching
- 1 August 1986
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 15 (3), 768-785
- https://doi.org/10.1137/0215055
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Movement Problems for 2-Dimensional LinkagesSIAM Journal on Computing, 1984
- On the Piano Movers' problem: IV. Various decomposable two‐dimensional motion‐planning problemsCommunications on Pure and Applied Mathematics, 1984
- On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifoldsAdvances in Applied Mathematics, 1983
- On the Piano Movers' Problem: III. Coordinating the Motion of Several Independent Bodies: The Special Case of Circular Bodies Moving Amidst Polygonal BarriersThe International Journal of Robotics Research, 1983
- 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
- Automatic Planning of Manipulator Transfer MovementsIEEE Transactions on Systems, Man, and Cybernetics, 1981
- An algorithm for planning collision-free paths among polyhedral obstaclesCommunications of the ACM, 1979
- Bounds on positive integral solutions of linear Diophantine equationsProceedings of the American Mathematical Society, 1976