On the public citation graph
Computational Aspects of Reordering Plans
0 signed · 95 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.1006/jcss.1998.1587openalex-snapshot
Zero Knowledge and the Chromatic Number
inferredcites →https://doi.org/10.1007/3-540-63912-8_88openalex-snapshot
Combining the expressivity of UCPOP with the efficiency of Graphplan
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/bfb0052953openalex-snapshot
Complete determination of parallel actions and temporal optimization in linear plans of action
inferredcites →https://doi.org/10.1016/0004-3702(87)90092-0openalex-snapshot
Planning for conjunctive goals
inferredcites →https://doi.org/10.1016/0004-3702(91)90024-eopenalex-snapshot
O-Plan: The open planning architecture
inferredcites →https://doi.org/10.1016/0004-3702(94)00081-bopenalex-snapshot
Expressive equivalence of planning formalisms
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)90011-6openalex-snapshot
A unified framework for explanation-based generalization of partially ordered and partially instantiated plans
inferredcites →https://doi.org/10.1016/0004-3702(94)90083-3openalex-snapshot
Multi-contributor causal structures for planning: a formalization and evaluation
inferredcites →https://doi.org/10.1016/0890-5401(91)90025-wopenalex-snapshot
Completeness in approximation classes
inferredcites →https://doi.org/10.1016/b978-0-934613-30-9.50006-8openalex-snapshot
FORMULATING MULTIAGENT, DYNAMIC-WORLD PROBLEMS IN THE CLASSICAL PLANNING FRAMEWORK
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)00003-4openalex-snapshot
State-variable planning under structural restrictions: algorithms and complexity
inferredcites →https://doi.org/10.1016/s0954-1810(98)00009-0openalex-snapshot
Efficient planning for a miniature assembly line
inferredcites →https://doi.org/10.1109/ccc.1996.507690openalex-snapshot
Zero knowledge and the chromatic number
inferredcites →https://doi.org/10.1109/sfcs.1995.492573openalex-snapshot
Free bits, PCPs and non-approximability-towards tight results
inferredcites →https://doi.org/10.1109/tpami.1983.4767389openalex-snapshot
Planning in Time: Windows and Durations for Activities and Goals
inferredcites →https://doi.org/10.1145/167088.167172openalex-snapshot
On the hardness of approximating minimization problems
inferredcites →https://doi.org/10.1145/185675.306789openalex-snapshot
On the hardness of approximating minimization problems
inferredcites →https://doi.org/10.1145/237814.237977openalex-snapshot
A threshold of ln n for approximating set cover (preliminary version)
inferredcites →https://doi.org/10.1184/r1/6607754openalex-snapshot
Nonlinear Planning with Parallel Resource Allocation
inferredcites →https://doi.org/10.21236/ada285888openalex-snapshot
Generating Parallel Execution Plans with a Partial Order Planner
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_14openalex-snapshot
Scaling up Planning by Teasing Out Resource Scheduling
inferred← citeshttps://doi.org/10.1007/11837862_42openalex-snapshot
Requirements for Automated Service Composition
inferred← citeshttps://doi.org/10.1007/978-3-031-16078-3_59openalex-snapshot
Plan Deordering with Conditional Effects
inferred← citeshttps://doi.org/10.1007/978-3-540-39853-0_30openalex-snapshot
The Role of Different Solvers in Planning and Scheduling Integration
inferred← citeshttps://doi.org/10.1007/978-3-642-11694-0_6openalex-snapshot
Planning and Failure Detection
inferred← citeshttps://doi.org/10.1007/978-3-642-25116-0_7openalex-snapshot
Proactive Continual Planning –
inferred← citeshttps://doi.org/10.1007/978-3-642-30353-1_41openalex-snapshot
Generalizing and Executing Plans
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/978-3-642-35101-3_68openalex-snapshot
Block-Structured Plan Deordering
inferred← citeshttps://doi.org/10.1007/s10115-018-1202-1openalex-snapshot
Efficient approaches for multi-agent planning
inferred← citeshttps://doi.org/10.1007/s10458-009-9081-1openalex-snapshot
Continual planning and acting in dynamic multiagent environments
inferred← citeshttps://doi.org/10.1007/s10458-016-9333-9openalex-snapshot
Collaborative privacy preserving multi-agent planning
inferred← citeshttps://doi.org/10.1007/s10458-025-09706-8openalex-snapshot
Improving execution concurrency in partial-order plans via block-substitution
inferred← citeshttps://doi.org/10.1007/s10796-010-9243-3openalex-snapshot
Decision-enabled dynamic process management for networked enterprises
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/s11576-008-0085-2openalex-snapshot
SEMPA – Ein Ansatz des Semantischen Prozessmanagements zur Planung von Prozessmodellen
inferred← citeshttps://doi.org/10.1016/j.artint.2017.11.006openalex-snapshot
Strong temporal planning with uncontrollable durations
inferred← citeshttps://doi.org/10.1016/j.dss.2004.07.003openalex-snapshot
A declarative approach to composing web services in dynamic environments
inferred← citeshttps://doi.org/10.1016/j.eswa.2006.05.027openalex-snapshot
Integrating planning and scheduling in workflow domains
inferred← citeshttps://doi.org/10.1016/j.eswa.2011.10.006openalex-snapshot
An agent specific planning algorithm
inferred← citeshttps://doi.org/10.1016/j.jss.2018.07.039openalex-snapshot
Automated composition and optimization of services for variability-intensive domains
inferred← citeshttps://doi.org/10.1016/j.neucom.2021.05.088openalex-snapshot
Neural dynamics for adaptive attitude tracking control of a flapping wing micro aerial vehicle
inferred← citeshttps://doi.org/10.1016/j.sysconle.2012.10.015openalex-snapshot
Parallelizing a state exchange strategy for noncooperative distributed NMPC
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)00122-9openalex-snapshot
Planning the project management way: Efficient planning by effective integration of causal and resource reasoning in RealPlan
inferred← citeshttps://doi.org/10.1023/a:1018954827926openalex-snapshot
Strong bounds on the approximability of two Pspace-hard problems in propositional planning
inferred← citeshttps://doi.org/10.1080/088395101300125734openalex-snapshot
Integrating planning and scheduling
inferred← citeshttps://doi.org/10.1109/icmlc.2007.4370685openalex-snapshot
A New Method for Parallel Planning via Heuristic Search
inferred← citeshttps://doi.org/10.1109/ictai59109.2023.00144openalex-snapshot
Efficient HTN to STRIPS Encodings for Concurrent Planning
inferred← citeshttps://doi.org/10.1109/iita.2008.216openalex-snapshot
Online Parallelization in Conformant Planning
inferred← citeshttps://doi.org/10.1109/tkde.2006.191openalex-snapshot
IPSS: A Hybrid Approach to Planning and Scheduling Integration
inferred← citeshttps://doi.org/10.1142/s0218213015500025openalex-snapshot
Learning Planning Domain Descriptions in RDDL
inferred← citeshttps://doi.org/10.1145/1082473.1082598openalex-snapshot
A distributed framework for solving the Multiagent Plan Coordination Problem
inferred← citeshttps://doi.org/10.1145/1082473.1082599openalex-snapshot
An efficient algorithm for multiagent plan coordination
inferred← citeshttps://doi.org/10.1145/1232425.1232431openalex-snapshot
Continual planning and acting in dynamic multiagent environments
inferred← citeshttps://doi.org/10.1201/9781351236423-39openalex-snapshot
Approximation Algorithms and Heuristics for Classical Planning
inferred← citeshttps://doi.org/10.1609/aaai.v26i1.8195openalex-snapshot
Generalizing and Executing Plans
inferred← citeshttps://doi.org/10.1609/aaai.v29i1.9653openalex-snapshot
Strong Temporal Planning with Uncontrollable Durations: A State-Space Approach
inferred← citeshttps://doi.org/10.1609/aaai.v31i1.11025openalex-snapshot
Plan Reordering and Parallel Execution — A Parameterized Complexity View
inferred← citeshttps://doi.org/10.1609/aaai.v33i01.33017538openalex-snapshot
Robustness Envelopes for Temporal Plans
inferred← citeshttps://doi.org/10.1609/aaai.v33i01.33017675openalex-snapshot
Temporal Planning with Temporal Metric Trajectory Constraints
inferred← citeshttps://doi.org/10.1609/aaai.v34i06.6530openalex-snapshot
POP ≡ POCL, Right? Complexity Results for Partial Order (Causal Link) Makespan Minimization
inferred← citeshttps://doi.org/10.1609/icaps.v19i1.13343openalex-snapshot
Optimality Properties of Planning Via Petri Net Unfolding: A Formal Analysis
inferred← citeshttps://doi.org/10.1609/icaps.v20i1.13399openalex-snapshot
An Evolutionary Metaheuristic Based on State Decomposition for Domain-Independent Satisficing Planning
inferred← citeshttps://doi.org/10.1609/icaps.v20i1.13402openalex-snapshot
Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement
inferred← citeshttps://doi.org/10.1609/icaps.v21i1.13462openalex-snapshot
Planning for Loosely Coupled Agents Using Partial Order Forward-Chaining
inferred← citeshttps://doi.org/10.1609/icaps.v22i1.13537openalex-snapshot
Optimally Relaxing Partial-Order Plans with MaxSAT
inferred← citeshttps://doi.org/10.1609/icaps.v28i1.13893openalex-snapshot
A Novel Iterative Approach to Top-k Planning
inferred← citeshttps://doi.org/10.1609/icaps.v28i1.13901openalex-snapshot
Plan Relaxation via Action Debinding and Deordering
inferred← citeshttps://doi.org/10.1609/icaps.v29i1.3493openalex-snapshot
Eliminating Redundant Actions in Partially Ordered Plans — A Complexity Analysis
inferred← citeshttps://doi.org/10.1609/icaps.v31i1.15944openalex-snapshot
A Closer Look at Causal Links: Complexity Results for Delete-Relaxation in Partial Order Causal Link (POCL) Planning
inferred← citeshttps://doi.org/10.1609/icaps.v32i1.19820openalex-snapshot
Debugging a Policy: Automatic Action-Policy Testing in AI Planning
inferred← citeshttps://doi.org/10.1609/socs.v2i1.18186openalex-snapshot
All PSPACE-Complete Planning Problems Are Equal but Some Are More Equal than Others
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.1302openalex-snapshot
Taming Numbers and Durations in the Model Checking Integrated Planning System
inferred← citeshttps://doi.org/10.1613/jair.3602openalex-snapshot
Narrative Planning: Compilations to Classical Planning
inferred← citeshttps://doi.org/10.1613/jair.4295openalex-snapshot
Distributed Heuristic Forward Search for Multi-agent Planning
inferred← citeshttps://doi.org/10.1613/jair.4980openalex-snapshot
Continuing Plan Quality Optimisation
inferred← citeshttps://doi.org/10.1613/jair.5128openalex-snapshot
Optimal Partial-Order Plan Relaxation via MaxSAT
inferred← citeshttps://doi.org/10.2200/s00900ed2v01y201902aim042openalex-snapshot
An Introduction to the Planning Domain Definition Language
inferred← citeshttps://doi.org/10.24425/acs.2021.137423openalex-snapshot
On transformation of conditional, conformant and parallel planning to linear programming
inferred← citeshttps://doi.org/10.2478/v10170-010-0042-3openalex-snapshot
On transformation of STRIPS planning to linear programming
inferred← citeshttps://doi.org/10.24963/ijcai.2020/573openalex-snapshot
Optimising Partial-Order Plans Via Action Reinstantiation
inferred← citeshttps://doi.org/10.25911/5d6c3a9454f26openalex-snapshot
Using Plan Decomposition for Continuing Plan Optimisation and Macro Generation
inferred← citeshttps://doi.org/10.3233/aic-230058openalex-snapshot
Revisiting block deordering in finite-domain state variable planning
inferred← citeshttps://doi.org/10.3233/mgs-2009-0134openalex-snapshot
Efficient and distributable methods for solving the multiagent plan coordination problem
inferred← citeshttps://doi.org/10.3384/diss.diva-136280openalex-snapshot
Computational Complexity of some Optimization Problems in Planning
inferred← citeshttps://doi.org/10.3390/ijgi7100404openalex-snapshot
Multi-Agent Planning for Automatic Geospatial Web Service Composition in Geoportals
inferred← citeshttps://doi.org/10.4230/lipics.time.2021.15openalex-snapshot
Olisipo: A Probabilistic Approach to the Adaptable Execution of Deterministic Temporal Plans
inferred← citeshttps://doi.org/10.5591/978-1-57735-516-8/ijcai11-330openalex-snapshot
Monitoring the execution of partial-order plans via regression
inferred← citeshttps://doi.org/10.7939/r3fm9hopenalex-snapshot
Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement - Extended Version
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.