atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Avoiding Dead Ends in Real-Time Heuristic Search

AAAI 2018 · Learning theory and algorithms › Combinatorial and search optimization · approach: Classical and HTN planning · 22 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
add safety predicate with breadth-first lookahead (simple safe search) to LSS-LRTA*LSS-LRTA* · Traffic and Racetracksuccess rateHelped
add safety check at node generation and comfort backup (S0) to LSS-LRTA*LSS-LRTA* · Traffic and Racetracksuccess rateMixed
explicitly prove promising nodes safe with safety heuristic search (SafeRTS) instead of S0S0 / LSS-LRTA* · Traffic and Racetracksuccess rateHelped
SafeRTS instead of simple safe search and S0real-time search · Racetrackaverage velocityHelped
commit to multiple actions rather than only the first action (ablation)LSS-LRTA* · Traffic and Racetracksuccess rateHelped
use safe-toward-best instead of best-safe action selection (ablation)SafeRTS · Traffic and Racetracksuccess rateHelped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy