Sampling-based roadmap of trees for parallel motion planning

lavalle, 2001, rapidly exploring random trees: progress and prospects, New Directions in Algorithmic and Computational Robotics, 293

lavalle, 2002, on the relationship between classical grid search and probabilistic roadmaps, Algorithmic Foundations of Robotics V, 59

10.1002/j.1538-7305.1970.tb01770.x

10.1109/70.508439

10.1145/225058.225159

kavraki, 1998, probabilistic roadmaps for robot path planning, Practical Motion Planning in Robotics Current Approaches and Future Challenges, 33

10.1177/02783640122067354

ladd, 2004, fast exploration for robots with dynamics, Proc Workshop Algorithmic Found Robot

10.1177/0278364904045469

10.1109/TRA.2004.824649

10.1109/IRDS.2002.1041614

10.1109/ROBOT.2003.1242285

10.1109/70.660866

amato, 0, Motion Planning Benchmarks

akinc, 2003, probabilistic roadmaps of trees for parallel computation of multiple query roadmaps, Proc Int Symp Robot Res, 80

geraerts, 2002, a comparitive study of probabilistic roadmap planners, Algorithmic Foundations of Robotics V, 43

henrich, 1998, multi-directional search with goal switching for robot path planning, Proc Int Conf Ind Eng Applicat Artif Intell Expert Syst, 75

10.1109/IROS.1999.813013

hsu, 1998, on finding narrow passages with probabilistic roadmap planners, Robotics The Algorithmic Perspective, 141

10.1109/ROBOT.2000.844795

10.1109/ROBOT.1997.619371

10.1177/027836402320556421

10.1109/ROBOT.2005.1570711

10.1109/IRDS.2002.1043977

10.1109/ROBOT.2000.844106

10.1109/ROBOT.1999.772448

10.1177/027836499701600201

10.1109/ROBOT.2004.1308756

10.1177/027836402320556458

bessiere, 1998, the ariadne's clew algorithm, J Artif Intell Res, 9, 295, 10.1613/jair.468

10.1007/978-1-4615-0013-1_8

10.1177/02783640122067453

10.1109/ROBOT.1999.772447

branicky, 2001, quasirandomized path planning, Proc IEEE Int Conf Robot Autom, 1481

carpin, 2002, on parallel rrt's for multi-robot systems, Proc 8th Conf Italian Assoc Artif Intell, 834

10.1109/ROBOT.1995.525367

10.1109/ROBOT.1993.292122

de berg, 1997, Computational Geometry Algorithms and Applications, 10.1007/978-3-662-03427-9

10.1145/174147.174150

ehmann, 2001, geometric algorithms: accurate and fast proximity queries between polyhedra using convex surface decomposition, Proc Eurographics, 20, 500

10.1109/70.864240

amato, 1998, obprm: an obstacle-based prm for 3d workspaces, Robotics The Algorithmic Perspective, 156

amato, 2002, using motion planning to map protein folding landscapes and analyze folding kinetics of known native structures, Proc Int Conf Res Computat Molecular Biol, 2

10.1109/ROBOT.1999.770055

10.1177/027836499101000604

10.1089/10665270360688011

10.2514/6.2003-5511

bekris, 2003, multiple query motion planning using single query primitives, Proc IEEE/RSJ Int Conf Intell Robots Syst, 656

10.1109/ROBOT.2003.1242286

10.1109/ROBOT.2005.1570428

papadimitriou, 1982, Combinatorial Optimization Algorithms and Complexity

overmars, 1995, a probabilistic learning approach to motion planning, Algorithmic Foundations of Robotics, 19

lindemann, 2003, current issues in sampling-based motion planning, Proc Int Symp Robot Res, 36

lie, 2002, an incremental approach to motion planning with roadmap management, Proc IEEE Int Conf Robot Autom, 4, 3411

10.1007/3-540-63138-0_23

10.1109/ROBOT.1991.131722