Planning as heuristic search
From MaRDI portal
Publication:5941310
Recommendations
Cites work
- scientific article; zbMATH DE number 1696710 (Why is no real title available?)
- scientific article; zbMATH DE number 4162303 (Why is no real title available?)
- scientific article; zbMATH DE number 3657150 (Why is no real title available?)
- scientific article; zbMATH DE number 1285155 (Why is no real title available?)
- scientific article; zbMATH DE number 3895002 (Why is no real title available?)
- An Algorithm for Solving the Job-Shop Problem
- Constraint satisfaction using constraint logic programming
- Depth-first iterative-deepening: An optimal admissible tree search
- Fast planning through planning graph analysis
- Linear-space best-first search
- Network flows. Theory, algorithms, and applications.
- Planning as heuristic search
- Real-time heuristic search
- STRIPS: A new approach to the application of theorem proving to problem solving
- Using regression-match graphs to control search in planning
- Using temporal logics to express search control knowledge for planning
Cited in
(91)- Star-topology decoupled state space search
- Heuristics for planning with penalties and rewards formulated in logic and computed through circuits
- scientific article; zbMATH DE number 1943829 (Why is no real title available?)
- Goal distance estimation for automated planning using neural networks and support vector machines
- Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP
- Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search
- The computational complexity of avoiding spurious states in state space abstraction
- Efficient symbolic search for cost-optimal planning
- Weighted \(A^*\) search - unifying view and application
- Constraint partitioning in penalty formulations for solving temporal planning problems
- A unifying approach to heuristic search
- Concise finite-domain representations for PDDL planning tasks
- Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
- Learning from planner performance
- scientific article; zbMATH DE number 2038830 (Why is no real title available?)
- scientific article; zbMATH DE number 2038905 (Why is no real title available?)
- Minimax real-time heuristic search
- Planning and control in artificial intelligence: A unifying perspective
- Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces
- Learning heuristic functions for large state spaces
- Experimental evaluation of pheromone models in ACOPlan
- Planning in domains with derived predicates through rule-action graphs and local search
- Solving Simple Planning Problems with More Inference and No Search
- A heuristic search approach to planning with temporally extended preferences
- Conformant plans and beyond: principles and complexity
- Using regression-match graphs to control search in planning
- Conflict-based search for optimal multi-agent pathfinding
- scientific article; zbMATH DE number 2243410 (Why is no real title available?)
- Planning as heuristic search
- Recent advances in unfolding technique
- Branching and pruning: An optimal temporal POCL planner based on constraint programming
- Planning as satisfiability: parallel plans and algorithms for plan search
- Multiobjective heuristic state-space planning
- Heuristic planning: A declarative approach based on strategies for action selection
- Planning as satisfiability: heuristics
- Multi-agent pathfinding with continuous time
- CPCES: a planning framework to solve conformant planning problems through a counterexample guided refinement
- The FF planning system: Fast plan generation through heuristic search
- Search in the patience game `Black Hole'
- Automatic construction of optimal static sequential portfolios for AI planning and beyond
- Red-black planning: a new systematic approach to partial delete relaxation
- Directed Unfolding of Petri Nets
- Truncated incremental search
- Symbolic perimeter abstraction heuristics for cost-optimal planning
- Flucap: a heuristic search planner for first-order MDPS
- State-set branching: leveraging BDDs for heuristic search
- Contingent planning under uncertainty via stochastic satisfiability
- Implicit abstraction heuristics
- Anytime search in dynamic graphs
- Improving heuristics through relaxed search - an analysis of TP4 and HSP*a in the 2004 planning competition
- Modelling and solving English peg solitaire
- Robust planning with incomplete domain models
- New methods for proving the impossibility to solve problems through reduction of problem spaces
- State space search nogood learning: online refinement of critical-path dead-end detectors in planning
- Controlling the learning process of real-time heuristic search
- Extracting mutual exclusion invariants from lifted temporal planning domains
- The fast downward planning system
- Marvin: a heuristic search planner with online macro-action learning
- Subdimensional expansion for multirobot path planning
- On the completeness of pruning techniques for planning with conditional effects
- Optimal admissible composition of abstraction heuristics
- Anytime heuristic search for partial satisfaction planning
- Long-distance mutual exclusion for planning
- Breadth-first heuristic search
- Conformant planning via heuristic forward search: A new approach
- Boosting optimal symbolic planning: operator-potential heuristics
- Planning with incomplete information (invited paper)
- A Comprehensive Framework for Learning Declarative Action Models
- scientific article; zbMATH DE number 1696710 (Why is no real title available?)
- Investigating the solution space for online iterative explanation in goal reasoning agents
- Heuristic Hill-Climbing as a Markov Process
- Planning in artificial intelligence
- Anytime pack search
- Width-based search for multi agent privacy-preserving planning
- A constraint programming formulation for planning: From plan scheduling to plan generation
- KI 2005: Advances in Artificial Intelligence
- Online relaxation refinement for satisficing planning: on partial delete relaxation, complete hill-climbing, and novelty pruning
- Discovering state constraints for planning with conditional effects in \textsc{Discoplan}. I
- Brothers in arms? on AI planning and cellular automata
- Planning with regression analysis in transaction logic
- Set-structured and cost-sharing heuristics for classical planning
- Generalized planning as heuristic search: a new planning search-space that leverages pointers over objects
- Gittins-index heuristics for research planning
- Forward heuristic search planning based on an ordered hill-climbing algorithm
- The LM-Cut Heuristic Family for Optimal Numeric Planning with Simple Conditions
- Directing the Search in the Fast Forward Planning
- FROM PLANNING TO SEARCHING FOR THE SHORTEST PLAN: AN OPTIMAL TRANSITION
- Transition-Based Directed Model Checking
- Planning with Critical Section Macros: Theory and Practice
- Heuristic search under contract
- scientific article; zbMATH DE number 1852129 (Why is no real title available?)
This page was built for publication: Planning as heuristic search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5941310)
