An Optimal Approach to Anytime Task and Path Planning for Autonomous Mobile Robots in Dynamic Environments

  • Cuebong WongEmail author
  • Erfu Yang
  • Xiu-Tian Yan
  • Dongbing Gu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11650)


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.


Robotics 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).


  1. 1.
    Wong, C., Yang, E., Yan, X.-T., Gu, D.: Autonomous robots for harsh environments: a holistic overview of current solutions and ongoing challenges. Syst. Sci. Control Eng. 6(1), 213–219 (2018)CrossRefGoogle Scholar
  2. 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). Scholar
  3. 3.
    Nguyen, T.T., Kayacan, E., De Baedemaeker, J., Saeys, W.: Task and motion planning for apple harvesting robot. IFAC Proc. 46(18), 247–252 (2013)CrossRefGoogle Scholar
  4. 4.
    Friedrich, C., Csiszar, A., Lechler, A., Verl, A.: Efficient task and path planning for maintenance automation using a robot system. IEEE Trans. Autom. Sci. Eng. 15(3), 1205–1215 (2018)CrossRefGoogle Scholar
  5. 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). Scholar
  6. 6.
    Dantam, N.T., Chaudhuri, S., Kavraki, L.E.: The task-motion kit: an open source, general-purpose task and motion- planning framework. IEEE Robot. Autom. Mag. 25(3), 61–70 (2018)CrossRefGoogle Scholar
  7. 7.
    Muñoz, P., R-Moreno, M.D., Barrero, D.F.: Unified framework for path-planning and task-planning for autonomous robots. Robot. Auton. Syst. 82, 1–14 (2016)CrossRefGoogle Scholar
  8. 8.
    Woosley, B., Dasgupta, P.: Integrated real-time task and motion planning for multiple robots under path and communication uncertainties. Robotica 36(3), 353–373 (2018)CrossRefGoogle Scholar
  9. 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. 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. 11.
    McDermott, D.: The PDDL planning domain definition language. In: AIPS-98 Planning Competition Community (1998)Google Scholar
  12. 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
  13. 13.
    Hoomann, J.O.: The Metric-FF planning system: translating ‘ignoring delete lists’ to numeric state variables. J. Artif. Intell. Res. 20, 291–341 (2003)CrossRefGoogle Scholar
  14. 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
  15. 15.
    Otte, M., Frazzoli, E.: RRT\(^X\): asymptotically optimal single- query sampling-based motion planning with quick replanning. Int. J. Rob. Res. 35(7), 797–822 (2016)CrossRefGoogle Scholar
  16. 16.
    Daniel, K., Nash, A., Koenig, S., Felner, S.: Theta*: any-angle path planning on grids. J. Artif. Intell. Res. 39, 533–579 (2010)MathSciNetCrossRefGoogle Scholar
  17. 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

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Department of Design, Manufacture and Engineering ManagementUniversity of StrathclydeGlasgowUK
  2. 2.School of Computer Science and Electronic EngineeringUniversity of EssexColchesterUK

Personalised recommendations