Lissajous curves as aerial search patterns

Abstract

AbstractManned and unmanned systems are prevalent in a wide range of aerial searching applications. For aircraft whose trajectory is not or cannot be planned on-the-fly, optimal deterministic search pattern generation is a critical area of research. Lissajous curves have recently caught attention as excellent candidates for all kinds of aerial search applications, but little fundamental research has been done to understand how best to design Lissajous pattern (LP)s for this use. This paper examines the optimization of these search patterns from analytical, numerical, and data-driven perspectives to establish the state of the field in Lissajous curves for aerial search. From an analytical perspective, it was found that the average expected distance between a Lissajous searcher and a random target on a unit square approaches 0.586 as search time increases. Furthermore, an analytical approximation for the average searcher speed was found to guarantee error of no more than 22.1%. Important outcomes from the numerical optimization of Lissajous search patterns include the development of an intuitive evaluation criterion and the conclusion that irrational frequency ratios near 0.8 typically yield highest performance. Finally, while a robust predictive model for fast pattern optimization is yet out of reach, initial results indicate that such an approach shows promise.