Pages that link to "Item:Q3055802"
From MaRDI portal
The following pages link to The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks (Q3055802):
Displayed 17 items.
- Planning as satisfiability: heuristics (Q359984) (← links)
- Qualitative constraint satisfaction problems: an extended framework with landmarks (Q490417) (← links)
- State space search nogood learning: online refinement of critical-path dead-end detectors in planning (Q514137) (← links)
- Compact and efficient encodings for planning in factored state and action spaces with learned binarized neural network transition models (Q785238) (← links)
- Automatic construction of optimal static sequential portfolios for AI planning and beyond (Q898741) (← links)
- Agent planning programs (Q899440) (← links)
- Extracting mutual exclusion invariants from lifted temporal planning domains (Q1639696) (← links)
- The MADLA planner: multi-agent planning by combination of distributed and local heuristic search (Q1677441) (← links)
- Star-topology decoupled state space search (Q1749386) (← links)
- Selecting goals in oversubscription planning using relaxed plans (Q2238655) (← links)
- Landmark-based approaches for goal recognition as planning (Q2287208) (← links)
- Computing programs for generalized planning using a classical planner (Q2321292) (← links)
- Red-black planning: a new systematic approach to partial delete relaxation (Q2344359) (← links)
- (Q5020586) (← links)
- Online Relaxation Refinement for Satisficing Planning: On Partial Delete Relaxation, Complete Hill-Climbing, and Novelty Pruning (Q5026253) (← links)
- Planning with Critical Section Macros: Theory and Practice (Q5094030) (← links)
- Cost-optimal Planning, Delete Relaxation, Approximability, and Heuristics (Q5145837) (← links)