{"id":{"repo_id":"glasgow","oai_identifier":"oai:theses.gla.ac.uk:5485"},"canonical_url":"https://search.ndltd.org/etd/glasgow/oai:theses.gla.ac.uk:5485","repository":{"repo_id":"glasgow","name":"University of Glasgow","base_url":"https://theses.gla.ac.uk/cgi/oai2"},"display":{"title":"Optimal algorithm design for transfer path planning for unmanned aerial vehicles","abstract":"Over the past three decades unmanned aerial vehicles (UAV) have seen significant development with a current focus on automation. The main area of development that is pushing automation is that of path planning allowing a UAV to generate its own path information that it can then follow to carry out its mission. Little work however has been carried out on transfer path planning. This work attempts to address this shortcoming by developing optimal algorithms for a path planning task to move on to a circular flightpath to carry out a target tracking mission. The work is developed in three main sections. Firstly the transfer algorithm itself is derived including gradient analysis for the cost function being applied, adaptation of this cost function into two separate minimising actions and analysis of a cost function issue that introduces a separation distance constraint. The algorithm is tested proving correct constraint activation and cost selection. The second part of this work looks at validating the results of the transfer algorithm against the Dubin's car result and a receding horizon approach when applied to the transfer operation. Utilising the cost results from the transfer algorithm an efficiency analysis against the equivalent costs from the other methods is carried out. Lastly this work looks at the comparison between the developed transfer algorithm and a more flexible transfer approach by developing a new cost function form. A switching cost function is introduced where environmental parameters from the target tracking mission (i.e target position and velocity) are used to switch between a number of applicable cost functions (time minimal, distance minimal and minimum speed transfer). An analysis is carried out to investigate the performance of both the original algorithm and the newly developed switching function based on key target tracking parameters","abstract_html":"Over the past three decades unmanned aerial vehicles (UAV) have seen significant development with a current focus on automation. The main area of development that is pushing automation is that of path planning allowing a UAV to generate its own path information that it can then follow to carry out its mission. Little work however has been carried out on transfer path planning. This work attempts to address this shortcoming by developing optimal algorithms for a path planning task to move on to a circular flightpath to carry out a target tracking mission. The work is developed in three main sections. Firstly the transfer algorithm itself is derived including gradient analysis for the cost function being applied, adaptation of this cost function into two separate minimising actions and analysis of a cost function issue that introduces a separation distance constraint. The algorithm is tested proving correct constraint activation and cost selection. The second part of this work looks at validating the results of the transfer algorithm against the Dubin&#x27;s car result and a receding horizon approach when applied to the transfer operation. Utilising the cost results from the transfer algorithm an efficiency analysis against the equivalent costs from the other methods is carried out. Lastly this work looks at the comparison between the developed transfer algorithm and a more flexible transfer approach by developing a new cost function form. A switching cost function is introduced where environmental parameters from the target tracking mission (i.e target position and velocity) are used to switch between a number of applicable cost functions (time minimal, distance minimal and minimum speed transfer). An analysis is carried out to investigate the performance of both the original algorithm and the newly developed switching function based on key target tracking parameters","abstract_has_math":false,"creators":["Pollock, Andrew George"],"institution":"University of Glasgow","degree_name":null,"degree_level":"PhD","degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014","date_published":"2014","updated_at":"2026-11-19T08:23:46Z","subjects":["T Technology (General)","TL Motor vehicles. Aeronautics. Astronautics"],"languages":["en"],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":null,"outbound_label":null,"outbound_source":null,"record_url":null,"record_label":null,"record_kind":null,"record_source":null,"download_url":"https://theses.gla.ac.uk/5485/1/2014pollockphd.pdf","download_label":"Download PDF","download_source":"dc:identifier.uri","access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://theses.gla.ac.uk/cgi/oai2?verb=GetRecord&metadataPrefix=uketd_dc&identifier=oai%3Atheses.gla.ac.uk%3A5485","prefix":"uketd_dc"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Pollock, Andrew George"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2014"]},{"key":"dc:date.issued","label":"Date","values":["2014"]},{"key":"dc:publisher.institution","label":"Dc Publisher Institution","values":["University of Glasgow"]},{"key":"dc:relation.isreferencedby","label":"Dc Relation Isreferencedby","values":["https://theses.gla.ac.uk/5485/"]},{"key":"dc:relation.isreferencedby.uri","label":"Dc Relation Isreferencedby URI","values":["https://gla.on.worldcat.org/oclc/896607449"]},{"key":"dc:relation.references","label":"Dc Relation References","values":["[48] M.H. Korayem, M. Bamdad, and S. Bayat. Optimal trajectory planning with max imum load carrying capacity for cable suspended robots. In Mechatronics and its Applications, 2009. ISMA '09. 6th International Symposium on, pages 1 -6, march 2009. doi: 10.1109/ISMA.2009.5164817. [49] S. Khanmohammadi, G. Alizadeh, J. Jassbi, and M. Pourmahmood. A new artificial intelligence approach for 2d path planning for underwater vehicles avoiding static and energized obstacles. In Evolutionary Computation, 2008. CEC 2008. (IEEE World Congress on Computational Intelligence). IEEE Congress on, pages 1988 -1995, june 2008. doi: 10.1109/CEC.2008.4631061. [50] Hans Georg Bock and Karl J. Plitt. A multiple shooting algorithm for direct solution of optimal control problems. In International Federation of Automatic Control 9th World Congress, 1984. [51] T. Khuswendi, H. Hindersah, and W. Adiprawita. Uav path planning using poten tial field and modified receding horizon a* 3d algorithm. In Electrical Engineering and Informatics (ICEEI), 2011 International Conference on, pages 1 -6, july 2011. doi: 10.1109/ICEEI.2011.6021579. [52] J.R. Riehl, G.E. Collins, and J.P. Hespanha. Cooperative graph-based model pre dictive search. pages 2998 -3004, dec. 2007. ISSN 0191-2216. doi: 10.1109/CDC. 2007.4435025. [53] R. Prazenica, A. Kurdila, R. Sharpley, and J. Evers. Vision-based geometry es timation and receding horizon path planning for uavs operating in urban envi ronments. In American Control Conference, 2006, page 6 pp., june 2006. doi: 10.1109/ACC.2006.1657155. [54] Jongrae Kim and J.L. Crassidis. Uav path planning for maximum visibility of ground targets in an urban area. In Information Fusion (FUSION), 2010 13th Conference on, pages 1 -7, july 2010."]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"dc:type.qualificationlevel","label":"Dc Type Qualificationlevel","values":["PhD"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["T Technology (General)","TL Motor vehicles. Aeronautics. Astronautics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://theses.gla.ac.uk/5485/1/2014pollockphd.pdf"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Over the past three decades unmanned aerial vehicles (UAV) have seen significant development with a current focus on automation. The main area of development that is pushing automation is that of path planning allowing a UAV to generate its own path information that it can then follow to carry out its mission. Little work however has been carried out on transfer path planning. This work attempts to address this shortcoming by developing optimal algorithms for a path planning task to move on to a circular flightpath to carry out a target tracking mission. The work is developed in three main sections. Firstly the transfer algorithm itself is derived including gradient analysis for the cost function being applied, adaptation of this cost function into two separate minimising actions and analysis of a cost function issue that introduces a separation distance constraint. The algorithm is tested proving correct constraint activation and cost selection. The second part of this work looks at validating the results of the transfer algorithm against the Dubin's car result and a receding horizon approach when applied to the transfer operation. Utilising the cost results from the transfer algorithm an efficiency analysis against the equivalent costs from the other methods is carried out. Lastly this work looks at the comparison between the developed transfer algorithm and a more flexible transfer approach by developing a new cost function form. A switching cost function is introduced where environmental parameters from the target tracking mission (i.e target position and velocity) are used to switch between a number of applicable cost functions (time minimal, distance minimal and minimum speed transfer). An analysis is carried out to investigate the performance of both the original algorithm and the newly developed switching function based on key target tracking parameters"]},{"key":"dc:format","label":"Dc Format","values":["pdf"]},{"key":"dcterms:accessrights","label":"Dcterms Accessrights","values":["public"]},{"key":"dc:title","label":"Title","values":["Optimal algorithm design for transfer path planning for unmanned aerial vehicles"]}]}],"canonical_facts":{"dc:creator":["Pollock, Andrew George"],"dc:date":["2014"],"dc:date.issued":["2014"],"dc:description.abstract":["Over the past three decades unmanned aerial vehicles (UAV) have seen significant development with a current focus on automation. The main area of development that is pushing automation is that of path planning allowing a UAV to generate its own path information that it can then follow to carry out its mission. Little work however has been carried out on transfer path planning. This work attempts to address this shortcoming by developing optimal algorithms for a path planning task to move on to a circular flightpath to carry out a target tracking mission. The work is developed in three main sections. Firstly the transfer algorithm itself is derived including gradient analysis for the cost function being applied, adaptation of this cost function into two separate minimising actions and analysis of a cost function issue that introduces a separation distance constraint. The algorithm is tested proving correct constraint activation and cost selection. The second part of this work looks at validating the results of the transfer algorithm against the Dubin's car result and a receding horizon approach when applied to the transfer operation. Utilising the cost results from the transfer algorithm an efficiency analysis against the equivalent costs from the other methods is carried out. Lastly this work looks at the comparison between the developed transfer algorithm and a more flexible transfer approach by developing a new cost function form. A switching cost function is introduced where environmental parameters from the target tracking mission (i.e target position and velocity) are used to switch between a number of applicable cost functions (time minimal, distance minimal and minimum speed transfer). An analysis is carried out to investigate the performance of both the original algorithm and the newly developed switching function based on key target tracking parameters"],"dc:format":["pdf"],"dc:identifier.uri":["https://theses.gla.ac.uk/5485/1/2014pollockphd.pdf"],"dc:language":["en"],"dc:publisher.institution":["University of Glasgow"],"dc:relation.isreferencedby":["https://theses.gla.ac.uk/5485/"],"dc:relation.isreferencedby.uri":["https://gla.on.worldcat.org/oclc/896607449"],"dc:relation.references":["[48] M.H. Korayem, M. Bamdad, and S. Bayat. Optimal trajectory planning with max imum load carrying capacity for cable suspended robots. In Mechatronics and its Applications, 2009. ISMA '09. 6th International Symposium on, pages 1 -6, march 2009. doi: 10.1109/ISMA.2009.5164817. [49] S. Khanmohammadi, G. Alizadeh, J. Jassbi, and M. Pourmahmood. A new artificial intelligence approach for 2d path planning for underwater vehicles avoiding static and energized obstacles. In Evolutionary Computation, 2008. CEC 2008. (IEEE World Congress on Computational Intelligence). IEEE Congress on, pages 1988 -1995, june 2008. doi: 10.1109/CEC.2008.4631061. [50] Hans Georg Bock and Karl J. Plitt. A multiple shooting algorithm for direct solution of optimal control problems. In International Federation of Automatic Control 9th World Congress, 1984. [51] T. Khuswendi, H. Hindersah, and W. Adiprawita. Uav path planning using poten tial field and modified receding horizon a* 3d algorithm. In Electrical Engineering and Informatics (ICEEI), 2011 International Conference on, pages 1 -6, july 2011. doi: 10.1109/ICEEI.2011.6021579. [52] J.R. Riehl, G.E. Collins, and J.P. Hespanha. Cooperative graph-based model pre dictive search. pages 2998 -3004, dec. 2007. ISSN 0191-2216. doi: 10.1109/CDC. 2007.4435025. [53] R. Prazenica, A. Kurdila, R. Sharpley, and J. Evers. Vision-based geometry es timation and receding horizon path planning for uavs operating in urban envi ronments. In American Control Conference, 2006, page 6 pp., june 2006. doi: 10.1109/ACC.2006.1657155. [54] Jongrae Kim and J.L. Crassidis. Uav path planning for maximum visibility of ground targets in an urban area. In Information Fusion (FUSION), 2010 13th Conference on, pages 1 -7, july 2010."],"dc:subject":["T Technology (General)","TL Motor vehicles. Aeronautics. Astronautics"],"dcterms:accessrights":["public"],"dc:title":["Optimal algorithm design for transfer path planning for unmanned aerial vehicles"],"dc:type":["Thesis"],"dc:type.qualificationlevel":["PhD"]},"updated_at":"2026-11-19T08:23:46Z"}