In this paper, we propose a path re-planning algorithm that makes robots able to work in scenarios with moving obstacles. The algorithm switches between a set of pre-computed paths to avoid collisions with moving obstacles. It also improves the current path in an anytime fashion. The use of informed sampling enhances the search speed. Numerical results show the effectiveness of the strategy in different simulation scenarios.
@article{arxiv.2103.13245,
title = {Anytime informed path re-planning and optimization for robots in changing environments},
author = {Cesare Tonola and Marco Faroni and Nicola Pedrocchi and Manuel Beschi},
journal= {arXiv preprint arXiv:2103.13245},
year = {2023}
}