Author: Matthew D. FlintPublisher:
ISBN:
Category :
Languages : en
Pages :
Book Description
The work presented here is part of a research program being conducted in the area of decision and control for autonomous unmanned aerial vehicles (UAV2s). Speci.cally, the formulation is presented for the problem of generating near-optimal trajectories to follow in order for several UAV2s to cooperatively search for targets in a given area for which some a priori data about target distribution is available. In order to solve this problem, a discrete time decision model is created. The solution based on this model is presented, which utilizes a dynamic programming approach, implemented with a best-.rst search algorithm. This solution predicts the best path for individual vehicles to take under constraints on movement and computational power. A key reduction in computational complexity as compared to the ideal case is made by utilizing a limited look-ahead policy and by modeling other vehicles as stochastic elements. The formulation is .exible enough to respond to additional goals and restrictions, also. A set of simulation studies is provided that shows the utility of this approach. The proposed method is demonstrated against a standard search, and another method that currently exists in the literature.