The following pages link to (Q4449304):
Displayed 25 items.
- Truncated incremental search (Q253972) (← links)
- Planning in domains with derived predicates through rule-action graphs and local search (Q421464) (← links)
- On the completeness of pruning techniques for planning with conditional effects (Q473577) (← links)
- On the tractability of minimal model computation for some CNF theories (Q490649) (← links)
- State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning (Q543630) (← links)
- Kernel functions for case-based planning (Q622125) (← links)
- Managing concurrency in temporal planning using planner-scheduler interaction (Q834400) (← links)
- Long-distance mutual exclusion for planning (Q835814) (← links)
- Learning from planner performance (Q835821) (← links)
- Anytime heuristic search for partial satisfaction planning (Q835822) (← links)
- Task decomposition on abstract states, for planning under nondeterminism (Q835827) (← links)
- Agent planning programs (Q899440) (← links)
- Star-topology decoupled state space search (Q1749386) (← links)
- Discovering hidden structure in factored MDPs (Q1761300) (← links)
- Decidability and complexity of action-based temporal planning over dense time (Q2124463) (← links)
- A constraint-based approach to learn temporal features on action models from multiple plans (Q2152282) (← links)
- Discovering state constraints for planning with conditional effects in \textsc{Discoplan}. I (Q2188783) (← links)
- Set-structured and cost-sharing heuristics for classical planning (Q2268919) (← links)
- Red-black planning: a new systematic approach to partial delete relaxation (Q2344359) (← links)
- Sequential Monte Carlo in reachability heuristics for probabilistic planning (Q2389632) (← links)
- An approach to efficient planning with numerical fluents and multi-criteria plan quality (Q2389640) (← links)
- Processes and continuous change in a SAT-based planner (Q2457662) (← links)
- On the importance of domain model configuration for automated planning engines (Q2666958) (← links)
- MANAGING TEMPORAL CYCLES IN PLANNING PROBLEMS REQUIRING CONCURRENCY (Q2857288) (← links)
- Analyzing Heuristic-based Randomized Search Strategies for the Quantum Circuit Compilation Problem (Q5140145) (← links)