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. 2305.03632
  4. Cited By
Improving LaCAM for Scalable Eventually Optimal Multi-Agent Pathfinding

Improving LaCAM for Scalable Eventually Optimal Multi-Agent Pathfinding

5 May 2023
Keisuke Okumura
ArXivPDFHTML

Papers citing "Improving LaCAM for Scalable Eventually Optimal Multi-Agent Pathfinding"

4 / 4 papers shown
Title
Multi-Agent Path Finding via Finite-Horizon Hierarchical Factorization
Multi-Agent Path Finding via Finite-Horizon Hierarchical Factorization
Jiarui Li
A. Zanardi
G. Zardini
AI4CE
36
0
0
12 May 2025
Anytime Multi-Agent Path Finding with an Adaptive Delay-Based Heuristic
Anytime Multi-Agent Path Finding with an Adaptive Delay-Based Heuristic
Thomy Phan
Benran Zhang
Shao-Hung Chan
Sven Koenig
AI4CE
34
0
0
06 Aug 2024
Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding
Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding
Zhe Chen
Daniel Harabor
Jioyang Li
Peter Stuckey
22
8
0
22 Aug 2023
X*: Anytime Multi-Agent Path Finding for Sparse Domains using
  Window-Based Iterative Repairs
X*: Anytime Multi-Agent Path Finding for Sparse Domains using Window-Based Iterative Repairs
Kyle Vedder
Joydeep Biswas
25
17
0
30 Nov 2018
1