On the public citation graph
Efficient Implementation of the Plan Graph in STAN
0 signed · 71 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-63912-8_92openalex-snapshot
Extending planning graphs to an ADL subset
inferredcites →https://doi.org/10.1016/s0004-3702(96)00047-1openalex-snapshot
Fast planning through planning graph analysis
inferredcites →https://doi.org/10.1016/s0004-3702(98)00087-3openalex-snapshot
On the relations between intelligent backtracking and failure-driven explanation-based learning in constraint satisfaction and planning
inferredcites →https://doi.org/10.1613/jair.544openalex-snapshot
The Automatic Inference of State Invariants in TIM
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/10720246_11openalex-snapshot
Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length
inferred← citeshttps://doi.org/10.1007/10720246_28openalex-snapshot
Planning as Heuristic Search: New Results
inferred← citeshttps://doi.org/10.1007/3-540-39963-1_23openalex-snapshot
A Heuristic for Domain Independent Planning and Its Use in an Enforced Hill-Climbing Algorithm
inferred← citeshttps://doi.org/10.1007/3-540-45329-6_40openalex-snapshot
STeLLa: An Optimal Sequential and Parallel Planner
inferred← citeshttps://doi.org/10.1007/3-540-46148-5_7openalex-snapshot
A Heuristic for Planning Based on Action Evaluation
inferred← citeshttps://doi.org/10.1007/978-1-4615-1567-8_9openalex-snapshot
Functional Strips: A More Flexible Language for Planning and Problem Solving
inferred← citeshttps://doi.org/10.1007/978-3-030-06167-8_10openalex-snapshot
Planning in Artificial Intelligence
inferred← citeshttps://doi.org/10.1007/978-3-540-30133-2_2openalex-snapshot
FHP: Functional Heuristic Planning
inferred← citeshttps://doi.org/10.1007/978-3-540-39853-0_28openalex-snapshot
Planning with Fuzzy Resources
inferred← citeshttps://doi.org/10.1007/978-3-540-71209-1_37openalex-snapshot
Planned and Traversable Play-Out: A Flexible Method for Executing Scenario-Based Programs,
inferred← citeshttps://doi.org/10.1007/978-3-540-73580-9_17openalex-snapshot
A Meta-CSP Model for Optimal Planning
inferred← citeshttps://doi.org/10.1007/978-3-540-74930-1_22openalex-snapshot
APP: Agent Planning Package
inferred← citeshttps://doi.org/10.1007/978-3-540-88833-8_1openalex-snapshot
Plan-Coordination Mechanisms and the Price of Autonomy
inferred← citeshttps://doi.org/10.1007/978-3-540-89812-2_10openalex-snapshot
A Global Filtration for Satisfying Goals in Mutual Exclusion Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-11198-3_12openalex-snapshot
A PDDL-Based Planning Architecture to Support Arcade Game Playing
inferred← citeshttps://doi.org/10.1007/978-3-642-31665-4_8openalex-snapshot
Planning as Artificial Intelligence Problem - Short Introduction and Overview
inferred← citeshttps://doi.org/10.1007/s10115-018-1202-1openalex-snapshot
Efficient approaches for multi-agent planning
inferred← citeshttps://doi.org/10.1007/s10458-005-6104-4openalex-snapshot
Coordinating Self-interested Planning Agents
inferred← citeshttps://doi.org/10.1007/s10472-011-9240-3openalex-snapshot
Planning in domains with derived predicates through rule-action graphs and local search
inferred← citeshttps://doi.org/10.1016/j.artint.2005.07.001openalex-snapshot
Constraint partitioning in penalty formulations for solving temporal planning problems
inferred← citeshttps://doi.org/10.1016/j.artint.2008.11.009openalex-snapshot
Learning from planner performance
inferred← citeshttps://doi.org/10.1016/j.artint.2009.06.004openalex-snapshot
Weighted A ∗ search – unifying view and application
inferred← citeshttps://doi.org/10.1016/j.artint.2010.12.002openalex-snapshot
State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
inferred← citeshttps://doi.org/10.1016/j.artint.2016.12.002openalex-snapshot
State space search nogood learning: Online refinement of critical-path dead-end detectors in planning
inferred← citeshttps://doi.org/10.1016/j.artint.2018.01.004openalex-snapshot
Extracting mutual exclusion invariants from lifted temporal planning domains
inferred← citeshttps://doi.org/10.1016/j.cor.2005.01.018openalex-snapshot
Modelling and solving English Peg Solitaire
inferred← citeshttps://doi.org/10.1016/s0004-3702(01)00082-0openalex-snapshot
Least commitment in Graphplan
inferred← citeshttps://doi.org/10.1016/s0004-3702(01)00108-4openalex-snapshot
Planning as heuristic search
inferred← citeshttps://doi.org/10.1016/s0004-3702(01)00128-xopenalex-snapshot
Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP
inferred← citeshttps://doi.org/10.1016/s0004-3702(01)00158-8openalex-snapshot
Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search
inferred← citeshttps://doi.org/10.1016/s0004-3702(02)00371-5openalex-snapshot
Multiobjective heuristic state-space planning
inferred← citeshttps://doi.org/10.1016/s0004-3702(02)00375-2openalex-snapshot
SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
inferred← citeshttps://doi.org/10.1016/s0952-1976(01)00014-8openalex-snapshot
Efficient flexible planning via dynamic flexible constraint satisfaction
inferred← citeshttps://doi.org/10.1023/a:1008980403252openalex-snapshot
Towards Focused Plan Monitoring: A Technique and an Application to Mobile Robots
inferred← citeshttps://doi.org/10.1023/a:1025846120461openalex-snapshot
Planning as Propositional CSP: From Walksat to Local Search Techniques for Action Graphs
inferred← citeshttps://doi.org/10.1080/0952813x.2012.660991openalex-snapshot
Computing higher order exclusion relations in propositional planning
inferred← citeshttps://doi.org/10.1080/0952813x.2017.1409278openalex-snapshot
PDDL4J: a planning domain description library for java
inferred← citeshttps://doi.org/10.1109/cira.1999.810023openalex-snapshot
Towards focused plan monitoring: a technique and an application to mobile robots
inferred← citeshttps://doi.org/10.1111/j.1467-8640.2005.00275.xopenalex-snapshot
HYBRID ACE: COMBINING SEARCH DIRECTIONS FOR HEURISTIC PLANNING
inferred← citeshttps://doi.org/10.1142/s0218213004001806openalex-snapshot
SUBGOAL PARTITIONING AND GLOBAL SEARCH FOR SOLVING TEMPORAL PLANNING PROBLEMS IN MIXED SPACE
inferred← citeshttps://doi.org/10.1142/s0218213005002491openalex-snapshot
A VISUALIZATION ENVIRONMENT FOR PLANNING
inferred← citeshttps://doi.org/10.1142/s0218488504003041openalex-snapshot
OAP: AN OBJECT-ORIENTED APPROACH FOR PLANNING MODELING
inferred← citeshttps://doi.org/10.1145/2438653.2438671openalex-snapshot
A conformant planner based on approximation
inferred← citeshttps://doi.org/10.1145/967900.967916openalex-snapshot
Propositional planning in BDI agents
inferred← citeshttps://doi.org/10.1609/aaai.v34i06.6529openalex-snapshot
On Succinct Groundings of HTN Planning Problems
inferred← citeshttps://doi.org/10.1609/aimag.v20i2.1459openalex-snapshot
Recent Advances in AI Planning
inferred← citeshttps://doi.org/10.1609/aimag.v21i4.1536openalex-snapshot
Admissible heuristics for optimal planning
inferred← citeshttps://doi.org/10.1609/aimag.v22i3.1579openalex-snapshot
AltAlt: Combining Graphplan and Heuristic State Search
inferred← citeshttps://doi.org/10.1609/icaps.v22i1.13522openalex-snapshot
Pruning Methods for Optimal Delete-Free Planning
inferred← citeshttps://doi.org/10.1609/icaps.v27i1.13810openalex-snapshot
Symmetry Breaking in Star-Topology Decoupled Search
inferred← citeshttps://doi.org/10.1613/jair.1156openalex-snapshot
SAPA: A Multi-objective Metric Temporal Planner
inferred← citeshttps://doi.org/10.1613/jair.1168openalex-snapshot
AltAltp: Online Parallelization of Plans with Heuristic State Search
inferred← citeshttps://doi.org/10.1613/jair.1183openalex-snapshot
Planning Through Stochastic Local Search and Temporal Action Graphs in LPG
inferred← citeshttps://doi.org/10.1613/jair.1477openalex-snapshot
Using Memory to Transform Search on the Planning Graph
inferred← citeshttps://doi.org/10.1613/jair.1918openalex-snapshot
Temporal Planning using Subgoal Partitioning and Resolution in SGPlan
inferred← citeshttps://doi.org/10.1613/jair.4231openalex-snapshot
Property Directed Reachability for Automated Planning
inferred← citeshttps://doi.org/10.1613/jair.544openalex-snapshot
The Automatic Inference of State Invariants in TIM
inferred← citeshttps://doi.org/10.1613/jair.715openalex-snapshot
On Reasonable and Forced Goal Orderings and their Use in an Agenda-Driven Planning Algorithm
inferred← citeshttps://doi.org/10.1613/jair.855openalex-snapshot
The FF Planning System: Fast Plan Generation Through Heuristic Search
inferred← citeshttps://doi.org/10.1613/jair.893openalex-snapshot
The GRT Planning System: Backward Heuristic Construction in Forward State-Space Planning
inferred← citeshttps://doi.org/10.1613/jair.935openalex-snapshot
A Critical Assessment of Benchmark Comparison in Planning
inferred← citeshttps://doi.org/10.22028/d291-26627openalex-snapshot
Resolution-based methods for linear temporal reasoning
inferred← citeshttps://doi.org/10.24963/ijcai.2017/614openalex-snapshot
Search and Learn: On Dead-End Detectors, the Traps they Set, and Trap Learning
inferred← citeshttps://doi.org/10.4018/978-1-59904-534-4.ch015openalex-snapshot
A Visual Programming Tool for Designing Planning Problems for Semantic Web Service Composition
inferred← citeshttps://doi.org/10.4018/978-1-59904-705-8.ch006openalex-snapshot
Reinforcement Learning and Automated Planning
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.