Motion Planning for Multiple Robots
暂无分享,去创建一个
Boris Aronov | Mark de Berg | Jules Vleugels | A. Frank van der Stappen | Petr Svestka | B. Aronov | P. Svestka | M. D. Berg | J. Vleugels | A.F. van der Stappen
[1] George E. Collins,et al. Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975 .
[2] George E. Collins,et al. Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975, Automata Theory and Formal Languages.
[3] J. Schwartz,et al. On the Piano Movers' Problem: III. Coordinating the Motion of Several Independent Bodies: The Special Case of Circular Bodies Moving Amidst Polygonal Barriers , 1983 .
[4] J. Schwartz,et al. On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .
[5] John E. Hopcroft,et al. Motion of Objects in Contact , 1984 .
[6] Steven Fortune,et al. Coordinated motion of two robot arms , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.
[7] Micha Sharir,et al. On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles , 1986, Discret. Comput. Geom..
[8] John E. Hopcroft,et al. Reducing Multiple Object Motion Planning to Graph Searching , 1984, SIAM J. Comput..
[9] John Canny,et al. The complexity of robot motion planning , 1988 .
[10] Micha Sharir,et al. Coordinated motion planning for two independent robots , 1991, SCG '88.
[11] Tomás Lozano-Pérez,et al. Deadlock-free and collision-free coordination of two robot manipulators , 1989, Proceedings, 1989 International Conference on Robotics and Automation.
[12] Charles W. Warren,et al. Multiple robot path coordination using artificial potential fields , 1990, Proceedings., IEEE International Conference on Robotics and Automation.
[13] A. Frank van der Stappen,et al. Motion planning amidst fat obstacles , 1993 .
[14] Mark H. Overmars,et al. The Complexity of the Free Space for a Robot Moving Amidst Fat Obstacles , 1992, Comput. Geom..
[15] John F. Canny,et al. Computing Roadmaps of General Semi-Algebraic Sets , 1991, Comput. J..
[16] Rachid Alami,et al. Multi-robot cooperation through incremental plan-merging , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.
[17] Otfried Cheong,et al. Range Searching in Low-Density Environments , 1996, Inf. Process. Lett..
[18] S. Basu,et al. COMPUTING ROADMAPS OF SEMI-ALGEBRAIC SETS ON A VARIETY , 1999 .
[19] Marie-Françoise Roy,et al. On Computing a Set of Points Meeting Every Cell Defined by a Family of Polynomials on a Variety , 1995, J. Complex..
[20] Mark de Berg,et al. Realistic input models for geometric algorithms , 1997, SCG '97.
[21] S. Basu,et al. Computing roadmaps of semi-algebraic sets on a variety (extended abstract) , 1997 .
[22] S. Basu,et al. On Computing a Set of Points meeting every Semi-algebraically Connected Component of a Family of Pol , 1997 .
[23] Mark de Berg,et al. Motion Planning in Environments with Low Obstacle Density , 1998, Discret. Comput. Geom..