Optimize Planning Heuristics to Rank, not to Estimate Cost-to-Goal: Preliminaries by@heuristicsearch
Optimize Planning Heuristics to Rank, not to Estimate Cost-to-Goal: Preliminaries
by Aiding in the focused exploration of potential solutions.April 5th, 2024
Too Long; Didn't Read
This work revisits the necessary and sufficient conditions of strictly optimally efficient heuristics for forward search algorithms.
This is paper is available on arxiv under CC 4.0 DEED license.
Authors:
(1) Leah Chrestien, Czech Technical University in Prague;
(2) Tomá˘s Pevný, Czech Technical University in Prague, and Gen Digital, Inc.;
(3) Stefan Edelkamp, Czech Technical University in Prague;
(4) Antonín Komenda, Czech Technical University in Prague.
Table of Links
- Abstract & Introduction
- Preliminaries
- Conditions on strictly optimally efficient heuristic
- Loss functions
- Related Work
- Experiments
- Conclusion and References
- Appendix
2 Preliminaries
2.1 Forward search algorithm
L O A D I N G
. . . comments & more!
. . . comments & more!
