{"id":"https://openalex.org/W2490239233","doi":"https://doi.org/10.1007/s10846-016-0409-1","title":"Approximate 3D Euclidean Shortest Paths for Unmanned Aircraft in Urban Environments","display_name":"Approximate 3D Euclidean Shortest Paths for Unmanned Aircraft in Urban Environments","publication_year":2016,"publication_date":"2016-08-01","ids":{"openalex":"https://openalex.org/W2490239233","doi":"https://doi.org/10.1007/s10846-016-0409-1","mag":"2490239233"},"language":"en","primary_location":{"id":"doi:10.1007/s10846-016-0409-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10846-016-0409-1","pdf_url":null,"source":{"id":"https://openalex.org/S91329792","display_name":"Journal of Intelligent & Robotic Systems","issn_l":"0921-0296","issn":["0921-0296","1573-0409"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Intelligent & Robotic Systems","raw_type":"journal-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/A5021660372","display_name":"Guillermo Frontera","orcid":"https://orcid.org/0000-0001-8903-559X"},"institutions":[{"id":"https://openalex.org/I88060688","display_name":"Universidad Polit\u00e9cnica de Madrid","ror":"https://ror.org/03n6nwv02","country_code":"ES","type":"education","lineage":["https://openalex.org/I88060688"]}],"countries":["ES"],"is_corresponding":true,"raw_author_name":"Guillermo Frontera","raw_affiliation_strings":["ETSI Telecomunicaci\u00f3n, Universidad Polit\u00e9cnica de Madrid, 28040, Madrid, Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ETSI Telecomunicaci\u00f3n, Universidad Polit\u00e9cnica de Madrid, 28040, Madrid, Spain","institution_ids":["https://openalex.org/I88060688"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023193573","display_name":"David Mart\u00edn","orcid":"https://orcid.org/0000-0003-0397-0769"},"institutions":[{"id":"https://openalex.org/I88060688","display_name":"Universidad Polit\u00e9cnica de Madrid","ror":"https://ror.org/03n6nwv02","country_code":"ES","type":"education","lineage":["https://openalex.org/I88060688"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"David J. Mart\u00edn","raw_affiliation_strings":["ETSI Telecomunicaci\u00f3n, Universidad Polit\u00e9cnica de Madrid, 28040, Madrid, Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ETSI Telecomunicaci\u00f3n, Universidad Polit\u00e9cnica de Madrid, 28040, Madrid, Spain","institution_ids":["https://openalex.org/I88060688"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101704318","display_name":"Juan A. Besada","orcid":"https://orcid.org/0000-0002-4330-4050"},"institutions":[{"id":"https://openalex.org/I88060688","display_name":"Universidad Polit\u00e9cnica de Madrid","ror":"https://ror.org/03n6nwv02","country_code":"ES","type":"education","lineage":["https://openalex.org/I88060688"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Juan A. Besada","raw_affiliation_strings":["ETSI Telecomunicaci\u00f3n, Universidad Polit\u00e9cnica de Madrid, 28040, Madrid, Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ETSI Telecomunicaci\u00f3n, Universidad Polit\u00e9cnica de Madrid, 28040, Madrid, Spain","institution_ids":["https://openalex.org/I88060688"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007592479","display_name":"Da\u2010Wei Gu","orcid":"https://orcid.org/0000-0001-7475-5041"},"institutions":[{"id":"https://openalex.org/I153648349","display_name":"University of Leicester","ror":"https://ror.org/04h699437","country_code":"GB","type":"education","lineage":["https://openalex.org/I153648349"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Da-Wei Gu","raw_affiliation_strings":["Department of Engineering, University of Leicester, LE1 7RH, Leicester, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Engineering, University of Leicester, LE1 7RH, Leicester, UK","institution_ids":["https://openalex.org/I153648349"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5021660372"],"corresponding_institution_ids":["https://openalex.org/I88060688"],"apc_list":{"value":2990,"currency":"USD","value_usd":2990},"apc_paid":null,"fwci":0.8249,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.78372926,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"85","issue":"2","first_page":"353","last_page":"368"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"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":1.0,"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/T11099","display_name":"Autonomous Vehicle Technology and Safety","score":0.9936000108718872,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9908999800682068,"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/computation","display_name":"Computation","score":0.6774475574493408},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.6616705656051636},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6594951152801514},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6582480072975159},{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.6293126344680786},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5905098915100098},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.5578773021697998},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5281180143356323},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46782249212265015},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46565157175064087},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.4363862872123718},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23902779817581177},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2160433828830719},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.16470736265182495},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.134921133518219}],"concepts":[{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6774475574493408},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.6616705656051636},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6594951152801514},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6582480072975159},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.6293126344680786},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5905098915100098},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.5578773021697998},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5281180143356323},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46782249212265015},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46565157175064087},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.4363862872123718},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23902779817581177},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2160433828830719},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.16470736265182495},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.134921133518219},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10846-016-0409-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10846-016-0409-1","pdf_url":null,"source":{"id":"https://openalex.org/S91329792","display_name":"Journal of Intelligent & Robotic Systems","issn_l":"0921-0296","issn":["0921-0296","1573-0409"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Intelligent & Robotic Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.8399999737739563,"display_name":"Sustainable cities and communities"}],"awards":[{"id":"https://openalex.org/G4549891288","display_name":null,"funder_award_id":"FPU AP2009-0246","funder_id":"https://openalex.org/F4320321764","funder_display_name":"Ministerio de Educaci\u00f3n, Cultura y Deporte"}],"funders":[{"id":"https://openalex.org/F4320321764","display_name":"Ministerio de Educaci\u00f3n, Cultura y Deporte","ror":"https://ror.org/03nc27g21"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W131069610","https://openalex.org/W1482503584","https://openalex.org/W1498827059","https://openalex.org/W1512906775","https://openalex.org/W1814533834","https://openalex.org/W1983223843","https://openalex.org/W1986014106","https://openalex.org/W2014031977","https://openalex.org/W2014320134","https://openalex.org/W2018347014","https://openalex.org/W2024693023","https://openalex.org/W2031351246","https://openalex.org/W2036114412","https://openalex.org/W2044243445","https://openalex.org/W2050232743","https://openalex.org/W2053234329","https://openalex.org/W2058510050","https://openalex.org/W2070132530","https://openalex.org/W2075113601","https://openalex.org/W2077831477","https://openalex.org/W2078219854","https://openalex.org/W2086966885","https://openalex.org/W2090773282","https://openalex.org/W2101653488","https://openalex.org/W2110762409","https://openalex.org/W2111281539","https://openalex.org/W2123676901","https://openalex.org/W2123976412","https://openalex.org/W2128990851","https://openalex.org/W2132339863","https://openalex.org/W2139391136","https://openalex.org/W2140746528","https://openalex.org/W2149906774","https://openalex.org/W2163178194","https://openalex.org/W2167074278","https://openalex.org/W2170220350","https://openalex.org/W3103346840","https://openalex.org/W4233514863","https://openalex.org/W4238878318","https://openalex.org/W4251391716"],"related_works":["https://openalex.org/W3209137076","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W4221129498","https://openalex.org/W2887026015","https://openalex.org/W2363342665","https://openalex.org/W2170980056","https://openalex.org/W2578319993","https://openalex.org/W4402599120","https://openalex.org/W2379804627"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}