On the public citation graph

https://doi.org/10.2139/ssrn.4654489

0 signed · 35 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/s13042-020-01213-4openalex-extracted
A hybrid many-objective competitive swarm optimization algorithm for large-scale multirobot task allocation problem
inferredcites →https://doi.org/10.1016/j.aei.2022.101604openalex-extracted
A route and speed optimization model to find conflict-free routes for automated guided vehicles in large warehouses based on quick response code technology
inferredcites →https://doi.org/10.1016/j.aei.2023.102026openalex-extracted
Solving an industry-inspired generalization of lifelong MAPF problem including multiple delivery locations
inferredcites →https://doi.org/10.1016/j.artint.2014.11.006openalex-extracted
Conflict-based search for optimal multi-agent pathfinding
inferredcites →https://doi.org/10.1016/j.artint.2021.103574openalex-extracted
Pairwise symmetry reasoning for multi-agent path finding search
inferredcites →https://doi.org/10.1016/j.artint.2022.103752openalex-extracted
Priority inheritance with backtracking for iterative multi-agent path finding
inferredcites →https://doi.org/10.1016/j.artint.2022.103766openalex-extracted
Multi-agent path finding with mutex propagation
inferredcites →https://doi.org/10.1109/cac48633.2019.8997273openalex-extracted
Coupling-Degree-Based Heuristic Prioritized Planning Method for UAV Swarm Path Generation
inferredcites →https://doi.org/10.1109/icra.2011.5980306openalex-extracted
SIPP: Safe interval path planning for dynamic environments
inferredcites →https://doi.org/10.1109/icra40945.2020.9196813openalex-extracted
Multi-Robot Path Deconfliction through Prioritization by Path Prospects
inferredcites →https://doi.org/10.1109/iros.2005.1545306openalex-extracted
Prioritized motion planning for multiple robots
inferredcites →https://doi.org/10.1109/iros40897.2019.8968483openalex-extracted
Learning Safe Unlabeled Multi-Robot Planning with Motion Constraints
inferredcites →https://doi.org/10.1109/itsc.2019.8917112openalex-extracted
Multi-Agent Path Finding with Priority for Cooperative Automated Valet Parking
inferredcites →https://doi.org/10.1109/lra.2020.2967317openalex-extracted
Walk, Stop, Count, and Swap: Decentralized Multi-Agent Path Finding With Theoretical Guarantees
inferredcites →https://doi.org/10.1109/tase.2015.2445780openalex-extracted
Prioritized Planning Algorithms for Trajectory Coordination of Multiple Mobile Robots
inferredcites →https://doi.org/10.1109/tase.2022.3183183openalex-extracted
A Conflict-Based Search Framework for Multiobjective Multiagent Path Finding
inferredcites →https://doi.org/10.1109/tits.2011.2131650openalex-extracted
Optimization of Taxiway Routing and Runway Scheduling
inferredcites →https://doi.org/10.1109/tro.2016.2593448openalex-extracted
Optimal Multirobot Path Planning on Graphs: Complete Algorithms and Effective Heuristics
inferredcites →https://doi.org/10.1609/aaai.v24i1.7564openalex-extracted
Finding Optimal Solutions to Cooperative Pathfinding Problems
inferredcites →https://doi.org/10.1609/aaai.v33i01.33017643openalex-extracted
Searching with Consistent Prioritization for Multi-Agent Path Finding
inferredcites →https://doi.org/10.1609/aaai.v35i13.17344openalex-extracted
Lifelong Multi-Agent Path Finding in Large-Scale Warehouses
inferredcites →https://doi.org/10.1609/aaai.v35i14.17466openalex-extracted
EECBS: A Bounded-Suboptimal Search for Multi-Agent Path Finding
inferredcites →https://doi.org/10.1609/aaai.v36i9.21266openalex-extracted
MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search
inferredcites →https://doi.org/10.1609/aiide.v1i1.18726openalex-extracted
Cooperative Pathfinding
inferredcites →https://doi.org/10.1609/icaps.v29i1.3487openalex-extracted
Disjoint Splitting for Multi-Agent Path Finding with Conflict-Based Search
inferredcites →https://doi.org/10.1609/icaps.v30i1.6674openalex-extracted
Revisiting Bounded-Suboptimal Safe Interval Path Planning
inferredcites →https://doi.org/10.1609/socs.v10i1.18510openalex-extracted
Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks
inferredcites →https://doi.org/10.1609/socs.v11i1.18540openalex-extracted
Generalizing Multi-Agent Path Finding for Heterogeneous Agents
inferredcites →https://doi.org/10.1609/socs.v15i1.21769openalex-extracted
Learning a Priority Ordering for Prioritized Planning in Multi-Agent Path Finding
inferredcites →https://doi.org/10.1609/socs.v8i1.18423openalex-extracted
Search-Based Optimal Solvers for the Multi-Agent Pathfinding Problem: Summary and Challenges
inferredcites →https://doi.org/10.48550/arxiv.1710.01447openalex-extracted
inferredcites →https://doi.org/10.48550/arxiv.1908.02361openalex-extracted
inferredcites →https://doi.org/10.48550/arxiv.2005.07371openalex-extracted
Lifelong Multi-Agent Path Finding in Large-Scale Warehouses
inferredcites →https://doi.org/10.48550/arxiv.2010.01367openalex-extracted
inferredcites →https://doi.org/10.48550/arxiv.2103.07116openalex-extracted
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.