Limitations of and extensions to heuristic search planning
This thesis explores limitations of heuristic search planning, and presents techniques to overcome those limitations. The two halves of the thesis discuss problems in standard propositional planning (STRIPS) and in planning with numeric state variables respectively. === In the context of STRIPS, the...
Main Author: | Burfoot, Daniel. |
---|---|
Format: | Others |
Language: | en |
Published: |
McGill University
2006
|
Subjects: | |
Online Access: | http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=100779 |
Similar Items
-
Heuristic workforce scheduling
by: Culver, William Daniel
Published: (2008) -
Gender based meta-heuristic optimization algorithms
by: Tian, Zhong Huan
Published: (2017) -
Scheduling problems with no intermediate storage :
heuristics and probabilistic analysis
by: Nagorka, Peter Randal
Published: (2008) -
Studying Bibliometrics-Based Heuristics (BBHs): A New Research Program on the use of Bibliometrics in Research Evaluation
by: Lutz Bornmann
Published: (2020-08-01) -
New heuristics and meta-heuristics for the Bandpass problem
by: Arif Gursoy, et al.
Published: (2017-12-01)