A Tree-Based Algorithm for Construction Robots

• Published in: Proceedings of the International Conference on Automated Planning and Scheduling Vol. 24; pp. 481 - 489
• Main Authors: Kumar, T. K., Jung, Sangmook, Koenig, Sven
• Format: Journal Article Conference Proceeding
• Language: English
• Published: 01.01.2014
• ISSN: 2334-0835; 2334-0843; 2334-0843
• DOI: 10.1609/icaps.v24i1.13673

In this paper, we present a tree-based algorithm for construction robots. Inspired by the TERMES project of Harvard University, robots in this domain are required to gather construction blocks from a reservoir and build user-specified structures much larger than themselves. While the robots are of roughly the same size as the blocks, they can scale greater heights by using temporarily constructed ramps in the substructures. In this paper, we consider the problem of minimizing the number of pickup and drop-off operations performed on blocks in order to build user-specified structures. Our polynomial-time algorithm heuristically solves this problem and is based on the idea of performing dynamic programming on a spanning tree in the inner loop and searching for a good tree to do so in the outer loop. Our algorithm performs very well in simulation and scales easily to large problem instances. For planning problems of this nature that are akin to construction domains, we believe that valuable lessons can be learned from comparing the success of our algorithm with the failure of off-the-shelf planning technologies.