{"id":"https://openalex.org/W4414511777","doi":"https://doi.org/10.3390/ijgi14100374","title":"Adversarial Obstacle Placement with Spatial Point Processes for Optimal Path Disruption","display_name":"Adversarial Obstacle Placement with Spatial Point Processes for Optimal Path Disruption","publication_year":2025,"publication_date":"2025-09-25","ids":{"openalex":"https://openalex.org/W4414511777","doi":"https://doi.org/10.3390/ijgi14100374"},"language":"en","primary_location":{"id":"doi:10.3390/ijgi14100374","is_oa":true,"landing_page_url":"https://doi.org/10.3390/ijgi14100374","pdf_url":"https://www.mdpi.com/2220-9964/14/10/374/pdf?version=1758792381","source":{"id":"https://openalex.org/S2764431341","display_name":"ISPRS International Journal of Geo-Information","issn_l":"2220-9964","issn":["2220-9964"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ISPRS International Journal of Geo-Information","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/2220-9964/14/10/374/pdf?version=1758792381","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Li Zhou","orcid":"https://orcid.org/0009-0008-0339-2325"},"institutions":[{"id":"https://openalex.org/I82497590","display_name":"Auburn University","ror":"https://ror.org/02v80fc35","country_code":"US","type":"education","lineage":["https://openalex.org/I82497590"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Li Zhou","raw_affiliation_strings":["Department of Mathematics and Statistics, Auburn University, Auburn, AL 36849, USA"],"raw_orcid":"https://orcid.org/0009-0008-0339-2325","affiliations":[{"raw_affiliation_string":"Department of Mathematics and Statistics, Auburn University, Auburn, AL 36849, USA","institution_ids":["https://openalex.org/I82497590"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025386030","display_name":"Elvan Ceyhan","orcid":"https://orcid.org/0000-0003-2423-3178"},"institutions":[{"id":"https://openalex.org/I82497590","display_name":"Auburn University","ror":"https://ror.org/02v80fc35","country_code":"US","type":"education","lineage":["https://openalex.org/I82497590"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Elvan Ceyhan","raw_affiliation_strings":["Department of Mathematics and Statistics, Auburn University, Auburn, AL 36849, USA"],"raw_orcid":"https://orcid.org/0000-0003-2423-3178","affiliations":[{"raw_affiliation_string":"Department of Mathematics and Statistics, Auburn University, Auburn, AL 36849, USA","institution_ids":["https://openalex.org/I82497590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5119730405","display_name":"Polat Charyyev","orcid":null},"institutions":[{"id":"https://openalex.org/I157637111","display_name":"Naval Academy","ror":"https://ror.org/05syseh24","country_code":"TR","type":"education","lineage":["https://openalex.org/I157637111"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Polat Charyyev","raw_affiliation_strings":["MAP Akademi, Istanbul 34840, Turkey"],"raw_orcid":"https://orcid.org/0009-0002-3862-3214","affiliations":[{"raw_affiliation_string":"MAP Akademi, Istanbul 34840, Turkey","institution_ids":["https://openalex.org/I157637111"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5025386030"],"corresponding_institution_ids":["https://openalex.org/I82497590"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.27662354,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"14","issue":"10","first_page":"374","last_page":"374"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9994000196456909,"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.9994000196456909,"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.9986000061035156,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.996399998664856,"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/tree-traversal","display_name":"Tree traversal","score":0.9373000264167786},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.7861999869346619},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5339000225067139},{"id":"https://openalex.org/keywords/reset","display_name":"Reset (finance)","score":0.4918000102043152},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.43059998750686646},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.3840999901294708},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.37540000677108765}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.9373000264167786},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.7861999869346619},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6292999982833862},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5425999760627747},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5339000225067139},{"id":"https://openalex.org/C2779795794","wikidata":"https://www.wikidata.org/wiki/Q7315343","display_name":"Reset (finance)","level":2,"score":0.4918000102043152},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4478999972343445},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.43059998750686646},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.3840999901294708},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.37540000677108765},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3677000105381012},{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.3555000126361847},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3255999982357025},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31610000133514404},{"id":"https://openalex.org/C8272713","wikidata":"https://www.wikidata.org/wiki/Q176737","display_name":"Stochastic process","level":2,"score":0.3149000108242035},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.30219998955726624},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.28949999809265137},{"id":"https://openalex.org/C105339364","wikidata":"https://www.wikidata.org/wiki/Q2297740","display_name":"Software deployment","level":2,"score":0.2793000042438507},{"id":"https://openalex.org/C127491075","wikidata":"https://www.wikidata.org/wiki/Q7617825","display_name":"Stochastic modelling","level":2,"score":0.2623000144958496},{"id":"https://openalex.org/C6683253","wikidata":"https://www.wikidata.org/wiki/Q7075535","display_name":"Obstacle avoidance","level":4,"score":0.2615000009536743}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3390/ijgi14100374","is_oa":true,"landing_page_url":"https://doi.org/10.3390/ijgi14100374","pdf_url":"https://www.mdpi.com/2220-9964/14/10/374/pdf?version=1758792381","source":{"id":"https://openalex.org/S2764431341","display_name":"ISPRS International Journal of Geo-Information","issn_l":"2220-9964","issn":["2220-9964"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ISPRS International Journal of Geo-Information","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:5afa68bd8b8b4723a8f77ee38bbfde62","is_oa":true,"landing_page_url":"https://doaj.org/article/5afa68bd8b8b4723a8f77ee38bbfde62","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISPRS International Journal of Geo-Information, Vol 14, Iss 10, p 374 (2025)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.3390/ijgi14100374","is_oa":true,"landing_page_url":"https://doi.org/10.3390/ijgi14100374","pdf_url":"https://www.mdpi.com/2220-9964/14/10/374/pdf?version=1758792381","source":{"id":"https://openalex.org/S2764431341","display_name":"ISPRS International Journal of Geo-Information","issn_l":"2220-9964","issn":["2220-9964"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ISPRS International Journal of Geo-Information","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5099302636","display_name":null,"funder_award_id":"N00014-22-1-2572","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G6605806265","display_name":null,"funder_award_id":"#2319157","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"}],"funders":[{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4414511777.pdf"},"referenced_works_count":34,"referenced_works":["https://openalex.org/W429766147","https://openalex.org/W1424654272","https://openalex.org/W1493007304","https://openalex.org/W1519516901","https://openalex.org/W1537258144","https://openalex.org/W1863440143","https://openalex.org/W1992876208","https://openalex.org/W2020595907","https://openalex.org/W2021847163","https://openalex.org/W2025252735","https://openalex.org/W2072195747","https://openalex.org/W2073500691","https://openalex.org/W2078856178","https://openalex.org/W2091202128","https://openalex.org/W2093517413","https://openalex.org/W2118751446","https://openalex.org/W2127372295","https://openalex.org/W2137258261","https://openalex.org/W2169528473","https://openalex.org/W2484039423","https://openalex.org/W2489822048","https://openalex.org/W2808970843","https://openalex.org/W2911964244","https://openalex.org/W2951543070","https://openalex.org/W3099274836","https://openalex.org/W3107218662","https://openalex.org/W3120155235","https://openalex.org/W4280590673","https://openalex.org/W4378375186","https://openalex.org/W4384558191","https://openalex.org/W4388962567","https://openalex.org/W4396952369","https://openalex.org/W4402748763","https://openalex.org/W4403452523"],"related_works":[],"abstract_inverted_index":{"We":[0,26],"investigate":[1],"the":[2,12,15,21,69,123,134],"Optimal":[3,16],"Obstacle":[4,23],"Placement":[5],"(OOP)":[6],"problem":[7,19],"under":[8,88,160],"uncertainty,":[9],"framed":[10],"as":[11,100,102],"dual":[13],"of":[14,125],"Traversal":[17],"Path":[18],"in":[20],"Stochastic":[22],"Scene":[24],"paradigm.":[25],"consider":[27],"both":[28,116],"continuous":[29],"domains,":[30],"discretized":[31],"for":[32],"analysis,":[33],"and":[34,61,65,118,145,155],"already":[35],"discrete":[36],"spatial":[37,153],"grids":[38],"that":[39,80],"form":[40],"weighted":[41],"geospatial":[42],"networks":[43],"using":[44,68],"8-adjacency":[45],"lattices.":[46],"Our":[47],"unified":[48],"framework":[49],"integrates":[50],"OOP":[51],"with":[52],"stochastic":[53,146],"geometry,":[54],"modeling":[55],"obstacle":[56,156],"placement":[57],"via":[58],"Strauss":[59],"(regular)":[60],"Mat\u00e9rn":[62],"(clustered)":[63],"processes,":[64],"evaluates":[66],"traversal":[67,81,97,135],"Reset":[70],"Disambiguation":[71],"algorithm.":[72],"Through":[73],"extensive":[74],"Monte":[75],"Carlo":[76],"experiments,":[77],"we":[78],"show":[79],"cost":[82],"increases":[83],"by":[84,99,104,142],"up":[85],"to":[86,109,130],"40%":[87],"strongly":[89],"regular":[90],"placements,":[91],"while":[92],"clustered":[93],"configurations":[94],"can":[95],"decrease":[96],"costs":[98],"much":[101],"25%":[103],"leaving":[105],"navigable":[106],"corridors":[107],"compared":[108],"uniform":[110],"random":[111],"layouts.":[112],"In":[113],"mixed":[114],"(with":[115],"true":[117,126],"false":[119],"obstacles)":[120],"scenarios,":[121],"increasing":[122],"proportion":[124],"obstacles":[127],"from":[128],"30%":[129],"70%":[131],"nearly":[132],"doubles":[133],"cost.":[136],"These":[137],"findings":[138],"are":[139],"further":[140],"supported":[141],"statistical":[143],"analysis":[144],"ordering,":[147],"providing":[148],"rigorous":[149],"insights":[150],"into":[151],"how":[152],"patterns":[154],"compositions":[157],"influence":[158],"navigation":[159],"uncertainty.":[161]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}