( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Finding a needle in an exponential haystack: Discrete RRT for exploration of implicit roadmaps in multi-robot motion planning.

, , и . Int. J. Robotics Res., 35 (5): 501-513 (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Charles Halperin

Louis Halperin

Kirsten Halperin-Krasemann

Dan Tidten

Dan Bauer

 

Другие публикации лиц с тем же именем

Coordination of Multiple Robots along Given Paths with Bounded Junction Complexity., , , и . AAMAS, стр. 932-940. ACM, (2023)Two-Dimensional Arrangements in CGAL and Adaptive Point Location for Parametric Curves., и . WAE, том 1982 из Lecture Notes in Computer Science, стр. 171-182. Springer, (2000)Fast and robust retrieval of Minkowski sums of rotating convex polyhedra in 3-space., , и . Symposium on Solid and Physical Modeling, стр. 1-10. ACM, (2010)dRRT*: Scalable and Informed Asymptotically-Optimal Multi-Robot Motion Planning., , , , и . CoRR, (2019)Improved Maintenance of Molecular Surfaces Using Dynamic Graph Connectivity., и . WABI, том 3692 из Lecture Notes in Computer Science, стр. 401-413. Springer, (2005)Efficient sampling-based bottleneck pathfinding over cost maps., и . IROS, стр. 2003-2009. IEEE, (2017)Efficient high-quality motion planning by fast all-pairs r-nearest-neighbors., , и . ICRA, стр. 2985-2990. IEEE, (2015)Sparsification of motion-planning roadmaps by edge contraction., , , и . ICRA, стр. 4098-4105. IEEE, (2013)The Dynamic Servers Problem., , и . SODA, стр. 410-419. ACM/SIAM, (1998)Efficient Algorithms for Exact Motion Planning Amidst Fat Obstacles., , и . ICRA (1), стр. 297-304. IEEE Computer Society Press, (1993)