Asymptotically Near-Optimal Planning With Probabilistic Roadmap Spanners

10.1145/361002.361007

10.1145/1044731.1044732

keil, 1988, Proc 1st Scandinav Workshop Algorithm Theor, 208

10.1002/rsa.20130

10.1007/BF02189308

10.1002/jgt.3190130114

10.1007/11523468_22

10.1137/S0097539794271898

10.1137/S0097539794261295

0

0

0

10.1109/IRDS.2002.1041613

10.1177/0278364911406761

nieuwenhuisen, 2004, Using cycles in probabilistic roadmap graphs, Proc IEEE Int Conf Robot Autom, 1, 446

10.1109/TRO.2005.847599

geraerts, 2005, Creating small graphs for solving motion planning problems, Proc IEEE Int Conf Meth Models Autom Robot, 531

10.1109/ROBOT.2006.1641883

kim, 2003, Extracting optimal paths from roadmaps for motion planning, Proc IEEE Int Conf Robot Autom, 2, 2424

10.1109/IROS.2006.282009

0

0

10.1163/156855300741960

10.1109/IROS.2011.6095070

10.1109/IROS.1999.813013

0

10.1109/TC.1983.1676196

sanchez, 2001, A single-query, bi-directional probabilistic roadmap planner with lazy collision checking, Proc Int Symp Robot Res, 403

10.1177/0278364908097213

10.1016/j.robot.2007.06.002

amato, 1998, OBPRM: An obstacle-based PRM for 3D workspaces, Proc Workshop Algorithm Found Robot, 155

10.1109/70.508439

10.1109/TRO.2010.2098622

10.1177/027836402320556421

0

10.1177/02783640122067453

0

0

10.1109/ICRA.2012.6225296

10.1109/IROS.2006.282100

0

0

0