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. 2408.05385
  4. Cited By
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

9 August 2024
Teng Guo
Jingjin Yu
    AI4CE
ArXivPDFHTML

Papers citing "Expected $1.x$-Makespan-Optimal MAPF on Grids in Low-Poly Time"

2 / 2 papers shown
Title
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
29
16
0
22 Jan 2022
PRIMAL2: Pathfinding via Reinforcement and Imitation Multi-Agent
  Learning -- Lifelong
PRIMAL2: Pathfinding via Reinforcement and Imitation Multi-Agent Learning -- Lifelong
Mehul Damani
Zhiyao Luo
Emerson Wenzel
Guillaume Sartoretti
AI4CE
94
120
0
16 Oct 2020
1