Master of Science (MS)
First Committee Member
Laxmi P. Gewali
Number of Pages
We consider the problem of developing fast algorithms for computing short collision-free paths for aerial vehicles in the presence of obstacles and enemy radar installations. When aerial vehicles are deployed in such regions, it is critical to compute admissible paths having reduced exposure to threats. The generalized version of this problem is known to be NP-hard . We consider simplified versions in two dimensions. One of the specific problems we address is to adjust a given k-legged trajectory to reduce exposure to threats. We also propose an algorithm to compute a k-legged risk-reduced path using a stage graph which runs in 0(m 2p) time where m is the number of vertices per turn region and p is the number of radar and obstacle polygon edges. In addition, we describe methods for obtaining multiple risk-reduced paths and node disjoint paths from the stage graph. We also discuss the implementation of the proposed algorithms.
Planning; Presence; Regions; Risk; Trajectory
University of Nevada, Las Vegas
If you are the rightful copyright holder of this dissertation or thesis and wish to have the full text removed from Digital Scholarship@UNLV, please submit a request to firstname.lastname@example.org and include clear identification of the work, preferably with URL.
Sherwood, Michael Allan, "Trajectory planning in the presence of risk regions" (2003). UNLV Retrospective Theses & Dissertations. 1561.