2012
DOI: 10.4304/jsw.7.9.2099-2106
|View full text |Cite
|
Sign up to set email alerts
|

A Survey of Heuristics for Domain-Independent Planning

Abstract:

Increasing interest has been devoted to Planning as Heuristic Search over the years. Intense research has focused on deriving accurate heuristics in polynomial computational time for domain-independent planning. This paper reports on an extensive survey and analysis of research work related to heuristic derivation techniques for state space search planning, as well as other planning paradigms. Survey results reveal that heuristic techniques have been extensively applied in many efficient pl… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 25 publications
0
2
0
Order By: Relevance
“…Therefore, Dijkstra's algorithm was chosen as a reference [24]. The algorithm is often used as a benchmark, because it is optimal and represents the worst-case scenario in domain-independent planners [32].…”
Section: Methodsmentioning
confidence: 99%
“…Therefore, Dijkstra's algorithm was chosen as a reference [24]. The algorithm is often used as a benchmark, because it is optimal and represents the worst-case scenario in domain-independent planners [32].…”
Section: Methodsmentioning
confidence: 99%
“…Heuristic search (Bryce & Kambhampati, 2007;Haslum, Botea, Helmert, Bonet, & Koenig, 2007;Liang, 2012) has become a de facto standard method to fin plans in large deterministic search space. This approach has revolutionized planning, both in terms of scalability and in terms of research methodology.…”
Section: Planning Heuristicsmentioning
confidence: 99%