On the public citation graph
On Reasonable and Forced Goal Orderings and their Use in an Agenda-Driven Planning Algorithm
0 signed · 97 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-39963-1_23openalex-snapshot
A Heuristic for Domain Independent Planning and Its Use in an Enforced Hill-Climbing Algorithm
inferredcites →https://doi.org/10.1007/3-540-63912-8_84openalex-snapshot
Encoding planning problems in nonmonotonic logic programs
inferredcites →https://doi.org/10.1007/3-540-63912-8_92openalex-snapshot
Extending planning graphs to an ADL subset
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.1007/978-3-662-09438-9openalex-snapshot
Principles of Artificial Intelligence
inferredcites →https://doi.org/10.1016/0004-3702(74)90026-5openalex-snapshot
Planning in a hierarchy of abstraction spaces
inferredcites →https://doi.org/10.1016/0004-3702(85)90012-8openalex-snapshot
Macro-operators: A weak method for learning
inferredcites →https://doi.org/10.1016/0004-3702(87)90043-9openalex-snapshot
Nonmonotonic logic and temporal projection
inferredcites →https://doi.org/10.1016/0004-3702(87)90051-8openalex-snapshot
Planning as search: A quantitative approach
inferredcites →https://doi.org/10.1016/0004-3702(87)90092-0openalex-snapshot
Planning for conjunctive goals
inferredcites →https://doi.org/10.1016/0004-3702(89)90081-7openalex-snapshot
A theoretical analysis of conjunctive-goal problems
inferredcites →https://doi.org/10.1016/0004-3702(93)90080-uopenalex-snapshot
Acquiring search-control knowledge via static analysis
inferredcites →https://doi.org/10.1016/0004-3702(94)90005-1openalex-snapshot
On the computational complexity of temporal projection, planning, and plan validation
inferredcites →https://doi.org/10.1016/0004-3702(94)90062-0openalex-snapshot
Downward refinement and the efficiency of hierarchical problem solving
inferredcites →https://doi.org/10.1016/0004-3702(94)90081-7openalex-snapshot
The computational complexity of propositional STRIPS planning
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(99)00103-4openalex-snapshot
Towards efficient universal planning: A randomized approach
inferredcites →https://doi.org/10.1613/jair.393openalex-snapshot
Flaw Selection Strategies for Partial-Order Planning
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.21236/ada269772openalex-snapshot
Automatically Generating Abstractions for Planning
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11730095_21openalex-snapshot
Divide-and-Evolve: A New Memetic Scheme for Domain-Independent Temporal Planning
inferred← citeshttps://doi.org/10.1007/11757375_22openalex-snapshot
An Efficient Hybrid Strategy for Temporal Planning
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-3-030-06167-8_10openalex-snapshot
Planning in Artificial Intelligence
inferred← citeshttps://doi.org/10.1007/978-3-031-11321-5_13openalex-snapshot
Towards the Evaluation of Action Reversibility in STRIPS Using Domain Generators
inferred← citeshttps://doi.org/10.1007/978-3-319-10428-7_69openalex-snapshot
Monotone Temporal Planning: Tractability, Extensions and Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-64674-9_8openalex-snapshot
Hierarchical Game Approach to Solve Conflicts in Multiagent Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-24844-6_118openalex-snapshot
Translation STRIPS Planning in Multi-robot Environment to Linear Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-72960-0_9openalex-snapshot
Divide-and-Evolve: a Sequential Hybridization Strategy Using Evolutionary Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-25274-7_19openalex-snapshot
Using the Relaxed Plan Heuristic to Select Goals in Oversubscription Planning Problems
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/s10472-024-09960-8openalex-snapshot
On domain generators for the evaluation of action reversibility in STRIPS
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.1007/s10846-009-9364-4openalex-snapshot
Planning in Multi-agent Environment Using Strips Representation and Non-cooperative Equilibrium Strategy
inferred← citeshttps://doi.org/10.1007/s11227-018-2627-8openalex-snapshot
A new goal ordering for incremental planning
inferred← citeshttps://doi.org/10.1016/j.artint.2008.11.009openalex-snapshot
Learning from planner performance
inferred← citeshttps://doi.org/10.1016/j.artint.2014.12.008openalex-snapshot
Red–black planning: A new systematic approach to partial delete relaxation
inferred← citeshttps://doi.org/10.1016/j.artint.2020.103414openalex-snapshot
Selecting goals in oversubscription planning using relaxed plans
inferred← citeshttps://doi.org/10.1109/icarsc.2015.35openalex-snapshot
Planning with Activity Schemata: Closing the Loop in Experience-Based Planning
inferred← citeshttps://doi.org/10.1109/icmlc.2005.1527113openalex-snapshot
Most required goals for extracting heuristics in planning
inferred← citeshttps://doi.org/10.1109/icmlc.2007.4370677openalex-snapshot
Combine Incremental Planning, Reasonable Ordering, External Information and Soft Goals Handling
inferred← citeshttps://doi.org/10.1109/ictai.2005.118openalex-snapshot
Subgoal ordering and granularity control for incremental planning
inferred← citeshttps://doi.org/10.1109/ictai.2011.20openalex-snapshot
Using a Goal-Agenda and Committed Actions in Real-Time Planning
inferred← citeshttps://doi.org/10.1109/wcica.2006.1712840openalex-snapshot
Extracting State-marks in Planning
inferred← citeshttps://doi.org/10.1111/coin.12019openalex-snapshot
Planning with Multistep Forward Search with Forced Goal‐Ordering Constraints
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/s0218213007003515openalex-snapshot
SUBGOAL ORDERING AND GRANULARITY CONTROL FOR INCREMENTAL PLANNING
inferred← citeshttps://doi.org/10.1145/3229147.3229161openalex-snapshot
Automatic generation of geological stories from a single sketch
inferred← citeshttps://doi.org/10.1155/2013/963874openalex-snapshot
Heuristic Search for Planning with Different Forced Goal‐Ordering Constraints
inferred← citeshttps://doi.org/10.11606/t.3.2003.tde-28042003-164450openalex-snapshot
Desenvolvimento e implementação de um sistema de planejamento baseado em casos.
inferred← citeshttps://doi.org/10.1609/aaai.v25i1.8004openalex-snapshot
A Novel Technique for Avoiding Plateaus of Greedy Best-First Search in Satisficing Planning
inferred← citeshttps://doi.org/10.1609/aaai.v27i1.8644openalex-snapshot
Red-Black Relaxed Plan Heuristics
inferred← citeshttps://doi.org/10.1609/aimag.v34i3.2387openalex-snapshot
Online Reconfigurable Machines
inferred← citeshttps://doi.org/10.1609/icaps.v19i1.13342openalex-snapshot
Enhancing the Context-Enhanced Additive Heuristic with Precedence Constraints
inferred← citeshttps://doi.org/10.1609/icaps.v19i1.13376openalex-snapshot
Inference and Decomposition in Planning Using Causal Consistent Chains
inferred← citeshttps://doi.org/10.1609/icaps.v20i1.13429openalex-snapshot
Waking Up a Sleeping Rabbit: On Natural-Language Sentence Generation with FF
inferred← citeshttps://doi.org/10.1609/icaps.v21i1.13470openalex-snapshot
Searching for Plans with Carefully Designed Probes
inferred← citeshttps://doi.org/10.1609/icaps.v24i1.13618openalex-snapshot
Spatially Distributed Multiagent Path Planning
inferred← citeshttps://doi.org/10.1609/icaps.v26i1.13751openalex-snapshot
Practical Undoability Checking via Contingent Planning
inferred← citeshttps://doi.org/10.1609/icaps.v34i1.31496openalex-snapshot
Weak and Strong Reversibility of Non-deterministic Actions: Universality and Uniformity
inferred← citeshttps://doi.org/10.1609/socs.v12i1.18597openalex-snapshot
Landmark Heuristics for Lifted Planning - Extended Abstract
inferred← citeshttps://doi.org/10.1609/socs.v2i1.18208openalex-snapshot
A Novel Technique for Avoiding Plateaus of Greedy Best-First Search in Satisficing Planning
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.1146openalex-snapshot
Structure and Complexity in Planning with Unary Operators
inferred← citeshttps://doi.org/10.1613/jair.1302openalex-snapshot
Taming Numbers and Durations in the Model Checking Integrated Planning System
inferred← citeshttps://doi.org/10.1613/jair.1701openalex-snapshot
Engineering a Conformant Probabilistic 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.1613/jair.1918openalex-snapshot
Temporal Planning using Subgoal Partitioning and Resolution in SGPlan
inferred← citeshttps://doi.org/10.1613/jair.2817openalex-snapshot
Friends or Foes? On Planning as Satisfiability and Abstract CNF Encodings
inferred← citeshttps://doi.org/10.1613/jair.2972openalex-snapshot
The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks
inferred← citeshttps://doi.org/10.1613/jair.3184openalex-snapshot
On-line Planning and Scheduling: An Application to Controlling Modular Printers
inferred← citeshttps://doi.org/10.1613/jair.4358openalex-snapshot
Monotone Temporal Planning: Tractability, Extensions and Applications
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.18725/oparu-1765openalex-snapshot
Hierarchical landmarks - a means to reduce search effort in hybrid planning
inferred← citeshttps://doi.org/10.2478/v10170-010-0042-3openalex-snapshot
On transformation of STRIPS planning to linear programming
inferred← citeshttps://doi.org/10.25904/1912/1867openalex-snapshot
Landmark-Based Heuristics and Search Control for Automated Planning
inferred← citeshttps://doi.org/10.3182/20070723-3-pl-2917.00057openalex-snapshot
ON TRANSFORMATION OF STRIPS PLANNING PROBLEM
inferred← citeshttps://doi.org/10.3233/978-1-61499-098-7-312openalex-snapshot
Preferring Properly: Increasing Coverage while Maintaining Quality in Anytime Temporal Planning
inferred← citeshttps://doi.org/10.3233/aic-150658openalex-snapshot
Using random sampling trees for automated planning
inferred← citeshttps://doi.org/10.3233/aic-2010-0473openalex-snapshot
A weighted CSP approach to 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.ch004openalex-snapshot
Plan Optimization by Plan Rewriting
inferred← citeshttps://doi.org/10.4304/jsw.7.9.2099-2106openalex-snapshot
A Survey of Heuristics for Domain-Independent Planning
inferred← citeshttps://doi.org/10.5121/csit.2013.3823openalex-snapshot
Planning Based on Classification by Induction Graph
inferred← citeshttps://doi.org/10.5555/777092.777170openalex-snapshot
A logical measure of progress for planning
inferred← citeshttps://doi.org/10.70675/55a0f550z00caz491azb904z896689f3507bopenalex-snapshot
Manipulation planning for documented objects
inferred← citeshttps://doi.org/10.7936/k7q23x9sopenalex-snapshot
Efficient Automated Planning with New Formulations
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.