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. 1911.03927
47
14
v1v2v3 (latest)

Cooperative Pathfinding based on memory-efficient Multi-agent RRT*

10 November 2019
Jinmingwu Jiang
Kaigui Wu
ArXiv (abs)PDFHTML
Abstract

In cooperative pathfinding problems, no-conflicts paths that bring several agents from their start location to their destination need to be planned. This problem can be efficiently solved by Multi-agent RRT*(MA-RRT*) algorithm, which offers better scalability than the classical algorithm such as Optimal Anytime(OA) in sparse environments. However, the implementation of this algorithm is limited because the memory the algorithm required grows indefinitely as the paths get optimized. This paper proposes an improved version of the Multi-agent RRT*(MA-RRT*) algorithm, called Multi-agent RRT* Fixed Node(MA-RRT*FN), which limits the memory of the MA-RRT*. The results show that the MA-RRT*FN performs as well as the MA-RRT* while the memory required is fixed.

View on arXiv
Comments on this paper