Admissible Heuristics for Automated Planning
The problem of domain-independent automated planning has been a topic of research in Artificial Intelligence since the very beginnings of the field. Due to the desire not to rely on vast quantities of problem specific knowledge, the most widely adopted approach to automated planning is search. The t...
Main Author: | Haslum, Patrik |
---|---|
Format: | Doctoral Thesis |
Language: | English |
Published: |
Linköpings universitet, KPLAB - Laboratoriet för kunskapsbearbetning
2006
|
Subjects: | |
Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-6042 http://nbn-resolving.de/urn:isbn:91-85497-28-2 |
Similar Items
-
Q-Graphplan: QoS-Aware Automatic Service Composition With the Extended Planning Graph
by: Zhaoning Wang, et al.
Published: (2020-01-01) -
Temporal Task and Motion Plans: Planning and Plan Repair : Repairing Temporal Task and Motion Plans Using Replanning with Temporal Macro Operators
by: Hansson, Erik
Published: (2018) -
New Heuristics for Planning with Action Costs
by: Keyder, Emil Ragip
Published: (2010) -
Adaptively Informed Trees (AIT*) and Effort Informed Trees (EIT*): Asymmetric bidirectional sampling-based path planning
by: Gammell, J.D, et al.
Published: (2022) -
A Novel Heuristic Emergency Path Planning Method Based on Vector Grid Map
by: Bowen Yang, et al.
Published: (2021-05-01)