{"id":"https://openalex.org/W7162570401","doi":"https://doi.org/10.4230/lipics.socg.2026.43","title":"Unlabeled Multi-Robot Motion Planning with Improved Separation Trade-Offs","display_name":"Unlabeled Multi-Robot Motion Planning with Improved Separation Trade-Offs","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7162570401","doi":"https://doi.org/10.4230/lipics.socg.2026.43"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25849","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.43","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.43/LIPIcs.SoCG.2026.43.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.43/LIPIcs.SoCG.2026.43.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5130401529","display_name":"Tsuri Farhana","orcid":null},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Farhana, Tsuri","raw_affiliation_strings":["The Stein Faculty of Computer and Information Science, Ben-Gurion University of the Negev, Beer Sheva, Israel"],"raw_orcid":"https://orcid.org/0009-0006-7246-6805","affiliations":[{"raw_affiliation_string":"The Stein Faculty of Computer and Information Science, Ben-Gurion University of the Negev, Beer Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007090107","display_name":"Omrit Filtser","orcid":"https://orcid.org/0000-0002-3978-1428"},"institutions":[{"id":"https://openalex.org/I164950643","display_name":"Open University of Israel","ror":"https://ror.org/027z64205","country_code":"IL","type":"education","lineage":["https://openalex.org/I164950643"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Filtser, Omrit","raw_affiliation_strings":["Department of Mathematics and Computer Science, The Open University of Israel, Ra'anana, Israel"],"raw_orcid":"https://orcid.org/0000-0002-3978-1428","affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, The Open University of Israel, Ra'anana, Israel","institution_ids":["https://openalex.org/I164950643"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5130594080","display_name":"Shalev Goldshtein","orcid":null},"institutions":[{"id":"https://openalex.org/I164950643","display_name":"Open University of Israel","ror":"https://ror.org/027z64205","country_code":"IL","type":"education","lineage":["https://openalex.org/I164950643"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Goldshtein, Shalev","raw_affiliation_strings":["Department of Mathematics and Computer Science, The Open University of Israel, Ra'anana, Israel"],"raw_orcid":"https://orcid.org/0009-0001-7975-7721","affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, The Open University of Israel, Ra'anana, Israel","institution_ids":["https://openalex.org/I164950643"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.63418645,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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.5040000081062317,"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.5040000081062317,"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/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.16459999978542328,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical 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/T12288","display_name":"Optimization and Search Problems","score":0.07280000299215317,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.7221999764442444},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.6122999787330627},{"id":"https://openalex.org/keywords/separation","display_name":"Separation (statistics)","score":0.5745000243186951},{"id":"https://openalex.org/keywords/motion","display_name":"Motion (physics)","score":0.5242000222206116},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4514999985694885},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.4415000081062317}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7221999764442444},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.6122999787330627},{"id":"https://openalex.org/C2776061190","wikidata":"https://www.wikidata.org/wiki/Q7451805","display_name":"Separation (statistics)","level":2,"score":0.5745000243186951},{"id":"https://openalex.org/C104114177","wikidata":"https://www.wikidata.org/wiki/Q79782","display_name":"Motion (physics)","level":2,"score":0.5242000222206116},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4869000017642975},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45899999141693115},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4514999985694885},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.4415000081062317},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4316999912261963},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.42080000042915344},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4147000014781952},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4083000123500824},{"id":"https://openalex.org/C198082294","wikidata":"https://www.wikidata.org/wiki/Q3399648","display_name":"Position (finance)","level":2,"score":0.3176000118255615},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.3052000105381012}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25849","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.43","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.43/LIPIcs.SoCG.2026.43.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.socg.2026.43","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.socg.2026.43","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25849","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.43","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.43/LIPIcs.SoCG.2026.43.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7162570401.pdf","grobid_xml":"https://content.openalex.org/works/W7162570401.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"study":[1],"unlabeled":[2],"multi-robot":[3],"motion":[4],"planning":[5],"for":[6,173],"unit-disk":[7],"robots":[8],"in":[9,18,68],"a":[10,37,79,139,143,174],"polygonal":[11],"environment.":[12],"Although":[13],"the":[14,59,87,96,99,109,115,121,128,133,147,153],"problem":[15],"is":[16,117,123,130,149,155],"hard":[17],"general,":[19],"polynomial-time":[20,63,104,144],"solutions":[21],"exist":[22],"under":[23],"appropriate":[24],"separation":[25],"assumptions":[26],"on":[27,86],"start":[28],"and":[29,51,89,120,132,152],"target":[30],"positions.":[31],"Solovey":[32],"et":[33],"al.":[34],"(RSS'15)":[35],"provide":[36],"near-optimal":[38],"solution":[39,145,175],"assuming":[40],"that":[41,82,160],"start/target":[42],"positions":[43],"must":[44],"have":[45],"pairwise":[46],"distance":[47],"at":[48,52,167],"least":[49,53,168],"4,":[50],"\u221a5\u22482.236":[54],"from":[55],"obstacles.":[56],"This":[57],"raises":[58],"question":[60],"of":[61,98,166],"whether":[62],"algorithms":[64,106],"can":[65],"be":[66,171],"obtained":[67],"even":[69],"more":[70],"densely":[71],"packed":[72],"environments.":[73],"In":[74],"this":[75],"paper":[76],"we":[77,102,137,158],"present":[78],"generalized":[80],"algorithm":[81],"achieve":[83],"different":[84,140],"trade-offs":[85],"robots-separation":[88,116,129,148,163],"obstacles-separation":[90,122,134,154,165],"bounds,":[91],"all":[92],"significantly":[93],"improving":[94],"upon":[95],"state":[97],"art.":[100],"Specifically,":[101],"obtain":[103],"constant-approximation":[105],"to":[107,176],"minimize":[108],"total":[110],"path":[111],"length":[112],"when":[113,146],"(i)":[114],"2":[118],"2/3":[119],"1":[124],"2/3,":[125],"or":[126],"(ii)":[127],"\u22483.291":[131],"\u22481.354.":[135],"Additionally,":[136],"introduce":[138],"strategy":[141],"yielding":[142],"only":[150],"2,":[151],"3.":[156],"Finally,":[157],"show":[159],"without":[161],"any":[162],"assumption,":[164],"1.5":[169],"may":[170],"necessary":[172],"exist.":[177]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-05-28T00:00:00"}