Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
1904.02598
Cited By
v1
v2 (latest)
DDM: Fast Near-Optimal Multi-Robot Path Planning using Diversified-Path and Optimal Sub-Problem Solution Database Heuristics
4 April 2019
Shuai D. Han
Jingjin Yu
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"DDM: Fast Near-Optimal Multi-Robot Path Planning using Diversified-Path and Optimal Sub-Problem Solution Database Heuristics"
5 / 5 papers shown
Title
Enhancing Lifelong Multi-Agent Path-finding by Using Artificial Potential Fields
Arseniy Pertzovsky
Roni Stern
Ariel Felner
Roie Zivan
AI4CE
22
0
0
28 May 2025
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
84
6
0
06 Jul 2022
Sub-1.5 Time-Optimal Multi-Robot Path Planning on Grids in Polynomial Time
Teng Guo
Jingjin Yu
96
17
0
22 Jan 2022
Spatial and Temporal Splitting Heuristics for Multi-Robot Motion Planning
Teng Guo
Shuai D. Han
Jingjin Yu
33
10
0
25 Mar 2021
Lifelong Multi-Agent Path Finding in Large-Scale Warehouses
Jiaoyang Li
Andrew Tinka
Scott Kiesel
Joseph W. Durham
T. K. S. Kumar
Sven Koenig
AI4CE
87
239
0
15 May 2020
1