{"id":"https://openalex.org/W7083172024","doi":"https://doi.org/10.18421/sar83-04","title":"A Cooperative Reservation and Deadline-Aware Routing Algorithm for Multi-Agent Pathfinding Problem","display_name":"A Cooperative Reservation and Deadline-Aware Routing Algorithm for Multi-Agent Pathfinding Problem","publication_year":2025,"publication_date":"2025-09-24","ids":{"openalex":"https://openalex.org/W7083172024","doi":"https://doi.org/10.18421/sar83-04"},"language":"en","primary_location":{"id":"doi:10.18421/sar83-04","doi":"https://doi.org/10.18421/sar83-04","is_oa":true,"landing_page_url":"https://doi.org/10.18421/sar83-04","pdf_url":"https://www.sarjournal.com/content/83/SARJournalSeptember2025_240_247.pdf","source":{"id":"https://openalex.org/S4210236062","display_name":"SAR Journal - Science and Research","issn_l":"2619-9955","issn":["2619-9955","2619-9963"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":["erih-plus"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SAR Journal - Science and Research","raw_type":"journal-article"},"volume":null,"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.sarjournal.com/content/83/SARJournalSeptember2025_240_247.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5108620418","display_name":"Liviu Octavian Mafteiu-Scai","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I3121153395","display_name":"West University of Timi\u015foara","ror":"https://ror.org/0583a0t97","country_code":"RO","type":"education","lineage":["https://openalex.org/I3121153395"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Liviu Octavian Mafteiu-Scai","raw_affiliation_strings":["West University of Timisoara, Computer Science Department, Romania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"West University of Timisoara, Computer Science Department, Romania","institution_ids":["https://openalex.org/I3121153395"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5154265379","display_name":"Gicu Rata","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I3121153395","display_name":"West University of Timi\u015foara","ror":"https://ror.org/0583a0t97","country_code":"RO","type":"education","lineage":["https://openalex.org/I3121153395"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Gicu Rata","raw_affiliation_strings":["West University of Timisoara, Computer Science Department, Romania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"West University of Timisoara, Computer Science Department, Romania","institution_ids":["https://openalex.org/I3121153395"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I3121153395"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.34252857,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"240","last_page":"247"},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"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":1.0,"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/T11500","display_name":"Evacuation and Crowd Dynamics","score":0.0,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.0,"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/multi-agent-pathfinding","display_name":"multi-agent path finding","score":0.9980000257492065},{"id":"https://openalex.org/keywords/dynamic-priority-assignment","display_name":"dynamic priority assignment","score":0.5910000205039978},{"id":"https://openalex.org/keywords/collision-avoidance","display_name":"collision avoidance","score":0.7099999785423279},{"id":"https://openalex.org/keywords/replanning","display_name":"replanning","score":0.6050000190734863},{"id":"https://openalex.org/keywords/multi-robot-scheduling","display_name":"multi-robot scheduling","score":0.6840000152587891}],"concepts":[{"id":"https://openalex.org/C2777632111","wikidata":"https://www.wikidata.org/wiki/Q1937518","display_name":"Reservation","level":2,"score":0.777999997138977},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.718500018119812},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.7095999717712402},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6122000217437744},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5705000162124634},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5049999952316284},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.40149998664855957},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.39879998564720154},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.382999986410141},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3806999921798706},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3709000051021576},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.36000001430511475},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35019999742507935},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.28630000352859497},{"id":"https://openalex.org/C74222875","wikidata":"https://www.wikidata.org/wiki/Q16000312","display_name":"Robot kinematics","level":4,"score":0.2851000130176544},{"id":"https://openalex.org/C45235069","wikidata":"https://www.wikidata.org/wiki/Q278425","display_name":"Table (database)","level":2,"score":0.28380000591278076},{"id":"https://openalex.org/C2984173633","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Routing algorithm","level":4,"score":0.2628999948501587},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2624000012874603},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.26089999079704285}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.18421/sar83-04","doi":"https://doi.org/10.18421/sar83-04","is_oa":true,"landing_page_url":"https://doi.org/10.18421/sar83-04","pdf_url":"https://www.sarjournal.com/content/83/SARJournalSeptember2025_240_247.pdf","source":{"id":"https://openalex.org/S4210236062","display_name":"SAR Journal - Science and Research","issn_l":"2619-9955","issn":["2619-9955","2619-9963"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":["erih-plus"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SAR Journal - Science and Research","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.18421/sar83-04","doi":"https://doi.org/10.18421/sar83-04","is_oa":true,"landing_page_url":"https://doi.org/10.18421/sar83-04","pdf_url":"https://www.sarjournal.com/content/83/SARJournalSeptember2025_240_247.pdf","source":{"id":"https://openalex.org/S4210236062","display_name":"SAR Journal - Science and Research","issn_l":"2619-9955","issn":["2619-9955","2619-9963"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":["erih-plus"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SAR Journal - Science and Research","raw_type":"journal-article"},"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7083172024.pdf","grobid_xml":"https://content.openalex.org/works/W7083172024.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Multi-Agent":[0],"Pathfinding":[1],"(MAPF)":[2],"is":[3,34,100,105],"an":[4],"optimization":[5],"problem":[6],"for":[7,18,23,84],"the":[8,38,94,98,107,152],"multi-agent":[9],"scheduling":[10],"problem,":[11],"in":[12,58,93,170],"which":[13],"collision-free":[14],"paths":[15,166],"are":[16,42,68],"determined":[17],"a":[19,30,103,113,119],"group":[20],"of":[21],"agents":[22],"each":[24,64],"agent's":[25],"routes.":[26],"In":[27],"this":[28],"paper,":[29],"dynamic":[31,44,86],"priority-based":[32],"algorithm":[33,154],"proposed":[35,153],"to":[36,53,72,110,129],"solve":[37],"MAPF":[39],"problem.":[40],"Robots":[41],"assigned":[43],"priorities":[45],"based":[46],"on":[47],"factors":[48],"like":[49],"deadlines":[50],"and":[51,82,143],"distance":[52],"goal.":[54],"The":[55,132],"simulation":[56],"proceeds":[57],"discrete":[59],"time":[60,168],"steps,":[61],"where":[62],"at":[63],"step":[65],"active":[66],"robots":[67,90],"processed":[69,91],"sequentially":[70],"according":[71],"their":[73],"current":[74],"priority.":[75],"Each":[76],"robot":[77,108],"validates":[78],"its":[79],"existing":[80],"path":[81,99],"checks":[83],"potential":[85],"conflicts":[87,138,145,176],"with":[88],"higher-priority":[89],"earlier":[92],"same":[95,141],"step.":[96],"If":[97],"invalid":[101],"or":[102],"conflict":[104],"detected,":[106],"attempts":[109],"replan":[111],"using":[112],"time-expanded":[114],"A*":[115,133],"search":[116,134],"that":[117,151],"respects":[118],"shared":[120],"reservation":[121],"table.":[122],"This":[123],"table":[124],"stores":[125],"planned":[126],"space-time":[127],"occupations":[128],"prevent":[130],"collisions.":[131],"explicitly":[135],"avoids":[136],"vertex":[137],"(same":[139],"cell,":[140],"time)":[142],"edge":[144],"(swapping":[146],"adjacent":[147],"cells).":[148],"Experiments":[149],"demonstrate":[150],"(hereinafter":[155],"called":[156],"CREDAR":[157],"-":[158],"Cooperative":[159],"REservation":[160],"&":[161],"Deadline-Aware":[162],"Routing)":[163],"finds":[164],"valid":[165],"satisfying":[167],"constraints":[169],"various":[171],"test":[172],"scenarios,":[173],"dynamically":[174],"resolving":[175],"through":[177],"prioritized":[178],"replanning.":[179]},"counts_by_year":[],"updated_date":"2026-10-12T09:40:04.860316","created_date":"2025-10-10T00:00:00"}