On the public citation graph

The 2023 International Planning Competition

0 signed · 74 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-540-46573-7openalex-snapshot
Fundamentals of Airplane Flight Mechanics
inferredcites →https://doi.org/10.1007/978-3-642-25566-3_40openalex-snapshot
Sequential Model-Based Optimization for General Algorithm Configuration
inferredcites →https://doi.org/10.1007/s10994-011-5234-yopenalex-snapshot
The first learning track of the international planning competition
inferredcites →https://doi.org/10.1016/j.artint.2008.11.003openalex-snapshot
Practical solution techniques for first-order MDPs
inferredcites →https://doi.org/10.1017/s1471068419000061openalex-snapshot
The Seventh Answer Set Programming Competition: Design and Results
inferredcites →https://doi.org/10.1093/jigpal/jzz026openalex-snapshot
Relaxing non-interference requirements in parallel plans
inferredcites →https://doi.org/10.1109/iccad57390.2023.10323924openalex-snapshot
Optimal Layout Synthesis for Quantum Circuits as Classical Planning
inferredcites →https://doi.org/10.1145/3400302.3415620openalex-snapshot
Optimal layout synthesis for quantum computing
inferredcites →https://doi.org/10.1201/9780429187490openalex-snapshot
complexity, logic, and recursion theory
inferredcites →https://doi.org/10.1371/journal.pone.0177459openalex-snapshot
Singularity: Scientific containers for mobility of compute
inferredcites →https://doi.org/10.1609/aaai.v32i1.12082openalex-snapshot
Linear and Integer Programming-Based Heuristics for Cost-Optimal Numeric Planning
inferredcites →https://doi.org/10.1609/aaai.v33i01.33017530openalex-snapshot
Deep Reactive Policies for Planning in Stochastic Nonlinear Domains
inferredcites →https://doi.org/10.1609/aaai.v33i01.33017602openalex-snapshot
Learning How to Ground a Plan – Partial Grounding in Classical Planning
inferredcites →https://doi.org/10.1609/aaai.v34i06.6529openalex-snapshot
On Succinct Groundings of HTN Planning Problems
inferredcites →https://doi.org/10.1609/aaai.v34i06.6542openalex-snapshot
HDDL: An Extension to PDDL for Expressing Hierarchical Planning Problems
inferredcites →https://doi.org/10.1609/aaai.v35i13.17396openalex-snapshot
Symbolic Search for Optimal Total-Order HTN Planning
inferredcites →https://doi.org/10.1609/aaai.v36i9.21203openalex-snapshot
Making Translations to Classical Planning Competitive with Other HTN Planners
inferredcites →https://doi.org/10.1609/aimag.v21i2.1506openalex-snapshot
The 1998 AI Planning Systems Competition
inferredcites →https://doi.org/10.1609/aimag.v33i1.2392openalex-snapshot
A Survey of the Seventh International Planning Competition
inferredcites →https://doi.org/10.1609/aimag.v35i4.2556openalex-snapshot
Multirobot Coordination for Space Exploration
inferredcites →https://doi.org/10.1609/aimag.v36i3.2571openalex-snapshot
The 2014 International Planning Competition: Progress and Trends
inferredcites →https://doi.org/10.1609/icaps.v25i1.13700openalex-snapshot
Mixed-Initiative Planning and Execution for Multiple Drones in Search and Rescue Missions
inferredcites →https://doi.org/10.1609/icaps.v25i1.13721openalex-snapshot
Tight Bounds for HTN Planning
inferredcites →https://doi.org/10.1609/icaps.v26i1.13765openalex-snapshot
Bound to Plan: Exploiting Classical Heuristics via Automatic Translations of Tail-Recursive HTN Problems
inferredcites →https://doi.org/10.1609/icaps.v31i1.15943openalex-snapshot
Block Compression and Invariant Pruning for SAT-based Totally-Ordered HTN Planning
inferredcites →https://doi.org/10.1609/icaps.v31i1.15958openalex-snapshot
Translating Totally Ordered HTN Planning Problems to Classical Planning Problems Using Regular Approximation of Context-Free Languages
inferredcites →https://doi.org/10.1609/icaps.v31i1.15959openalex-snapshot
Loop Detection in the PANDA Planning System
inferredcites →https://doi.org/10.1609/socs.v15i1.21765openalex-snapshot
Scaling-Up Generalized Planning as Heuristic Search with Landmarks
inferredcites →https://doi.org/10.1609/socs.v16i1.27294openalex-snapshot
Novelty and Lifted Helpful Actions in Generalized Planning
inferredcites →https://doi.org/10.1613/jair.1.11633openalex-snapshot
ASNets: Deep Learning for Generalised Planning
inferredcites →https://doi.org/10.1613/jair.1.11875openalex-snapshot
Subgoaling Techniques for Satisficing and Optimal Numeric Planning
inferredcites →https://doi.org/10.1613/jair.1.12520openalex-snapshot
Lilotane: A Lifted SAT-based Approach to Hierarchical Planning
inferredcites →https://doi.org/10.1613/jair.1.14034openalex-snapshot
The LM-Cut Heuristic Family for Optimal Numeric Planning with Simple Conditions
inferredcites →https://doi.org/10.1613/jair.1240openalex-snapshot
The 3rd International Planning Competition: Results and Analysis
inferredcites →https://doi.org/10.1613/jair.1880openalex-snapshot
The First Probabilistic Track of the International Planning Competition
inferredcites →https://doi.org/10.1613/jair.2972openalex-snapshot
The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks
inferredcites →https://doi.org/10.1613/jair.601openalex-snapshot
The Good Old Davis-Putnam Procedure Helps Counting Models
inferredcites →https://doi.org/10.24963/ijcai.2017/612openalex-snapshot
Landmarks for Numeric Planning Problems
inferredcites →https://doi.org/10.24963/ijcai.2019/857openalex-snapshot
On Guiding Search in HTN Planning with Classical Planning Heuristics
inferredcites →https://doi.org/10.24963/ijcai.2019/875openalex-snapshot
A Survey on Hierarchical Planning – One Abstract Idea, Many Concrete Realizations
inferredcites →https://doi.org/10.24963/ijcai.2020/571openalex-snapshot
Optimal Planning Modulo Theories
inferredcites →https://doi.org/10.24963/ijcai.2023/591openalex-snapshot
DiSProD: Differentiable Symbolic Propagation of Distributions for Planning
inferredcites →https://doi.org/10.24963/ijcai.2023/593openalex-snapshot
On the Compilability of Bounded Numeric Planning
inferredcites →https://doi.org/10.24963/kr.2022/49openalex-snapshot
Learning Generalized Policies without Supervision Using GNNs
inferredcites →https://doi.org/10.24963/kr.2023/21openalex-snapshot
Learning Hierarchical Policies by Iteratively Reducing the Width of Sketch Rules
inferredcites →https://doi.org/10.3233/aic-180604openalex-snapshot
Alice in DIY wonderland or: Instructing novice users on how to use tools in DIY projects
inferredcites →https://doi.org/10.3233/sat-220001openalex-snapshot
OMTPlan: A Tool for Optimal Planning Modulo Theories
inferredcites →https://doi.org/10.48550/arxiv.1202.3762openalex-snapshot
Symbolic Dynamic Programming for Discrete and Continuous State MDPs
inferredcites →https://doi.org/10.48550/arxiv.2008.00104openalex-snapshot
Optimizing Long-term Social Welfare in Recommender Systems: A Constrained Matching Approach

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4656069openalex-extracted
inferred← citeshttps://doi.org/10.1007/978-3-030-69128-8openalex-snapshot
Reflections on Artificial Intelligence for Humanity
inferred← citeshttps://doi.org/10.1007/978-981-96-7749-8_37openalex-snapshot
Leveraging AI Planning Models for the Water Management of the Red River Basin in Vietnam
inferred← citeshttps://doi.org/10.1007/s00170-026-19253-5openalex-snapshot
Dynamic machine-level planning for Plug & Produce manufacturing
inferred← citeshttps://doi.org/10.1016/b978-155860856-6/50038-7openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/j.artint.2015.05.005openalex-snapshot
Automatic construction of optimal static sequential portfolios for AI planning and beyond
inferred← citeshttps://doi.org/10.1016/j.eswa.2023.122820openalex-snapshot
A hybrid approach for expressive numeric and temporal planning with control parameters
inferred← citeshttps://doi.org/10.1016/j.softx.2024.102012openalex-snapshot
Unified Planning: Modeling, manipulating and solving AI planning problems in Python
inferred← citeshttps://doi.org/10.1109/aim65483.2026.11657905openalex-snapshot
On the Generalization Gap in LLM Planning: Tests and Verifier-Reward RL
inferred← citeshttps://doi.org/10.1109/iat.2003.1241075openalex-snapshot
A resource based framework for planning and replanning
inferred← citeshttps://doi.org/10.1109/icseng.2005.33openalex-snapshot
Decision-Making in an Energy System: A Knowledge-Based Solution
inferred← citeshttps://doi.org/10.1109/ictai59109.2023.00144openalex-snapshot
Efficient HTN to STRIPS Encodings for Concurrent Planning
inferred← citeshttps://doi.org/10.1109/ictai66417.2025.00133openalex-snapshot
Exploiting Macro-Actions in Learning GPT-Based General Planning Policies
inferred← citeshttps://doi.org/10.1109/tase.2025.3586549openalex-snapshot
Automating Transfer of Robot Task Plans Using Functorial Data Migrations
inferred← citeshttps://doi.org/10.1109/tg.2025.3566891openalex-snapshot
AutoGT: Automatic Generation of Game Trees for Algorithm Benchmarking
inferred← citeshttps://doi.org/10.1145/2790449.2790521openalex-snapshot
On modeling planning problems in tabled logic programming
inferred← citeshttps://doi.org/10.1145/3770854.3785692openalex-snapshot
REALM-Bench: A Benchmark for Evaluating Multi-Agent Systems on Real-world, Dynamic Planning and Scheduling Tasks
inferred← citeshttps://doi.org/10.1609/aaai.v26i1.8331openalex-snapshot
Construction of New Medicines via Game Proof Search
inferred← citeshttps://doi.org/10.1609/aaai.v29i1.9349openalex-snapshot
BDDs Strike Back (in AI Planning)
inferred← citeshttps://doi.org/10.1609/icaps.v34i1.31480openalex-snapshot
JaxPlan and GurobiPlan: Optimization Baselines for Replanning in Discrete and Mixed Discrete-Continuous Probabilistic Domains
inferred← citeshttps://doi.org/10.1609/socs.v3i1.18242openalex-snapshot
Better Parameter-Free Anytime Search by Minimizing Time Between Solutions
inferred← citeshttps://doi.org/10.1613/jair.1.11567openalex-snapshot
Using Machine Learning for Decreasing State Uncertainty in Planning
inferred← citeshttps://doi.org/10.1613/jair.1701openalex-snapshot
Engineering a Conformant Probabilistic Planner
inferred← citeshttps://doi.org/10.1613/jair.5373openalex-snapshot
The Sixth Answer Set Programming Competition
inferred← citeshttps://doi.org/10.3233/faia241000openalex-snapshot
A Lazy Approach to Neural Numerical Planning with Control Parameters
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.