{"id":"https://openalex.org/W4391381557","doi":"https://doi.org/10.1109/wsc60868.2023.10408572","title":"Implementing Efficient Dynamic Threat Avoidance Routing Based on Dijkstra\u2019s Shortest Path Algorithm in the Advanced Framework for Simulation, Integration, and Modeling (AFSIM)","display_name":"Implementing Efficient Dynamic Threat Avoidance Routing Based on Dijkstra\u2019s Shortest Path Algorithm in the Advanced Framework for Simulation, Integration, and Modeling (AFSIM)","publication_year":2023,"publication_date":"2023-12-10","ids":{"openalex":"https://openalex.org/W4391381557","doi":"https://doi.org/10.1109/wsc60868.2023.10408572"},"language":"en","primary_location":{"id":"doi:10.1109/wsc60868.2023.10408572","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wsc60868.2023.10408572","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 Winter Simulation Conference (WSC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110266177","display_name":"D. Reid","orcid":null},"institutions":[{"id":"https://openalex.org/I55061410","display_name":"U.S. Air Force Institute of Technology","ror":"https://ror.org/03f9f1d95","country_code":"US","type":"education","lineage":["https://openalex.org/I1294991024","https://openalex.org/I1330347796","https://openalex.org/I1330347796","https://openalex.org/I2802362820","https://openalex.org/I4210089612","https://openalex.org/I4210102105","https://openalex.org/I4210102105","https://openalex.org/I55061410"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dante C. Reid","raw_affiliation_strings":["Air Force Institute of Technology,Department of Operational Sciences,OH,USA,45433-7765"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Air Force Institute of Technology,Department of Operational Sciences,OH,USA,45433-7765","institution_ids":["https://openalex.org/I55061410"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091359453","display_name":"L. Champagne","orcid":"https://orcid.org/0000-0003-0260-9752"},"institutions":[{"id":"https://openalex.org/I55061410","display_name":"U.S. Air Force Institute of Technology","ror":"https://ror.org/03f9f1d95","country_code":"US","type":"education","lineage":["https://openalex.org/I1294991024","https://openalex.org/I1330347796","https://openalex.org/I1330347796","https://openalex.org/I2802362820","https://openalex.org/I4210089612","https://openalex.org/I4210102105","https://openalex.org/I4210102105","https://openalex.org/I55061410"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lance E. Champagne","raw_affiliation_strings":["Air Force Institute of Technology,Department of Operational Sciences,OH,USA,45433-7765"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Air Force Institute of Technology,Department of Operational Sciences,OH,USA,45433-7765","institution_ids":["https://openalex.org/I55061410"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073368912","display_name":"Nathan Gaw","orcid":"https://orcid.org/0000-0001-7879-8946"},"institutions":[{"id":"https://openalex.org/I55061410","display_name":"U.S. Air Force Institute of Technology","ror":"https://ror.org/03f9f1d95","country_code":"US","type":"education","lineage":["https://openalex.org/I1294991024","https://openalex.org/I1330347796","https://openalex.org/I1330347796","https://openalex.org/I2802362820","https://openalex.org/I4210089612","https://openalex.org/I4210102105","https://openalex.org/I4210102105","https://openalex.org/I55061410"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nathan B. Gaw","raw_affiliation_strings":["Air Force Institute of Technology,Department of Operational Sciences,OH,USA,45433-7765"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Air Force Institute of Technology,Department of Operational Sciences,OH,USA,45433-7765","institution_ids":["https://openalex.org/I55061410"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I55061410"],"apc_list":null,"apc_paid":null,"fwci":0.6996,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.75449861,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"2415","last_page":"2426"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11195","display_name":"Simulation Techniques and Applications","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11195","display_name":"Simulation Techniques and Applications","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9907000064849854,"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/T11106","display_name":"Data Management and Algorithms","score":0.984000027179718,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.8315863013267517},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6911161541938782},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5874952673912048},{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.529115617275238},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.497531920671463},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.47745779156684875},{"id":"https://openalex.org/keywords/routing-algorithm","display_name":"Routing algorithm","score":0.44349050521850586},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4431438148021698},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3983938694000244},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2548533082008362},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.17933735251426697},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.14137575030326843}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.8315863013267517},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6911161541938782},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5874952673912048},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.529115617275238},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.497531920671463},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.47745779156684875},{"id":"https://openalex.org/C2984173633","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Routing algorithm","level":4,"score":0.44349050521850586},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4431438148021698},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3983938694000244},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2548533082008362},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.17933735251426697},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.14137575030326843},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/wsc60868.2023.10408572","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wsc60868.2023.10408572","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 Winter Simulation Conference (WSC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W2051147552","https://openalex.org/W2116834108","https://openalex.org/W2131225422","https://openalex.org/W2150705946","https://openalex.org/W2163812848","https://openalex.org/W2363930778","https://openalex.org/W2763988592","https://openalex.org/W3028128531","https://openalex.org/W4243549213","https://openalex.org/W4285092328","https://openalex.org/W6611556809","https://openalex.org/W6751057105"],"related_works":["https://openalex.org/W4402599120","https://openalex.org/W4223969905","https://openalex.org/W2383519316","https://openalex.org/W2376328589","https://openalex.org/W4221129498","https://openalex.org/W1562631103","https://openalex.org/W2887026015","https://openalex.org/W2578319993","https://openalex.org/W2886722595","https://openalex.org/W78690942"],"abstract_inverted_index":{"Simulating":[0],"pre-planned":[1],"routes":[2,21,33],"and":[3,48,98],"dynamic":[4],"threat":[5,50,78,128],"avoidance":[6,51],"routing":[7,52],"represents":[8],"a":[9],"significant":[10],"problem":[11],"for":[12,34,57],"operations":[13],"analysts.":[14],"Without":[15],"methods":[16],"to":[17,60,87,118,124],"create":[18],"operationally":[19],"valid":[20],"through":[22],"automation,":[23],"the":[24,38,41,73,89,106,110,121],"analyst":[25],"is":[26,80],"generally":[27],"faced":[28],"with":[29,114],"hard":[30],"coding":[31],"individual":[32],"multiple":[35],"aircraft":[36,58],"over":[37],"entirety":[39],"of":[40,70,91,120],"mission":[42,74],"set.":[43],"This":[44],"research":[45],"developed,":[46],"implemented,":[47],"analyzed":[49],"based":[53],"on":[54,94],"Dijkstra\u2019s":[55],"algorithm":[56,108],"attempting":[59],"operate":[61],"in":[62],"an":[63],"anti-access":[64],"area":[65],"denial":[66],"(A2AD)":[67],"environment":[68],"capable":[69],"dynamically":[71],"updating":[72],"route":[75],"as":[76],"new":[77],"information":[79],"learned.":[81],"A":[82],"designed":[83],"experiment":[84],"was":[85],"conducted":[86],"determine":[88],"impact":[90],"grid":[92,115],"parameters":[93],"operational":[95,112],"effectiveness":[96],"metrics":[97],"computational":[99,133],"costs.":[100,134],"Statistical":[101],"analysis":[102],"results":[103],"show":[104],"that":[105],"proposed":[107],"produced":[109],"best":[111],"performance":[113],"spacing":[116],"set":[117],"50%":[119],"smallest":[122],"surface":[123],"air":[125],"missile":[126],"(SAM)":[127],"radius":[129],"without":[130],"incurring":[131],"prohibitive":[132]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}