{"id":"https://openalex.org/W4388406414","doi":"https://doi.org/10.1109/kse59128.2023.10299413","title":"Multi-Level Elliptic Dijkstra's Algorithm for Finding Optimal Trajectory of Aircrafts","display_name":"Multi-Level Elliptic Dijkstra's Algorithm for Finding Optimal Trajectory of Aircrafts","publication_year":2023,"publication_date":"2023-10-18","ids":{"openalex":"https://openalex.org/W4388406414","doi":"https://doi.org/10.1109/kse59128.2023.10299413"},"language":"en","primary_location":{"id":"doi:10.1109/kse59128.2023.10299413","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/kse59128.2023.10299413","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 15th International Conference on Knowledge and Systems Engineering (KSE)","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/A5072375949","display_name":"Van Hoan","orcid":"https://orcid.org/0000-0001-9098-109X"},"institutions":[{"id":"https://openalex.org/I131359167","display_name":"Le Quy Don Technical University","ror":"https://ror.org/04wgyjv21","country_code":"VN","type":"education","lineage":["https://openalex.org/I131359167"]}],"countries":["VN"],"is_corresponding":true,"raw_author_name":"Van Hoan Do","raw_affiliation_strings":["Center for Applied Mathematics and Informatics, Le Quy Don Technical University,Hanoi,Vietnam","Center for Applied Mathematics and Informatics, Le Quy Don Technical University, Hanoi, Vietnam"],"affiliations":[{"raw_affiliation_string":"Center for Applied Mathematics and Informatics, Le Quy Don Technical University,Hanoi,Vietnam","institution_ids":["https://openalex.org/I131359167"]},{"raw_affiliation_string":"Center for Applied Mathematics and Informatics, Le Quy Don Technical University, Hanoi, Vietnam","institution_ids":["https://openalex.org/I131359167"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024334019","display_name":"Nam-D\u0169ng Ho\u00e0ng","orcid":"https://orcid.org/0000-0001-7752-824X"},"institutions":[{"id":"https://openalex.org/I177233841","display_name":"Vietnam National University, Hanoi","ror":"https://ror.org/02jmfj006","country_code":"VN","type":"education","lineage":["https://openalex.org/I177233841"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Nam-D\u0169ng Hoang","raw_affiliation_strings":["University of Science, Vietnam National University,Faculty of Mathematics, Mechanics and Informatics,Hanoi,Vietnam","Faculty of Mathematics, Mechanics and Informatics, University of Science, Vietnam National University, Hanoi, Vietnam"],"affiliations":[{"raw_affiliation_string":"University of Science, Vietnam National University,Faculty of Mathematics, Mechanics and Informatics,Hanoi,Vietnam","institution_ids":["https://openalex.org/I177233841"]},{"raw_affiliation_string":"Faculty of Mathematics, Mechanics and Informatics, University of Science, Vietnam National University, Hanoi, Vietnam","institution_ids":["https://openalex.org/I177233841"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5072375949"],"corresponding_institution_ids":["https://openalex.org/I131359167"],"apc_list":null,"apc_paid":null,"fwci":0.2076,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.60152022,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"59","issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9958999752998352,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9955000281333923,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.9586282968521118},{"id":"https://openalex.org/keywords/suurballes-algorithm","display_name":"Suurballe's algorithm","score":0.6743403673171997},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5919052362442017},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5457042455673218},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5356665849685669},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.4954568147659302},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.4703923463821411},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.4525935649871826},{"id":"https://openalex.org/keywords/a*-search-algorithm","display_name":"A* search algorithm","score":0.4355728030204773},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3706377446651459},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.22756871581077576},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.1556016504764557}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.9586282968521118},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.6743403673171997},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5919052362442017},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5457042455673218},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5356665849685669},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.4954568147659302},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.4703923463821411},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.4525935649871826},{"id":"https://openalex.org/C103578098","wikidata":"https://www.wikidata.org/wiki/Q277680","display_name":"A* search algorithm","level":2,"score":0.4355728030204773},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3706377446651459},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.22756871581077576},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.1556016504764557},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/kse59128.2023.10299413","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/kse59128.2023.10299413","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 15th International Conference on Knowledge and Systems Engineering (KSE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1592025499","https://openalex.org/W1969483458","https://openalex.org/W1973125174","https://openalex.org/W1994924587","https://openalex.org/W2034501275","https://openalex.org/W2084224084","https://openalex.org/W2104317982","https://openalex.org/W2127470768","https://openalex.org/W2143083884","https://openalex.org/W2150418461","https://openalex.org/W2169528473","https://openalex.org/W2227557434","https://openalex.org/W2517489620","https://openalex.org/W2756533639","https://openalex.org/W2759080877","https://openalex.org/W4240200084","https://openalex.org/W6649045865","https://openalex.org/W6675622114","https://openalex.org/W6726594438","https://openalex.org/W6743923897","https://openalex.org/W6744850216"],"related_works":["https://openalex.org/W3205035283","https://openalex.org/W2382258861","https://openalex.org/W4281943708","https://openalex.org/W3015233512","https://openalex.org/W3023359981","https://openalex.org/W2136320479","https://openalex.org/W1508906807","https://openalex.org/W2978166001","https://openalex.org/W2382831994","https://openalex.org/W3155894620"],"abstract_inverted_index":{"We":[0,14],"propose":[1],"a":[2,16,20,24,52,90],"multi-level":[3,17],"elliptic":[4],"Dijkstra's":[5,55,108],"algorithm":[6,30,79,109],"for":[7],"flight":[8,12],"planning":[9],"in":[10,89],"free":[11],"airspaces.":[13],"exploit":[15],"decomposition":[18],"of":[19,26,54,69,92],"given":[21],"graph":[22,50,91],"into":[23],"sequence":[25],"containing":[27],"subgraphs.":[28],"The":[29,57],"alternates":[31],"between":[32],"running":[33],"the":[34,44,48,66,70,86],"forward":[35],"and":[36,97,101],"backward":[37],"search":[38,67],"on":[39,110],"those":[40],"subgraphs,":[41],"starting":[42],"from":[43],"smallest":[45],"one":[46],"to":[47,64,84],"original":[49],"using":[51],"modification":[53],"algorithm.":[56],"distances":[58],"obtained":[59],"by":[60],"earlier":[61],"searches":[62],"help":[63],"reduce":[65],"space":[68],"later":[71],"ones":[72],"significantly.":[73],"Computational":[74],"results":[75],"show":[76],"that":[77],"our":[78],"requires":[80],"at":[81],"most":[82],"0.06s":[83],"find":[85],"cheapest":[87],"route":[88],"more":[93],"than":[94,107],"130,000":[95],"nodes":[96],"17.5":[98],"million":[99],"arcs,":[100],"is":[102],"about":[103],"7":[104],"times":[105],"faster":[106],"average.":[111]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-12-25T23:11:45.687758","created_date":"2025-10-10T00:00:00"}