Abstract
This article introduces a robust and safe path planning algorithm in order to satisfy mission requirements specified in linear temporal logic (LTL). When a path is planned to accomplish a mission, it is possible for a robot to fail to complete the mission or collide with obstacles due to noises and disturbances in the system. Hence, we need to find a robust path against possible disturbances. We introduce a robust path planning algorithm, which maximizes the probability of success in accomplishing a given mission by considering disturbances, while minimizing the moving distance of a robot. The proposed method can guarantee the safety of the planned trajectory by incorporating an LTL formula and chance constraints in a hierarchical manner. A high-level planner generates a discrete plan satisfying the mission requirements specified in LTL. A low-level planner builds a sampling-based rapidly exploring random tree search tree to minimize both the mission failure probability and the moving distance while guaranteeing the probability of collision with obstacles to be below a specified threshold. We have analyzed properties of the proposed algorithm theoretically and validated the robustness and safety of paths generated by the algorithm in simulation and experiments using a quadrotor.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
