Sciweavers

1146 search results - page 1 / 230
» On the Complexity of Domain-Independent Planning
Sort
View
AAAI
1992
13 years 6 months ago
On the Complexity of Domain-Independent Planning
In this paper, we examine how the complexity of domain-independent planning with strips-style operators depends on the nature of the planning operators. We show how the time compl...
Kutluhan Erol, Dana S. Nau, V. S. Subrahmanian
IJCAI
2007
13 years 6 months ago
Domain Independent Approaches for Finding Diverse Plans
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...
ECAI
2008
Springer
13 years 6 months ago
Combining Domain-Independent Planning and HTN Planning: The Duet Planner
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...
AIPS
2006
13 years 6 months ago
Lessons Learned in Applying Domain-Independent Planning to High-Speed Manufacturing
Much has been made of the need for academic planning research to orient towards real-world applications. In this paper, we relate our experience in adapting domain-independent pla...
Minh Binh Do, Wheeler Ruml
AAAI
2007
13 years 7 months ago
Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning
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...