Fetching the paper…
Reading the bibliography…
Coverage Path Planning (CPP) aims at finding an optimal path that covers the whole given space.
E. M. Arkin and R. Hassin, “Approximation algorithms for the geometric covering salesman problem,” Discrete Applied Mathematics , vol. 55, no. 3, pp. 197–218, 1994
1994
Earlier work this paper cites.
M. Dorigo, V. Maniezzo, and A. Colorni, “Ant system: optimization by a colony of cooperating agents,” IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) , vol. 26, no. 1, pp. 29–41, 1996
1996
Earlier work this paper cites.
H. Choset, “Coverage for robotics–a survey of recent results,” Annals of Mathematics and Artificial Intelligence , vol. 31, no. 1, pp. 113–126, 2001
2001
Earlier work this paper cites.
Y. Gabriely and E. Rimon, “Spiral-stc: An on-line coverage algorithm of grid environments by a mobile robot,” in Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No. 02CH37292) , vol. 1. IEEE, 2002, pp. 954–960
2002
Earlier work this paper cites.
E. Galceran and M. Carreras, “A survey on coverage path planning for robotics,” Robotics and Autonomous Systems , vol. 61, no. 12, pp. 1258–1276, 2013
2013
Cited alongside, same era.
R. Almadhoun, T. Taha, L. Seneviratne, J. Dias, and G. Cai, “A survey on inspecting structures using robotic systems,” International Journal of Advanced Robotic Systems , vol. 13, no. 6, p. 1729881416663664, 2016
2016
Cited alongside, same era.
R. Bormann, F. Jordan, J. Hampp, and M. Hägele, “Indoor coverage path planning: Survey, implementation, analysis,” in 2018 IEEE International Conference on Robotics and Automation (ICRA) . IEEE, 2018, pp. 1718–1725
2018
Cited alongside, same era.
2019
Cited alongside, same era.
S. Gao, Y. Ding, and B. M. Chen, “A frontier-based coverage path planning algorithm for robot exploration in unknown environment,” in 2020 39th Chinese Control Conference (CCC) . IEEE, 2020, pp. 3920–3925
2020
Later among the works it cites.
B. Nasirian, M. Mehrandezh, and F. Janabi-Sharifi, “Efficient coverage path planning for mobile disinfecting robots using graph-based representation of environment,” Frontiers in Robotics and AI , vol. 8, p. 4, 2021
2021
Later among the works it cites.
C. S. Tan, R. Mohd-Mokhtar, and M. R. Arshad, “A comprehensive review of coverage path planning in robotics using classical and heuristic algorithms,” IEEE Access , 2021
2021
Later among the works it cites.
P. Wang, L. Mihaylova, P. Bonnifait, P. Xu, and J. Jiang, “Feature-refined box particle filtering for autonomous vehicle localisation with openstreetmap,” Engineering Applications of Artificial Intelligence , vol. 105, p. 104445, 2021
2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…