The following pages link to Planning as heuristic search (Q5941310):
Displaying 50 items.
- Truncated incremental search (Q253972) (← links)
- Goal distance estimation for automated planning using neural networks and support vector machines (Q269064) (← links)
- Efficient symbolic search for cost-optimal planning (Q343909) (← 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)
- On the completeness of pruning techniques for planning with conditional effects (Q473577) (← 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)
- The computational complexity of avoiding spurious states in state space abstraction (Q622104) (← 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)
- Multiobjective heuristic state-space planning (Q814441) (← links)
- Controlling the learning process of real-time heuristic search (Q814454) (← links)
- Contingent planning under uncertainty via stochastic satisfiability (Q814473) (← links)
- Heuristic planning: A declarative approach based on strategies for action selection (Q814564) (← links)
- Long-distance mutual exclusion for planning (Q835814) (← links)
- Concise finite-domain representations for PDDL planning tasks (Q835819) (← links)
- Learning from planner performance (Q835821) (← 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)
- Weighted \(A^*\) search - unifying view and application (Q840833) (← links)
- Automatic construction of optimal static sequential portfolios for AI planning and beyond (Q898741) (← links)
- Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces (Q901034) (← links)
- Conformant plans and beyond: principles and complexity (Q969534) (← links)
- Optimal admissible composition of abstraction heuristics (Q991018) (← links)
- Extracting mutual exclusion invariants from lifted temporal planning domains (Q1639696) (← links)
- Symbolic perimeter abstraction heuristics for cost-optimal planning (Q1647507) (← links)
- Star-topology decoupled state space search (Q1749386) (← links)
- Multi-agent pathfinding with continuous time (Q2124435) (← links)
- Discovering state constraints for planning with conditional effects in \textsc{Discoplan}. I (Q2188783) (← 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)
- Anytime pack search (Q2311238) (← links)
- Subdimensional expansion for multirobot path planning (Q2343828) (← links)
- Conflict-based search for optimal multi-agent pathfinding (Q2343829) (← links)
- Red-black planning: a new systematic approach to partial delete relaxation (Q2344359) (← links)
- Planning with regression analysis in transaction logic (Q2360182) (← links)
- State-set branching: leveraging BDDs for heuristic search (Q2389616) (← links)
- Heuristics for planning with penalties and rewards formulated in logic and computed through circuits (Q2389669) (← links)
- Anytime search in dynamic graphs (Q2389673) (← links)
- Planning as satisfiability: parallel plans and algorithms for plan search (Q2457605) (← links)
- Conformant planning via heuristic forward search: A new approach (Q2457623) (← links)
- Breadth-first heuristic search (Q2457631) (← links)
- Constraint partitioning in penalty formulations for solving temporal planning problems (Q2457638) (← links)
- Branching and pruning: An optimal temporal POCL planner based on constraint programming (Q2457640) (← links)
- Modelling and solving English peg solitaire (Q2489133) (← links)
- Planning with Incomplete Information (Q3003424) (← links)
