{"id":"https://openalex.org/W4414767430","doi":"https://doi.org/10.1109/tii.2025.3609137","title":"Acceptance\u2013Rejection Sampling-Guided Discrete RRT for Multiagent Path Finding","display_name":"Acceptance\u2013Rejection Sampling-Guided Discrete RRT for Multiagent Path Finding","publication_year":2025,"publication_date":"2025-10-02","ids":{"openalex":"https://openalex.org/W4414767430","doi":"https://doi.org/10.1109/tii.2025.3609137"},"language":"en","primary_location":{"id":"doi:10.1109/tii.2025.3609137","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tii.2025.3609137","pdf_url":null,"source":{"id":"https://openalex.org/S184777250","display_name":"IEEE Transactions on Industrial Informatics","issn_l":"1551-3203","issn":["1551-3203","1941-0050"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Industrial Informatics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5042584819","display_name":"Jianbin Xin","orcid":"https://orcid.org/0000-0002-1024-4135"},"institutions":[{"id":"https://openalex.org/I38877650","display_name":"Zhengzhou University","ror":"https://ror.org/04ypx8c21","country_code":"CN","type":"education","lineage":["https://openalex.org/I38877650"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jianbin Xin","raw_affiliation_strings":["Electrical and Information Engineering, Zhengzhou University, Zhengzhou, China"],"raw_orcid":"https://orcid.org/0000-0002-1024-4135","affiliations":[{"raw_affiliation_string":"Electrical and Information Engineering, Zhengzhou University, Zhengzhou, China","institution_ids":["https://openalex.org/I38877650"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078144380","display_name":"Yuze Duan","orcid":"https://orcid.org/0000-0003-2913-6158"},"institutions":[{"id":"https://openalex.org/I38877650","display_name":"Zhengzhou University","ror":"https://ror.org/04ypx8c21","country_code":"CN","type":"education","lineage":["https://openalex.org/I38877650"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yuze Duan","raw_affiliation_strings":["Electrical and Information Engineering, Zhengzhou University, Zhengzhou, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical and Information Engineering, Zhengzhou University, Zhengzhou, China","institution_ids":["https://openalex.org/I38877650"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003219071","display_name":"Hai Zhu","orcid":"https://orcid.org/0000-0002-9780-5053"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hai Zhu","raw_affiliation_strings":["Defense Innovation Institute, Beijing, China"],"raw_orcid":"https://orcid.org/0000-0002-9780-5053","affiliations":[{"raw_affiliation_string":"Defense Innovation Institute, Beijing, China","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100676081","display_name":"Jing Liang","orcid":"https://orcid.org/0000-0003-0811-0223"},"institutions":[{"id":"https://openalex.org/I38877650","display_name":"Zhengzhou University","ror":"https://ror.org/04ypx8c21","country_code":"CN","type":"education","lineage":["https://openalex.org/I38877650"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jing Liang","raw_affiliation_strings":["Electrical and Information Engineering, Zhengzhou University, Zhengzhou, China"],"raw_orcid":"https://orcid.org/0000-0003-0811-0223","affiliations":[{"raw_affiliation_string":"Electrical and Information Engineering, Zhengzhou University, Zhengzhou, China","institution_ids":["https://openalex.org/I38877650"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.23644588,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"22","issue":"1","first_page":"207","last_page":"218"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9936000108718872,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6866999864578247},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6593999862670898},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5981000065803528},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.5031999945640564},{"id":"https://openalex.org/keywords/random-tree","display_name":"Random tree","score":0.5012000203132629},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.49570000171661377},{"id":"https://openalex.org/keywords/multi-agent-system","display_name":"Multi-agent system","score":0.4375},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.3666999936103821}],"concepts":[{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6866999864578247},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6593999862670898},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.607699990272522},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5981000065803528},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.5031999945640564},{"id":"https://openalex.org/C2776839635","wikidata":"https://www.wikidata.org/wiki/Q14942679","display_name":"Random tree","level":4,"score":0.5012000203132629},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.49570000171661377},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4876999855041504},{"id":"https://openalex.org/C41550386","wikidata":"https://www.wikidata.org/wiki/Q529909","display_name":"Multi-agent system","level":2,"score":0.4375},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37630000710487366},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3666999936103821},{"id":"https://openalex.org/C55689738","wikidata":"https://www.wikidata.org/wiki/Q15963867","display_name":"Discrete time and continuous time","level":2,"score":0.36649999022483826},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.34950000047683716},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.34150001406669617},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33559998869895935},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.28060001134872437},{"id":"https://openalex.org/C153782549","wikidata":"https://www.wikidata.org/wiki/Q175116","display_name":"Discrete space","level":2,"score":0.28029999136924744},{"id":"https://openalex.org/C47822265","wikidata":"https://www.wikidata.org/wiki/Q854457","display_name":"Complex system","level":2,"score":0.27880001068115234},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.2590000033378601},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.25619998574256897}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tii.2025.3609137","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tii.2025.3609137","pdf_url":null,"source":{"id":"https://openalex.org/S184777250","display_name":"IEEE Transactions on Industrial Informatics","issn_l":"1551-3203","issn":["1551-3203","1941-0050"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Industrial Informatics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1028840406","display_name":null,"funder_award_id":"62173311","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G5107126576","display_name":null,"funder_award_id":"U23A20340","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G7681882944","display_name":null,"funder_award_id":"62573389","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1424654272","https://openalex.org/W1989407213","https://openalex.org/W2123030512","https://openalex.org/W2136323427","https://openalex.org/W2191404279","https://openalex.org/W2241553860","https://openalex.org/W2758931569","https://openalex.org/W2892258706","https://openalex.org/W2912551019","https://openalex.org/W2914864020","https://openalex.org/W2964997335","https://openalex.org/W2996899864","https://openalex.org/W3001812523","https://openalex.org/W3037164939","https://openalex.org/W3090404636","https://openalex.org/W3092786062","https://openalex.org/W3175724379","https://openalex.org/W3190828211","https://openalex.org/W3216907783","https://openalex.org/W4200000120","https://openalex.org/W4225814850","https://openalex.org/W4226155395","https://openalex.org/W4312789547","https://openalex.org/W4320015828","https://openalex.org/W4360584446","https://openalex.org/W4382202651","https://openalex.org/W4392638773"],"related_works":[],"abstract_inverted_index":{"Discrete":[0],"rapid-exploring":[1],"random":[2],"tree":[3],"(dRRT)":[4],"methods":[5],"have":[6],"been":[7,96],"proposed":[8,73,93],"but":[9],"remain":[10],"to":[11,33,46,74,124],"be":[12],"improved,":[13],"showing":[14],"great":[15],"potential":[16],"for":[17,62],"efficiently":[18,58],"solving":[19],"multiagent":[20],"path":[21,79],"finding":[22],"(MAPF)":[23],"problems.":[24],"This":[25],"article":[26],"proposes":[27],"a":[28,68],"new":[29],"dRRT":[30],"algorithm":[31,94],"designed":[32],"tackle":[34],"complex":[35],"and":[36,78,86,103,108,120],"challenging":[37],"MAPF":[38,100,118],"instances":[39,102,119],"that":[40,57],"current":[41],"discrete":[42],"RRT":[43],"approaches":[44],"struggle":[45],"solve":[47],"efficiently.":[48],"In":[49],"particular,":[50],"we":[51],"introduce":[52],"an":[53],"acceptance\u2013rejection":[54],"sampling":[55],"method":[56],"guides":[59],"the":[60],"search":[61,76],"feasible":[63],"paths":[64],"toward":[65],"destinations.":[66],"Moreover,":[67],"multistep":[69],"expansion":[70],"strategy":[71],"is":[72,89],"improve":[75],"efficiency":[77],"quality.":[80],"Theoretical":[81],"analysis":[82],"regarding":[83],"time":[84],"complexity":[85],"probabilistic":[87],"completeness":[88],"also":[90],"provided.":[91],"The":[92],"has":[95],"extensively":[97],"tested":[98],"on":[99],"benchmark":[101],"verified":[104],"in":[105,115],"industrial":[106],"simulations":[107],"real-world":[109],"experiments,":[110],"demonstrating":[111],"its":[112,121],"superior":[113],"performance":[114],"handling":[116],"large-scale":[117],"competitiveness":[122],"compared":[123],"state-of-the-art":[125],"algorithms.":[126]},"counts_by_year":[],"updated_date":"2026-01-10T23:39:48.068659","created_date":"2025-10-10T00:00:00"}