On the public citation graph
Revisiting Bounded-Suboptimal Safe Interval Path Planning
0 signed · 33 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/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1016/0004-3702(70)90007-xopenalex-snapshot
Heuristic search viewed as path finding in a graph
inferredcites →https://doi.org/10.1016/0004-3702(77)90002-9openalex-snapshot
On the complexity of admissible search algorithms
inferredcites →https://doi.org/10.1016/j.artint.2022.103662openalex-snapshot
Multi-Agent Pathfinding with Continuous Time
inferredcites →https://doi.org/10.1109/icra.2011.5980306openalex-snapshot
SIPP: Safe interval path planning for dynamic environments
inferredcites →https://doi.org/10.1109/icra.2017.7989657openalex-snapshot
Multi-robot path planning for a swarm of robots that can both fly and drive
inferredcites →https://doi.org/10.1109/iros.2012.6386191openalex-snapshot
Anytime Safe Interval Path Planning for dynamic environments
inferredcites →https://doi.org/10.1109/tssc.1968.300136openalex-snapshot
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
inferredcites →https://doi.org/10.1145/3828.3830openalex-snapshot
Generalized best-first search strategies and the optimality of A*
inferredcites →https://doi.org/10.1609/socs.v10i1.18501openalex-snapshot
Optimal and Bounded-Suboptimal Multi-Agent Motion Planning
inferredcites →https://doi.org/10.1609/socs.v7i1.18395openalex-snapshot
Repair Policies for Not Reopening Nodes in Different Search Settings
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-030-87725-5_1openalex-snapshot
Prioritized SIPP for Multi-agent Path Finding with Kinematic Constraints
inferred← citeshttps://doi.org/10.1007/978-981-99-6847-3_27openalex-snapshot
Key-Agent Based Dynamic Prioritized Planning for Multi-agent Systems
inferred← citeshttps://doi.org/10.1007/s42405-026-01243-2openalex-snapshot
A Hybrid Discrete-Continuous Strategy for Multi-aircraft Trajectory Planning on Flight Deck
inferred← citeshttps://doi.org/10.1016/j.aei.2024.102523openalex-snapshot
Multi-agent priority gaming for path planning in chain-like blocking situation
inferred← citeshttps://doi.org/10.1109/case58245.2025.11163972openalex-snapshot
Efficient Social Navigation: Leveraging Discrete Morse Theory for Dynamic Agent Interaction*
inferred← citeshttps://doi.org/10.1109/icbase63199.2024.10762725openalex-snapshot
Research on Multi-robot Path Planning Based on Optimal Energy Consumption
inferred← citeshttps://doi.org/10.1109/lra.2024.3511435openalex-snapshot
Multi-Agent Path Finding With Heterogeneous Geometric and Kinematic Constraints in Continuous Space
inferred← citeshttps://doi.org/10.1109/raiie65740.2025.11140355openalex-snapshot
A Bidirectional search MB-IHCA* Multi-Robot Path Planning Algorithm Based on Search Node Collaboration Mechanism
inferred← citeshttps://doi.org/10.1109/rcae62637.2024.10834259openalex-snapshot
Incremental CBS: Adaptive Multi-Agent Pathfinding in Dynamic Environments
inferred← citeshttps://doi.org/10.1109/tiv.2024.3355423openalex-snapshot
A Priority-Based Hierarchical Framework for k-Robust Multi-Agent Path Finding
inferred← citeshttps://doi.org/10.1109/yac66630.2025.11150319openalex-snapshot
Obstacle Conflict-based Search Method for Dynamic Obstacle Avoidance in Multi-agent Pathfinding
inferred← citeshttps://doi.org/10.15622/ia.25.4.4openalex-snapshot
An Efficient Method for Generating Kinematically Feasible Motion Primitives via Curvature Parameterization
inferred← citeshttps://doi.org/10.1609/aaai.v37i10.26453openalex-snapshot
Safe Interval Path Planning with Kinodynamic Constraints
inferred← citeshttps://doi.org/10.1609/socs.v12i1.18562openalex-snapshot
Towards Narrowing the Search in Bounded-Suboptimal Safe Interval Path Planning
inferred← citeshttps://doi.org/10.1609/socs.v15i1.21800openalex-snapshot
Situated Grid Pathfinding Among Moving Obstacles (Extended Abstract)
inferred← citeshttps://doi.org/10.3103/s014768822470062xopenalex-snapshot
Artificial Intelligence and Cognitive Modeling: Creative Heritage of G.S. Osipov
inferred← citeshttps://doi.org/10.3390/electronics13163347openalex-snapshot
Multi-Agent Collaborative Path Planning Algorithm with Multiple Meeting Points
inferred← citeshttps://doi.org/10.3390/machines12070482openalex-snapshot
MT-SIPP: An Efficient Collision-Free Multi-Chain Robot Path Planning Algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.2108.00745openalex-snapshot
Multi-objective Conflict-based Search Using Safe-interval Path Planning
inferred← citeshttps://doi.org/10.52783/jes.1195openalex-snapshot
Multi-robot Source Navigation Method Based on Coordination Graph Monte Carlo Tree Search
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.