An optimal approach to anytime task and path planning for autonomous mobile robots in dynamic environments

Wong, Cuebong and Yang, Erfu and Yan, Xiu-Tian and Gu, Dongbing; Althoefer, Kaspar and Konstantinova, Jelizaveta and Zhang, Ketao, eds. (2019) An optimal approach to anytime task and path planning for autonomous mobile robots in dynamic environments. In: Towards Autonomous Robotic Systems - 20th Annual Conference, TAROS 2019, Proceedings. Lecture Notes in Computer Science . Springer Publishing, Cham, pp. 155-166. ISBN 9783030253318 (https://doi.org/10.1007/978-3-030-25332-5_14)

[thumbnail of Wong-etal-TAROS2019-An-optimal-approach-to-anytime-task-and-path-planning-for-autonomous]
Preview
 Text. Filename: Wong_etal_TAROS2019_An_optimal_approach_to_anytime_task_and_path_planning_for_autonomous.pdf
Accepted Author Manuscript
Download (958kB)| Preview

Abstract

The study of combined task and path planning has mainly focused on feasibility planning for high-dimensional, complex manipulation problems. Yet the integration of symbolic reasoning capabilities with geometric knowledge can address optimal planning in lower dimensional problems. This paper presents a dynamic, anytime task and path planning approach that enables mobile robots to autonomously adapt to changes in the environment. The planner consists of a path planning layer that adopts a multi-tree extension of the optimal Transition-based Rapidly-Exploring Random Tree algorithm to simultaneously find optimal paths for all movement actions. The corresponding path costs, derived from a cost space function, are incorporated into the symbolic representation of the problem to guide the task planning layer. Anytime planning provides continuous path quality improvements, which subsequently updates the high-level plan. Geometric knowledge of the environment is preserved to efficiently re-plan both at the task and path planning level. The planner is evaluated against existing methods for static planning problems, showing that it is able to find higher quality plans without compromising planning time. Simulated deployment of the planner in a partially-known environment demonstrates the effectiveness of the dynamic, anytime components.

ORCID iDs

Wong, Cuebong ORCID logoORCID: https://orcid.org/0000-0002-6541-6125, Yang, Erfu ORCID logoORCID: https://orcid.org/0000-0003-1813-5950, Yan, Xiu-Tian ORCID logoORCID: https://orcid.org/0000-0002-3798-7414 and Gu, Dongbing; Althoefer, Kaspar, Konstantinova, Jelizaveta and Zhang, Ketao
CORE (COnnecting REpositories)