On the public citation graph
Motion Planning for Multiple Robots
0 signed · 68 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/3-540-54522-0_99openalex-snapshot
Computing roadmaps of general semi-algebraic sets
inferredcites →https://doi.org/10.1007/978-3-7091-9459-1_4openalex-snapshot
Quantifier Elimination for Real Closed Fields by Cylindrical Algebraic Decomposition
inferredcites →https://doi.org/10.1007/bf01530889openalex-snapshot
Coordinated motion planning for two independent robots
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/pl00009402openalex-snapshot
Motion Planning in Environments with Low Obstacle Density
inferredcites →https://doi.org/10.1007/s00453-002-0961-xopenalex-snapshot
Realistic Input Models for Geometric Algorithms
inferredcites →https://doi.org/10.1016/0196-8858(83)90014-3openalex-snapshot
On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds
inferredcites →https://doi.org/10.1016/0925-7721(93)90007-sopenalex-snapshot
The complexity of the free space for a robot moving amidst fat obstacles
inferredcites →https://doi.org/10.1016/s0020-0190(96)00154-8openalex-snapshot
Range searching in low-density environments
inferredcites →https://doi.org/10.1090/s0894-0347-99-00311-2openalex-snapshot
Computing roadmaps of semi-algebraic sets on a variety
inferredcites →https://doi.org/10.1093/comjnl/36.5.504openalex-snapshot
Computing Roadmaps of General Semi-Algebraic Sets
inferredcites →https://doi.org/10.1109/robot.1986.1087401openalex-snapshot
On multiple moving objects
inferredcites →https://doi.org/10.1109/robot.1986.1087555openalex-snapshot
Coordinated motion of two robot arms
inferredcites →https://doi.org/10.1109/robot.1990.126028openalex-snapshot
Multiple robot path coordination using artificial potential fields
inferredcites →https://doi.org/10.1109/robot.1995.525645openalex-snapshot
Multi-robot cooperation through incremental plan-merging
inferredcites →https://doi.org/10.1137/0215055openalex-snapshot
Reducing Multiple Object Motion Planning to Graph Searching
inferredcites →https://doi.org/10.1145/1093390.1093393openalex-snapshot
Quantifier Elimination for Real Closed Fields by Cylindrical Algebraic Decomposition
inferredcites →https://doi.org/10.1145/262839.262986openalex-snapshot
Realistic input models for geometric algorithms
inferredcites →https://doi.org/10.1145/73393.73426openalex-snapshot
Coordinated motion planning for two independent robots
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/027836498600400403openalex-snapshot
Motion of Objects in Contact
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/cviu.2000.0835openalex-snapshot
Image Analysis and Computer Vision: 1999
inferred← citeshttps://doi.org/10.1007/3-540-45351-2_26openalex-snapshot
Hybrid Geodesics as Optimal Solutions to the Collision-Free Motion Planning Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-16595-0_1openalex-snapshot
Efficient Multi-robot Motion Planning for Unlabeled Discs in Simple Polygons
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1007/978-3-319-76072-8_4openalex-snapshot
Path Planning for a Formation of Mobile Robots with Split and Merge
inferred← citeshttps://doi.org/10.1007/978-3-540-45058-0_14openalex-snapshot
Coordinating Multiple Robots with Kinodynamic Constraints along Specified Paths
inferred← citeshttps://doi.org/10.1007/978-3-642-28572-1_51openalex-snapshot
Any-Com Multi-robot Path-Planning with Dynamic Teams: Multi-robot Coordination under Communication Constraints
inferred← citeshttps://doi.org/10.1007/978-3-658-37711-3_7openalex-snapshot
Weiterführende Ergebnisse
inferred← citeshttps://doi.org/10.1017/cbo9780511546877.009openalex-snapshot
Extensions of Basic Motion Planning
inferred← citeshttps://doi.org/10.1017/s0263574709005773openalex-snapshot
Offline decoupled path planning approach for effective coordination of multiple robots
inferred← citeshttps://doi.org/10.1088/1742-6596/2390/1/012109openalex-snapshot
Research on path planning and scheduling of multi AGVs based on a two-way dual path map
inferred← citeshttps://doi.org/10.1109/iccas.2014.6987833openalex-snapshot
Reaction force based grasping position estimation of multi-teleoperated robots for pipe installation in offshore plants
inferred← citeshttps://doi.org/10.1109/ichr.2010.5686844openalex-snapshot
Planning multi-robot grasping motions
inferred← citeshttps://doi.org/10.1109/icinfa.2006.374133openalex-snapshot
A New Fuzzy Path Planning For Multiple Robots
inferred← citeshttps://doi.org/10.1109/ictai52525.2021.00017openalex-snapshot
Collision-aware Multi-robot Motion Coordination Deep-RL with Dynamic Priority Strategy
inferred← citeshttps://doi.org/10.1109/iros.1995.525801openalex-snapshot
Cooperative mobile robotics: antecedents and directions
inferred← citeshttps://doi.org/10.1109/iros.2005.1545603openalex-snapshot
Path planning for pushing a disk using compliance
inferred← citeshttps://doi.org/10.1109/iros.2006.282536openalex-snapshot
Multi-Robot Motion Planning by Incremental Coordination
inferred← citeshttps://doi.org/10.1109/iros.2007.4399287openalex-snapshot
Reactive deformation roadmaps: motion planning of multiple robots in dynamic environments
inferred← citeshttps://doi.org/10.1109/iros.2010.5649438openalex-snapshot
Decentralized prioritized planning in large multirobot teams
inferred← citeshttps://doi.org/10.1109/lra.2018.2800116openalex-snapshot
Efficient, High-Quality Stack Rearrangement
inferred← citeshttps://doi.org/10.1109/robot.2002.1014852openalex-snapshot
Using a PRM planner to compare centralized and decoupled planning for multi-robot systems
inferred← citeshttps://doi.org/10.1109/robot.2004.1308892openalex-snapshot
Exact Pareto-optimal coordination of two translating polygonal robots on an acyclic roadmap
inferred← citeshttps://doi.org/10.1109/robot.2009.5152765openalex-snapshot
Multi-robot coordination using generalized social potential fields
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/tro.2007.898967openalex-snapshot
Pushing a Disk Using Compliance
inferred← citeshttps://doi.org/10.1109/wcica.2004.1342412openalex-snapshot
Multi mobile robot path planning based on genetic algorithm
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.1137/s0363012901387562openalex-snapshot
Optimal Coordinated Motions of Multiple Agents Moving on a Plane
inferred← citeshttps://doi.org/10.1177/027836402320556458openalex-snapshot
On Delaying Collision Checking in PRM Planning: Application to Multi-Robot Coordination
inferred← citeshttps://doi.org/10.1177/0278364905051974openalex-snapshot
Coordinating Multiple Robots with Kinodynamic Constraints Along Specified Paths
inferred← citeshttps://doi.org/10.1177/0278364913506268openalex-snapshot
k -color multi-robot motion planning
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/0278364918780999openalex-snapshot
Complexity Results and Fast Methods for Optimal Tabletop Rearrangement with Overhand Grasps
inferred← citeshttps://doi.org/10.1177/0278364918784660openalex-snapshot
Effective metrics for multi-robot motion-planning
inferred← citeshttps://doi.org/10.15607/rss.2009.v.018openalex-snapshot
Centralized path planning for multiple robots: Optimal decoupling into sequential plans
inferred← citeshttps://doi.org/10.15607/rss.2015.xi.011openalex-snapshot
Motion Planning for Unlabeled Discs with Optimality Guarantees
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.33414/rtyc.37.166-176.2020openalex-snapshot
Planificador jerárquico de trayectorias para sistemas multi-robots
inferred← citeshttps://doi.org/10.4018/978-1-5225-0245-6.ch015openalex-snapshot
Conflict Resolution in Robotics
inferred← citeshttps://doi.org/10.48550/arxiv.1305.2889openalex-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.48550/arxiv.1404.6573openalex-snapshot
Similar Part Rearrangement With Pebble Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1705.10300openalex-snapshot
Effective Metrics for Multi-Robot Motion-Planning
inferred← citeshttps://doi.org/10.5772/8983openalex-snapshot
Multi-Robot Collective Path Finding in Dynamic Environments
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.