{"id":"https://openalex.org/W7140637251","doi":"https://doi.org/10.48550/arxiv.2603.24442","title":"Relaxing Constraints in Anonymous Multi Agent Path Finding for Large Agents","display_name":"Relaxing Constraints in Anonymous Multi Agent Path Finding for Large Agents","publication_year":2026,"publication_date":"2026-03-25","ids":{"openalex":"https://openalex.org/W7140637251","doi":"https://doi.org/10.48550/arxiv.2603.24442"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.24442","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.24442","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.24442","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5087318535","display_name":"Stepan Dergachev","orcid":"https://orcid.org/0000-0001-8858-2831"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dergachev, Stepan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5130658304","display_name":"Dmitry Avdeev","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Avdeev, Dmitry","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.8737000226974487,"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.8737000226974487,"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/T12288","display_name":"Optimization and Search Problems","score":0.03500000014901161,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.016499999910593033,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/limit","display_name":"Limit (mathematics)","score":0.6636999845504761},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.5748999714851379},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.5703999996185303},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4799000024795532},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.45739999413490295},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.4235999882221222},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.4189000129699707}],"concepts":[{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.6636999845504761},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6617000102996826},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.5748999714851379},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.5703999996185303},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49399998784065247},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4799000024795532},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.45739999413490295},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.4235999882221222},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4189000129699707},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.39640000462532043},{"id":"https://openalex.org/C135692309","wikidata":"https://www.wikidata.org/wiki/Q111124","display_name":"Square (algebra)","level":2,"score":0.38339999318122864},{"id":"https://openalex.org/C41550386","wikidata":"https://www.wikidata.org/wiki/Q529909","display_name":"Multi-agent system","level":2,"score":0.3619000017642975},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.30959999561309814},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.298799991607666},{"id":"https://openalex.org/C2776639384","wikidata":"https://www.wikidata.org/wiki/Q840396","display_name":"Ideal (ethics)","level":2,"score":0.2728999853134155},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.272599995136261},{"id":"https://openalex.org/C2781011336","wikidata":"https://www.wikidata.org/wiki/Q1465133","display_name":"Time limit","level":2,"score":0.27070000767707825},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.2533000111579895},{"id":"https://openalex.org/C2780791683","wikidata":"https://www.wikidata.org/wiki/Q846785","display_name":"Action (physics)","level":2,"score":0.2515000104904175}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.24442","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.24442","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.24442","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.24442","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,137],"study":[1],"addressed":[2],"the":[3,11,15,24,53,63,94,101,121,158,172,180],"problem":[4],"of":[5,17,52,65,120,134,144],"Anonymous":[6],"Multi-Agent":[7],"Path-finding":[8],"(AMAPF).":[9],"Unlike":[10],"classical":[12],"formulation,":[13],"where":[14,128],"assignment":[16],"agents":[18,129,184],"to":[19,166],"goals":[20,39,189],"is":[21,29],"fixed,":[22],"in":[23,71,81,86],"anonymous":[25],"MAPF":[26],"setting":[27],"it":[28],"irrelevant":[30],"which":[31],"agent":[32,146],"reaches":[33],"specific":[34],"goal,":[35],"provided":[36],"that":[37,171,182],"all":[38,183],"are":[40,130],"occupied.":[41],"Most":[42],"existing":[43],"multi-agent":[44],"pathfinding":[45],"algorithms":[46,123],"rely":[47],"on":[48,93,100],"a":[49,140,153],"discrete":[50],"representation":[51],"environment":[54],"(e.g.,":[55],"square":[56],"grids)":[57],"and":[58,105,112,160,191],"do":[59],"not":[60],"account":[61],"for":[62,78,125],"sizes":[64],"agents.":[66],"This":[67],"limits":[68],"their":[69,188],"applicability":[70],"real-world":[72],"scenarios,":[73],"such":[74,97],"as":[75,98,132],"trajectory":[76],"planning":[77],"mobile":[79],"robots":[80],"warehouses.":[82],"Conversely,":[83],"methods":[84],"operating":[85],"continuous":[87,126],"space":[88],"typically":[89],"impose":[90],"substantial":[91],"restrictions":[92],"input":[95],"data,":[96],"constraints":[99,159],"distances":[102],"between":[103,109,148],"initial":[104],"goal":[106],"positions":[107,111],"or":[108],"start/goal":[110,150],"obstacles.":[113],"In":[114],"this":[115,162],"work,":[116],"we":[117],"considered":[118],"one":[119],"AMAPF":[122],"designed":[124],"space,":[127],"modeled":[131],"disks":[133],"equal":[135],"size.":[136],"algorithm":[138],"requires":[139],"strict":[141],"minimum":[142],"separation":[143],"$4$":[145,165],"radii":[147],"any":[149],"positions.":[151],"Proposed":[152],"modification":[154],"aimed":[155],"at":[156],"relaxing":[157],"reduce":[161],"limit":[163],"from":[164],"$2\\sqrt{3}$.":[167],"We":[168],"theoretically":[169],"demonstrated":[170],"proposed":[173],"enhancements":[174],"preserve":[175],"original":[176],"theoretical":[177],"properties,":[178],"including":[179],"guarantee":[181],"will":[185],"eventually":[186],"achieve":[187],"safely":[190],"without":[192],"collisions.":[193]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-03-27T00:00:00"}