Coordinated motion planning for two independent robots
- 1 March 1991
- journal article
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 3 (1), 107-130
- https://doi.org/10.1007/bf01530889
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal spaceDiscrete & Computational Geometry, 1990
- Sharp upper and lower bounds on the length of general Davenport-Schinzel sequencesJournal of Combinatorial Theory, Series A, 1989
- On the general motion-planning problem with two degrees of freedomDiscrete & Computational Geometry, 1989
- On multiple moving objectsAlgorithmica, 1987
- An efficient and simple motion planning algorithm for a ladder amidst polygonal barriersJournal of Algorithms, 1987
- Moving a ladder in three dimensions: upper and lower boundsPublished by Association for Computing Machinery (ACM) ,1987
- Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemesCombinatorica, 1986
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstaclesDiscrete & Computational Geometry, 1986
- Coordinated motion of two robot armsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- A “retraction” method for planning the motion of a discJournal of Algorithms, 1985