Acceptance-Rejection Sampling-Guided Discrete RRT for Multiagent Path Finding

Discrete rapid-exploring random tree (dRRT) methods have been proposed but remain to be improved, showing great potential for efficiently solving multiagent path finding (MAPF) problems. This article proposes a new dRRT algorithm designed to tackle complex and challenging MAPF instances that current...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on industrial informatics s. 1 - 12
Hlavní autoři: Xin, Jianbin, Duan, Yuze, Zhu, Hai, Liang, Jing
Médium: Journal Article
Jazyk:angličtina
Vydáno: IEEE 2025
Témata:
Backtracking
Collision avoidance
Connectors
Heuristic algorithms
Multi-robot systems
Multiagent path finding (MAPF)
multirobot systems
path planning
Planning
Probabilistic logic
Robot kinematics
sampling-based algorithm
Time complexity
Training
ISSN:1551-3203, 1941-0050
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract Discrete rapid-exploring random tree (dRRT) methods have been proposed but remain to be improved, showing great potential for efficiently solving multiagent path finding (MAPF) problems. This article proposes a new dRRT algorithm designed to tackle complex and challenging MAPF instances that current discrete RRT approaches struggle to solve efficiently. In particular, we introduce an acceptance-rejection sampling method that efficiently guides the search for feasible paths toward destinations. Moreover, a multistep expansion strategy is proposed to improve search efficiency and path quality. Theoretical analysis regarding time complexity and probabilistic completeness is also provided. The proposed algorithm has been extensively tested on MAPF benchmark instances and verified in industrial simulations and real-world experiments, demonstrating its superior performance in handling large-scale MAPF instances and its competitiveness compared to state-of-the-art algorithms.
AbstractList Discrete rapid-exploring random tree (dRRT) methods have been proposed but remain to be improved, showing great potential for efficiently solving multiagent path finding (MAPF) problems. This article proposes a new dRRT algorithm designed to tackle complex and challenging MAPF instances that current discrete RRT approaches struggle to solve efficiently. In particular, we introduce an acceptance-rejection sampling method that efficiently guides the search for feasible paths toward destinations. Moreover, a multistep expansion strategy is proposed to improve search efficiency and path quality. Theoretical analysis regarding time complexity and probabilistic completeness is also provided. The proposed algorithm has been extensively tested on MAPF benchmark instances and verified in industrial simulations and real-world experiments, demonstrating its superior performance in handling large-scale MAPF instances and its competitiveness compared to state-of-the-art algorithms.
Author Liang, Jing
Zhu, Hai
Xin, Jianbin
Duan, Yuze
Author_xml – sequence: 1
  givenname: Jianbin
  orcidid: 0000-0002-1024-4135
  surname: Xin
  fullname: Xin, Jianbin
  email: j.xin@zzu.edu.cn
  organization: Electrical and Information Engineering, Zhengzhou University, Zhengzhou, China
– sequence: 2
  givenname: Yuze
  surname: Duan
  fullname: Duan, Yuze
  email: yuze.duan@ieee.org
  organization: Electrical and Information Engineering, Zhengzhou University, Zhengzhou, China
– sequence: 3
  givenname: Hai
  orcidid: 0000-0002-9780-5053
  surname: Zhu
  fullname: Zhu, Hai
  email: zhuhai11@alumni.nudt.edu.cn
  organization: Defense Innovation Institute, Beijing, China
– sequence: 4
  givenname: Jing
  orcidid: 0000-0003-0811-0223
  surname: Liang
  fullname: Liang, Jing
  email: liangjing@zzu.edu.cn
  organization: Electrical and Information Engineering, Zhengzhou University, Zhengzhou, China
BookMark eNpFkDtvwjAUha2KSgXavUMH_wHTe-04qUdEy0MCtaLZI8cPagQOSszQf98gkDqdM5yH9I3IIDbREfKMMEEE9VquVhMOXE5EDgpFcUeGqDJkABIGvZcSmeAgHsio6_YAogChhmQzNcadko7Gsa3bO5NCE-m3Pp4OIe7Y4hyss_Q9dKZ1ydHttqS-aenmfEhB71xM9EunHzoP0fb5R3Lv9aFzTzcdk3L-Uc6WbP25WM2ma2Y4qsQyK7jJhHPOS-S6eKsleu0NQqFNoYBnPvPWIuSyFkp6kMqi5rn2dcFrL8YErrOmbbqudb46teGo298KobrQqHoa1YVGdaPRV16uldC__scRFYdciT8Eh12O
CODEN ITIICH
ContentType Journal Article
DBID 97E
RIA
RIE
AAYXX
CITATION
DOI 10.1109/TII.2025.3609137
DatabaseName IEEE Xplore (IEEE)
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1941-0050
EndPage 12
ExternalDocumentID 10_1109_TII_2025_3609137
11192069
Genre orig-research
GrantInformation_xml – fundername: National Natural Science Foundation of China
  grantid: 62573389; 62173311; U23A20340
  funderid: 10.13039/501100001809
