24 May 2012 Lévy walks for autonomous search
Author Affiliations +
Abstract
A canonical problem for autonomy is search and discovery. Often, searching needs to be unpredictable in order to be effective. In this paper, we investigate and compare the effectiveness of the traditional and predictable lawnmower search strategy to that of a random search. Specifically the family of searches with paths determined by heavy tailed distributions called Lévy stable searches is investigated. These searches are characterized by long flight paths, followed by a new random direction, with the flight path lengths determined by the distribution parameter α. Two basic search scenarios are considered in this study: stationary targets, and moving targets, both on planar surfaces. Monte-Carlo simulations demonstrate the advantages of Lévy over the lawnmower strategy especially for moving targets. Ultimately to corroborate the suitability of the Lévy strategy for UAVs, we implement and demonstrate the feasibility of the algorithm in the Multiple Unified Simulation Environment (MUSE), which includes vehicle's constraints and dynamics. The MUSE / Air Force Synthetic Environment for Reconnaissance and Surveillance (AFSERS) simulation system is the primary virtual ISR and UAV simulation within DOD for command and staff level training for the Joint Services.
© (2012) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Arjuna Flenner, Arjuna Flenner, Jennifer Flenner, Jennifer Flenner, James Bobinchak, James Bobinchak, David Mercier, David Mercier, Anhtuan Le, Anhtuan Le, Katia Estabridis, Katia Estabridis, Gary Hewer, Gary Hewer, } "Lévy walks for autonomous search", Proc. SPIE 8389, Ground/Air Multisensor Interoperability, Integration, and Networking for Persistent ISR III, 83890Z (24 May 2012); doi: 10.1117/12.918719; https://doi.org/10.1117/12.918719
PROCEEDINGS
10 PAGES


SHARE
Back to Top