ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1801.01689
  4. Cited By
Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots
  with Bounded Stretch

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

5 January 2018
Erik D. Demaine
S. Fekete
Phillip Keldenich
H. Meijer
Christian Scheffer
ArXivPDFHTML

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

26 / 26 papers shown
Title
Optimally Solving Colored Generalized Sliding-Tile Puzzles: Complexity
  and Bounds
Optimally Solving Colored Generalized Sliding-Tile Puzzles: Complexity and Bounds
Marcus Gozon
Jingjin Yu
26
0
0
19 Oct 2024
Ten Problems in Geobotics
Ten Problems in Geobotics
Mikkel Abrahamsen
Dan Halperin
52
0
0
22 Aug 2024
Expected $1.x$-Makespan-Optimal MAPF on Grids in Low-Poly Time
Expected 1.x1.x1.x-Makespan-Optimal MAPF on Grids in Low-Poly Time
Teng Guo
Jingjin Yu
AI4CE
46
1
0
09 Aug 2024
On Computing Makespan-Optimal Solutions for Generalized Sliding-Tile
  Puzzles
On Computing Makespan-Optimal Solutions for Generalized Sliding-Tile Puzzles
Marcus Gozon
Jingjin Yu
20
4
0
18 Dec 2023
The Parameterized Complexity of Coordinated Motion Planning
The Parameterized Complexity of Coordinated Motion Planning
E. Eiben
R. Ganian
Iyad A. Kanj
23
9
0
12 Dec 2023
Near-Optimal Min-Sum Motion Planning for Two Square Robots in a
  Polygonal Environment
Near-Optimal Min-Sum Motion Planning for Two Square Robots in a Polygonal Environment
Pankaj K. Agarwal
Dan Halperin
M. Sharir
Alex Steiger
15
4
0
31 Oct 2023
Fine-Grained Complexity Analysis of Multi-Agent Path Finding on 2D Grids
Fine-Grained Complexity Analysis of Multi-Agent Path Finding on 2D Grids
Tzvika Geft
13
3
0
25 May 2023
Collision Detection for Modular Robots -- it is easy to cause collisions
  and hard to avoid them
Collision Detection for Modular Robots -- it is easy to cause collisions and hard to avoid them
Siddharth Gupta
M. V. Kreveld
O. Michail
Andreas Padalkin
17
4
0
01 May 2023
Coordination of Multiple Robots along Given Paths with Bounded Junction
  Complexity
Coordination of Multiple Robots along Given Paths with Bounded Junction Complexity
Mikkel Abrahamsen
Tzvika Geft
Dan Halperin
Barak Ugav
23
6
0
01 Mar 2023
Reconfiguration of a 2D Structure Using Spatio-Temporal Planning and
  Load Transferring
Reconfiguration of a 2D Structure Using Spatio-Temporal Planning and Load Transferring
Javier Garcia
Michael Yannuzzi
Peter Kramer
Christian Rieck
S. Fekete
Aaron T. Becker
17
1
0
16 Nov 2022
Multi-Robot Motion Planning for Unit Discs with Revolving Areas
Multi-Robot Motion Planning for Unit Discs with Revolving Areas
P. Agarwal
Tzvika Geft
Dan Halperin
Erin Taylor
25
5
0
30 Sep 2022
Efficiently Reconfiguring a Connected Swarm of Labeled Robots
Efficiently Reconfiguring a Connected Swarm of Labeled Robots
S. Fekete
Peter Kramer
Christian Rieck
Christian Scheffer
Arne Schmidt
6
6
0
22 Sep 2022
Polynomial Time Near-Time-Optimal Multi-Robot Path Planning in Three
  Dimensions with Applications to Large-Scale UAV Coordination
Polynomial Time Near-Time-Optimal Multi-Robot Path Planning in Three Dimensions with Applications to Large-Scale UAV Coordination
Teng Guo
S. Feng
Jingjin Yu
34
6
0
06 Jul 2022
Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds
Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds
Bahareh Banyassady
Mark de Berg
K. Bringmann
K. Buchin
Henning Fernau
Dan Halperin
Irina Kostitsyna
Y. Okamoto
Stijn Slot
37
10
0
16 May 2022
Refined Hardness of Distance-Optimal Multi-Agent Path Finding
Refined Hardness of Distance-Optimal Multi-Agent Path Finding
Tzvika Geft
Dan Halperin
OT
8
14
0
14 Mar 2022
Leveraging Experience in Lifelong Multi-Agent Pathfinding
Leveraging Experience in Lifelong Multi-Agent Pathfinding
Nitzan Madar
Kiril Solovey
Oren Salzman
6
5
0
09 Feb 2022
Sub-1.5 Time-Optimal Multi-Robot Path Planning on Grids in Polynomial
  Time
Sub-1.5 Time-Optimal Multi-Robot Path Planning on Grids in Polynomial Time
Teng Guo
Jingjin Yu
42
16
0
22 Jan 2022
Reconfiguring Shortest Paths in Graphs
Reconfiguring Shortest Paths in Graphs
Kshitij Gajjar
A. Jha
Manish Kumar
A. Lahiri
14
10
0
14 Dec 2021
Coordination of two robotic manipulators for object retrieval in clutter
Coordination of two robotic manipulators for object retrieval in clutter
Jeeho Ahn
Changhwan Kim
Changjoo Nam
34
14
0
30 Sep 2021
Computing Coordinated Motion Plans for Robot Swarms: The CG:SHOP
  Challenge 2021
Computing Coordinated Motion Plans for Robot Swarms: The CG:SHOP Challenge 2021
S. Fekete
Phillip Keldenich
Dominik Krupke
Joseph S. B. Mitchell
14
20
0
29 Mar 2021
Shadoks Approach to Low-Makespan Coordinated Motion Planning
Shadoks Approach to Low-Makespan Coordinated Motion Planning
Loïc Crombez
G. D. D. Fonseca
Y. Gérard
Aldo González-Lorenzo
Pascal Lafourcade
Luc Libralesso
13
18
0
25 Mar 2021
Rubik Tables and Object Rearrangement
Rubik Tables and Object Rearrangement
M. Szegedy
Jingjin Yu
8
6
0
12 Feb 2020
Motion Planning for Multiple Unit-Ball Robots in $\mathbb{R}^d$
Motion Planning for Multiple Unit-Ball Robots in Rd\mathbb{R}^dRd
I. Solomon
Dan Halperin
14
9
0
14 Jul 2018
Constant Factor Time Optimal Multi-Robot Routing on High-Dimensional
  Grids in Mostly Sub-Quadratic Time
Constant Factor Time Optimal Multi-Robot Routing on High-Dimensional Grids in Mostly Sub-Quadratic Time
Jingjin Yu
30
26
0
31 Jan 2018
Discrete configuration spaces of squares and hexagons
Discrete configuration spaces of squares and hexagons
H. Alpert
17
8
0
20 Apr 2017
Decentralized Non-communicating Multiagent Collision Avoidance with Deep
  Reinforcement Learning
Decentralized Non-communicating Multiagent Collision Avoidance with Deep Reinforcement Learning
Yu Fan Chen
Miao Liu
Michael Everett
Jonathan P. How
189
583
0
26 Sep 2016
1