{"id":"https://openalex.org/W2066113473","doi":"https://doi.org/10.1109/icnsc.2008.4525382","title":"Study on Risk-time-dependent Path Programming","display_name":"Study on Risk-time-dependent Path Programming","publication_year":2008,"publication_date":"2008-04-01","ids":{"openalex":"https://openalex.org/W2066113473","doi":"https://doi.org/10.1109/icnsc.2008.4525382","mag":"2066113473"},"language":"en","primary_location":{"id":"doi:10.1109/icnsc.2008.4525382","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnsc.2008.4525382","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Conference on Networking, Sensing and Control","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":null,"display_name":"Zhang Hongjun","orcid":null},"institutions":[{"id":"https://openalex.org/I4210163363","display_name":"PLA Army Engineering University","ror":"https://ror.org/05mgp8x93","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210163363"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhang Hongjun","raw_affiliation_strings":["Engineering Institute of Engineering, People''s Liberation Army University of Science and Technology, Nanjing, China","PLA Univ. of Sci. & Technol., Nanjing"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Engineering Institute of Engineering, People''s Liberation Army University of Science and Technology, Nanjing, China","institution_ids":["https://openalex.org/I4210163363"]},{"raw_affiliation_string":"PLA Univ. of Sci. & Technol., Nanjing","institution_ids":["https://openalex.org/I4210163363"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045866004","display_name":"Pan Qinghua","orcid":null},"institutions":[{"id":"https://openalex.org/I4210163363","display_name":"PLA Army Engineering University","ror":"https://ror.org/05mgp8x93","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210163363"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Pan Qinghua","raw_affiliation_strings":["Engineering Institute of Engineering, People''s Liberation Army University of Science and Technology, Nanjing, China","PLA Univ. of Sci. & Technol., Nanjing"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Engineering Institute of Engineering, People''s Liberation Army University of Science and Technology, Nanjing, China","institution_ids":["https://openalex.org/I4210163363"]},{"raw_affiliation_string":"PLA Univ. of Sci. & Technol., Nanjing","institution_ids":["https://openalex.org/I4210163363"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036088740","display_name":"Wu Zhongjun","orcid":null},"institutions":[{"id":"https://openalex.org/I4210163363","display_name":"PLA Army Engineering University","ror":"https://ror.org/05mgp8x93","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210163363"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Wu Zhongjun","raw_affiliation_strings":["Engineering Institute of Engineering, People''s Liberation Army University of Science and Technology, Nanjing, China","Engineering Institute of Engineering Corps, PLA University of Science & Technology, Nanjing, 210007, China. phone: 13851945716"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Engineering Institute of Engineering, People''s Liberation Army University of Science and Technology, Nanjing, China","institution_ids":["https://openalex.org/I4210163363"]},{"raw_affiliation_string":"Engineering Institute of Engineering Corps, PLA University of Science & Technology, Nanjing, 210007, China. phone: 13851945716","institution_ids":["https://openalex.org/I4210163363"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.57863099,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1109","last_page":"1113"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13371","display_name":"Military Defense Systems Analysis","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T13371","display_name":"Military Defense Systems Analysis","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/T14270","display_name":"Simulation and Modeling Applications","score":0.9926999807357788,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T13832","display_name":"Advanced Decision-Making Techniques","score":0.9690999984741211,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/shortest-path-problem","display_name":"Shortest path problem","score":0.6716062426567078},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.66751629114151},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6290558576583862},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5213838219642639},{"id":"https://openalex.org/keywords/adversary","display_name":"Adversary","score":0.500856876373291},{"id":"https://openalex.org/keywords/battle","display_name":"Battle","score":0.46180102229118347},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.4263801574707031},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.2232462465763092},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16688692569732666},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.15674078464508057},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.09133017063140869},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09077391028404236}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6716062426567078},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.66751629114151},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6290558576583862},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5213838219642639},{"id":"https://openalex.org/C41065033","wikidata":"https://www.wikidata.org/wiki/Q2825412","display_name":"Adversary","level":2,"score":0.500856876373291},{"id":"https://openalex.org/C2778627824","wikidata":"https://www.wikidata.org/wiki/Q178561","display_name":"Battle","level":2,"score":0.46180102229118347},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.4263801574707031},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.2232462465763092},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16688692569732666},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.15674078464508057},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.09133017063140869},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09077391028404236},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icnsc.2008.4525382","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnsc.2008.4525382","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Conference on Networking, Sensing and Control","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.47999998927116394}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1986652726","https://openalex.org/W2089338760","https://openalex.org/W2092842476","https://openalex.org/W2117638964"],"related_works":["https://openalex.org/W2003237632","https://openalex.org/W2350977361","https://openalex.org/W2348097125","https://openalex.org/W2000391299","https://openalex.org/W2994023542","https://openalex.org/W2999081595","https://openalex.org/W1558737772","https://openalex.org/W1968712166","https://openalex.org/W3131868133","https://openalex.org/W2357456606"],"abstract_inverted_index":{"Correctly":[0],"shaping":[1],"the":[2,27,47,55,69,72,92,106,112,121,125],"maneuver":[3,18,50,95],"scheme":[4,51],"is":[5,34,40],"very":[6],"important":[7],"to":[8,54,85],"combat":[9],"unit":[10],"surviving":[11],"and":[12,75,80,98,108],"promoting":[13],"battle":[14],"effectiveness.":[15],"Influences":[16],"on":[17,103],"from":[19,36,124],"roads":[20],"or":[21],"some":[22],"areas":[23],"are":[24],"ubiquitous":[25],"in":[26],"troop":[28],"march.":[29],"The":[30,114],"most":[31],"serious":[32],"influence":[33],"derived":[35],"enemy's":[37],"menace,":[38],"which":[39],"time":[41,66],"dependent.":[42],"So,":[43],"we":[44,89],"can":[45,119],"see":[46],"problem":[48],"of":[49,57,59,71,94,105,110],"programming":[52],"belongs":[53],"domain":[56],"research":[58],"risk":[60,65],"time-dependent":[61],"shortest":[62,73],"path.":[63],"For":[64],"dependent":[67],"network,":[68],"study":[70],"path":[74,96],"its":[76],"efficiency":[77],"has":[78],"wide-ranging":[79],"realistic":[81],"meaning.":[82],"In":[83],"order":[84],"solve":[86],"this":[87],"problem,":[88],"put":[90],"forward":[91],"model":[93],"programming,":[97],"then":[99],"give":[100],"calculating":[101],"methods":[102],"parameters":[104],"net":[107],"steps":[109],"solving":[111],"model.":[113,126],"example":[115],"shows":[116],"that":[117],"it":[118],"obtain":[120],"practical":[122],"conclusion":[123]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}