{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/78547"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/78547","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"An efficient way for path planning of cooperative autonomously soaring gliders","abstract":"Made available in DSpace on 2015-07-22T22:18:09Z (GMT). No. of bitstreams: 2 ZAMAN-THESIS-2015.pdf: 2013042 bytes, checksum: 31e119555d43a7cb77c3a0b2dd9b0a5a (MD5) LICENSE.txt: 4211 bytes, checksum: 29d447deaca356bfb55a4cfd8c8912cf (MD5) Previous issue date: 2015-05-01","abstract_html":"Made available in DSpace on 2015-07-22T22:18:09Z (GMT). No. of bitstreams: 2 ZAMAN-THESIS-2015.pdf: 2013042 bytes, checksum: 31e119555d43a7cb77c3a0b2dd9b0a5a (MD5) LICENSE.txt: 4211 bytes, checksum: 29d447deaca356bfb55a4cfd8c8912cf (MD5) Previous issue date: 2015-05-01","abstract_has_math":false,"creators":["Zaman, Muhammad Aneeq Uz"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Mechanical Engineering","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-07-22T22:18:09Z","date_published":"2015-07-22T22:18:09Z","updated_at":"2026-07-22T22:26:11Z","subjects":["Cooperative Autonomous Soaring","Cooperative Control","Optimal Path Planning","Optimization"],"languages":["en"],"rights":["Copyright 2015 Muhammad Aneeq uz Zaman"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/78547","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Zaman, Muhammad Aneeq Uz"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2015-07-22T22:18:09Z","2015-05","2015-05-01","2015-5"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mechanical Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Cooperative Autonomous Soaring","Cooperative Control","Optimal Path Planning","Optimization"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2015 Muhammad Aneeq uz Zaman"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/78547"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Made available in DSpace on 2015-07-22T22:18:09Z (GMT). No. of bitstreams: 2 ZAMAN-THESIS-2015.pdf: 2013042 bytes, checksum: 31e119555d43a7cb77c3a0b2dd9b0a5a (MD5) LICENSE.txt: 4211 bytes, checksum: 29d447deaca356bfb55a4cfd8c8912cf (MD5) Previous issue date: 2015-05-01","This thesis attempts to solve the problem of planning paths for a group of gliding UAVs performing a task. These gliders have start and goal configurations (positions and orientations) in 2-dimensional space and also a starting altitude. This can be thought of as the starting energy of the glider. The task, given to the gliders, is to visit a set of \\textit{interest points} in 2-dimensions. Since the gliders start with a limited energy and are constantly losing it, the paths should be planned such that the energy lost while traveling over the paths is minimized. Moreover, exploitation of free energy present in the environment, called \\textit{Autonomous Soaring}, can also be used to maximize the range of the aircraft, potentially allowing the gliders to visit even more interest points. The task of planning paths for the gliders is decoupled into two parts (i) planning the best sequence of waypoint visitation (for each glider) and, (ii) planning paths over these sequences. This decoupled approach results in increased computational efficiency of the framework. The first section of the thesis deals with assignment and sequencing of waypoints for each glider, such that the cumulative energy lost by the team of gliders is minimized. This section uses an estimate of the actual energy, spent by the gliders going from point to point. The second section deals with planning paths over this sequence of waypoints, such that the dynamic constraints of the gliders are respected and the energy lost by each glider, over the course of its mission, is minimized. Each section starts with a review of the literature relevant to that topic. The problem is formulated in a rigorous way and is followed by the proposed solution. Any theoretical guarantees which follow from the proposed solution are stated and proved. After which simulation results are presented.","Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2015-07-22 without embargo terms","The student, Muhammad Zaman, accepted the attached license on 2015-04-29 at 14:01.","The student, Muhammad Zaman, submitted this Thesis for approval on 2015-04-29 at 14:09.","This Thesis was approved for publication on 2015-05-01 at 15:12.","DSpace SAF Submission Ingestion Package generated from Vireo submission #8189 on 2015-07-22 at 10:34:54"]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["An efficient way for path planning of cooperative autonomously soaring gliders"]}]}],"canonical_facts":{"dc:creator":["Zaman, Muhammad Aneeq Uz"],"dc:date":["2015-07-22T22:18:09Z","2015-05","2015-05-01","2015-5"],"dc:description":["Made available in DSpace on 2015-07-22T22:18:09Z (GMT). No. of bitstreams: 2 ZAMAN-THESIS-2015.pdf: 2013042 bytes, checksum: 31e119555d43a7cb77c3a0b2dd9b0a5a (MD5) LICENSE.txt: 4211 bytes, checksum: 29d447deaca356bfb55a4cfd8c8912cf (MD5) Previous issue date: 2015-05-01","This thesis attempts to solve the problem of planning paths for a group of gliding UAVs performing a task. These gliders have start and goal configurations (positions and orientations) in 2-dimensional space and also a starting altitude. This can be thought of as the starting energy of the glider. The task, given to the gliders, is to visit a set of \\textit{interest points} in 2-dimensions. Since the gliders start with a limited energy and are constantly losing it, the paths should be planned such that the energy lost while traveling over the paths is minimized. Moreover, exploitation of free energy present in the environment, called \\textit{Autonomous Soaring}, can also be used to maximize the range of the aircraft, potentially allowing the gliders to visit even more interest points. The task of planning paths for the gliders is decoupled into two parts (i) planning the best sequence of waypoint visitation (for each glider) and, (ii) planning paths over these sequences. This decoupled approach results in increased computational efficiency of the framework. The first section of the thesis deals with assignment and sequencing of waypoints for each glider, such that the cumulative energy lost by the team of gliders is minimized. This section uses an estimate of the actual energy, spent by the gliders going from point to point. The second section deals with planning paths over this sequence of waypoints, such that the dynamic constraints of the gliders are respected and the energy lost by each glider, over the course of its mission, is minimized. Each section starts with a review of the literature relevant to that topic. The problem is formulated in a rigorous way and is followed by the proposed solution. Any theoretical guarantees which follow from the proposed solution are stated and proved. After which simulation results are presented.","Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2015-07-22 without embargo terms","The student, Muhammad Zaman, accepted the attached license on 2015-04-29 at 14:01.","The student, Muhammad Zaman, submitted this Thesis for approval on 2015-04-29 at 14:09.","This Thesis was approved for publication on 2015-05-01 at 15:12.","DSpace SAF Submission Ingestion Package generated from Vireo submission #8189 on 2015-07-22 at 10:34:54"],"dc:format":["application/pdf"],"dc:identifier":["http://hdl.handle.net/2142/78547"],"dc:language":["en"],"dc:rights":["Copyright 2015 Muhammad Aneeq uz Zaman"],"dc:subject":["Cooperative Autonomous Soaring","Cooperative Control","Optimal Path Planning","Optimization"],"dc:title":["An efficient way for path planning of cooperative autonomously soaring gliders"],"dc:type":["text"],"thesis:degree_discipline":["Mechanical Engineering"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:11Z"}