Please use this identifier to cite or link to this item:
|Title:||An evolutionary algorithm for multiple waypoints planning with B-spline trajectory generation for Unmanned Aerial Vehicles (UAVs)||Authors:||May, K.E.
Traveling Salesman Problems (TSP)
Unmanned Aerial Vehicles (UAVs)
|Issue Date:||2010||Citation:||May, K.E.,Sien, H.J.,Ping, Y.S.,Hai, S.Z. (2010). An evolutionary algorithm for multiple waypoints planning with B-spline trajectory generation for Unmanned Aerial Vehicles (UAVs). 2010 International Conference on Computational Problem-Solving, ICCP 2010 : 77-81. ScholarBank@NUS Repository.||Abstract:||In this work, we focus on multiple waypoints planning that take into account the stealthiness of autonomous UAVs; generating stealthy waypoints through a region laden with enemy radars. The important goal of waypoint planning for Unmanned Aerial Vehicles (UAVs) is to generate an optimal path for UAVs to visit all of the specified waypoints. We use the Traveling Salesman Problems (TSP) optimization to solve the visitation sequence planning problem for UAVs. The aim is to find the optimal solution that minimizes the distance travelled by the UAVs with low radar risk; under the strict constraints that each waypoint is visited exactly once by the UAVs, and the flying altitude does not exceed the specified threshold so as to minimize the radar exposure. The generated solution is then refined using a series of cubic splines in lieu of the straight line segments, resulting in a cost-effective path traceable by the UAVs. The shape of the trajectory is approximated using cubic B-splines. Simulated results are presented, illustrating the potential benefits of such approach. ©Memetic Computing Society.||Source Title:||2010 International Conference on Computational Problem-Solving, ICCP 2010||URI:||http://scholarbank.nus.edu.sg/handle/10635/83473||ISBN:||9789810863227|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.