On the public citation graph
Exploiting Competitive Planner Performance
0 signed · 55 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/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(75)90002-8openalex-snapshot
Optimal problem-solving search: All-or-none solutions
inferredcites →https://doi.org/10.1016/s0004-3702(96)00047-1openalex-snapshot
Fast planning through planning graph analysis
inferredcites →https://doi.org/10.1023/a:1008607721339openalex-snapshot
Test Case Generation as an AI Planning Problem
inferredcites →https://doi.org/10.1080/09528139508953801openalex-snapshot
Integrating planning and learning: the PRODIGY architecture
inferredcites →https://doi.org/10.1613/jair.544openalex-snapshot
The Automatic Inference of State Invariants in TIM
inferredcites →https://doi.org/10.21236/ada327284openalex-snapshot
Statistical Selection Among Problem-Solving Methods.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-032-10486-1_25openalex-snapshot
Efficient Goal Selection in Automated Planning: A Case Study on Tourist Route Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-49956-7_28openalex-snapshot
Hardware-Specific Selection the Most Fast-Running Software Components
inferred← citeshttps://doi.org/10.1007/978-3-319-50137-6_7openalex-snapshot
Algorithm Selection for Combinatorial Search Problems: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-642-35455-7_6openalex-snapshot
A Guide to Portfolio-Based Planning
inferred← citeshttps://doi.org/10.1007/978-3-642-44973-4_40openalex-snapshot
Identifying Key Algorithm Parameters and Instance Features Using Forward Selection
inferred← citeshttps://doi.org/10.1016/j.artint.2007.11.004openalex-snapshot
Proof planning with multiple strategies
inferred← citeshttps://doi.org/10.1016/j.artint.2008.11.009openalex-snapshot
Learning from planner performance
inferred← citeshttps://doi.org/10.1016/j.artint.2013.10.003openalex-snapshot
Algorithm runtime prediction: Methods & evaluation
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.artint.2016.04.003openalex-snapshot
ASlib: A benchmark library for algorithm selection
inferred← citeshttps://doi.org/10.1016/j.ins.2015.05.010openalex-snapshot
Algorithm selection for black-box continuous optimization problems: A survey on methods and challenges
inferred← citeshttps://doi.org/10.1017/s026988891200001xopenalex-snapshot
A review of machine learning for automated planning
inferred← citeshttps://doi.org/10.1023/a:1021686406575openalex-snapshot
AI Planner Assisted Test Generation
inferred← citeshttps://doi.org/10.1080/09528130410001724797openalex-snapshot
Automatic evaluation and selection of problem-solving methods: theory and experiments
inferred← citeshttps://doi.org/10.1080/0952813x.2021.1970239openalex-snapshot
Improving Domain-Independent Heuristic State-Space Planning via plan cost predictions
inferred← citeshttps://doi.org/10.1109/24.855534openalex-snapshot
Generating test-cases from an object-oriented model with an artifical-intelligence planning system
inferred← citeshttps://doi.org/10.1109/cmpsac.1999.812687openalex-snapshot
Generating goal-oriented test cases
inferred← citeshttps://doi.org/10.1109/ictai.2013.12openalex-snapshot
An Automatic Algorithm Selection Approach for Planning
inferred← citeshttps://doi.org/10.1111/coin.12211openalex-snapshot
On the predictability of domain‐independent temporal planners
inferred← citeshttps://doi.org/10.1145/3358960.3379127openalex-snapshot
Transferring Pareto Frontiers across Heterogeneous Hardware Environments
inferred← citeshttps://doi.org/10.1162/evco_a_00242openalex-snapshot
Automated Algorithm Selection: Survey and Perspectives
inferred← citeshttps://doi.org/10.1287/ijoc.2017.0798openalex-snapshot
What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO
inferred← citeshttps://doi.org/10.14393/ufu.di.2014.327openalex-snapshot
Aplicando técnicas de aprendizado de máquina em planejamento
inferred← citeshttps://doi.org/10.1609/aaai.v34i04.5949openalex-snapshot
Online Planner Selection with Graph Neural Networks and Adaptive Scheduling
inferred← citeshttps://doi.org/10.1609/aaai.v36i9.21209openalex-snapshot
Explainable Planner Selection for Classical Planning
inferred← citeshttps://doi.org/10.1609/icaps.v19i1.13386openalex-snapshot
An Automatically Configurable Portfolio-based Planner with Macro-actions: PbP
inferred← citeshttps://doi.org/10.1609/icaps.v22i1.13538openalex-snapshot
Learning Portfolios of Automatically Tuned Planners
inferred← citeshttps://doi.org/10.1609/icaps.v24i1.13680openalex-snapshot
Improved Features for Runtime Prediction of Domain-Independent Planners
inferred← citeshttps://doi.org/10.1609/icaps.v25i1.13715openalex-snapshot
Identifying and Exploiting Features for Effective Plan Retrieval in Case-Based Planning
inferred← citeshttps://doi.org/10.1609/icaps.v29i1.3531openalex-snapshot
Learning Classical Planning Strategies with Policy Gradient
inferred← citeshttps://doi.org/10.1609/icaps.v30i1.6753openalex-snapshot
Generating and Exploiting Cost Predictions in Heuristic State-Space Planning
inferred← citeshttps://doi.org/10.1613/jair.1136openalex-snapshot
VHPOP: Versatile Heuristic Partial Order Planner
inferred← citeshttps://doi.org/10.1613/jair.4359openalex-snapshot
Planning through Automatic Portfolio Configuration: The PbP Approach
inferred← citeshttps://doi.org/10.1613/jair.5080openalex-snapshot
The IBaCoP Planning System: Instance-Based Configured Portfolios
inferred← citeshttps://doi.org/10.1613/jair.935openalex-snapshot
A Critical Assessment of Benchmark Comparison in Planning
inferred← citeshttps://doi.org/10.24963/ijcai.2017/602openalex-snapshot
Beyond Forks: Finding and Ranking Star Factorings for Decoupled Search
inferred← citeshttps://doi.org/10.3233/aic-150671openalex-snapshot
Portfolio-based planning: State of the art, common practice and open challenges
inferred← citeshttps://doi.org/10.3233/fi-2016-1447openalex-snapshot
Identifying and Exploiting Features for Effective Plan Retrieval in Case-Based Planning
inferred← citeshttps://doi.org/10.4018/978-1-59140-450-7.ch003openalex-snapshot
Machine Learning for Adaptive Planning
inferred← citeshttps://doi.org/10.48550/arxiv.1210.7959openalex-snapshot
Algorithm Selection for Combinatorial Search Problems: A Survey
inferred← citeshttps://doi.org/10.48550/arxiv.1211.0906openalex-snapshot
Algorithm Runtime Prediction: Methods & Evaluation
inferred← citeshttps://doi.org/10.48550/arxiv.1311.4319openalex-snapshot
Ranking Algorithms by Performance
inferred← citeshttps://doi.org/10.48550/arxiv.1506.02465openalex-snapshot
ASlib: A Benchmark Library for Algorithm Selection
inferred← citeshttps://doi.org/10.48550/arxiv.1811.00210openalex-snapshot
Online Planner Selection with Graph Neural Networks and Adaptive Scheduling
inferred← citeshttps://doi.org/10.48550/arxiv.1811.11597openalex-snapshot
Automated Algorithm Selection: Survey and Perspectives
inferred← citeshttps://doi.org/10.7166/34-3-2945openalex-snapshot
FITNESS LANDSCAPE MEASURES FOR ANALYSING THE TOPOLOGY OF THE FEASIBLE REGION OF AN OPTIMISATION PROBLEM
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.