UAS trajectories, UAV path planning, ADS-B, convex optimization, separation assurance, detect and avoid
This paper presents a time-based path planning optimizer for separation assurance for unmanned aircraft systems (UAS). Given Automatic Dependent Surveillance-Broadcast (ADS-B) as a sensor, intruder information such as position, velocity, and identification information is available at ranges on the order of 50 nautical miles. Such long-range intruder detection facilitates path planning for separation assurance, but also poses computational challenges. The time-based path optimizer presented in this paper provides a path-planning method that takes advantage of long-range ADS-B information and addresses the associated challenges. It is capable of long-range path planning and, due to the convex formulation, is computationally efficient enough to run successively for increased robustness. The ultimate result of this research is a convex, time-based path planner that is suitable for a detect-and-avoid solution on small UAS in the National Airspace System.
Original Publication Citation
Duffield, M., Ning, A., and McLain, T., “Optimization-Based Path Planning for Separation Assurance on Small Unmanned Aircraft,” AIAA Guidance, Navigation, and Control Conference, San Diego, CA, Jan. 2016. doi:10.2514/6.2016-2194
BYU ScholarsArchive Citation
Duffield, Matthew; Ning, Andrew; and McLain, Timothy, "Optimization-Based Path Planning for Separation Assurance on Small Unmanned Aircraft" (2016). All Faculty Publications. 1721.
Ira A. Fulton College of Engineering and Technology
Copyright Use Information