Planning as heuristic search

DOI10.1016/S0004-3702(01)00108-4zbMath0971.68146OpenAlexW2122054842MaRDI QIDQ5941310

Publication date: 20 August 2001

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0004-3702(01)00108-4

zbMATH Keywords

planning heuristic search domain-independent heuristics forward/backward search graphplan non-optimal planning strips

Mathematics Subject Classification ID

Searching and sorting (68P10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (65)

Goal distance estimation for automated planning using neural networks and support vector machines ⋮ Planning with regression analysis in transaction logic ⋮ Multi-agent pathfinding with continuous time ⋮ Long-distance mutual exclusion for planning ⋮ Concise finite-domain representations for PDDL planning tasks ⋮ Learning from planner performance ⋮ A heuristic search approach to planning with temporally extended preferences ⋮ Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners ⋮ Weighted \(A^*\) search - unifying view and application ⋮ Extracting mutual exclusion invariants from lifted temporal planning domains ⋮ Symbolic perimeter abstraction heuristics for cost-optimal planning ⋮ State-set branching: leveraging BDDs for heuristic search ⋮ Heuristics for planning with penalties and rewards formulated in logic and computed through circuits ⋮ Anytime search in dynamic graphs ⋮ Efficient symbolic search for cost-optimal planning ⋮ Planning as satisfiability: heuristics ⋮ Planning with Critical Section Macros: Theory and Practice ⋮ A Comprehensive Framework for Learning Declarative Action Models ⋮ HEURISTIC SEARCH UNDER CONTRACT ⋮ Discovering state constraints for planning with conditional effects in \textsc{Discoplan}. I ⋮ Recent advances in unfolding technique ⋮ The computational complexity of avoiding spurious states in state space abstraction ⋮ Automatic construction of optimal static sequential portfolios for AI planning and beyond ⋮ Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces ⋮ Width-based search for multi agent privacy-preserving planning ⋮ Learning heuristic functions for large state spaces ⋮ Planning in domains with derived predicates through rule-action graphs and local search ⋮ Experimental evaluation of pheromone models in ACOPlan ⋮ Heuristic Hill-Climbing as a Markov Process ⋮ On the completeness of pruning techniques for planning with conditional effects ⋮ Planning as satisfiability: parallel plans and algorithms for plan search ⋮ Conformant planning via heuristic forward search: A new approach ⋮ Breadth-first heuristic search ⋮ Constraint partitioning in penalty formulations for solving temporal planning problems ⋮ Branching and pruning: An optimal temporal POCL planner based on constraint programming ⋮ Investigating the solution space for online iterative explanation in goal reasoning agents ⋮ Planning with Incomplete Information ⋮ State space search nogood learning: online refinement of critical-path dead-end detectors in planning ⋮ Robust planning with incomplete domain models ⋮ Star-topology decoupled state space search ⋮ New methods for proving the impossibility to solve problems through reduction of problem spaces ⋮ Conformant plans and beyond: principles and complexity ⋮ Modelling and solving English peg solitaire ⋮ Planning as heuristic search ⋮ Minimax real-time heuristic search ⋮ A constraint programming formulation for planning: From plan scheduling to plan generation ⋮ Set-structured and cost-sharing heuristics for classical planning ⋮ Planning and control in artificial intelligence: A unifying perspective ⋮ Directed Unfolding of Petri Nets ⋮ Optimal admissible composition of abstraction heuristics ⋮ Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search ⋮ Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP ⋮ Transition-Based Directed Model Checking ⋮ Anytime pack search ⋮ CPCES: a planning framework to solve conformant planning problems through a counterexample guided refinement ⋮ Subdimensional expansion for multirobot path planning ⋮ Conflict-based search for optimal multi-agent pathfinding ⋮ Red-black planning: a new systematic approach to partial delete relaxation ⋮ The LM-Cut Heuristic Family for Optimal Numeric Planning with Simple Conditions ⋮ Online Relaxation Refinement for Satisficing Planning: On Partial Delete Relaxation, Complete Hill-Climbing, and Novelty Pruning ⋮ Truncated incremental search ⋮ Multiobjective heuristic state-space planning ⋮ Controlling the learning process of real-time heuristic search ⋮ Contingent planning under uncertainty via stochastic satisfiability ⋮ Heuristic planning: A declarative approach based on strategies for action selection

Uses Software

Cites Work

This page was built for publication: Planning as heuristic search