atlas

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

Saturated Post-hoc Optimization for Classical Planning

AAAI 2021 · Learning theory and algorithms › Combinatorial and search optimization · approach: Classical and HTN planning · 5 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 saturated operator costs in post-hoc optimization constraintsPost-hoc optimization with HC abstractions · IPC 1998–2018 tasks, HCsolved tasks: +9Helped
Use saturated operator costs in post-hoc optimization constraintsPost-hoc optimization with SYS abstractions · IPC 1998–2018 tasks, SYSsolved tasks: +51Helped
Use saturated operator costs in post-hoc optimization constraintsPost-hoc optimization with CART abstractions · IPC 1998–2018 tasks, CARTsolved tasks: +176Helped
Use saturated operator costs in post-hoc optimization constraintsPost-hoc optimization with combined HC, SYS, and CART abstractions · IPC 1998–2018 tasks, COMBsolved tasks: +171Helped

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