The following pages link to (Q4449294):
Displaying 21 items.
- Planning in domains with derived predicates through rule-action graphs and local search (Q421464) (← links)
- Approximation of action theories and its application to conformant planning (Q543583) (← links)
- Computing the minimal relations in point-based qualitative temporal reasoning through metagraph closure (Q543614) (← links)
- State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning (Q543630) (← links)
- Kernel functions for case-based planning (Q622125) (← links)
- Learning from planner performance (Q835821) (← links)
- Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners (Q835826) (← links)
- Some computational aspects of DISTANCE SAT (Q877840) (← links)
- Agent planning programs (Q899440) (← links)
- Efficient benchmarking of algorithm configurators via model-based surrogates (Q1707462) (← links)
- Star-topology decoupled state space search (Q1749386) (← links)
- A case study in programming a quantum annealer for hard operational planning problems (Q2018131) (← links)
- Set-structured and cost-sharing heuristics for classical planning (Q2268919) (← links)
- An approach to efficient planning with numerical fluents and multi-criteria plan quality (Q2389640) (← links)
- Breadth-first heuristic search (Q2457631) (← links)
- Branching and pruning: An optimal temporal POCL planner based on constraint programming (Q2457640) (← links)
- Processes and continuous change in a SAT-based planner (Q2457662) (← links)
- Handling fuzzy temporal constraints in a planning environment (Q2468753) (← links)
- Divide-and-Evolve: a Sequential Hybridization Strategy Using Evolutionary Algorithms (Q3509425) (← links)
- Maintenance of plan libraries for case-based planning: offline and online policies (Q6535412) (← links)
- Planning in artificial intelligence (Q6602257) (← links)
