Fetching the paper…
Reading the bibliography…
In this paper, we present Batch Informed Trees (BIT*), a planning algorithm based on unifying graph- and sampling-based planning techniques.
R. E. Bellman, “The theory of dynamic programming,” Bull. of the AMS , 60(6): 503–516, 1954
1954
Earlier work this paper cites.
R. E. Bellman, Dynamic Programming . Princeton Uni. Press, 1957
1957
Earlier work this paper cites.
E. W. Dijkstra, “A note on two problems in connexion with graphs,” Numerische Mathematik , 1(1): 269–271, 1959
1959
Earlier work this paper cites.
E. N. Gilbert, “Random plane networks,” SIAM , 9(4): 533–543, 1961
1961
Earlier work this paper cites.
P. E. Hart, N. J. Nilsson, and B. Raphael, “A formal basis for the heuristic determination of minimum cost paths,” TSSC , 4(2): 100–107, Jul. 1968
1968
Earlier work this paper cites.
I. Pohl, “Bi-directional search,” Mach. Intel. , 6: 127–140, 1971
1971
Earlier work this paper cites.
D. P. Bertsekas, “Convergence of discretization procedures in dynamic programming,” TAC , 20(3): 415–419, Jun. 1975
1975
Earlier work this paper cites.
L. Sint and D. de Champeaux, “An improved bidirectional heuristic search algorithm,” JACM , 24(2): 177–191, Apr. 1977
1977
Earlier work this paper cites.
T. Lozano-Pérez and M. A. Wesley, “An algorithm for planning collision-free paths among polyhedral obstacles,” CACM , 22(10): 560–570, Oct. 1979
1979
Earlier work this paper cites.
J. Barraquand and J.-C. Latombe, “Nonholonomic multibody mobile robots: controllability and motion planning in the presence of obstacles,” in ICRA , 3: 2328–2335, Apr. 1991
1991
Earlier work this paper cites.
K. Kondo, “Motion planning with six degrees of freedom by multistrategic bidirectional heuristic free-space enumeration,” TRA , 7(3): 267–277, Jun. 1991
1991
Earlier work this paper cites.
P. C. Chen and Y. K. Hwang, “SANDROS: a motion planner with performance proportional to task difficulty,” in ICRA , 3: 2346–2353, May 1992
1992
Earlier work this paper cites.
B. Donald, P. Xavier, J. Canny, and J. Reif, “Kinodynamic motion planning,” JACM , 40(5): 1048–1066, Nov. 1993
1993
Earlier work this paper cites.
C. S. Sallaberger and G. M. D’Eleuterio, “Optimal robotic path planning using dynamic programming and randomization,” Acta Astronautica , 35(2–3): 143–156, 1995
1995
Earlier work this paper cites.
A. Stentz, “The focussed D* algorithm for real-time replanning,” in IJCAI 1652–1659, 1995
1995
Cited alongside, same era.
K. M. Lynch and M. T. Mason, “Stable pushing: Mechanics, controllability, and planning,” IJRR , 15(6): 533–556, 1996
1996
Cited alongside, same era.
L. E. Kavraki, P. Švestka, J.-C. Latombe, and M. H. Overmars, “Probabilistic roadmaps for path planning in high-dimensional configuration spaces,” TRA , 12(4): 566–580, 1996
1996
Cited alongside, same era.
M. Cherif, “Kinodynamic motion planning for all-terrain wheeled vehicles,” in ICRA , 1: 317–322, 1999
1999
Cited alongside, same era.
J. J. Kuffner Jr. and S. M. LaValle, “RRT-Connect: An efficient approach to single-query path planning,” in ICRA , 995–1001, 2000
2000
Cited alongside, same era.
S. Muthukrishnan and G. Pandurangan, “The bin-covering technique for thresholding random geometric graph properties,” in SODA , 989–998, 2005
2005
Later among the works it cites.
D. Ferguson and A. Stentz, “Anytime RRTs,” IROS , 5369–5375, 2006
2006
Later among the works it cites.
R. Diankov and J. J. Kuffner Jr., “Randomized statistical path planning,” in IROS , 2007
2007
Later among the works it cites.
M. Likhachev, D. Ferguson, G. Gordon, A. Stentz, and S. Thrun, “Anytime search in dynamic graphs,” Art. Intel. , 172(14): 1613–1643, 2008
2008
Later among the works it cites.
S. Karaman and E. Frazzoli, “Sampling-based algorithms for optimal motion planning,” IJRR , 30(7): 846–894, 2011
2011
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
S. M. LaValle and J. J. Kuffner Jr., “Randomized kinodynamic planning,” IJRR , 20(5): 378–400, 2001
2001
Cited alongside, same era.
D. Hsu, R. Kindel, J.-C. Latombe, and S. Rock, “Randomized kinodynamic motion planning with moving obstacles,” IJRR , 21(3): 233–255, 2002
2002
Cited alongside, same era.
C. Urmson and R. Simmons, “Approaches for heuristically biasing RRT growth,” IROS , 2: 1178–1183, 2003
2003
Cited alongside, same era.
M. Penrose, Random Geometric Graphs , ser. Oxford Studies in Probability, L. C. G. Rogers, Ed. Oxford Uni. Press, 5: 2003
2003
Cited alongside, same era.
S. Koenig, M. Likhachev, and D. Furcy, “Lifelong planning A*,” Art. Intel. , 155(1–2): 93–146, 2004
2004
Cited alongside, same era.
F. Xue and P. R. Kumar, “The number of neighbors needed for connectivity of wireless networks,” Wireless Networks , 10(2): 169–181, 2004
2004
Cited alongside, same era.
M. Likhachev, D. Ferguson, G. Gordon, A. Stentz, and S. Thrun, “Anytime dynamic A*: An anytime, replanning algorithm,” in ICAPS , Jun. 2005
2005
Cited alongside, same era.
B. Akgun and M. Stilman, “Sampling heuristics for optimal motion planning in high dimensions,” IROS , 2640–2645, 2011
2011
Later among the works it cites.
S. Srinivasa, D. Berenson, M. Cakmak, A. Collet Romea, M. Dogar, A. Dragan, R. A. Knepper, T. D. Niemueller, K. Strabala, J. M. Vandeweghe, and J. Ziegler, “HERB 2.0: Lessons learned from developing a mobile manipulator for the home,” Proc. IEEE , 100(8): 1–19, Jul. 2012
2012
Later among the works it cites.
I. A. Şucan, M. Moll, and L. E. Kavraki, “The Open Motion Planning Library,” IEEE R&A Mag. , 19(4): 72–82, Dec. 2012
2012
Later among the works it cites.
M. Otte and N. Correll, “C-FOREST: Parallel shortest path planning with superlinear speedup,” TRO , 29(3): 798–806, Jun. 2013
2013
Later among the works it cites.
L. Janson and M. Pavone, “Fast marching trees: a fast marching sampling-based method for optimal motion planning in many dimensions,” in ISRR , Dec. 2013
2013
Later among the works it cites.
J. D. Gammell, S. S. Srinivasa, and T. D. Barfoot, “Informed RRT*: Optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic,” in IROS , 2997–3004, 2014
2014
Closest in time.
S. M. Persson and I. Sharf, “Sampling-based A* algorithm for robot path-planning,” IJRR , 33(13): 1683–1798, 2014
2014
Closest in time.
O. Salzman and D. Halperin, “Asymptotically-optimal motion planning using lower bounds on cost,” in ICRA , 2015
2015
Closest in time.