Recursive decomposition of numeric goals, exemplified with automated construction agents in 3D MineCraft worlds

Abstract

This research describes a novel approach to incorporating in a general planning process. Five planning control strategies are articulated for combining primitive (which directly solve problems) with (which decompose problems into combinations of problems of the same form). The combined rules are applied to carry out and generalized planning, utilizing the observation that a navigation problem can be decomposed automatically into smaller planning-aided problems, and hence addressed by vertical recursive rules. The approach is illustrated in a MineCraft construction domain, using an agent that is able to build blocks to create a path to reach an initially unreachable target, e.g., a path finding task in which parts of the path must be constructed during the course of navigation/planning, such as building a bridge to fill a gap on the way to the target location.