Optimize Planning Heuristics to Rank, not to Estimate Cost-to-Goal: Preliminaries

Written by heuristicsearch | Published 2024/04/05
Tech Story Tags: optimize-planning | cost-to-goal | imitation-learning | heuristic-functions | heuristics-to-rank | greedy-best-first-search | family-of-loss-functions | automated-planning

TLDRThis work revisits the necessary and sufficient conditions of strictly optimally efficient heuristics for forward search algorithms.via the TL;DR App

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

2 Preliminaries

2.1 Forward search algorithm

Written by heuristicsearch | Efficiently exploring and navigating large solution spaces at HeuristicsSearch.Tech
Published by HackerNoon on 2024/04/05
ABOUTHow hackers start their afternoons. We publish tech stories and build publishing software.

READEntirely free library read by hundreds of millions to learn anything about any technology.

WRITEHackerNoon elevates quality technology writing far and wide across the interwebs.

PARTNERHackerNoon works directly with tech companies to place ads by content relevancy