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.
Unable to display preview. Download preview PDF.
- 4.Mondada, F., Pettinaro, G.C., Guignard, A., Kwee, I., Floreano, D., Deneubourg, J.L., Nolfi, S., Gambardella, L., Dorigo, M.: SWARM-BOT: a New Distributed Robotic Concept. Autonomous Robots, special Issue on Swarm Robotics 17(2-3), 193–221 (2004)Google Scholar
- 5.Erol, K., Hendler, J.A., Nau, D.S.: HTN Planning: Complexity and Expressivity. In: AAAI, pp. 1123–1128. AAAI Press, Menlo Park (1994)Google Scholar
- 8.Durfee, E.: Distributed problem solving and planning. Multiagent systems: a modern approach to distributed artificial intelligence, 121–164 (1999)Google Scholar
- 9.DesJardins, M., Durfee, E., Ortiz, C., Wolverton, M.: A survey of research in distributed, continual planning. AI Magazine (1999)Google Scholar
- 16.Hart, P., Nilsson, N., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics 4, 100–107Google Scholar
- 17.Rao, V.N., Kumar, V.: Superlinear speedup in parallel state-space search. In: Proceedings of the Eighth Conference on Foundations of Software Technology and Theoretical Computer Science, London, UK, pp. 161–174. Springer, Heidelberg (1988)Google Scholar