On the public citation graph
Constant Factor Time Optimal Multi-Robot Routing on High-Dimensional Grids
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.
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/978-3-642-36279-8_10openalex-snapshot
Multi-agent Path Planning and Network Flow
inferredcites →https://doi.org/10.1007/978-3-642-36279-8_12openalex-snapshot
k-Color Multi-robot Motion Planning
inferredcites →https://doi.org/10.1007/978-94-011-1590-2openalex-snapshot
Theory of Automatic Robot Assembly and Programming
inferredcites →https://doi.org/10.1007/pl00009259openalex-snapshot
A Linear-Time Algorithm for the Feasibility of Pebble Motion on Trees
inferredcites →https://doi.org/10.1007/s00291-007-0100-9openalex-snapshot
Operations research at container terminals: a literature update
inferredcites →https://doi.org/10.1007/s00453-009-9290-7openalex-snapshot
Multi-Color Pebble Motion on Graphs
inferredcites →https://doi.org/10.1007/s004539910025openalex-snapshot
A General Framework for Assembly Planning: The Motion Space Approach
inferredcites →https://doi.org/10.1007/s004930170002openalex-snapshot
Edge-Coloring Bipartite Multigraphs in O ( E log D ) Time
inferredcites →https://doi.org/10.1016/0020-0190(84)90130-3openalex-snapshot
Strong np-hardness of moving many discs
inferredcites →https://doi.org/10.1016/0095-8956(74)90098-7openalex-snapshot
Graph puzzles, homotopy, and the alternating group
inferredcites →https://doi.org/10.1016/j.artint.2012.11.006openalex-snapshot
The increasing cost tree search for optimal multi-agent pathfinding
inferredcites →https://doi.org/10.1016/j.artint.2014.11.006openalex-snapshot
Conflict-based search for optimal multi-agent pathfinding
inferredcites →https://doi.org/10.1016/j.tcs.2005.05.008openalex-snapshot
PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
inferredcites →https://doi.org/10.1023/a:1008937911390openalex-snapshot
A Probabilistic Approach to Collaborative Multi-Robot Localization
inferredcites →https://doi.org/10.1109/43.969439openalex-snapshot
Scheduling of microfluidic operations for reconfigurable two-dimensional electrowetting arrays
inferredcites →https://doi.org/10.1109/70.736775openalex-snapshot
Optimal motion planning for multiple robots having independent goals
inferredcites →https://doi.org/10.1109/icar.1997.620182openalex-snapshot
Cooperative search and rescue with a team of mobile robots
inferredcites →https://doi.org/10.1109/icra.2013.6631119openalex-snapshot
ODrM* optimal multirobot path planning in low dimensional search spaces
inferredcites →https://doi.org/10.1109/icra.2015.7139967openalex-snapshot
Local motion planning for collaborative multi-robot manipulation of deformable objects
inferredcites →https://doi.org/10.1109/iros.1995.525802openalex-snapshot
Moving furniture with teams of autonomous robots
inferredcites →https://doi.org/10.1109/iros.1995.525940openalex-snapshot
Cooperative multi-robot box-pushing
inferredcites →https://doi.org/10.1109/iros.2007.4399520openalex-snapshot
A decentralized planner that guarantees the safety of communicating vehicles with complex dynamics that replan online
inferredcites →https://doi.org/10.1109/iros.2011.6048671openalex-snapshot
M*: A complete multirobot path planning algorithm with performance bounds
inferredcites →https://doi.org/10.1109/iros.2011.6095022openalex-snapshot
M*: A complete multirobot path planning algorithm with performance bounds
inferredcites →https://doi.org/10.1109/lra.2015.2503143openalex-snapshot
Intractability of Optimal Multirobot Path Planning on Planar Graphs
inferredcites →https://doi.org/10.1109/robot.1996.506594openalex-snapshot
Optimal motion planning for multiple robots having independent goals
inferredcites →https://doi.org/10.1109/robot.2002.1013625openalex-snapshot
A distributed and optimal motion planning approach for multiple mobile robots
inferredcites →https://doi.org/10.1109/robot.2008.4543489openalex-snapshot
Reciprocal Velocity Obstacles for real-time multi-agent navigation
inferredcites →https://doi.org/10.1109/robot.2010.5509502openalex-snapshot
Behavior-based evacuation planning
inferredcites →https://doi.org/10.1109/roman.2012.6343737openalex-snapshot
Pedestrian-inspired sampling-based multi-robot collision avoidance
inferredcites →https://doi.org/10.1109/sfcs.1984.715921openalex-snapshot
Coordinating Pebble Motion On Graphs, The Diameter Of Permutation Groups, And Applications
inferredcites →https://doi.org/10.1109/tro.2016.2593448openalex-snapshot
Optimal Multirobot Path Planning on Graphs: Complete Algorithms and Effective Heuristics
inferredcites →https://doi.org/10.1112/jlms/s1-10.37.26openalex-snapshot
On Representatives of Subsets
inferredcites →https://doi.org/10.1137/100812513openalex-snapshot
Perfect Matchings in $O(n\log n)$ Time in Regular Bipartite Graphs
inferredcites →https://doi.org/10.1137/18m1194341openalex-snapshot
Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch
inferredcites →https://doi.org/10.1177/0278364905059067openalex-snapshot
Coordinating Multiple Droplets in Planar Array Digital Microfluidic Systems
inferredcites →https://doi.org/10.1177/0278364913506268openalex-snapshot
k -color multi-robot motion planning
inferredcites →https://doi.org/10.1177/0278364913515307openalex-snapshot
C apt : Concurrent assignment and planning of trajectories for multiple robots
inferredcites →https://doi.org/10.1177/0278364916672311openalex-snapshot
On the hardness of unlabeled multi-robot motion planning
inferredcites →https://doi.org/10.1177/0278364917741532openalex-snapshot
Hold Or take Optimal Plan (HOOP): A quadratic programming approach to multi-robot trajectory generation
inferredcites →https://doi.org/10.1177/027836498400300405openalex-snapshot
On the Complexity of Motion Planning for Multiple Independent Objects; PSPACE- Hardness of the "Warehouseman's Problem"
inferredcites →https://doi.org/10.15607/rss.2009.v.018openalex-snapshot
Centralized path planning for multiple robots: Optimal decoupling into sequential plans
inferredcites →https://doi.org/10.15607/rss.2015.xi.011openalex-snapshot
Motion Planning for Unlabeled Discs with Optimality Guarantees
inferredcites →https://doi.org/10.1609/icaps.v26i1.13796openalex-snapshot
Multi-Agent Path Finding with Kinematic Constraints
inferredcites →https://doi.org/10.1609/socs.v3i1.18222openalex-snapshot
Conflict-Based Search for Optimal Multi-Agent Path Finding
inferredcites →https://doi.org/10.1609/socs.v6i1.18343openalex-snapshot
ICBS: The Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding
inferredcites →https://doi.org/10.4153/cjm-1956-045-5openalex-snapshot
Maximal Flow Through a Network
inferredcites →https://doi.org/10.48550/arxiv.1408.2260openalex-snapshot
On the hardness of unlabeled multi-robot motion planning
inferredcites →https://doi.org/10.48550/arxiv.1504.02072openalex-snapshot
Intractability of Optimal Multi-Robot Path Planning on Planar Graphs
inferredcites →https://doi.org/10.48550/arxiv.1706.07255openalex-snapshot
Average Case Constant Factor Time and Distance Optimal Multi-Robot Path Planning in Well-Connected Environments
inferredcites →https://doi.org/10.48550/arxiv.1801.10465openalex-snapshot
Constant Factor Time Optimal Multi-Robot Routing on High-Dimensional Grids in Mostly Sub-Quadratic Time
inferredcites →https://doi.org/10.5555/1402821.1402883openalex-snapshot
A new approach to cooperative pathfinding
inferredcites →https://doi.org/10.5591/978-1-57735-516-8/ijcai11-059openalex-snapshot
Push and swap: fast cooperative path-finding with completeness guarantees
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-44051-0_46openalex-snapshot
Motion Planning for Multiple Unit-Ball Robots in $$\mathbb {R}^{{\varvec{d}}}$$
inferred← citeshttps://doi.org/10.1007/978-3-030-44051-0_47openalex-snapshot
Coordinating the Motion of Labeled Discs with Optimality Guarantees under Extreme Density
inferred← citeshttps://doi.org/10.1007/978-3-030-66723-8_31openalex-snapshot
On Rearrangement of Items Stored in Stacks
inferred← citeshttps://doi.org/10.1007/s43154-021-00043-8openalex-snapshot
Roadmaps for Robot Motion Planning with Groups of Robots
inferred← citeshttps://doi.org/10.1109/allerton49937.2022.9929323openalex-snapshot
Rubik Tables, Stack Rearrangement, and Multi-Robot Path Planning
inferred← citeshttps://doi.org/10.1109/icra40945.2020.9197033openalex-snapshot
Parallel Permutation for Linear Full-resolution Reconfiguration of Heterogeneous Sliding-only Cubic Modular Robots
inferred← citeshttps://doi.org/10.1109/icra46639.2022.9812357openalex-snapshot
Optimizing Space Utilization for More Effective Multi-Robot Path Planning
inferred← citeshttps://doi.org/10.1109/icra48506.2021.9561899openalex-snapshot
Spatial and Temporal Splitting Heuristics for Multi-Robot Motion Planning
inferred← citeshttps://doi.org/10.1109/icra48891.2023.10160351openalex-snapshot
Toward Efficient Physical and Algorithmic Design of Automated Garages
inferred← citeshttps://doi.org/10.1109/icra55743.2025.11128488openalex-snapshot
Targeted Parallelization of Conflict-Based Search for Multi-Robot Path Planning
inferred← citeshttps://doi.org/10.1109/iros47612.2022.9982231openalex-snapshot
Polynomial Time Near-Time-Optimal Multi-Robot Path Planning in Three Dimensions with Applications to Large-Scale UAV Coordination
inferred← citeshttps://doi.org/10.1109/lra.2020.2967317openalex-snapshot
Walk, Stop, Count, and Swap: Decentralized Multi-Agent Path Finding With Theoretical Guarantees
inferred← citeshttps://doi.org/10.1109/lra.2020.2967326openalex-snapshot
DDM: Fast Near-Optimal Multi-Robot Path Planning Using Diversified-Path and Optimal Sub-Problem Solution Database Heuristics
inferred← citeshttps://doi.org/10.1109/lra.2023.3315208openalex-snapshot
Linear-Time Reconfiguration of Sliding-Only Cubic Modular Robots Under Severe Space Requirements
inferred← citeshttps://doi.org/10.1109/tro.2020.2967656openalex-snapshot
Shape Formation in Homogeneous Swarms Using Local Task Swapping
inferred← citeshttps://doi.org/10.1177/02783649211059844openalex-snapshot
Rubik Tables and object rearrangement
inferred← citeshttps://doi.org/10.15607/rss.2019.xv.066openalex-snapshot
Scalable and Congestion-Aware Routing for Autonomous Mobility-On-Demand Via Frank-Wolfe Optimization
inferred← citeshttps://doi.org/10.15607/rss.2022.xviii.057openalex-snapshot
Sub-1.5 Time-Optimal Multi-Robot Path Planning on Grids in Polynomial Time
inferred← citeshttps://doi.org/10.1613/jair.1.16299openalex-snapshot
Expected 1.x Makespan-Optimal Multi-Agent Path Finding on Grid Graphs in Low Polynomial Time
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.