An Optimal Approach to Anytime Task and Path Planning for Autonomous Mobile Robots in Dynamic Environments
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.
KeywordsRobotics Autonomous systems Task planning Path planning Combined task and motion planning Dynamic planning
Funded by the Engineering and Physical Sciences Research Council (EPSRC) under its Doctoral Training Partnership Programme (DTP 2016–2020 University of Strathclyde, Glasgow, UK).
- 2.Gasparetto, A., Boscariol, P., Lanzutti, A., Vidoni, R.: Path planning and trajectory planning algorithms: a general overview. In: Carbone, G., Gomez-Bravo, F. (eds.) Motion and Operation Planning of Robotic Systems. MMS, vol. 29, pp. 3–27. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-14705-5_1CrossRefGoogle Scholar
- 5.Garrett, C.R., Lozano-Pérez, T., Kaelbling, L.P.: FFRob: an efficient heuristic for task and motion planning. In: Akin, H.L., Amato, N.M., Isler, V., van der Stappen, A.F. (eds.) Algorithmic Foundations of Robotics XI. STAR, vol. 107, pp. 179–195. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-16595-0_11CrossRefGoogle Scholar
- 9.Wong, C., Yang, E., Yan, X.-T., Gu, D.: Optimal path planning based on a multi-tree T-RRT* approach for robotic task planning in continuous cost spaces. In: 12th France-Japan and 10th Europe-Asia Congress on Mechatronics, pp. 242–247 (2018)Google Scholar
- 10.Wong, C., Yang, E., Yan, X.-T., Gu, D.: Dynamic anytime task and path planning for mobile robots. In: UK-RAS19 Conference on Embedded Intelligence: Enabling & Supporting RAS Technologies, pp. 36–39 (2019)Google Scholar
- 11.McDermott, D.: The PDDL planning domain definition language. In: AIPS-98 Planning Competition Community (1998)Google Scholar
- 12.Gerevini, A., Saetti, A., Serina, I., Toninelli, P.: LPG-TD: a fully automated planner for PDDL2.2 domains. In: 14th International Conference on Automated Planning and Scheduling International Planning Competition (2004)Google Scholar
- 14.Ferguson, D., Stentz, A.: Anytime RRTs. In: Proceedings of the 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 5369–5375 (2006)Google Scholar
- 17.Karaman, S., Walter, M.R., Perez, A., Frazzoli, E., Teller, S.: Anytime motion planning using the RRT*. In: IEEE International Conference on Robotics and Automation, pp. 1478–1483 (2011)Google Scholar