Multi-agent Rapidly Exploring Random Trees
Multi-Agent Rapidly Exploring Random Trees is a path planning framework that extends the Rapidly Exploring Random Trees algorithm by enabling coordinated exploration and motion planning of multiple agents through shared configuration space sampling and inter-agent collision avoidance constraints.
13
Publications
803
Citations
39
Authors
19
Institutions
Publications per year
2017–2026
5
Variants
Marrt
13
1–5 of 13
39
3
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 39
19

United States Naval Academy
Annapolis, United States
2 h-index
2 publications
63 citations
American Institute of Aeronautics and Astronautics
Reston, United States
2 h-index
5 publications
224 citations
University of Pennsylvania
Philadelphia, United States
2 h-index
4 publications
126 citations
Massachusetts Institute of Technology
Cambridge, United States
2 h-index
6 publications
279 citations
Aalto University
Espoo, Finland
1 h-index
3 publications
465 citations

University of Edinburgh
Edinburgh, United Kingdom
1 h-index
1 publications
33 citations

China Mobile (China)
Beijing, China
1 h-index
1 publications
30 citations
University of Kassel
Kassel, Germany
1 h-index
2 publications
22 citations
1–8 of 19
IJRR · 1 publications · 21 citations
1
h-index
JAIS · 1 publications · 24 citations
1
h-index
1 publications · 22 citations
1
h-index
ARS · 1 publications · 32 citations
1
h-index
1 publications · 69 citations
1
h-index
1–5