AI Paper Atlas

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

Efficiently Reasoning with Interval Constraints in Forward Search Planning

Amanda Coles, Andrew Coles, Moises Martinez, Emre Savas, Juan Manuel Delfa, Tomás de la Rosa, Yolanda E-Martín, Angel García-Olaya

AAAI 2019 · Learning theory and algorithms › Combinatorial and search optimization · approach: Classical and HTN planning · 4 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
handle interval constraints natively instead of by compilation to extra actionsOPTIC · Concrete, Crewplanning, Zeno Travel, Cafetime to solve: under 2 secondsImproved
scale durations and constraints by 10 to fit MTP discretizationMTP · benchmark domainsproblems solvedImproved
remove total goal ordering (problems 13-18 vs 7-12)OPTIC · Mars roversolve timeImproved
remove total goal ordering (problems 13-18)APSI · Mars roversolve timeHurt

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