Fast planning through planning graph analysis

DOI10.1016/S0004-3702(96)00047-1zbMath1017.68533OpenAlexW2025460523MaRDI QIDQ1402751

Publication date: 28 August 2003

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

Full work available at URL: https://doi.org/10.1016/s0004-3702(96)00047-1

zbMATH Keywords

Graph algorithms STRIPS planning General purpose planning Planning graph analysis

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Parallel planning via the distribution of operators, Characterization, verification and generation of strategies in games with resource constraints, Automatic workflow verification and generation, Long-distance mutual exclusion for planning, 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, Task decomposition on abstract states, for planning under nondeterminism, The factored policy-gradient planner, Gearing Up for Effective ASP Planning, Extracting mutual exclusion invariants from lifted temporal planning domains, A Global Filtration for Satisfying Goals in Mutual Exclusion Networks, The Open-Source Fixed-Point Model Checker for Symbolic Analysis of Security Protocols, Using Satisfiability for Non-optimal Temporal Planning, A formal characterisation of Hamblin's action-state semantics, Conflict-directed \(A^{*}\) and its role in model-based embedded systems, An approach to efficient planning with numerical fluents and multi-criteria plan quality, Heuristics for planning with penalties and rewards formulated in logic and computed through circuits, A competitive and cooperative approach to propositional satisfiability, Conformant planning as a case study of incremental QBF solving, Planning as satisfiability: heuristics, Efficiently deciding equivalence for standard primitives and phases, State-variable planning under structural restrictions: algorithms and complexity, EXPERIENCES WITH PLANNING FOR NATURAL LANGUAGE GENERATION, Domain-Independent Cost-Optimal Planning in ASP, Agent planning programs, Width-based search for multi agent privacy-preserving planning, Planning in domains with derived predicates through rule-action graphs and local search, Experimental evaluation of pheromone models in ACOPlan, Unnamed Item, A cost-effective planning graph approach for large-scale Web Service Composition, Unnamed Item, On the complexity of planning for agent teams and its implications for single agent planning, 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, Strong planning under partial observability, Constraint partitioning in penalty formulations for solving temporal planning problems, Processes and continuous change in a SAT-based planner, Using temporal logics to express search control knowledge for planning, Towards efficient universal planning: A randomized approach, State space search nogood learning: online refinement of critical-path dead-end detectors in planning, Star-topology decoupled state space search, New methods for proving the impossibility to solve problems through reduction of problem spaces, Model checking abilities of agents: a closer look, Resource separation in dynamic logic of propositional assignments, Discovering hidden structure in factored MDPs, Planning and acting in partially observable stochastic domains, Modelling and solving English peg solitaire, Evaluating new options in the context of existing plans, Planning as heuristic search, A constraint programming formulation for planning: From plan scheduling to plan generation, Set-structured and cost-sharing heuristics for classical planning, A case study in programming a quantum annealer for hard operational planning problems, Planning and control in artificial intelligence: A unifying perspective, A SAT approach to query optimization in mediator systems, Least commitment in Graphplan, 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, Representing and planning with interacting actions and privacy, Landmark-based approaches for goal recognition as planning, COMPLETENESS AND REALIZABILITY: CONDITIONS FOR AUTOMATIC GENERATION OF WORKFLOWS, Graphplan, Probabilistic Reasoning by SAT Solvers, Remote Agent: to boldly go where no AI system has gone before, The logical foundations of goal-regression planning in autonomous agents, Planning under uncertainty as G<scp>OLOG</scp>programs, Reasoning about actions with imprecise and incomplete state descriptions, On linear logic planning and concurrency, Multi-agent path finding with mutex propagation, CPCES: a planning framework to solve conformant planning problems through a counterexample guided refinement, Gradient-based mixed planning with symbolic and numeric action parameters, MANAGING TEMPORAL CYCLES IN PLANNING PROBLEMS REQUIRING CONCURRENCY, Plan coordination by revision in collective agent based systems., Automated planning as an early verification tool for distributed control, Complexity results for standard benchmark domains in planning, A logic programming approach to knowledge-state planning. II: The DLV\(^\mathcal K\) system, Multiobjective heuristic state-space planning, Contingent planning under uncertainty via stochastic satisfiability, On the hierarchical community structure of practical Boolean formulas

Uses Software

Cites Work