{"id":"https://openalex.org/W4412508470","doi":"https://doi.org/10.1609/socs.v18i1.36016","title":"LSRP*: Scalable and Anytime Planning for Multi-Agent Path Finding with Asynchronous Actions (Extended Abstract)","display_name":"LSRP*: Scalable and Anytime Planning for Multi-Agent Path Finding with Asynchronous Actions (Extended Abstract)","publication_year":2025,"publication_date":"2025-07-20","ids":{"openalex":"https://openalex.org/W4412508470","doi":"https://doi.org/10.1609/socs.v18i1.36016"},"language":"en","primary_location":{"id":"doi:10.1609/socs.v18i1.36016","is_oa":true,"landing_page_url":"https://doi.org/10.1609/socs.v18i1.36016","pdf_url":"https://ojs.aaai.org/index.php/SOCS/article/download/36016/38171","source":{"id":"https://openalex.org/S4387284494","display_name":"Proceedings of the International Symposium on Combinatorial Search","issn_l":"2832-9163","issn":["2832-9163","2832-9171"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Symposium on Combinatorial Search","raw_type":"journal-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://ojs.aaai.org/index.php/SOCS/article/download/36016/38171","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101466489","display_name":"Shuai Zhou","orcid":"https://orcid.org/0000-0003-0375-8039"},"institutions":[{"id":"https://openalex.org/I90610280","display_name":"South China University of Technology","ror":"https://ror.org/0530pts50","country_code":"CN","type":"education","lineage":["https://openalex.org/I90610280"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Shuai Zhou","raw_affiliation_strings":["South China University of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"South China University of Technology","institution_ids":["https://openalex.org/I90610280"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011120967","display_name":"Shizhe Zhao","orcid":null},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Shizhe Zhao","raw_affiliation_strings":["Shanghai Jiao Tong University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Shanghai Jiao Tong University","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018561143","display_name":"Zhongqiang Ren","orcid":"https://orcid.org/0000-0003-2880-8653"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhongqiang Ren","raw_affiliation_strings":["Shanghai Jiao Tong University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Shanghai Jiao Tong University","institution_ids":["https://openalex.org/I183067930"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.4136,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.80959242,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"18","issue":null,"first_page":"275","last_page":"276"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998000264167786,"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.9998000264167786,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9832000136375427,"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"}},{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9800000190734863,"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/asynchronous-communication","display_name":"Asynchronous communication","score":0.79805988073349},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.7690936326980591},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6932612657546997},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6085338592529297},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.6069872379302979},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.4163914918899536},{"id":"https://openalex.org/keywords/human\u2013computer-interaction","display_name":"Human\u2013computer interaction","score":0.39429253339767456},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.32242369651794434},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.21108010411262512},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.06511986255645752}],"concepts":[{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.79805988073349},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7690936326980591},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6932612657546997},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6085338592529297},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6069872379302979},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.4163914918899536},{"id":"https://openalex.org/C107457646","wikidata":"https://www.wikidata.org/wiki/Q207434","display_name":"Human\u2013computer interaction","level":1,"score":0.39429253339767456},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.32242369651794434},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.21108010411262512},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.06511986255645752},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1609/socs.v18i1.36016","is_oa":true,"landing_page_url":"https://doi.org/10.1609/socs.v18i1.36016","pdf_url":"https://ojs.aaai.org/index.php/SOCS/article/download/36016/38171","source":{"id":"https://openalex.org/S4387284494","display_name":"Proceedings of the International Symposium on Combinatorial Search","issn_l":"2832-9163","issn":["2832-9163","2832-9171"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Symposium on Combinatorial Search","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1609/socs.v18i1.36016","is_oa":true,"landing_page_url":"https://doi.org/10.1609/socs.v18i1.36016","pdf_url":"https://ojs.aaai.org/index.php/SOCS/article/download/36016/38171","source":{"id":"https://openalex.org/S4387284494","display_name":"Proceedings of the International Symposium on Combinatorial Search","issn_l":"2832-9163","issn":["2832-9163","2832-9171"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Symposium on Combinatorial Search","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4412508470.pdf","grobid_xml":"https://content.openalex.org/works/W4412508470.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1982914007","https://openalex.org/W2159583675","https://openalex.org/W2359600231","https://openalex.org/W1824242903","https://openalex.org/W1493858311","https://openalex.org/W2380019117","https://openalex.org/W2155470929","https://openalex.org/W2111125783","https://openalex.org/W2394465510","https://openalex.org/W3138952546"],"abstract_inverted_index":{"Multi-Agent":[0],"Path":[1],"Finding":[2],"(MAPF)":[3],"seeks":[4],"collision-free":[5],"paths":[6],"for":[7,90],"multiple":[8],"agents":[9,46,147,158],"from":[10],"their":[11,16],"respective":[12,17],"starting":[13],"locations":[14,19],"to":[15,101,145,155,165],"goal":[18],"while":[20],"minimizing":[21],"path":[22],"costs.":[23],"Although":[24],"many":[25,91],"MAPF":[26,64],"algorithms":[27],"were":[28],"developed,":[29],"most":[30],"of":[31,44,63,71,135,167],"them":[32],"rely":[33],"on":[34,38],"a":[35,55,108],"common":[36],"assumption":[37,59],"synchronized":[39],"actions,":[40],"where":[41],"the":[42,49,121,127,133,168],"actions":[43],"all":[45],"start":[47],"at":[48],"same":[50],"time":[51,56],"and":[52,137,161],"always":[53],"take":[54],"unit.":[57],"This":[58,105],"may":[60],"limit":[61],"use":[62],"planners":[65],"in":[66,148],"practice.":[67],"To":[68],"get":[69],"rid":[70],"this":[72],"assumption,":[73],"recently,":[74],"an":[75],"algorithm":[76],"called":[77,112],"Loosely":[78],"Synchronized":[79],"Rule-Based":[80],"Planning":[81],"(LSRP)":[82],"is":[83,124],"proposed,":[84],"which":[85],"can":[86,115,152,162],"find":[87],"sub-optimal":[88],"solutions":[89,99],"agents.":[92],"However,":[93],"LSRP":[94,160],"often":[95],"finds":[96],"poor":[97],"quality":[98,119],"due":[100],"its":[102],"unbounded":[103],"sub-optimality.":[104],"paper":[106],"develops":[107],"new":[109],"anytime":[110],"planner":[111],"LSRP*":[113,151],"that":[114],"keep":[116],"improving":[117],"solution":[118,123,169],"after":[120],"initial":[122],"obtained":[125],"until":[126],"runtime":[128],"budget":[129],"depletes.":[130],"We":[131],"analyze":[132],"properties":[134],"LSPR*":[136],"test":[138],"it":[139],"against":[140],"several":[141],"baselines":[142],"with":[143],"up":[144,154,164],"1000":[146],"various":[149],"maps.":[150],"handle":[153],"25%":[156],"more":[157],"than":[159],"reduce":[163],"40%":[166],"cost":[170],"found":[171],"by":[172],"LSRP.":[173]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}