The following pages link to Planning as heuristic search (Q5941310):
Displaying 21 items.
- Planning with Incomplete Information (Q3003424) (← links)
- HEURISTIC SEARCH UNDER CONTRACT (Q3224350) (← links)
- FROM PLANNING TO SEARCHING FOR THE SHORTEST PLAN: AN OPTIMAL TRANSITION (Q3427990) (← links)
- Heuristic Hill-Climbing as a Markov Process (Q3534666) (← links)
- Directed Unfolding of Petri Nets (Q3599218) (← links)
- Transition-Based Directed Model Checking (Q3617760) (← links)
- Directing the Search in the Fast Forward Planning (Q3628589) (← links)
- Gittins-index heuristics for research planning (Q4859566) (← 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)
- A Comprehensive Framework for Learning Declarative Action Models (Q5094057) (← links)
- Investigating the solution space for online iterative explanation in goal reasoning agents (Q5145432) (← links)
- The LM-Cut Heuristic Family for Optimal Numeric Planning with Simple Conditions (Q5870521) (← links)
- Planning as heuristic search (Q5941310) (← links)
- Minimax real-time heuristic search (Q5941315) (← links)
- Planning and control in artificial intelligence: A unifying perspective (Q5945807) (← links)
- Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search (Q5958540) (← links)
- Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP (Q5958636) (← links)
- Width-based search for multi agent privacy-preserving planning (Q6161467) (← links)
- Generalized planning as heuristic search: a new planning search-space that leverages pointers over objects (Q6566615) (← links)
- Planning in artificial intelligence (Q6602257) (← links)
