{"id":"https://openalex.org/W7139940831","doi":"https://doi.org/10.48550/arxiv.2603.18958","title":"Optimal Path Planning in Hostile Environments","display_name":"Optimal Path Planning in Hostile Environments","publication_year":2026,"publication_date":"2026-03-19","ids":{"openalex":"https://openalex.org/W7139940831","doi":"https://doi.org/10.48550/arxiv.2603.18958"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.18958","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.18958","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.18958","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5035960508","display_name":"Andrzej Kaczmarczyk","orcid":"https://orcid.org/0000-0003-1401-0157"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kaczmarczyk, Andrzej","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017702198","display_name":"\u0160imon Schierreich","orcid":"https://orcid.org/0000-0001-8901-1942"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Schierreich, \u0160imon","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5116535553","display_name":"Nicholas Axel Tanujaya","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tanujaya, Nicholas Axel","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5130220138","display_name":"Haifeng Xu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xu, Haifeng","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"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.8270999789237976,"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.8270999789237976,"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.04179999977350235,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.02250000089406967,"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/traverse","display_name":"Traverse","score":0.6134999990463257},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6033999919891357},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4810999929904938},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47540000081062317},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.43709999322891235},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.4307999908924103},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.43059998750686646},{"id":"https://openalex.org/keywords/software-deployment","display_name":"Software deployment","score":0.40610000491142273},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.39989998936653137}],"concepts":[{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.6134999990463257},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6033999919891357},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5651000142097473},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5128999948501587},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4810999929904938},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47540000081062317},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.43709999322891235},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.4307999908924103},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.43059998750686646},{"id":"https://openalex.org/C105339364","wikidata":"https://www.wikidata.org/wiki/Q2297740","display_name":"Software deployment","level":2,"score":0.40610000491142273},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.39989998936653137},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.3846000134944916},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.3319999873638153},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.3237000107765198},{"id":"https://openalex.org/C2776654903","wikidata":"https://www.wikidata.org/wiki/Q2601463","display_name":"SAFER","level":2,"score":0.31439998745918274},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.3057999908924103},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.30250000953674316},{"id":"https://openalex.org/C59519942","wikidata":"https://www.wikidata.org/wiki/Q650665","display_name":"Drone","level":2,"score":0.2969000041484833},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.29339998960494995},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.289000004529953},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.26759999990463257},{"id":"https://openalex.org/C2776505523","wikidata":"https://www.wikidata.org/wiki/Q4785468","display_name":"Plan (archaeology)","level":2,"score":0.25999999046325684},{"id":"https://openalex.org/C79581498","wikidata":"https://www.wikidata.org/wiki/Q1367530","display_name":"Suite","level":2,"score":0.25949999690055847},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.2517000138759613}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.18958","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.18958","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.18958","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.18958","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"Preprint"},"sustainable_development_goals":[{"score":0.49564868211746216,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Coordinating":[0],"agents":[1,47,71,103],"through":[2],"hazardous":[3],"environments,":[4],"such":[5],"as":[6],"aid-delivering":[7],"drones":[8],"navigating":[9],"conflict":[10],"zones":[11],"or":[12],"field":[13],"robots":[14],"traversing":[15],"deployment":[16],"areas":[17],"filled":[18],"with":[19],"obstacles,":[20],"poses":[21],"fundamental":[22],"planning":[23,37,90],"challenges.":[24],"We":[25,107,129],"introduce":[26],"and":[27,54,177],"analyze":[28],"the":[29,89,100,105,112,133,139,146],"computational":[30,169],"complexity":[31],"of":[32,45,102,116,157],"a":[33,50,57,62,77,95,143,151,167],"new":[34],"multi-agent":[35],"path":[36],"problem":[38,134],"that":[39,69,98,132],"captures":[40],"this":[41,84,172],"setting.":[42],"A":[43],"group":[44],"identical":[46],"begins":[48],"at":[49],"common":[51,63],"start":[52,161],"location":[53],"must":[55],"navigate":[56],"graph-based":[58],"environment":[59,140],"to":[60,93,162],"reach":[61],"target.":[64,106,163],"The":[65],"graph":[66,141],"contains":[67],"hazards":[68],"eliminate":[70],"upon":[72],"contact":[73],"but":[74],"then":[75,130],"enter":[76],"known":[78],"cooldown":[79],"period":[80],"before":[81],"reactivating.":[82],"In":[83],"discrete-time,":[85],"fully-observable,":[86],"deterministic":[87],"setting,":[88],"task":[91],"is":[92,135,142],"compute":[94],"movement":[96],"schedule":[97],"maximizes":[99],"number":[101],"reaching":[104],"first":[108],"prove":[109],"that,":[110],"despite":[111],"exponentially":[113],"large":[114],"space":[115],"feasible":[117],"plans,":[118],"optimal":[119],"plans":[120],"require":[121],"only":[122],"polynomially-many":[123],"steps,":[124],"establishing":[125],"membership":[126],"in":[127],"NP.":[128],"show":[131],"NP-hard":[136],"even":[137],"when":[138],"tree.":[144],"On":[145],"positive":[147],"side,":[148],"we":[149],"present":[150],"polynomial-time":[152],"algorithm":[153],"for":[154,171],"graphs":[155],"consisting":[156],"vertex-disjoint":[158],"paths":[159],"from":[160],"Our":[164],"results":[165],"establish":[166],"rich":[168],"landscape":[170],"problem,":[173],"identifying":[174],"both":[175],"intractable":[176],"tractable":[178],"fragments.":[179]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-03-21T00:00:00"}