Fast planning through planning graph analysis

1997/02/01 by Avrim L. Blum, Avrim Blum, Merrick L. Furst · 1,557 citations
Computer Science · Mathematics · #AI-based Problem Solving and Planning #Artificial intelligence #Automated planning and scheduling #Combinatorics #Computer science #Constraint Satisfaction and Optimization #Graph #Graph theory #Logic, Reasoning, and Knowledge #Mathematical optimization #Mathematics #Order (exchange) #Perspective (graphical) #Plan (archaeology) #Planner #Theoretical computer science

paper · pdf · doi:10.1016/s0004-3702(96)00047-1

published in Artificial Intelligence 90(1-2), 281-300 (Elsevier BV)

openalex publication_date 1997/02/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/31

Cited by

• Planning and acting in partially observable stochastic domains
• Defeasible Reasoning in OSCAR
• Compilation-based Solvers for Multi-Agent Path Finding: a Survey, Discussion, and Future Opportunities
• SymStep: Symbolic Step Verification for Logical Reasoning
• Goal Recognition over Imperfect Domain Models
• Extracting Lifted Mutual Exclusion Invariants from Temporal Planning Domains
• Automated Penetration Testing with LLM Agents and Classical Planning
• End-to-end PDDL Planning with Hardcoded and Dynamic Agents
• Brainstorm/J: a Java Framework for Intelligent Agents
• Dynamic Epistemic Logic with ASP Updates: Application to Conditional Planning
• Reasoning and Planning with Sensing Actions, Incomplete Information, and Static Causal Laws using Answer Set Programming
• Planning with Preferences using Logic Programming
• Practical Reasoning with Norms for Autonomous Software Agents (Full Edition)
• How can we assess human-agent interactions? Case studies in software agent design
• Learning Discrete Abstractions for Visual Rearrangement Tasks Using Vision-Guided Graph Coloring
• Inspire or Predict? Exploring New Paradigms in Assisting Classical Planners with Large Language Models
• Timeline-based planning: Expressiveness and Complexity
• Augmenting Von Neumann's Architecture for an Intelligent Future
• Survey of Graph Analysis Applications
• Game-theoretic Approach for Non-Cooperative Planning
• Handling PDDL3.0 State Trajectory Constraints with Temporal Landmarks
• Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
• Mean-based Heuristic Search for Real-Time Planning
• Extracting Actionability from Machine Learning Models by Sub-optimal Deterministic Planning
• Cost Based Satisficing Search Considered Harmful
• Heuristic Approaches for Goal Recognition in Incomplete Domain Models
• Attack Planning in the Real World
• A Near-Term Quantum Computing Approach for Hard Computational Problems in Space Exploration
• Make Planning Research Rigorous Again!
• SyDeBO: Symbolic-Decision-Embedded Bilevel Optimization for Long-Horizon Manipulation in Dynamic Environments
• Hunger and Market Dynamics in Pre-Modern Communities: Insights into the Effects of Market Intervention from a Multi-Agent Model
• An Empirical Study of the Effects of Spurious Transitions on Abstraction-based Heuristics
• AI Planning Framework for LLM-Based Web Agents
• Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning
• A flexible coupling approach to multi-agent planning under incomplete information
• The brain's connective core and its role in animal cognition. [europepmc]
• Multipotent Systems: Combining Planning, Self-Organization, and Reconfiguration in Modular Robot Ensembles. [europepmc]
• Data structure set-trie for storing and querying sets: Theoretical and empirical analysis. [europepmc]