On the public citation graph

Motion Planning for Unlabeled Discs with Optimality Guarantees

https://doi.org/10.15607/rss.2015.xi.011

0 signed · 114 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/3-540-61422-2_137openalex-snapshot

A linear time algorithm for the feasibility of pebble motion on trees

inferredcites →https://doi.org/10.1007/978-3-319-16595-0_1openalex-snapshot

Efficient Multi-robot Motion Planning for Unlabeled Discs in Simple Polygons

inferredcites →https://doi.org/10.1007/978-3-319-16595-0_34openalex-snapshot

Finding a Needle in an Exponential Haystack: Discrete RRT for Exploration of Implicit Roadmaps in Multi-robot Motion Planning

inferredcites →https://doi.org/10.1007/978-3-540-30140-0_62openalex-snapshot

Classroom Examples of Robustness Problems in Geometric Computations

inferredcites →https://doi.org/10.1007/978-3-540-45058-0_14openalex-snapshot

Coordinating Multiple Robots with Kinodynamic Constraints along Specified Paths

inferredcites →https://doi.org/10.1007/978-3-642-17283-0openalex-snapshot

CGAL Arrangements and Their Applications: A Step-by-Step Guide

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_11openalex-snapshot

Trajectory Planning and Assignment in Multirobot Systems

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-3-642-36279-8_14openalex-snapshot

Space-Time Group Motion Planning

inferredcites →https://doi.org/10.1007/978-3-642-36279-8_19openalex-snapshot

On the Power of Manifold Samples in Exploring Configuration Spaces and the Dimensionality of Narrow Passages

inferredcites →https://doi.org/10.1007/bf01840371openalex-snapshot

On multiple moving objects

inferredcites →https://doi.org/10.1007/bf02187683openalex-snapshot

On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles

inferredcites →https://doi.org/10.1007/pl00009476openalex-snapshot

Motion Planning for Multiple Robots

inferredcites →https://doi.org/10.1007/s00453-009-9290-7openalex-snapshot

Multi-Color Pebble Motion on Graphs

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/j.artint.2014.11.001openalex-snapshot

Subdimensional expansion for multirobot path planning

inferredcites →https://doi.org/10.1016/s0921-8890(97)00033-xopenalex-snapshot

Coordinated path planning for multiple robots

inferredcites →https://doi.org/10.1109/70.736775openalex-snapshot

Optimal motion planning for multiple robots having independent goals

inferredcites →https://doi.org/10.1109/cdc.2012.6426233openalex-snapshot

Distance optimal formation control on graphs with a tight convergence time guarantee

inferredcites →https://doi.org/10.1109/icra.2013.6630671openalex-snapshot

Concurrent assignment and planning of trajectories for large teams of interchangeable robots

inferredcites →https://doi.org/10.1109/icra.2013.6631083openalex-snapshot

Efficient formation path planning on large graphs

inferredcites →https://doi.org/10.1109/icra.2013.6631084openalex-snapshot

Planning optimal paths for multiple robots on graphs

inferredcites →https://doi.org/10.1109/iros.2005.1545306openalex-snapshot

Prioritized motion planning for multiple robots

inferredcites →https://doi.org/10.1109/robot.1989.100033openalex-snapshot

Deadlock-free and collision-free coordination of two robot manipulators

inferredcites →https://doi.org/10.1109/robot.2005.1570374openalex-snapshot

Path Planning for Permutation-Invariant Multi-Robot Formations

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/sfcs.1987.42openalex-snapshot

New lower bound techniques for robot motion planning problems

inferredcites →https://doi.org/10.1109/tase.2014.2331983openalex-snapshot

On the Power of Manifold Samples in Exploring Configuration Spaces and the Dimensionality of Narrow Passages

inferredcites →https://doi.org/10.1109/tase.2015.2470096openalex-snapshot

Efficient Multi-Robot Motion Planning for Unlabeled Discs in Simple Polygons

inferredcites →https://doi.org/10.1109/tro.2006.878952openalex-snapshot

Path planning for permutation-invariant multirobot formations

