{"id":"https://openalex.org/W7138891386","doi":"https://doi.org/10.48550/arxiv.2603.16510","title":"Minimum Exposure Motion Planning","display_name":"Minimum Exposure Motion Planning","publication_year":2026,"publication_date":"2026-03-17","ids":{"openalex":"https://openalex.org/W7138891386","doi":"https://doi.org/10.48550/arxiv.2603.16510"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.16510","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.16510","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.16510","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5130023495","display_name":"Sarita de Berg","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"de Berg, Sarita","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087003217","display_name":"Joachim Gudmundsson","orcid":"https://orcid.org/0000-0002-6778-7990"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gudmundsson, Joachim","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5129802178","display_name":"Peter Kramer","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kramer, Peter","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069173698","display_name":"Christian Rieck","orcid":"https://orcid.org/0000-0003-0846-5163"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rieck, Christian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5029179453","display_name":"Sampson Wong","orcid":"https://orcid.org/0000-0003-3803-3804"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wong, Sampson","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5130023495"],"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/T12288","display_name":"Optimization and Search Problems","score":0.31850001215934753,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.31850001215934753,"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.28049999475479126,"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"}},{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.13339999318122864,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6603000164031982},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6051999926567078},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.5963000059127808},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5800999999046326},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5503000020980835},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.487199991941452},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4203999936580658},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4131999909877777}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6603000164031982},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6051999926567078},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.5963000059127808},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5800999999046326},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5503000020980835},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5037999749183655},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.487199991941452},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46959999203681946},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4203999936580658},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4131999909877777},{"id":"https://openalex.org/C178650486","wikidata":"https://www.wikidata.org/wiki/Q1128619","display_name":"Square tiling","level":3,"score":0.41100001335144043},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40230000019073486},{"id":"https://openalex.org/C135692309","wikidata":"https://www.wikidata.org/wiki/Q111124","display_name":"Square (algebra)","level":2,"score":0.3952000141143799},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.383899986743927},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.3538999855518341},{"id":"https://openalex.org/C104114177","wikidata":"https://www.wikidata.org/wiki/Q79782","display_name":"Motion (physics)","level":2,"score":0.3345000147819519},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.32519999146461487},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.3188999891281128},{"id":"https://openalex.org/C34413123","wikidata":"https://www.wikidata.org/wiki/Q170978","display_name":"Robotics","level":3,"score":0.3100999891757965},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.28540000319480896},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.28040000796318054},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2775000035762787},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.2653000056743622},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.26339998841285706},{"id":"https://openalex.org/C7356347","wikidata":"https://www.wikidata.org/wiki/Q1307838","display_name":"Unit square","level":2,"score":0.25870001316070557}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.16510","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.16510","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.16510","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.16510","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":[{"score":0.4490290582180023,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,77,128],"investigate":[1],"multiple":[2],"fundamental":[3],"variants":[4],"of":[5,33,59,67,96,125,152,176],"the":[6,18,21,57,64,86,100,163,174],"classic":[7],"coordinated":[8,25],"motion":[9,26],"planning":[10],"(CMP)":[11],"problem":[12],"for":[13,83,107,139,146,186],"unit":[14],"square":[15],"robots":[16,35],"in":[17,85,99],"plane":[19,101],"under":[20],"$L_1$":[22],"metric.":[23],"In":[24],"planning,":[27],"we":[28,155],"are":[29,37,56,168],"given":[30],"two":[31,51],"arrangements":[32],"$k$":[34],"and":[36,63,105,142,165,192],"tasked":[38],"with":[39,110],"finding":[40],"a":[41,46,79,94,108,150],"movement":[42],"schedule":[43,109],"that":[44,102,135,161],"minimizes":[45],"certain":[47],"objective":[48,54,81,91],"function.":[49],"The":[50,88],"most":[52],"prominent":[53],"functions":[55],"sum":[58],"distances":[60],"traveled":[61],"(Min-Sum)":[62],"latest":[65],"time":[66,113,133],"arrival":[68],"(Min-Makespan).":[69],"Both":[70],"objectives":[71,167],"have":[72],"previously":[73],"been":[74],"studied":[75],"extensively.":[76],"introduce":[78],"new":[80,157],"function":[82,92],"CMP":[84],"plane.":[87],"proposed":[89],"Min-Exposure":[90],"defines":[93],"set":[95],"polygonal":[97],"regions":[98],"provide":[103],"cover":[104],"asks":[106],"minimal":[111],"elapsed":[112],"during":[114],"which":[115],"at":[116],"least":[117],"one":[118],"robot":[119],"is":[120],"partially":[121],"or":[122],"fully":[123],"outside":[124],"these":[126],"regions.":[127],"give":[129],"an":[130,143],"$\\mathcal{O}(n^4\\log":[131],"n)$":[132],"algorithm":[134,145],"computes":[136],"exposure-minimal":[137],"schedules":[138],"$k=2$":[140],"robots,":[141],"XP":[144],"arbitrary":[147],"$k$.":[148],"As":[149],"result":[151],"independent":[153],"interest,":[154],"leverage":[156],"insights":[158],"to":[159],"prove":[160],"both":[162],"Min-Makespan":[164],"Min-Sum":[166],"fixed-parameter":[169],"tractable":[170],"(FPT)":[171],"parameterized":[172,179],"by":[173],"number":[175],"robots.":[177],"Our":[178],"complexity":[180],"results":[181,185],"generalize":[182],"known":[183],"FPT":[184],"rectangular":[187],"grid":[188],"graphs":[189],"[Eiben,":[190],"Ganian,":[191],"Kanj,":[193],"SoCG'23].":[194]},"counts_by_year":[],"updated_date":"2026-05-05T08:41:31.759640","created_date":"2026-03-20T00:00:00"}