GroupedDBID 0R~
29I
4.4
5GY
6IK
97E
AAJGR
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
ACGFS
ACIWK
AENEX
AGQYO
AHBIQ
AKJIK
AKQYR
ALMA_UNASSIGNED_HOLDINGS
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
EBS
HZ~
IFIPE
IPLJI
JAVBF
LAI
O9-
OCL
P2P
RIA
RIE
RNS
5VS
AAYXX
AETIX
AGSQL
CITATION
EJD
M43
ID FETCH-LOGICAL-c219t-4d32c43eeef512a78b51fafc107ac79024f4fdd1065b395f059d1a26afb72bf3
IEDL.DBID RIE
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001587352900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1551-3203
IngestDate Sat Nov 29 07:16:40 EST 2025
Wed Oct 08 06:22:42 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
https://doi.org/10.15223/policy-029
https://doi.org/10.15223/policy-037
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c219t-4d32c43eeef512a78b51fafc107ac79024f4fdd1065b395f059d1a26afb72bf3
ORCID 0000-0002-1024-4135
0000-0003-0811-0223
0000-0002-9780-5053
PageCount 12
ParticipantIDs crossref_primary_10_1109_TII_2025_3609137
ieee_primary_11192069
PublicationCentury 2000
PublicationDate 2025-00-00
PublicationDateYYYYMMDD 2025-01-01
PublicationDate_xml – year: 2025
  text: 2025-00-00
PublicationDecade 2020
PublicationTitle IEEE transactions on industrial informatics
PublicationTitleAbbrev TII
PublicationYear 2025
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0037039
Score 2.4128451
Snippet Discrete rapid-exploring random tree (dRRT) methods have been proposed but remain to be improved, showing great potential for efficiently solving multiagent...
SourceID crossref
ieee
SourceType Index Database
Publisher
StartPage 1
SubjectTerms Backtracking
Collision avoidance
Connectors
Heuristic algorithms
Multi-robot systems
Multiagent path finding (MAPF)
multirobot systems
path planning
Planning
Probabilistic logic
Robot kinematics
sampling-based algorithm
Time complexity
Training
Title Acceptance-Rejection Sampling-Guided Discrete RRT for Multiagent Path Finding
URI https://ieeexplore.ieee.org/document/11192069
WOSCitedRecordID wos001587352900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE Electronic Library (IEL)
  customDbUrl:
  eissn: 1941-0050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0037039
  issn: 1551-3203
  databaseCode: RIE
  dateStart: 20050101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwELagYoCBZxHlJQ8sDG6T2InjsQIKlaCqSoZukZ-oDCkqLb-fs5OKMjCwWZEjWd_Z97Dvu0PoBkyipTbXRAgJAYpkiohcG-JcrIXVkksZupY889Eon07FuCGrBy6MtTYkn9muH4a3fDPXK39V1oNzKZIoE9tom_OsJmut1S6FrStCcdQ0JjSJ6PpNMhK9YjiESDBJuzTzZTD5Lxu00VQl2JTBwT9Xc4j2G-cR92tpH6EtWx2jvY2Sgifopa99ooqXJZnY95BoVeFX6RPHqzfyuJoZa_D9DLQFuMt4MikwuK048HClp1nhMfiEeDALbJc2KgYPxd0TaVomEA2qZ0mYoYlmFNbqwJJLnqs0dtJpCPKk5gIMsmPOGIgDU0VF6sC5MrFMMukUT5Sjp6hVzSt7hjCcdMlykG9qcparOM9UZqg1kmnDUqk66HaNYflRF8YoQ0ARiRLwLj3eZYN3B7U9fD_zGuTO__h-gXb97_VNxyVqLRcre4V29Ndy9rm4DmL_BhNOrD8
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwELagIAEDzyLK0wMLg9skdh4eK6C0oq2qkqFb5PiBwpCi0vL7OTupgIGBzYqsyPrOvod93x1Ct2ASNdWJJJwLCFAEywlPpCLG-JJrKWIhXNeSYTweJ7MZn9RkdceF0Vq75DPdtkP3lq_mcmWvyjpwLnngRXwTbYWMBV5F11orXgqbl7vyqKFPaODR9aukxzvpYACxYBC2aWQLYca_rNCPtirOqvQO_rmeQ7Rfu4-4W8n7CG3o8hjt_SgqeIJGXWlTVaw0yVS_uVSrEr8ImzpevpKnVaG0wg8F6AtwmPF0mmJwXLFj4gpLtMIT8Apxr3B8lyZKe4_pfZ_UTROIBOWzJEzRQDIKazVgy0Wc5KFvhJEQ5gkZczDJhhmlIBIMc8pDA-6V8kUQCZPHQW7oKWqU81KfIQxnXbAEJByqhCW5n0R5pKhWgknFQpG30N0aw-y9Ko2RuZDC4xngnVm8sxrvFmpa-L7n1cid__H9Bu3009EwGw7Gzxdo1_6quve4RI3lYqWv0Lb8XBYfi2u3Bb4AOdSvhg
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Acceptance-Rejection+Sampling-Guided+Discrete+RRT+for+Multiagent+Path+Finding&rft.jtitle=IEEE+transactions+on+industrial+informatics&rft.au=Xin%2C+Jianbin&rft.au=Duan%2C+Yuze&rft.au=Zhu%2C+Hai&rft.au=Liang%2C+Jing&rft.date=2025&rft.pub=IEEE&rft.issn=1551-3203&rft.spage=1&rft.epage=12&rft_id=info:doi/10.1109%2FTII.2025.3609137&rft.externalDocID=11192069
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1551-3203&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1551-3203&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1551-3203&client=summon