inferredcites →https://doi.org/10.1137/060652063openalex-snapshot

Reconfigurations in Graphs and Grids

inferredcites →https://doi.org/10.1145/276884.276926openalex-snapshot

Motion planning for multiple robots

inferredcites →https://doi.org/10.1177/0278364905051974openalex-snapshot

Coordinating Multiple Robots with Kinodynamic Constraints Along Specified Paths

inferredcites →https://doi.org/10.1177/0278364905059057openalex-snapshot

Computing Pareto Optimal Coordinations on Roadmaps

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/0278364915615688openalex-snapshot

Finding a needle in an exponential haystack: Discrete RRT for exploration of implicit roadmaps in multi-robot motion planning

inferredcites →https://doi.org/10.1177/0278364916672311openalex-snapshot

On the hardness of unlabeled multi-robot motion planning

inferredcites →https://doi.org/10.1177/027836498300200304openalex-snapshot

On the Piano Movers' Problem: III. Coordinating the Motion of Several Independent Bodies: The Special Case of Circular Bodies Moving Amidst Polygonal Barriers

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.2013.ix.030openalex-snapshot

Goal Assignment and Trajectory Planning for Large Teams of Aerial Robots

inferredcites →https://doi.org/10.15607/rss.2015.xi.046openalex-snapshot

On the hardness of unlabeled multi-robot motion planning

inferredcites →https://doi.org/10.1609/aaai.v25i1.8041openalex-snapshot

An Efficient and Complete Approach for Cooperative Path-Finding

inferredcites →https://doi.org/10.1609/socs.v4i1.18289openalex-snapshot

From Feasibility Tests to Path Planners for Multi-Agent Pathfinding

inferredcites →https://doi.org/10.21236/ada196213openalex-snapshot

On Multiple Moving Objects

inferredcites →https://doi.org/10.4310/cag.2018.v26.n4.a1openalex-snapshot

A Geometric approach to shortest bounded curvature paths

inferredcites →https://doi.org/10.48550/arxiv.1301.2342openalex-snapshot

A Linear Time Algorithm for the Feasibility of Pebble Motion on Graphs

inferredcites →https://doi.org/10.48550/arxiv.1408.2260openalex-snapshot

On the hardness of unlabeled multi-robot motion planning

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/cav.2162openalex-snapshot

Spatially distributed lane planning for navigation in 3D environments

inferred← citeshttps://doi.org/10.1007/978-3-030-43089-4_58openalex-snapshot

Assignment Algorithms for Variable Robot Formations

inferred← citeshttps://doi.org/10.1007/978-3-030-44051-0_45openalex-snapshot

Fast, High-Quality Dual-Arm Rearrangement in Synchronous, Monotone Tabletop Setups

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-031-71360-6_14openalex-snapshot

Decentralized Unlabeled Multi-agent Navigation in Continuous Space

inferred← citeshttps://doi.org/10.1007/978-3-032-09967-9_13openalex-snapshot

Tractability Frontiers in Multi-robot Coordination and Geometric Reconfiguration

inferred← citeshttps://doi.org/10.1007/978-3-319-51532-8_30openalex-snapshot

An Effective Algorithmic Framework for Near Optimal Multi-robot Path Planning

inferred← citeshttps://doi.org/10.1007/978-3-642-41610-1_166-1openalex-snapshot

Complexity of Planning

inferred← citeshttps://doi.org/10.1007/s10458-023-09626-5openalex-snapshot

Connected coordinated motion planning with bounded stretch

inferred← citeshttps://doi.org/10.1007/s10458-024-09668-3openalex-snapshot

Efficiently reconfiguring a connected swarm of labeled robots

inferred← citeshttps://doi.org/10.1007/s10514-017-9673-6openalex-snapshot

Locally-optimal multi-robot navigation under delaying disturbances using homotopy constraints

inferred← citeshttps://doi.org/10.1007/s10514-018-9719-4openalex-snapshot

ALAN: adaptive learning for multi-agent navigation

