Motion Planning for Unlabeled Discs with Optimality Guarantees

E. L. Lawler, Combinatorial optimization: networks and matroids . Courier Dover Publications, 1976

1976

Earlier work this paper cites.

J. T. Schwartz and M. Sharir, “On the piano movers’ problem: III. coordinating the motion of several independent bodies: the special case of circular bodies moving amidst polygonal barriers,” International Journal of Robotics Research , vol. 2, no. 3, pp. 46–75, 1983

1983

Earlier work this paper cites.

J. E. Hopcroft, J. T. Schwartz, and M. Sharir, “On the complexity of motion planning for multiple independent objects; PSPACE-hardness of the “Warehouseman’s problem”,” International Journal of Robotics Research , vol. 3, no. 4, pp. 76–88, 1984

1984

Earlier work this paper cites.

P. G. Spirakis and C.-K. Yap, “Strong NP-hardness of moving many discs,” Information Processing Letters , vol. 19, no. 1, pp. 55–59, 1984

1984

Earlier work this paper cites.

D. Kornhauser, G. Miller, and P. Spirakis, “Coordinating pebble motion on graphs, the diameter of permutation groups, and applications,” in Foundations of Computer Science (FOCS) . IEEE Computer Society, 1984, pp. 241–250

1984

Earlier work this paper cites.

D. Kornhauser, “Coordinating pebble motion on graphs, the diameter of permutation groups, and applications,” M.Sc. Thesis, Department of Electrical Engineering and Computer Scienec, Massachusetts Institute of Technology, 1984

1984

Earlier work this paper cites.

M. A. Erdmann and T. Lozano-Pérez, “On multiple moving objects,” in International Conference on Robotics and Automation (ICRA) , 1986, pp. 1419–1424

1986

Earlier work this paper cites.

K. Kedem, R. Livne, J. Pach, and M. Sharir, “On the union of jordan regions and collision-free translational motion amidst polygonal obstacles,” Discrete & Computational Geometry , vol. 1, pp. 59–70, 1986

1986

Earlier work this paper cites.

J. F. Canny and J. H. Reif, “New lower bound techniques for robot motion planning problems,” in 28th Annual Symposium on Foundations of Computer Science, Los Angeles, California, USA , 1987, pp. 49–60

1987

Earlier work this paper cites.

P. A. O’Donnell and T. Lozano-Pérez, “Deadlock-free and collision-free coordination of two robot manipulators,” in International Conference on Robotics and Automation (ICRA) , 1989, pp. 484–489

1989

Earlier work this paper cites.

V. Auletta, A. Monti, M. Parente, and P. Persiano, “A linear time algorithm for the feasibility of pebble motion on trees,” in Scandinavian Symposium and Workshops on Algorithm Theory (SWAT) , 1996, pp. 259–270

1996

Earlier work this paper cites.

S. M. LaValle and S. A. Hutchinson, “Optimal motion planning for multiple robots having independent goals,” IEEE Transactions on Robotics & Automation , vol. 14, no. 6, pp. 912–925, 1998

1998

Earlier work this paper cites.

P. Švestka and M. H. Overmars, “Coordinated path planning for multiple robots,” Robotics and Autonomous Systems , vol. 23, no. 3, pp. 125–152, 1998

1998

Earlier work this paper cites.

B. Aronov, M. de Berg, A. F. van der Stappen, P. Švestka, and J. Vleugels, “Motion planning for multiple robots,” Discrete & Computational Geometry , vol. 22, no. 4, pp. 505–525, 1999

1999

Earlier work this paper cites.

J. Peng and S. Akella, “Coordinating multiple robots with kinodynamic constraints along specified paths,” in Algorithmic Foundations of Robotics V , J.-D. Boissonat, J. Burdick, K. Goldberg, and S. Hutchinson, Eds. Berlin: Springer-Verlag, 2002, pp. 221–237

2002

Earlier work this paper cites.

J. van den Berg and M. H. Overmars, “Prioritized motion planning for multiple robots,” in International Conference on Intelligent Robots and Systems (IROS) , 2005, pp. 430 – 435

2005

Cited alongside, same era.

R. Ghrist, J. M. O’Kane, and S. M. LaValle, “Computing Pareto Optimal Coordinations on Roadmaps,” International Journal of Robotics Research , vol. 24, no. 11, pp. 997–1010, 2005

2005

Cited alongside, same era.

E. J. Griffith and S. Akella, “Coordinating multiple droplets in planar array digital microfluidic systems,” International Journal of Robotics Research , vol. 24, no. 11, pp. 933–949, 2005

2005

Cited alongside, same era.

S. Kloder and S. Hutchinson, “Path planning for permutation-invariant multirobot formations,” IEEE Transactions on Robotics , vol. 22, no. 4, pp. 650–665, 2006

2006

Cited alongside, same era.

I. Karamouzas, R. Geraerts, and A. F. van der Stappen, “Space-time group motion planning,” in Workshop on the Algorithmic Foundations of Robotics (WAFR), MIT, Cambridge, Massachusetts, USA , 2012, pp. 227–243

2012

Later among the works it cites.

O. Salzman, M. Hemmer, and D. Halperin, “On the power of manifold samples in exploring configuration spaces and the dimensionality of narrow passages,” in Workshop on the Algorithmic Foundations of Robotics (WAFR) , 2012, pp. 313–329

2012

Later among the works it cites.

E. Fogel, D. Halperin, and R. Wein, CGAL Arrangements and Their Applications - A Step-by-Step Guide , ser. Geometry and computing. Springer, 2012, vol. 7

2012

Later among the works it cites.

M. Turpin, N. Michael, and V. Kumar, “Concurrent assignment and planning of trajectories for large teams of interchangeable robots,” in International Conference on Robotics and Automation (ICRA) , 2013

2013

Later among the works it cites.