On the public citation graph
Centralized path planning for multiple robots: Optimal decoupling into sequential plans
0 signed · 187 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-94-011-1590-2openalex-snapshot
Theory of Automatic Robot Assembly and Programming
inferredcites →https://doi.org/10.1007/bf02574386openalex-snapshot
Objects that cannot be taken apart with two hands
inferredcites →https://doi.org/10.1007/pl00009476openalex-snapshot
Motion Planning for Multiple Robots
inferredcites →https://doi.org/10.1007/s004539910025openalex-snapshot
A General Framework for Assembly Planning: The Motion Space Approach
inferredcites →https://doi.org/10.1016/0004-3702(94)90048-5openalex-snapshot
Geometric reasoning about mechanical assembly
inferredcites →https://doi.org/10.1016/s0921-8890(02)00256-7openalex-snapshot
Finding and optimizing solvable priority schemes for decoupled path planning techniques for teams of mobile robots
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.508439openalex-snapshot
Probabilistic roadmaps for path planning in high-dimensional configuration spaces
inferredcites →https://doi.org/10.1109/70.736775openalex-snapshot
Optimal motion planning for multiple robots having independent goals
inferredcites →https://doi.org/10.1109/70.988973openalex-snapshot
Path coordination for multiple mobile robots: a resolution-complete algorithm
inferredcites →https://doi.org/10.1109/iros.2005.1545306openalex-snapshot
Prioritized motion planning for multiple robots
inferredcites →https://doi.org/10.1109/iros.2006.282536openalex-snapshot
Multi-Robot Motion Planning by Incremental Coordination
inferredcites →https://doi.org/10.1109/robot.1986.1087401openalex-snapshot
On multiple moving objects
inferredcites →https://doi.org/10.1109/robot.1989.100008openalex-snapshot
Fast motion planning for multiple moving 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.1995.525645openalex-snapshot
Multi-robot cooperation through incremental plan-merging
inferredcites →https://doi.org/10.1109/robot.2001.932818openalex-snapshot
Disassembly sequencing using a motion planning approach
inferredcites →https://doi.org/10.1109/robot.2002.1014852openalex-snapshot
Using a PRM planner to compare centralized and decoupled planning for multi-robot systems
inferredcites →https://doi.org/10.1109/robot.2003.1242251openalex-snapshot
Motion planning for a crowd of robots
inferredcites →https://doi.org/10.1109/robot.2003.1242252openalex-snapshot
Motion planning for multiple mobile robots using dynamic networks
inferredcites →https://doi.org/10.1109/robot.2005.1570148openalex-snapshot
Motion Planning of Multiple Agents in Virtual Environments using Coordination Graphs
inferredcites →https://doi.org/10.1109/tro.2008.918056openalex-snapshot
A Complete and Scalable Strategy for Coordinating Multiple Robots Within Roadmaps
inferredcites →https://doi.org/10.1177/0278364905051974openalex-snapshot
Coordinating Multiple Robots with Kinodynamic Constraints Along Specified Paths
inferredcites →https://doi.org/10.1201/9781439864135-43openalex-snapshot
Rapidly-Exploring Random Trees: Progress and Prospects
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-31993-9_18openalex-snapshot
On Randomized Searching for Multi-robot Coordination
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-66723-8_15openalex-snapshot
Synchronized Multi-arm Rearrangement Guided by Mode Graphs with Capacity Constraints
inferred← citeshttps://doi.org/10.1007/978-3-030-66723-8_30openalex-snapshot
Visualizing Local Minima in Multi-robot Motion Planning Using Multilevel Morse Theory
inferred← citeshttps://doi.org/10.1007/978-3-030-98574-5_2openalex-snapshot
Introduction to UAS Traffic Management
inferred← citeshttps://doi.org/10.1007/978-3-031-59057-3_1openalex-snapshot
Compute Optimal Waiting Times for Collaborative Route Planning
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-03413-3_29openalex-snapshot
Multi-robot Operation System with Conflict Resolution
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-16595-0_42openalex-snapshot
Pebble Motion on Graphs with Rotations: Efficient Feasibility Tests and Planning Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-25524-8_14openalex-snapshot
Multi-agent Path Planning in Known Dynamic Environments
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-319-60916-4_34openalex-snapshot
A Complete Algorithm for Generating Safe Trajectories for Multi-robot Teams
inferred← citeshttps://doi.org/10.1007/978-3-319-67113-0_10openalex-snapshot
Sampling-Based Path Planning for Multi-robot Systems with Co-Safe Linear Temporal Logic Specifications
inferred← citeshttps://doi.org/10.1007/978-3-319-93581-2_7openalex-snapshot
Variants of Independence Detection in SAT-Based Optimal Multi-agent Path Finding
inferred← citeshttps://doi.org/10.1007/978-3-642-23181-0_19openalex-snapshot
PROSA and Delegate MAS in Robotics
inferred← citeshttps://doi.org/10.1007/978-3-642-33971-4_10openalex-snapshot
M*: A Complete Multirobot Path Planning Algorithm with Optimality Bounds
inferred← citeshttps://doi.org/10.1007/978-3-642-36279-8_10openalex-snapshot
Multi-agent Path Planning and Network Flow
inferred← citeshttps://doi.org/10.1007/978-3-642-36279-8_12openalex-snapshot
k-Color Multi-robot Motion Planning
inferred← citeshttps://doi.org/10.1007/978-3-642-41610-1_232-1openalex-snapshot
Multi-agent Pathfinding
inferred← citeshttps://doi.org/10.1007/978-3-642-44927-7_13openalex-snapshot
A Human-Inspired Collision Avoidance Method for Multi-robot and Mobile Autonomous Robots
inferred← citeshttps://doi.org/10.1007/978-981-13-1135-2_13openalex-snapshot
Path Planning for Multiple Mobile Robots by Priority Assignment
inferred← citeshttps://doi.org/10.1007/s10458-014-9259-zopenalex-snapshot
An iterative approach for makespan-minimized multi-agent path planning in discrete space
inferred← citeshttps://doi.org/10.1007/s10458-016-9343-7openalex-snapshot
The joint movement of pebbles in solving the ( $$N^2-1$$ N 2 - 1 )-puzzle suboptimally and its applications in rule-based cooperative path-finding
inferred← citeshttps://doi.org/10.1007/s10489-014-0598-xopenalex-snapshot
Automated robotic parking systems: real-time, concurrent and multi-robot path planning in dynamic environments
inferred← citeshttps://doi.org/10.1007/s10514-012-9275-2openalex-snapshot
Decentralized path planning for multi-agent teams with complex constraints
inferred← citeshttps://doi.org/10.1007/s10514-014-9412-1openalex-snapshot
Goal assignment and trajectory planning for large teams of interchangeable robots
inferred← citeshttps://doi.org/10.1007/s10514-018-9714-9openalex-snapshot
Dynamic teams of robots as ad hoc distributed computers: reducing the complexity of multi-robot motion planning via subspace selection
inferred← citeshttps://doi.org/10.1007/s10514-018-9718-5openalex-snapshot
Bound to help: cooperative manipulation of objects via compliant, unactuated tails
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/s10846-019-01084-0openalex-snapshot
Distributed Cooperative Obstacle Avoidance for Mobile Robots Using Independent Virtual Center Points
inferred← citeshttps://doi.org/10.1007/s11081-022-09719-2openalex-snapshot
An integrated rolling horizon and adaptive-refinement approach for disjoint trajectories optimization
inferred← citeshttps://doi.org/10.1007/s11227-025-06960-1openalex-snapshot
Multi-robot Collaborative 3D Path Planning Based On Game Theory and Particle Swarm Optimization Hybrid Method
inferred← citeshttps://doi.org/10.1007/s11370-021-00350-1openalex-snapshot
Visiting pebbles on rectangular grids: coordinating multiple robots in mobile fulfilment systems
inferred← citeshttps://doi.org/10.1007/s11370-021-00363-wopenalex-snapshot
Coordination of multi-robot path planning for warehouse application using smart approach for identifying destinations
inferred← citeshttps://doi.org/10.1007/s11390-014-1469-yopenalex-snapshot
Crowd Simulation and Its Applications: Recent Advances
inferred← citeshttps://doi.org/10.1007/s40747-023-01088-2openalex-snapshot
A decoupling method for solving the multi-agent path finding problem
inferred← citeshttps://doi.org/10.1007/s42452-020-3093-5openalex-snapshot
Robot path planning based on laser range finder and novel objective functions in grey wolf optimizer
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.artint.2014.11.001openalex-snapshot
Subdimensional expansion for multirobot path planning
inferred← citeshttps://doi.org/10.1016/j.asoc.2015.01.046openalex-snapshot
A stochastic algorithm for makespan minimized multi-agent path planning in discrete space
inferred← citeshttps://doi.org/10.1016/j.cja.2018.08.012openalex-snapshot
Exploring mission planning method for a team of carrier aircraft launching
inferred← citeshttps://doi.org/10.1016/j.disopt.2024.100837openalex-snapshot
The non-stop disjoint trajectories problem
inferred← citeshttps://doi.org/10.1016/j.eswa.2021.115128openalex-snapshot
Multirobot coordination with deep reinforcement learning in complex environments
inferred← citeshttps://doi.org/10.1016/j.robot.2017.01.008openalex-snapshot
Decentralized safe conflict resolution for multiple robots in dense scenarios
inferred← citeshttps://doi.org/10.1016/j.robot.2020.103534openalex-snapshot
Dynamic prioritized motion coordination of multi-AGV systems
inferred← citeshttps://doi.org/10.1017/s0263574711000142openalex-snapshot
Parameterized collision region for centralized motion planning of multiagents along specified paths
inferred← citeshttps://doi.org/10.1017/s0263574723000322openalex-snapshot
A comprehensive review of the latest path planning developments for multi-robot formation systems
inferred← citeshttps://doi.org/10.1080/17452759.2022.2162929openalex-snapshot
Teams of robots in additive manufacturing: a review
inferred← citeshttps://doi.org/10.1080/17452759.2024.2433588openalex-snapshot
Mobile robotics and 3D printing: addressing challenges in path planning and scalability
inferred← citeshttps://doi.org/10.1109/access.2022.3151092openalex-snapshot
An Adaptive Agent-Specific Sub-Optimal Bounding Approach for Multi-Agent Path Finding
inferred← citeshttps://doi.org/10.1109/bigdata59044.2023.10386672openalex-snapshot
General Concepts in Swarm of Drones Control: Analysis and Implementation
inferred← citeshttps://doi.org/10.1109/cac48633.2019.8997273openalex-snapshot
Coupling-Degree-Based Heuristic Prioritized Planning Method for UAV Swarm Path Generation
inferred← citeshttps://doi.org/10.1109/cdc.2012.6426233openalex-snapshot
Distance optimal formation control on graphs with a tight convergence time guarantee
inferred← citeshttps://doi.org/10.1109/cdc.2013.6760303openalex-snapshot
Shortest path set induced vertex ordering and its application to distributed distance optimal formation path planning and control on graphs
inferred← citeshttps://doi.org/10.1109/cdc.2017.8264538openalex-snapshot
Optimal multi-robot path planning for pesticide spraying in agricultural fields
inferred← citeshttps://doi.org/10.1109/cimsim.2011.43openalex-snapshot
Centralized Decoupled Path Planning Algorithm for Multiple Robots Using the Temporary Goal Configurations
inferred← citeshttps://doi.org/10.1109/icacci.2016.7732373openalex-snapshot
Bluetooth RSSI based collision avoidance in multirobot environment
inferred← citeshttps://doi.org/10.1109/icar.2013.6766474openalex-snapshot
Decentralized collision avoidance for large teams of robots
inferred← citeshttps://doi.org/10.1109/iccect60629.2024.10545932openalex-snapshot
The Group-Based Distributed Auction Algorithms for Multi-Robot Task Assignment
inferred← citeshttps://doi.org/10.1109/icra.2013.6631083openalex-snapshot
Efficient formation path planning on large graphs
inferred← citeshttps://doi.org/10.1109/icra.2013.6631084openalex-snapshot
Planning optimal paths for multiple robots on graphs
inferred← citeshttps://doi.org/10.1109/icra.2015.7138977openalex-snapshot
Decentralized cooperative mean approach to collision avoidance for nonholonomic mobile robots
inferred← citeshttps://doi.org/10.1109/icra.2016.7487147openalex-snapshot
Proxemic group behaviors using reciprocal multi-agent navigation
inferred← citeshttps://doi.org/10.1109/icra.2016.7487581openalex-snapshot
Efficiently solving general rearrangement tasks: A fast extension primitive for an incremental sampling-based planner
inferred← citeshttps://doi.org/10.1109/icra.2017.7989507openalex-snapshot
Efficient multi-agent global navigation using interpolating bridges
inferred← citeshttps://doi.org/10.1109/icra46639.2022.9811934openalex-snapshot
Efficient and High-quality Prehensile Rearrangement in Cluttered and Confined Spaces
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/icra46639.2022.9812367openalex-snapshot
Fast High-Quality Tabletop Rearrangement in Bounded Workspace
inferred← citeshttps://doi.org/10.1109/icra48506.2021.9561716openalex-snapshot
Uniform Object Rearrangement: From Complete Monotone Primitives to Efficient Non-Monotone Informed Search
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/icra55743.2025.11127905openalex-snapshot
Planning for Tabletop Object Rearrangement
inferred← citeshttps://doi.org/10.1109/icstm.2017.8089197openalex-snapshot
Survey on prioritized multi robot path planning
inferred← citeshttps://doi.org/10.1109/icuas.2019.8798157openalex-snapshot
A Lane-Based Approach for Large-Scale Strategic Conflict Management for UAS Service Suppliers
inferred← citeshttps://doi.org/10.1109/icus48101.2019.8996027openalex-snapshot
Distributed Trajectory Generation for Multi-Quadrotors Using Receding Horizon Control and Sequential Convex Programming
inferred← citeshttps://doi.org/10.1109/infocomtech.2017.8340595openalex-snapshot
Prioritized multi robot path planning in presence of dynamic obstacles
inferred← citeshttps://doi.org/10.1109/interact.2010.5706221openalex-snapshot
Analysis of a novel chemotaxis inspired locomotion strategy for miniaturized mobile nodes in a heterogeneous environment
inferred← citeshttps://doi.org/10.1109/irc.2018.00034openalex-snapshot
Optimal Trajectory and Schedule Planning for Autonomous Guided Vehicles in Flexible Manufacturing System
inferred← citeshttps://doi.org/10.1109/iros.2010.5649064openalex-snapshot
Network-guided multi-robot path planning in discrete representations
inferred← citeshttps://doi.org/10.1109/iros.2010.5649438openalex-snapshot
Decentralized prioritized planning in large multirobot teams
inferred← citeshttps://doi.org/10.1109/iros.2011.6048846openalex-snapshot
Efficient and complete centralized multi-robot path planning
inferred← citeshttps://doi.org/10.1109/iros.2011.6095022openalex-snapshot
M*: A complete multirobot path planning algorithm with performance bounds
inferred← citeshttps://doi.org/10.1109/iros.2011.6095085openalex-snapshot
Efficient and complete centralized multi-robot path planning
inferred← citeshttps://doi.org/10.1109/iros.2012.6386147openalex-snapshot
Finding graph topologies for feasible multirobot motion planning
inferred← citeshttps://doi.org/10.1109/iros.2016.7759300openalex-snapshot
Safe and complete trajectory generation for robot teams with higher-order dynamics
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/iros45743.2020.9341213openalex-snapshot
Multi-Robot Coordinated Planning in Confined Environments under Kinematic Constraints
inferred← citeshttps://doi.org/10.1109/iros45743.2020.9341805openalex-snapshot
DeepMNavigate: Deep Reinforced Multi-Robot Navigation Unifying Local & Global Collision Avoidance
inferred← citeshttps://doi.org/10.1109/iros47612.2022.9981715openalex-snapshot
Toward Efficient Task Planning for Dual-Arm Tabletop Object Rearrangement
inferred← citeshttps://doi.org/10.1109/isma.2013.6547396openalex-snapshot
Optimized D∗ algorithm with two phase motion in unknown damaged indoor environments
inferred← citeshttps://doi.org/10.1109/itsc.2019.8916906openalex-snapshot
Push, Stop, and Replan: An Application of Pebble Motion on Graphs to Planning in Automated Warehouses
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.3067851openalex-snapshot
VR-ORCA: Variable Responsibility Optimal Reciprocal Collision Avoidance
inferred← citeshttps://doi.org/10.1109/lra.2024.3358623openalex-snapshot
MCCA: A Decentralized Method for Collision and Deadlock Avoidance With Nonholonomic Robots
inferred← citeshttps://doi.org/10.1109/lra.2025.3598672openalex-snapshot
TaskSimLF: Efficient Leader-Follower Multi-Agent Path Finding With Clustered Pickup and Delivery
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.2017.8250940openalex-snapshot
Scalable asymptotically-optimal multi-robot motion planning
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/mrs.2019.8901083openalex-snapshot
Anytime Multi-arm Task and Motion Planning for Pick-and-Place of Individual Objects via Handoffs
inferred← citeshttps://doi.org/10.1109/mrs66243.2025.11357248openalex-snapshot
Bandwidth-Aware Multi-Robot Coordination with Utility-Guided Coalition Formation
inferred← citeshttps://doi.org/10.1109/sbr-lars.2012.51openalex-snapshot
Using Space D* for Crowded Real Robots Environments
inferred← citeshttps://doi.org/10.1109/smc.2019.8913959openalex-snapshot
Minimizing Task Completion Time of Prioritized Motion Planning in Multi-Robot Systems
inferred← citeshttps://doi.org/10.1109/southeastcon42311.2019.9020456openalex-snapshot
Distributed Coordination of Autonomous Guided Vehicles in Multi-agent Systems with Shared Resources
inferred← citeshttps://doi.org/10.1109/tase.2012.2200102openalex-snapshot
Real-Time Path Planning for Coordinated Transport of Multiple Particles Using Optical Tweezers
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.2016.2593448openalex-snapshot
Optimal Multirobot Path Planning on Graphs: Complete Algorithms and Effective Heuristics
inferred← citeshttps://doi.org/10.1109/tro.2022.3198020openalex-snapshot
Long-Horizon Multi-Robot Rearrangement Planning for Construction Assembly
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/3019612.3019708openalex-snapshot
An asynchronous distributed constraint optimization approach to multi-robot path planning with complex constraints
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/0278364917741532openalex-snapshot
Hold Or take Optimal Plan (HOOP): A quadratic programming approach to multi-robot trajectory generation
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/02783649231178565openalex-snapshot
Minimizing running buffers for tabletop object rearrangement: Complexity, fast algorithms, and applications
inferred← citeshttps://doi.org/10.1515/pjbr-2018-0014openalex-snapshot
Multi-robot Voronoi tessellation based area partitioning algorithm study
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.2015.xi.045openalex-snapshot
Dealing with Difficult Instances of Object Rearrangement
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.2021.xvii.014openalex-snapshot
Rearrangement on Lattices with Swaps: Optimality Structures and Efficient Algorithms
inferred← citeshttps://doi.org/10.15607/rss.2021.xvii.033openalex-snapshot
On Minimizing the Number of Running Buffers for Tabletop Rearrangement
inferred← citeshttps://doi.org/10.1609/aaai.v25i1.8041openalex-snapshot
An Efficient and Complete Approach for Cooperative Path-Finding
inferred← citeshttps://doi.org/10.1609/socs.v10i1.18497openalex-snapshot
On SAT-Based Approaches for Multi-Agent Path Finding with the Sum-of-Costs Objective
inferred← citeshttps://doi.org/10.1609/socs.v15i1.21769openalex-snapshot
Learning a Priority Ordering for Prioritized Planning in Multi-Agent Path Finding
inferred← citeshttps://doi.org/10.1609/socs.v2i1.18209openalex-snapshot
Efficient and Complete Centralized Multi-Robot Path Planning
inferred← citeshttps://doi.org/10.1609/socs.v3i1.18243openalex-snapshot
Multi-Agent Pathfinding with Simultaneous Execution of Single-Agent Primitives
inferred← citeshttps://doi.org/10.17587/mau.21.420-427openalex-snapshot
Collision Avoidance System Synthesis for a Group of Robots in Unsupervised Learning Paradigm
inferred← citeshttps://doi.org/10.21203/rs.3.rs-5185711/v1openalex-snapshot
Article Title]{Multi-Robot Collaborative 3D Path Planning Based On Game Theory and Particle Swarm Optimization Hybrid Method
inferred← citeshttps://doi.org/10.23919/acc.2019.8814874openalex-snapshot
Multi-agent trajectory planning: A decentralized iterative algorithm based on single-agent dynamic RRT*
inferred← citeshttps://doi.org/10.23919/jsee.2025.000087openalex-snapshot
Hierarchical Cooperative Path Planning Method Using Three-Dimensional Velocity-Obstacle Strategy for Multiple Fixed-Wing UAVs
inferred← citeshttps://doi.org/10.3384/diss.diva-173940openalex-snapshot
Trajectory Planning for an Autonomous Vehicle in Multi-Vehicle Traffic Scenarios
inferred← citeshttps://doi.org/10.3390/robotics8020035openalex-snapshot
A Time-Efficient Co-Operative Path Planning Model Combined with Task Assignment for Multi-Agent Systems
inferred← citeshttps://doi.org/10.4018/978-1-5225-0245-6.ch015openalex-snapshot
Conflict Resolution in Robotics
inferred← citeshttps://doi.org/10.47606/acven/ph0383openalex-snapshot
Fundamentals of applied robotics: an integrated guide on control, programming and training
inferred← citeshttps://doi.org/10.48550/arxiv.1205.0207openalex-snapshot
Shortest Path Set Induced Vertex Ordering and its Application to Distributed Distance Optimal Multi-agent Formation Path Planning
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.1610.04964openalex-snapshot
Improvements in Sub-optimal Solving of the $(N^2-1)$-Puzzle via Joint Relocation of Pebbles and its Applications to Rule-based Cooperative Path-Finding
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.1810.03071openalex-snapshot
Towards Search-based Motion Planning for Micro Aerial Vehicles
inferred← citeshttps://doi.org/10.48550/arxiv.2101.12241openalex-snapshot
Uniform Object Rearrangement: From Complete Monotone Primitives to Efficient Non-Monotone Informed Search
inferred← citeshttps://doi.org/10.48550/arxiv.2102.12684openalex-snapshot
Ensuring Progress for Multiple Mobile Robots via Space Partitioning, Motion Rules, and Adaptively Centralized Conflict Resolution
inferred← citeshttps://doi.org/10.48550/arxiv.2108.03368openalex-snapshot
Multi-Robot Path Planning in Complex Environments via Graph Embedding
inferred← citeshttps://doi.org/10.5220/0006126000850095openalex-snapshot
Integration of Independence Detection into SAT-based Optimal Multi-Agent Path Finding - A Novel SAT-based Optimal MAPF Solver
inferred← citeshttps://doi.org/10.5220/0006865901810189openalex-snapshot
Improved Discrete RRT for Coordinated Multi-robot Planning
inferred← citeshttps://doi.org/10.54254/2755-2721/5/20230640openalex-snapshot
The characters and advantages of different algorithms in multi-robot path planning
inferred← citeshttps://doi.org/10.54254/2755-2721/50/20241229openalex-snapshot
The evolution and current frontiers of path planning algorithms for mobile robots: A comprehensive review
inferred← citeshttps://doi.org/10.55041/ijsrem25663openalex-snapshot
Analysis using a Model-Based Approach of Path Planning for Multiple Uavs in the Context of Surveying Building Damage Following a Disaster
inferred← citeshttps://doi.org/10.5591/978-1-57735-516-8/ijcai11-059openalex-snapshot
Push and swap: fast cooperative path-finding with completeness guarantees
inferred← citeshttps://doi.org/10.61263/mjes.v2i2.57openalex-snapshot
Comparative Analysis of GA-PRM Algorithm Performance in Simulation and Real-World Robotics Applications
inferred← citeshttps://doi.org/10.65109/uffx4790openalex-snapshot
A Scheduling-Based Approach to Multi-Agent Path Finding with Weighted and Capacitated Arcs
inferred← citeshttps://doi.org/10.70675/2fb25917z088dz4401z8fa8z9672b7fba3bcopenalex-snapshot
Planning of visual servoing tasks for robotics
inferred← citeshttps://doi.org/10.7282/t35x2d2kopenalex-snapshot
Compact representations for efficient robot motion planning with formal guarantees
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.