Fetching the paper…
Reading the bibliography…
In many applications, including logistics and manufacturing, robot manipulators operate in semi-structured environments alongside humans or other robots.
L. E. Kavraki, P. Svestka, J.-C. Latombe, and M. H. 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.
Z. J. Czech, G. Havas, and B. S. Majewski, “ Perfect hashing ,” Theoretical Computer Science , vol. 182, no. 1-2, pp. 1–143, 1997
1997
Earlier work this paper cites.
S. M. LaValle, “ Rapidly-exploring random trees: A new tool for path planning ,” 1998
1998
Earlier work this paper cites.
J. J. Kuffner and S. M. LaValle, “ RRT-connect: An efficient approach to single-query path planning ,” in Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No. 00CH37065) , vol. 2. IEEE, 2000, pp. 995–1001
2000
Earlier work this paper cites.
P. Leven and S. Hutchinson, “ A framework for real-time path planning in changing environments ,” The International Journal of Robotics Research , vol. 21, no. 12, pp. 999–1030, 2002
2002
Earlier work this paper cites.
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
Earlier work this paper cites.
M. Phillips, B. Cohen, S. Chitta, and M. Likhachev, “ E-Graphs: Bootstrapping Planning with Experience Graphs ,” in Proceedings of Robotics: Science and Systems , Sydney, Australia, July 2012
2012
Earlier work this paper cites.
D. Berenson, P. Abbeel, and K. Goldberg, “ A robot path planning framework that learns from experience ,” in 2012 IEEE International Conference on Robotics and Automation . IEEE, 2012, pp. 3671–3678
2012
Cited alongside, same era.
I. A. Sucan, M. Moll, and L. E. Kavraki, “ The open motion planning library ,” IEEE Robotics & Automation Magazine , vol. 19, no. 4, pp. 72–82, 2012
2012
Cited alongside, same era.
D. Coleman, I. A. Şucan, M. Moll, K. Okada, and N. Correll, “ Experience-based planning with sparse roadmap spanners ,” in 2015 IEEE International Conference on Robotics and Automation (ICRA) . IEEE, 2015, pp. 900–905
2015
Cited alongside, same era.
B. Calli, A. Singh, A. Walsman, S. Srinivasa, P. Abbeel, and A. M. Dollar, “ The ycb object and model set: Towards common benchmarks for manipulation research ,” in 2015 international conference on advanced robotics (ICAR) . IEEE, 2015, pp. 510–517
2015
Cited alongside, same era.
P. Lehner and A. Albu-Schäffer, “ The repetition roadmap for repetitive constrained motion planning ,” IEEE Robotics and Automation Letters , vol. 3, no. 4, pp. 3884–3891, 2018
2018
Later among the works it cites.
J. Liang, V. Makoviychuk, A. Handa, N. Chentanez, M. Macklin, and D. Fox, “Gpu-accelerated robotic simulation for distributed reinforcement learning,” Conference on Robot Learning , 2018
2018
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Y. Yang, W. Merkt, V. Ivan, Z. Li, and S. Vijayakumar, “ HDRM: A resolution complete dynamic roadmap for real-time motion planning in complex scenes ,” IEEE Robotics and Automation Letters , vol. 3, no. 1, pp. 551–558, 2017
2017
Cited alongside, same era.
2017
Cited alongside, same era.
L. Kavraki and R. Bohlin, “ Path planning using lazy PRM .”
Cited in the paper.
2020
Closest in time.
J. D. Gammell, T. D. Barfoot, and S. S. Srinivasa, “ Batch Informed Trees (BIT*): Informed asymptotically optimal anytime search ,” The International Journal of Robotics Research , vol. 39, no. 5, pp. 543–567, 2020
2020
Closest in time.