Fetching the paper…
Reading the bibliography…
The problem of path planning in unknown environments remains a challenging problem - as the environment is gradually observed during the navigation, the underlying planner has to update the environment representation and replan, promptly and constantly, to account for the new observations.
E. W. Dijkstra, “A note on two problems in connexion with graphs,” Numerische mathematik , vol. 1, no. 1, pp. 269–271, 1959
1959
Earlier work this paper cites.
P. Hart, N. Nilsson, and B. Raphael, “A formal basis for the heuristic determination of minimum cost paths,” IEEE Transactions on Systems Science and Cybernetics , vol. 4, no. 2, pp. 100–107, 1968
1968
Earlier work this paper cites.
D. H. Douglas and T. K. Peucker, “Algorithms for the reduction of the number of points required to represent a digitized line or its caricature,” Cartographica: The International Journal for Geographic Information and Geovisualization , vol. 10, pp. 112–122, 1973
1973
Earlier work this paper cites.
D.-T. Lee, “Proximity and reachability in the plane.” Ph.D. dissertation, USA, 1978
1978
Earlier work this paper cites.
T. Lozano-Pérez and M. A. Wesley, “An algorithm for planning collision-free paths among polyhedral obstacles,” Communications of the ACM , vol. 22, no. 10, p. 560–570, 1979
1979
Earlier work this paper cites.
S. Suzuki and K. Abe, “Topological structural analysis of digitized binary images by border following,” Computer Vision, Graphics, and Image Processing , vol. 30, pp. 32–46, 1985
1985
Earlier work this paper cites.
B. Oommen, S. Iyengar, N. Rao, and R. Kashyap, “Robot navigation in unknown terrains using learned visibility graphs. part i: The disjoint convex obstacle case,” IEEE Journal on Robotics and Automation , vol. 3, no. 6, pp. 672–681, 1987
1987
Earlier work this paper cites.
N. Rao, “Robot navigation in unknown generalized polygonal terrains using vision sensors,” IEEE Transactions on Systems, Man, and Cybernetics , vol. 25, no. 6, pp. 947–962, 1995
1995
Earlier work this paper cites.
L. Kavraki, P. Svestka, J.-C. Latombe, and M. Overmars, “Probabilistic roadmaps for path planning in high-dimensional configuration spaces,” IEEE Transactions on Robotics and Automation , vol. 12, no. 4, pp. 566–580, 1996
1996
Earlier work this paper cites.
A. Stentz, “Optimal and efficient path planning for partially known environments,” in Intelligent Unmanned Ground Vehicles , 1997, pp. 203–220
1997
Earlier work this paper cites.
J. Kuffner and S. LaValle, “RRT-connect: An efficient approach to single-query path planning,” in IEEE International Conference on Robotics and Automation , 2000, pp. 995–1001
2000
Earlier work this paper cites.
R. Bohlin and L. Kavraki, “Path planning using lazy PRM,” in IEEE International Conference on Robotics and Automation , 2000, pp. 521–528
2000
Earlier work this paper cites.
S. M. LaValle, J. J. Kuffner, B. Donald et al. , “Rapidly-exploring random trees: Progress and prospects,” Algorithmic and computational robotics: new directions , vol. 5, pp. 293–308, 2001
2001
Cited alongside, same era.
J. Kitzinger, “The visibility graph among polygonal obstacles: a comparison of algorithms,” 2003
2003
Cited alongside, same era.
C. Lanzoni, A. Sanchez, and R. Zapata, “Sensor-based motion planning for car-like mobile robots in unknown environments,” in IEEE International Conference on Robotics and Automation , 2003, pp. 4258–4263
2003
Cited alongside, same era.
S. Koenig and M. Likhachev, “Fast replanning for navigation in unknown terrain,” IEEE Transactions on Robotics , vol. 21, no. 3, pp. 354–363, 2005
2005
Cited alongside, same era.
D. Ferguson, N. Kalra, and A. Stentz, “Replanning with RRTs,” in IEEE International Conference on Robotics and Automation , 2006, pp. 1243–1248
A. Dobson and K. E. Bekris, “Improving sparse roadmap spanners,” in 2013 IEEE International Conference on Robotics and Automation , 2013, pp. 4106–4111
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 IEEE/RSJ International Conference on Intelligent Robots and Systems , 2014, pp. 2997–3004
2014
Later among the works it cites.
M. El Khaili, “Visibility graph for path planning in the presence of moving obstacles,” Engineering Science and Technology an International Journal , vol. 4, pp. 118–123, 09 2014
2014
Later among the works it cites.
J. Gammell, S. Srinivasa, and T. Barfoot, “Batch Informed Trees (BIT*): Sampling-based optimal planning via the heuristically guided search of implicit random geometric graphs,” in IEEE International Conference on Robotics and Automation , 06 2015, pp. 3067–3074
2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2006
Cited alongside, same era.
D. Wooden and M. Egerstedt, “Oriented visibility graphs: low-complexity planning in real-time environments,” in Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006. , 2006, pp. 2354–2359
2006
Cited alongside, same era.
Y. Tian, L. Yan, G.-Y. Park, S.-H. Yang, Y.-S. Kim, S.-R. Lee, and C.-Y. Lee, “Application of RRT-based local path planning algorithm in unknown environment,” in International Symposium on Computational Intelligence in Robotics and Automation , 2007, pp. 456–460
2007
Cited alongside, same era.
R. Andersen and S. Publications, Modern Methods for Robust Regression . SAGE Publications, 2008
2008
Cited alongside, same era.
S. C. Yun, V. Ganapathy, and T. W. Chien, “Enhanced D* Lite algorithm for mobile robot navigation,” in IEEE Symposium on Industrial Electronics and Applications , 2010, pp. 545–550
2010
Cited alongside, same era.
S. Karaman and E. Frazzoli, “Sampling-based algorithms for optimal motion planning,” The International Journal of Robotics Research , vol. 30, no. 7, pp. 846–894, 2011
2011
Cited alongside, same era.
H. Kaluder, M. Brezak, and I. Petrovic, “A visibility graph based method for path planning in dynamic environments,” in The 34th International Convention MIPRO , 2011, pp. 717–721
2011
Cited alongside, same era.
A. T. Le, M. Q. Bui, T. D. Le, and N. Peter, “D* Lite with reset: Improved version of D* Lite for complex environment,” in IEEE International Conference on Robotic Computing , 2017, pp. 160–163
2017
Later among the works it cites.
C. Richter and N. Roy, Bayesian Learning for Safe High-Speed Navigation in Unknown Environments , 01 2018, pp. 325–341
2018
Later among the works it cites.
J. Zhang and S. Singh, “Laser-visual-inertial odometry and mapping with high robustness and low drift,” Journal of Field Robotics , vol. 35, no. 8, pp. 1242–1264, 2018
2018
Later among the works it cites.
J. Zeng, R. Ju, L. Qin, Y. Hu, Q. Yin, and C. Hu, “Navigation in unknown dynamic environments based on deep reinforcement learning,” Sensors , vol. 19, p. 3837, 09 2019
2019
Later among the works it cites.
X. Guo and Y. Fang, “Learning to navigate in unknown environments based on GMRP-N,” in IEEE Annual International Conference on CYBER Technology in Automation, Control, and Intelligent Systems , 2019, pp. 1453–1458
2019
Later among the works it cites.
J. Zhang, C. Hu, R. G. Chadha, and S. Singh, “Falco: Fast likelihood-based collision avoidance with extension to human-guided navigation,” Journal of Field Robotics , vol. 37, no. 8, pp. 1300–1313, 2020
2020
Later among the works it cites.
C. Cao, H. Zhu, F. Yang, Y. Xia, H. Choset, J. Oh, and J. Zhang, “Autonomous exploration development environment and the planning algorithms,” in IEEE International Conference on Robotics and Automation , Philadelphia, PA, May 2022
2022
Closest in time.