In many planning situations, a planner is required to return a diverse set of plans satisfying the same goals which will be used by the external systems collectively. We take a do...
Biplav Srivastava, Tuan A. Nguyen, Alfonso Gerevin...
Abstract. Despite the recent advances in planning for classical domains, the question of how to use domain knowledge in planning is yet to be completely and clearly answered. Some ...
Alfonso Gerevini, Ugur Kuter, Dana S. Nau, Alessan...
Heuristic search is a leading approach to domain-independent planning. For cost-optimal planning, however, existing admissible heuristics are generally too weak to effectively gui...
Patrik Haslum, Adi Botea, Malte Helmert, Blai Bone...
Programs such as Bacon, Abacus, Coper, Kepler and others are designed to find functional relationships of scientific significance in numerical data without relying on the deep dom...
There are a lot of approaches for solving planning problems. Many of these approaches are based on `brute force` search methods and do not care about structures of plans previousl...