atlas

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

Symbolic Search for Optimal Total-Order HTN Planning

AAAI 2021 · Learning theory and algorithms › Combinatorial and search optimization · approach: Classical and HTN planning · 11 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
Use symbolic search with BDD-based automata for optimal TOHTN planning instead of the strongest overall baselineOptimal TOHTN planning · Overall (465 instances)instances solved: 242 vs. 174Helped
Use symbolic search rather than SAT(bin)Barman · Barmaninstances solved: 0 vs. 12Hurt
Use symbolic search rather than SAT(bin)Childsnack · Childsnackinstances solved: 2 vs. 6Hurt
Use symbolic search rather than SAT(bin)Gripper · Gripperinstances solved: 20 vs. 20No clear effect
Use symbolic search rather than SAT(bin)Satellite-PANDA · Satellite-PANDAinstances solved: 25 vs. 25No clear effect

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