Solving large TÆMS problems efficiently by selective exploration and decomposition

Abstract

TÆMS is a hierarchical modeling language capable of representing complex task networks with intra-task uncertainties and inter-task dependencies. The uncertainty and complexity of the application domains represented in TÆMS models often lead to very large state spaces, which push the need to design efficient solution algorithms for TÆMS problems. In this paper, we present a solver that integrates selective state space search techniques with state space decomposition techniques. Our experiments demonstrate that the solver can find an (approximately) optimal solution much faster than prior approaches.