{"id":"https://openalex.org/W3207856687","doi":"https://doi.org/10.1007/s11075-021-01167-w","title":"A minimum-time obstacle-avoidance path planning algorithm for unmanned aerial vehicles","display_name":"A minimum-time obstacle-avoidance path planning algorithm for unmanned aerial vehicles","publication_year":2021,"publication_date":"2021-10-12","ids":{"openalex":"https://openalex.org/W3207856687","doi":"https://doi.org/10.1007/s11075-021-01167-w","mag":"3207856687"},"language":"en","primary_location":{"id":"doi:10.1007/s11075-021-01167-w","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11075-021-01167-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11075-021-01167-w.pdf","source":{"id":"https://openalex.org/S117494069","display_name":"Numerical Algorithms","issn_l":"1017-1398","issn":["1017-1398","1572-9265"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Numerical Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s11075-021-01167-w.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5067705920","display_name":"Arturo De Marinis","orcid":null},"institutions":[{"id":"https://openalex.org/I5561750","display_name":"University of Bari Aldo Moro","ror":"https://ror.org/027ynra39","country_code":"IT","type":"education","lineage":["https://openalex.org/I5561750"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Arturo De Marinis","raw_affiliation_strings":["Dipartimento di Matematica, Universit\u00e0 di Bari, Bari, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica, Universit\u00e0 di Bari, Bari, Italy","institution_ids":["https://openalex.org/I5561750"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084316854","display_name":"Felice Iavernaro","orcid":"https://orcid.org/0000-0002-9716-7370"},"institutions":[{"id":"https://openalex.org/I5561750","display_name":"University of Bari Aldo Moro","ror":"https://ror.org/027ynra39","country_code":"IT","type":"education","lineage":["https://openalex.org/I5561750"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Felice Iavernaro","raw_affiliation_strings":["Dipartimento di Matematica, Universit\u00e0 di Bari, Bari, Italy"],"raw_orcid":"https://orcid.org/0000-0002-9716-7370","affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica, Universit\u00e0 di Bari, Bari, Italy","institution_ids":["https://openalex.org/I5561750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027255213","display_name":"Francesca Mazzia","orcid":"https://orcid.org/0000-0003-1072-9578"},"institutions":[{"id":"https://openalex.org/I5561750","display_name":"University of Bari Aldo Moro","ror":"https://ror.org/027ynra39","country_code":"IT","type":"education","lineage":["https://openalex.org/I5561750"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Francesca Mazzia","raw_affiliation_strings":["Dipartimento di Informatica, Universit\u00e0 di Bari, Bari, Italy"],"raw_orcid":"https://orcid.org/0000-0003-1072-9578","affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica, Universit\u00e0 di Bari, Bari, Italy","institution_ids":["https://openalex.org/I5561750"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5067705920"],"corresponding_institution_ids":["https://openalex.org/I5561750"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":1.1651,"has_fulltext":true,"cited_by_count":19,"citation_normalized_percentile":{"value":0.81038634,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"89","issue":"4","first_page":"1639","last_page":"1661"},"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/T12158","display_name":"Guidance and Control Systems","score":0.9997000098228455,"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/T11615","display_name":"Control and Dynamics of Mobile Robots","score":0.9970999956130981,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/obstacle-avoidance","display_name":"Obstacle avoidance","score":0.8194416761398315},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.7817793488502502},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.671169638633728},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.5769878029823303},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5697025656700134},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.557016909122467},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5331864356994629},{"id":"https://openalex.org/keywords/maximum-principle","display_name":"Maximum principle","score":0.5197919607162476},{"id":"https://openalex.org/keywords/continuation","display_name":"Continuation","score":0.5193896889686584},{"id":"https://openalex.org/keywords/pontryagins-minimum-principle","display_name":"Pontryagin's minimum principle","score":0.5109073519706726},{"id":"https://openalex.org/keywords/optimal-control","display_name":"Optimal control","score":0.4982123374938965},{"id":"https://openalex.org/keywords/control-theory","display_name":"Control theory (sociology)","score":0.4627980887889862},{"id":"https://openalex.org/keywords/collision-avoidance","display_name":"Collision avoidance","score":0.4170162081718445},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3750477433204651},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3741886615753174},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3662133812904358},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.34565964341163635},{"id":"https://openalex.org/keywords/control","display_name":"Control (management)","score":0.23359709978103638},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.17901739478111267},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.1735316812992096}],"concepts":[{"id":"https://openalex.org/C6683253","wikidata":"https://www.wikidata.org/wiki/Q7075535","display_name":"Obstacle avoidance","level":4,"score":0.8194416761398315},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.7817793488502502},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.671169638633728},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.5769878029823303},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5697025656700134},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.557016909122467},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5331864356994629},{"id":"https://openalex.org/C31010330","wikidata":"https://www.wikidata.org/wiki/Q1914255","display_name":"Maximum principle","level":3,"score":0.5197919607162476},{"id":"https://openalex.org/C88626702","wikidata":"https://www.wikidata.org/wiki/Q1128903","display_name":"Continuation","level":2,"score":0.5193896889686584},{"id":"https://openalex.org/C141803461","wikidata":"https://www.wikidata.org/wiki/Q3491629","display_name":"Pontryagin's minimum principle","level":3,"score":0.5109073519706726},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.4982123374938965},{"id":"https://openalex.org/C47446073","wikidata":"https://www.wikidata.org/wiki/Q5165890","display_name":"Control theory (sociology)","level":3,"score":0.4627980887889862},{"id":"https://openalex.org/C2780864053","wikidata":"https://www.wikidata.org/wiki/Q5147495","display_name":"Collision avoidance","level":3,"score":0.4170162081718445},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3750477433204651},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3741886615753174},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3662133812904358},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.34565964341163635},{"id":"https://openalex.org/C2775924081","wikidata":"https://www.wikidata.org/wiki/Q55608371","display_name":"Control (management)","level":2,"score":0.23359709978103638},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17901739478111267},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.1735316812992096},{"id":"https://openalex.org/C121704057","wikidata":"https://www.wikidata.org/wiki/Q352070","display_name":"Collision","level":2,"score":0.0},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s11075-021-01167-w","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11075-021-01167-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11075-021-01167-w.pdf","source":{"id":"https://openalex.org/S117494069","display_name":"Numerical Algorithms","issn_l":"1017-1398","issn":["1017-1398","1572-9265"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Numerical Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:ricerca.uniba.it:11586/379851","is_oa":true,"landing_page_url":"https://hdl.handle.net/11586/379851","pdf_url":null,"source":{"id":"https://openalex.org/S4377196296","display_name":"CINECA IRIS Institutional Research Information System (University of Bari Aldo Moro)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I5561750","host_organization_name":"University of Bari Aldo Moro","host_organization_lineage":["https://openalex.org/I5561750"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1007/s11075-021-01167-w","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11075-021-01167-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11075-021-01167-w.pdf","source":{"id":"https://openalex.org/S117494069","display_name":"Numerical Algorithms","issn_l":"1017-1398","issn":["1017-1398","1572-9265"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Numerical Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.7900000214576721,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320311030","display_name":"Istituto Nazionale di Alta Matematica \"Francesco Severi\"","ror":"https://ror.org/01vx64p53"},{"id":"https://openalex.org/F4320334079","display_name":"Gruppo Nazionale per il Calcolo Scientifico","ror":null}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3207856687.pdf","grobid_xml":"https://content.openalex.org/works/W3207856687.grobid-xml"},"referenced_works_count":37,"referenced_works":["https://openalex.org/W634094752","https://openalex.org/W1484387568","https://openalex.org/W1520585323","https://openalex.org/W1594114333","https://openalex.org/W1983438486","https://openalex.org/W2001981441","https://openalex.org/W2003870543","https://openalex.org/W2004842024","https://openalex.org/W2020313492","https://openalex.org/W2022424321","https://openalex.org/W2031037571","https://openalex.org/W2055503622","https://openalex.org/W2088088757","https://openalex.org/W2095522225","https://openalex.org/W2119040940","https://openalex.org/W2130936882","https://openalex.org/W2143246762","https://openalex.org/W2147518535","https://openalex.org/W2170548965","https://openalex.org/W2181005557","https://openalex.org/W2214630523","https://openalex.org/W2303961898","https://openalex.org/W2340680806","https://openalex.org/W2460476271","https://openalex.org/W2491068463","https://openalex.org/W2584459811","https://openalex.org/W2767578104","https://openalex.org/W2783085206","https://openalex.org/W2784210365","https://openalex.org/W2798000375","https://openalex.org/W2805397692","https://openalex.org/W2893406334","https://openalex.org/W2896378747","https://openalex.org/W2981460880","https://openalex.org/W2997651839","https://openalex.org/W3099916242","https://openalex.org/W4302561152"],"related_works":["https://openalex.org/W2771042763","https://openalex.org/W2155570364","https://openalex.org/W4211240924","https://openalex.org/W4302321938","https://openalex.org/W4292923857","https://openalex.org/W2031281152","https://openalex.org/W2543201876","https://openalex.org/W2511035558","https://openalex.org/W162218241","https://openalex.org/W1500373884"],"abstract_inverted_index":{"Abstract":[0],"In":[1],"this":[2],"article,":[3],"we":[4],"present":[5],"a":[6,47],"new":[7],"strategy":[8],"to":[9,56,72,83],"determine":[10],"an":[11],"unmanned":[12],"aerial":[13],"vehicle":[14],"trajectory":[15],"that":[16,50],"minimizes":[17],"its":[18],"flight":[19],"time":[20],"in":[21],"presence":[22,58],"of":[23,59,87],"avoidance":[24],"areas":[25],"and":[26,41,69,76],"obstacles.":[27,60],"The":[28],"method":[29],"combines":[30],"classical":[31],"results":[32],"from":[33],"optimal":[34],"control":[35],"theory,":[36],"i.e.":[37],"the":[38,42,53,57,64,73,85],"Euler-Lagrange":[39],"Theorem":[40],"Pontryagin":[43],"Minimum":[44],"Principle,":[45],"with":[46],"continuation":[48],"technique":[49],"dynamically":[51],"adapts":[52],"solution":[54],"curve":[55],"We":[61],"initially":[62],"consider":[63],"two-dimensional":[65],"path":[66],"planning":[67],"problem":[68],"then":[70],"move":[71],"three-dimensional":[74],"one,":[75],"include":[77],"numerical":[78],"illustrations":[79],"for":[80],"both":[81],"cases":[82],"show":[84],"efficiency":[86],"our":[88],"approach.":[89]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}