Planner9, a HTN planner distributed on groups of miniature mobile robots

Autonomous mobile robots are promising tools for operations in environments that are difficult to access for humans. When these environments are dynamic and non-deterministic, like in collapsed buildings, the robots must coordinate their actions and the use of resources using planning. This paper presents Planner9, a hierarchical task network (HTN) planner that runs on groups of miniature mobile robots. These robots have limited computational power and memory, but are well connected through Wi-Fi. Planner9 takes advantage of this connectivity to distribute the planning over different robots. We have adapted the HTN algorithm to perform parallel search using A* and to limit the number of search nodes through lifting. We show that Planner9 scales well with the number of robots, even on non-linear tasks that involve recursions in their decompositions. We show that contrary to JSHOP2, Planner9 finds optimal plans.

Published in:
Intelligent Robotics and Applications, Proceedings of the Second International Conference on Intelligent Robotics and Application, 5928, 1013-1022
Presented at:
Second International Conference on Intelligent Robotics and Application, Singapore, December 16-18, 2009
Berlin / Heidelberg, Springer

 Record created 2009-09-05, last modified 2018-01-28

External links:
Download fulltextURL
Download fulltextn/a
Rate this document:

Rate this document:
(Not yet reviewed)