AI Paper Atlas

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

Allocating Planning Effort When Actions Expire

Shahaf S. Shperberg, Andrew Coles, Bence Cserna, Erez Karpas, Wheeler Ruml, Solomon E. Shimony

AAAI 2019 · Learning theory and algorithms › Combinatorial and search optimization · approach: Classical and HTN planning · 12 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 greedy deadline-aware allocation instead of round-robinTime allocation across expiring processes · Known deadlines averagesuccess probability: 0.35 -> 0.78Improved
use greedy deadline-aware allocation instead of round-robinTime allocation across expiring processes · Unknown deadlines averagesuccess probability: 0.41 -> 0.41No clear effect
use greedy allocation instead of most-promising-planTime allocation · All settings averagesuccess probability: 0.36 -> 0.60Improved
use ScheduleDR (diminishing-returns scheduler) instead of greedyTime allocation · Known deadlines, Boltzmannsuccess probability: 0.99 -> 0.91 (B, 100); 0.41 -> 0.09 (N, 10)Mixed
use ScheduleDR instead of greedyTime allocation · Unknown deadlines averagesuccess probability: 0.41 -> 0.45Improved
use greedy instead of MDP optimal policyTime allocation · All settings averageruntime: 0.20 -> 0.01Improved

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