Pages that link to "Item:Q2717791"
From MaRDI portal
The following pages link to The FF planning system: Fast plan generation through heuristic search (Q2717791):
Displaying 50 items.
- Goal distance estimation for automated planning using neural networks and support vector machines (Q269064) (← links)
- Domain-independent planning for services in uncertain and dynamic environments (Q286080) (← links)
- Planning as satisfiability: heuristics (Q359984) (← links)
- Recent advances in unfolding technique (Q403021) (← links)
- Learning heuristic functions for large state spaces (Q420796) (← links)
- Planning in domains with derived predicates through rule-action graphs and local search (Q421464) (← links)
- Experimental evaluation of pheromone models in ACOPlan (Q421472) (← links)
- Depth-based short-sighted stochastic shortest path problems (Q460624) (← links)
- Plan aggregation for strong cyclic planning in nondeterministic domains (Q460629) (← links)
- On the completeness of pruning techniques for planning with conditional effects (Q473577) (← links)
- Fast strong planning for fully observable nondeterministic planning problems (Q504220) (← links)
- State space search nogood learning: online refinement of critical-path dead-end detectors in planning (Q514137) (← links)
- Robust planning with incomplete domain models (Q514145) (← links)
- Approximation of action theories and its application to conformant planning (Q543583) (← links)
- State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning (Q543630) (← links)
- Kernel functions for case-based planning (Q622125) (← links)
- Specifying and computing preferred plans (Q646542) (← links)
- New methods for proving the impossibility to solve problems through reduction of problem spaces (Q693286) (← links)
- CPCES: a planning framework to solve conformant planning problems through a counterexample guided refinement (Q785225) (← links)
- Complexity results for standard benchmark domains in planning (Q814425) (← links)
- Multiobjective heuristic state-space planning (Q814441) (← links)
- Managing concurrency in temporal planning using planner-scheduler interaction (Q834400) (← links)
- Concise finite-domain representations for PDDL planning tasks (Q835819) (← links)
- Learning from planner performance (Q835821) (← links)
- Anytime heuristic search for partial satisfaction planning (Q835822) (← links)
- A heuristic search approach to planning with temporally extended preferences (Q835825) (← links)
- Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners (Q835826) (← links)
- The factored policy-gradient planner (Q835832) (← links)
- Practical solution techniques for first-order MDPs (Q835833) (← links)
- Automatic construction of optimal static sequential portfolios for AI planning and beyond (Q898741) (← links)
- A generic approach to planning in the presence of incomplete information: theory and implementation (Q899156) (← links)
- Agent planning programs (Q899440) (← links)
- An extension of metric temporal planning with application to AC voltage control (Q900312) (← links)
- Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces (Q901034) (← links)
- Conformant plans and beyond: principles and complexity (Q969534) (← links)
- Automatically selecting and using primary effects in planning: Theory and experiments. (Q1399131) (← links)
- Fast planning through planning graph analysis (Q1402751) (← links)
- Planning the project management way: Efficient planning by effective integration of causal and resource reasoning in RealPlan (Q1606337) (← 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)
- Discovering hidden structure in factored MDPs (Q1761300) (← links)
- Gradient-based mixed planning with symbolic and numeric action parameters (Q2093396) (← links)
- Selecting goals in oversubscription planning using relaxed plans (Q2238655) (← links)
- Model checking approach to automated planning (Q2248102) (← links)
- A constraint programming formulation for planning: From plan scheduling to plan generation (Q2268509) (← links)
- Set-structured and cost-sharing heuristics for classical planning (Q2268919) (← links)
- Representing and planning with interacting actions and privacy (Q2287194) (← links)
- Landmark-based approaches for goal recognition as planning (Q2287208) (← links)
- Red-black planning: a new systematic approach to partial delete relaxation (Q2344359) (← links)
