{"id":"https://openalex.org/W2921228217","doi":"https://doi.org/10.1007/978-3-030-14984-0_27","title":"Route Planning for Teams of Unmanned Aerial Vehicles Using Dubins Vehicle Model with Budget Constraint","display_name":"Route Planning for Teams of Unmanned Aerial Vehicles Using Dubins Vehicle Model with Budget Constraint","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2921228217","doi":"https://doi.org/10.1007/978-3-030-14984-0_27","mag":"2921228217"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-14984-0_27","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-14984-0_27","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5075512206","display_name":"David Zahr\u00e1dka","orcid":"https://orcid.org/0000-0002-7380-8495"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"David Zahr\u00e1dka","raw_affiliation_strings":["Faculty of Electrical Engineering, Czech Technical University, Technicka 2, 166 27, Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering, Czech Technical University, Technicka 2, 166 27, Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045281591","display_name":"Robert P\u011bni\u010dka","orcid":"https://orcid.org/0000-0001-8549-4932"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Robert P\u011bni\u010dka","raw_affiliation_strings":["Faculty of Electrical Engineering, Czech Technical University, Technicka 2, 166 27, Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering, Czech Technical University, Technicka 2, 166 27, Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004992661","display_name":"Martin Saska","orcid":"https://orcid.org/0000-0001-7106-3816"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Martin Saska","raw_affiliation_strings":["Faculty of Electrical Engineering, Czech Technical University, Technicka 2, 166 27, Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering, Czech Technical University, Technicka 2, 166 27, Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5075512206"],"corresponding_institution_ids":["https://openalex.org/I44504214"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.2563,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.4203513,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"365","last_page":"389"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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":0.9998999834060669,"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/T11133","display_name":"UAV Applications and Optimization","score":0.9986000061035156,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.998199999332428,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/orienteering","display_name":"Orienteering","score":0.817718505859375},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7349377870559692},{"id":"https://openalex.org/keywords/grasp","display_name":"GRASP","score":0.5850217342376709},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5677870512008667},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.5616229176521301},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.47995808720588684},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.46744048595428467},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.45867663621902466},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.427686870098114},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.41338324546813965},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.3518413305282593},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.35021236538887024},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.29012060165405273},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.16797718405723572},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12481889128684998}],"concepts":[{"id":"https://openalex.org/C513932644","wikidata":"https://www.wikidata.org/wiki/Q29358","display_name":"Orienteering","level":2,"score":0.817718505859375},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7349377870559692},{"id":"https://openalex.org/C171268870","wikidata":"https://www.wikidata.org/wiki/Q1486676","display_name":"GRASP","level":2,"score":0.5850217342376709},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5677870512008667},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.5616229176521301},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47995808720588684},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.46744048595428467},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.45867663621902466},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.427686870098114},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.41338324546813965},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.3518413305282593},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.35021236538887024},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.29012060165405273},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.16797718405723572},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12481889128684998},{"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/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","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},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-030-14984-0_27","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-14984-0_27","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6299999952316284,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W5006467","https://openalex.org/W213367833","https://openalex.org/W1192714208","https://openalex.org/W1963938442","https://openalex.org/W1965603691","https://openalex.org/W1972096422","https://openalex.org/W1987206750","https://openalex.org/W1992631165","https://openalex.org/W1996002457","https://openalex.org/W1999883971","https://openalex.org/W2003281104","https://openalex.org/W2014979043","https://openalex.org/W2019738489","https://openalex.org/W2022149436","https://openalex.org/W2050819731","https://openalex.org/W2057380865","https://openalex.org/W2057658519","https://openalex.org/W2091756921","https://openalex.org/W2104642742","https://openalex.org/W2113873983","https://openalex.org/W2135475768","https://openalex.org/W2135812345","https://openalex.org/W2154929945","https://openalex.org/W2171211995","https://openalex.org/W2187370932","https://openalex.org/W2236023658","https://openalex.org/W2253899129","https://openalex.org/W2313274380","https://openalex.org/W2342740524","https://openalex.org/W2346699423","https://openalex.org/W2401610261","https://openalex.org/W2525640293","https://openalex.org/W2526249116","https://openalex.org/W2532988808","https://openalex.org/W2587484717","https://openalex.org/W2587537338","https://openalex.org/W2610768354","https://openalex.org/W2738861344","https://openalex.org/W2742734338","https://openalex.org/W2745894514","https://openalex.org/W2748110852","https://openalex.org/W2767752711","https://openalex.org/W2772011902","https://openalex.org/W3126989843"],"related_works":["https://openalex.org/W4387497383","https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2935909890","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W3119129187"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}