AI Paper Atlas

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

Symbolic Top-k Planning

David Speck, Robert Mattmüller, Bernhard Nebel

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

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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
use symbolic top-k search instead of FORBID-K replanning at k=10000SYM-K · IPC optimal track, k=10000k-coverage: 503 -> 1232Improved
use symbolic top-k search instead of FORBID-K at k=100SYM-K · IPC optimal track, k=100k-coverage: 1020 -> 1282Improved
use symbolic top-k search instead of FORBID-K at k=1SYM-K · IPC optimal track, k=1k-coverage: 1280 -> 1293No clear effect
use bidirectional instead of forward symbolic search (ablation)SYM-K · IPC optimal trackk-coverageImproved
scale k from 1 to 10000 for SYM-K bidirectionalSYM-K · IPC optimal trackk-coverage: 1293 -> 1232No clear effect
scale k from 1 to 10000 for FORBID-K naiveFORBID-K · IPC optimal trackk-coverage: 1280 -> 503Hurt
SYM-K vs FORBID-K per domain at k=10000SYM-K · 73 IPC domainsk-coverageImproved
SYM-K forward search vs K* and FORBID-K for k>=5SYM-K forward · IPC optimal track, k>=5k-coverageImproved

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