Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences

Brigham Young University

Series

Path planning

Publication Year

Articles 1 - 4 of 4

Full-Text Articles in Physical Sciences and Mathematics

Uav Intelligent Path Planning For Wilderness Search And Rescue, Michael A. Goodrich, Lanny Lin Oct 2009

Uav Intelligent Path Planning For Wilderness Search And Rescue, Michael A. Goodrich, Lanny Lin

Faculty Publications

In the priority search phase of Wilderness Search and Rescue, a probability distribution map is created. Areas with higher probabilities are searched first in order to find the missing person in the shortest expected time. When using a UAV to support search, the onboard video camera should cover as much of the important areas as possible within a set time. We explore several algorithms (with and without set destination) and describe some novel techniques in solving this problem and compare their performances against typical WiSAR scenarios. This problem is NP-hard, but our algorithms yield high quality solutions that approximate the …


Learning Real-Time A* Path Planner For Unmanned Air Vehicle Target Sensing, Jason K. Howlett, Timothy W. Mclain, Michael A. Goodrich Mar 2006

Learning Real-Time A* Path Planner For Unmanned Air Vehicle Target Sensing, Jason K. Howlett, Timothy W. Mclain, Michael A. Goodrich

Faculty Publications

This paper presents a path planner for sensing closely-spaced targets from a fixed-wing unmanned air vehicle (UAV) having a specified sensor footprint. The planner is based on the learning real-time A* (LRTA*) search algorithm and produces dynamically feasible paths that accomplish the sensing objectives in the shortest possible distance. A tree of candidate paths that span the area of interest is created by assembling primitive turn and straight sections of a specified step size in a sequential fashion from the starting position of the UAV. An LRTA* search of the tree produces feasible paths any time during its execution and …


Learning Real-Time A* Path Planner For Sensing Closely-Spaced Targets From An Aircraft, Jason K. Howlett, Michael A. Goodrich, Timothy W. Mclain Aug 2003

Learning Real-Time A* Path Planner For Sensing Closely-Spaced Targets From An Aircraft, Jason K. Howlett, Michael A. Goodrich, Timothy W. Mclain

Faculty Publications

This work develops an any-time path planner, based on the learning real-time A* (LRTA*) search, for generating flyable paths that allow an aircraft with a specified sensor footprint to sense a group of closely-spaced targets. The LRTA* algorithm searches a tree of flyable paths for the branch that accomplishes the desired objectives in the shortest distance. The tree of paths is created by assembling primitive turn and straight sections of a specified step size. The operating parameters for the LRTA* search directly influence the running time and path-length performance of the search. A modified LRTA* search is presented that terminates …


Coordinated Target Assignment And Intercept For Unmanned Air Vehicles, Erik P. Anderson, Randal W. Beard, Michael A. Goodrich, Timothy W. Mclain Dec 2002

Coordinated Target Assignment And Intercept For Unmanned Air Vehicles, Erik P. Anderson, Randal W. Beard, Michael A. Goodrich, Timothy W. Mclain

Faculty Publications

This paper presents an end-to-end solution to the cooperative control problem represented by the scenario where unmanned air vehicles (UAVs) are assigned to transition through known target locations in the presence of dynamic threats. The problem is decomposed into the subproblems of: 1) cooperative target assignment; 2) coordinated UAV intercept; 3) path planning; 4) feasible trajectory generation; and 5) asymptotic trajectory following. The design technique is based on a hierarchical approach to coordinated control. Simulation results are presented to demonstrate the effectiveness of the approach.