HTN planning: complexity and expressivity
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Distributed problem solving and planning
Multiagent systems
A machine program for theorem-proving
Communications of the ACM
IMPACTing SHOP: Putting an AI Planner Into a Multi-Agent Environment
Annals of Mathematics and Artificial Intelligence
Superlinear Speedup in Parallel State-Space Search
Proceedings of the Eighth Conference on Foundations of Software Technology and Theoretical Computer Science
Automated Planning: Theory & Practice
Automated Planning: Theory & Practice
Swarm-Bot: A New Distributed Robotic Concept
Autonomous Robots
Robot and Sensor Networks for First Responders
IEEE Pervasive Computing
A Unified Framework Based on HTN and POP Approaches for Multi-Agent Planning
IAT '07 Proceedings of the 2007 IEEE/WIC/ACM International Conference on Intelligent Agent Technology
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
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.