inferred← citeshttps://doi.org/10.1007/s10514-019-09832-9openalex-snapshot

dRRT*: Scalable and informed asymptotically-optimal multi-robot motion planning

inferred← citeshttps://doi.org/10.1007/s10514-019-09858-zopenalex-snapshot

Average case constant factor time and distance optimal multi-robot path planning in well-connected environments

inferred← citeshttps://doi.org/10.1007/s10514-020-09917-wopenalex-snapshot

Planar max flow maps and determination of lanes with clearance

inferred← citeshttps://doi.org/10.1007/s10514-025-10198-4openalex-snapshot

Shortest coordinated motions for square robots

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.1016/j.conengprac.2021.104753openalex-snapshot

Centralized collision-free polynomial trajectories and goal assignment for aerial swarms

inferred← citeshttps://doi.org/10.1109/acc.2016.7525304openalex-snapshot

Collision free and permutation invariant formation control using the root locus principle

inferred← citeshttps://doi.org/10.1109/icra.2017.7989507openalex-snapshot

Efficient multi-agent global navigation using interpolating bridges

inferred← citeshttps://doi.org/10.1109/icra40945.2020.9196799openalex-snapshot

DC-CAPT: Concurrent Assignment and Planning of Trajectories for Dubins Cars

inferred← citeshttps://doi.org/10.1109/icra48506.2021.9561009openalex-snapshot

Near-Optimal Multi-Robot Motion Planning with Finite Sampling

inferred← citeshttps://doi.org/10.1109/icra48891.2023.10160902openalex-snapshot

Real-Time Decentralized Navigation of Nonholonomic Agents Using Shifted Yielding Areas

inferred← citeshttps://doi.org/10.1109/iros.2017.8206019openalex-snapshot

Efficient sampling-based bottleneck pathfinding over cost maps

inferred← citeshttps://doi.org/10.1109/iros.2018.8594417openalex-snapshot

SEAR: A Polynomial- Time Multi-Robot Path Planning Algorithm with Expected Constant-Factor Optimality Guarantee

inferred← citeshttps://doi.org/10.1109/iros47612.2022.9981807openalex-snapshot

Multi-Robot Path Planning Using Medial-Axis-Based Pebble-Graph Embedding

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/iros51168.2021.9636088openalex-snapshot

Decentralized, Unlabeled Multi-Agent Navigation in Obstacle-Rich Environments using Graph Neural Networks

inferred← citeshttps://doi.org/10.1109/lra.2018.2800116openalex-snapshot

Efficient, High-Quality Stack Rearrangement

inferred← citeshttps://doi.org/10.1109/lra.2019.2961302openalex-snapshot

Optimal Perimeter Guarding With Heterogeneous Robot Teams: Complexity Analysis and Effective Algorithms

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.2021.3074885openalex-snapshot

Large Scale Distributed Collaborative Unlabeled Motion Planning With Graph Policy Gradients

inferred← citeshttps://doi.org/10.1109/lra.2024.3350977openalex-snapshot

Learning Neural Traffic Rules

inferred← citeshttps://doi.org/10.1109/mrs.2017.8250930openalex-snapshot

Expected constant-factor optimal multi-robot path planning in well-connected environments

inferred← citeshttps://doi.org/10.1109/mrs.2019.8901065openalex-snapshot

Effective Heuristics for Multi-Robot Path Planning in Warehouse Environments

inferred← citeshttps://doi.org/10.1109/taes.2017.2696603openalex-snapshot

Optimal Aircraft Planar Navigation in Static Threat Environments

inferred← citeshttps://doi.org/10.1109/tase.2015.2470096openalex-snapshot

Efficient Multi-Robot Motion Planning for Unlabeled Discs in Simple Polygons

inferred← citeshttps://doi.org/10.1109/tase.2021.3055144openalex-snapshot

Fast, High-Quality Two-Arm Rearrangement in Synchronous, Monotone Tabletop Setups

inferred← citeshttps://doi.org/10.1109/tro.2016.2593448openalex-snapshot

Optimal Multirobot Path Planning on Graphs: Complete Algorithms and Effective Heuristics

