On the public citation graph
The GRT Planning System: Backward Heuristic Construction in Forward State-Space Planning
0 signed · 45 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/10720246_27openalex-snapshot
GRT: A Domain Independent Heuristic for STRIPS Worlds Based on Greedy Regression Tables
inferredcites →https://doi.org/10.1007/3-540-63912-8_97openalex-snapshot
Ignoring irrelevant facts and operators in plan generation
inferredcites →https://doi.org/10.1016/0004-3702(71)90010-5openalex-snapshot
Strips: A new approach to the application of theorem proving to problem solving
inferredcites →https://doi.org/10.1016/0004-3702(92)90028-vopenalex-snapshot
On the complexity of blocks-world planning
inferredcites →https://doi.org/10.1016/s0004-3702(01)00108-4openalex-snapshot
Planning as heuristic search
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(97)00034-9openalex-snapshot
Engineering and compiling planning domain models to promote validity and efficiency
inferredcites →https://doi.org/10.1016/s0004-3702(97)00035-0openalex-snapshot
An event driven integration reasoning scheme for handling dynamic threats in an unstructured environment
inferredcites →https://doi.org/10.1016/s0004-3702(99)00010-7openalex-snapshot
Using regression-match graphs to control search in planning
inferredcites →https://doi.org/10.1016/s0898-1221(00)90185-8openalex-snapshot
State-space search: Algorithms, complexity, extensions, and applications
inferredcites →https://doi.org/10.1109/iciis.1999.810279openalex-snapshot
On determining and completing incomplete states in STRIPS domains
inferredcites →https://doi.org/10.1613/jair.544openalex-snapshot
The Automatic Inference of State Invariants in TIM
inferredcites →https://doi.org/10.1613/jair.570openalex-snapshot
Efficient Implementation of the Plan Graph in STAN
inferredcites →https://doi.org/10.1613/jair.64openalex-snapshot
Total-Order and Partial-Order Planning: A Comparative Analysis
inferredcites →https://doi.org/10.1613/jair.715openalex-snapshot
On Reasonable and Forced Goal Orderings and their Use in an Agenda-Driven Planning Algorithm
inferredcites →https://doi.org/10.1613/jair.855openalex-snapshot
The FF Planning System: Fast Plan Generation Through Heuristic Search
inferredcites →https://doi.org/10.21236/ada303260openalex-snapshot
Fast Planning Through Planning Graph Analysis.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
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-4020-6268-1_87openalex-snapshot
Coordination, Cooperation and Conflict Resolution in Multi-Agent Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-30498-2_12openalex-snapshot
Handling Numeric Criteria in Relaxed Planning Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-85776-1_23openalex-snapshot
Heuristic Hill-Climbing as a Markov Process
inferred← citeshttps://doi.org/10.1007/978-3-540-89985-3_119openalex-snapshot
Directing the Search in the Fast Forward Planning
inferred← citeshttps://doi.org/10.1007/s10472-009-9170-5openalex-snapshot
Set-structured and cost-sharing heuristics for classical planning
inferred← citeshttps://doi.org/10.1007/s10489-007-0083-xopenalex-snapshot
Planning in highly dynamic environments: an anytime approach for planning under time constraints
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/s0004-3702(02)00371-5openalex-snapshot
Multiobjective heuristic state-space planning
inferred← citeshttps://doi.org/10.1080/0952813x.2010.503341openalex-snapshot
On the importance of breaking ties in the relaxed plan heuristic
inferred← citeshttps://doi.org/10.1088/1742-6596/1533/3/032020openalex-snapshot
Urban Planning Reform Trend Based on Artificial Intelligence
inferred← citeshttps://doi.org/10.1360/jos181328openalex-snapshot
Research on Relations of Effect of Action for STRIPS Domain
inferred← citeshttps://doi.org/10.1609/icaps.v20i1.13406openalex-snapshot
Using Backwards Generated Goals for Heuristic Planning
inferred← citeshttps://doi.org/10.1613/jair.1136openalex-snapshot
VHPOP: Versatile Heuristic Partial Order Planner
inferred← citeshttps://doi.org/10.1613/jair.1144openalex-snapshot
The Metric-FF Planning System: Translating ``Ignoring Delete Lists'' to Numeric State Variables
inferred← citeshttps://doi.org/10.1613/jair.1156openalex-snapshot
SAPA: A Multi-objective Metric Temporal Planner
inferred← citeshttps://doi.org/10.1613/jair.1747openalex-snapshot
Where 'Ignoring Delete Lists' Works: Local Search Topology in Planning Benchmarks
inferred← citeshttps://doi.org/10.3233/aic-2011-0504openalex-snapshot
Implicit abstraction heuristics for cost-optimal planning
inferred← citeshttps://doi.org/10.32920/ryerson.14647755openalex-snapshot
Efficient Lifted Planning with Regression-Based Heuristics
inferred← citeshttps://doi.org/10.32920/ryerson.14647755.v1openalex-snapshot
Efficient Lifted Planning with Regression-Based Heuristics
inferred← citeshttps://doi.org/10.4018/978-1-59140-450-7.ch003openalex-snapshot
Machine Learning for Adaptive Planning
inferred← citeshttps://doi.org/10.5555/777092.777168openalex-snapshot
Speeding up the calculation of heuristics for heuristic search-based planning
inferred← citeshttps://doi.org/10.5772/6315openalex-snapshot
Extending AI Planning to Solve more Realistic Problems
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.