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

30 November 2018
Kyle Vedder
Joydeep Biswas
ArXivPDFHTML

Papers citing "X*: Anytime Multi-Agent Path Finding for Sparse Domains using Window-Based Iterative Repairs"

4 / 4 papers shown
Title
Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks
Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks
Roni Stern
Nathan R Sturtevant
Ariel Felner
Sven Koenig
Hang Ma
...
Dor Atzmon
L. Cohen
T. K. S. Kumar
Eli Boyarski
R. Barták
AI4CE
55
594
0
19 Jun 2019
Planning Optimal Paths for Multiple Robots on Graphs
Planning Optimal Paths for Multiple Robots on Graphs
Jingjin Yu
Steven M. Lavalle
55
176
0
17 Apr 2012
Exploiting Subgraph Structure in Multi-Robot Path Planning
Exploiting Subgraph Structure in Multi-Robot Path Planning
Malcolm R. K. Ryan
69
214
0
31 Oct 2011
Sampling-based Algorithms for Optimal Motion Planning
Sampling-based Algorithms for Optimal Motion Planning
S. Karaman
Emilio Frazzoli
82
4,660
0
05 May 2011
1