inferred← citeshttps://doi.org/10.1109/tro.2023.3281152openalex-snapshot

Near-Optimal Multi-Robot Motion Planning with Finite Sampling

inferred← citeshttps://doi.org/10.1109/tro.2025.3626654openalex-snapshot

Concurrent-Allocation Task Execution for Multirobot Path-Crossing-Minimal Navigation in Obstacle Environments

inferred← citeshttps://doi.org/10.1137/18m1194341openalex-snapshot

Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch

inferred← citeshttps://doi.org/10.1145/3532773openalex-snapshot

Computing Coordinated Motion Plans for Robot Swarms: The CG:SHOP Challenge 2021

inferred← citeshttps://doi.org/10.1177/0278364915615688openalex-snapshot

Finding a needle in an exponential haystack: Discrete RRT for exploration of implicit roadmaps in multi-robot motion planning

inferred← citeshttps://doi.org/10.1177/0278364916672311openalex-snapshot

On the hardness of unlabeled multi-robot motion planning

inferred← citeshttps://doi.org/10.1177/0278364919859627openalex-snapshot

The Critical Radius in Sampling-based Motion Planning

inferred← citeshttps://doi.org/10.12783/dtcse/cst2017/12547openalex-snapshot

An Improved Artificial Potential Field for Unmanned Aerial Vehicles Path Planning

inferred← citeshttps://doi.org/10.15607/rss.2015.xi.046openalex-snapshot

On the hardness of unlabeled multi-robot motion planning

inferred← citeshttps://doi.org/10.15607/rss.2017.xiii.022openalex-snapshot

Effective Metrics for Multi-Robot Motion-Planning

inferred← citeshttps://doi.org/10.15607/rss.2017.xiii.051openalex-snapshot

High-Quality Tabletop Rearrangement with Overhand Grasps: Hardness Results and Fast Methods

inferred← citeshttps://doi.org/10.15607/rss.2018.xiv.013openalex-snapshot

Constant Factor Time Optimal Multi-Robot Routing on High-Dimensional Grids

inferred← citeshttps://doi.org/10.15607/rss.2018.xiv.052openalex-snapshot

GPU-Based Max Flow Maps in the Plane

inferred← citeshttps://doi.org/10.15607/rss.2019.xv.002openalex-snapshot

Efficient Algorithms for Optimal Perimeter Guarding

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.15622/rcai.2025.048openalex-snapshot

НАВИГАЦИЯ ГРУППЫ ВЗАИМОЗАМЕНЯЕМЫХ АГЕНТОВ В НЕПРЕРЫВНОЙ СРЕДЕ

inferred← citeshttps://doi.org/10.3390/machines11070722openalex-snapshot

Conventional, Heuristic and Learning-Based Robot Motion Planning: Reviewing Frameworks of Current Practical Significance

inferred← citeshttps://doi.org/10.48550/arxiv.1408.2260openalex-snapshot

On the hardness of unlabeled multi-robot motion planning

inferred← citeshttps://doi.org/10.48550/arxiv.1607.02770openalex-snapshot

Sampling-based bottleneck pathfinding with applications to Frechet matching

inferred← citeshttps://doi.org/10.48550/arxiv.1607.04005openalex-snapshot

Characterizing minimum-length coordinated motions for two discs

inferred← citeshttps://doi.org/10.48550/arxiv.1706.07255openalex-snapshot

Average Case Constant Factor Time and Distance Optimal Multi-Robot Path Planning in Well-Connected Environments

inferred← citeshttps://doi.org/10.48550/arxiv.1807.05428openalex-snapshot

Motion Planning for Multiple Unit-Ball Robots in $\mathbb{R}^d$

inferred← citeshttps://doi.org/10.48550/arxiv.2004.12144openalex-snapshot

Multi-robot motion planning of k-colored discs is PSPACE-hard

inferred← citeshttps://doi.org/10.48550/arxiv.2011.08944openalex-snapshot

Near-Optimal Multi-Robot Motion Planning with Finite Sampling

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.