Abstract
This paper presents atrajectory optimization-based study for identifying the influencesof different fixed-wing aircraft parameters on perching maneuvers. Perching trajectories, which involve climbing for landing with a near-zero speed, are optimized to minimize the unwanted altitude gain, herewith referred to as undershoot. Undershoot has a complex relationshipnot only with the control inputs, but also with the aircraft geometry and features, such as stability characteristics, controllability, and thrust available. Tofacilitate this parametric study, anaerodynamic modeling tool is developed, which combines a nonlinear vortex correction method with the Leishman's state-space form of Wagner's unsteady model. This tool is used for in-flight aerodynamics evaluation during the optimization of the perching maneuvers. The perching solutions - minimum undershoot and trajectory length - are then computed, andthe effects of key parameters of the maneuver are studied. Itis found that a high aspect ratio, high thrust available, optimal placement of the center of gravity, relaxed terminal velocity constraints, low zero-lift drag, and headwind reduce the spatial requirements for the maneuver. Furthermore, it is confirmed that a high angle-of-attack maneuver is not critical for very low speed perching.
Keywords
Affiliated Institutions
Related Publications
A linear space algorithm for computing maximal common subsequences
The problem of finding a longest common subsequence of two strings has been solved in quadratic time and space. An algorithm is presented which will solve this problem in quadra...
Fast Kernels for String and Tree Matching
In this paper we present a new algorithm suitable for matching discrete objects such as strings and trees in linear time, thus obviating dynamic programming with quadratic time ...
Randomized Algorithms
Randomized algorithms, once viewed as a tool in computational number theory, have by now found widespread application. Growth has been fueled by the two major benefits of random...
Handbook of Genetic Algorithms
This book sets out to explain what genetic algorithms are and how they can be used to solve real-world problems. The first objective is tackled by the editor, Lawrence Davis. Th...
Nearest-Neighbor Clutter Removal for Estimating Features in Spatial Point Processes
Abstract We consider the problem of detecting features in spatial point processes in the presence of substantial clutter. One example is the detection of minefields using reconn...
Publication Info
- Year
- 1999
- Type
- article
- Volume
- 9
- Issue
- 4
- Pages
- 877-900
- Citations
- 1681
- Access
- Closed
External Links
Social Impact
Social media, news, blog, policy document mentions
Citation Metrics
Cite This
Identifiers
- DOI
- 10.1137/s1052623497325107