Worst-case parameter search based clearance using parallel nonlinear programming methods

N/ACitations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This chapter presents the theoretical background for several enhancements of the worst-case parameter search based clearance of flight control laws. The worst case search method aims to find combinations of parameters and flight conditions for which the clearance criteria are mostly violated or poorly satisfied. The two main aspects for the proposed enhancements are: (1) increasing the reliability of clearance by the application of global optimization methods in conjunction with established simulation and analysis tools; and (2) increasing the efficiency of clearance by applying parallel computation techniques. These enhancements are illustrated in Chapter 13 by the application of the selected optimization methods and parallelization techniques to several challenging clearance criteria. © 2012 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Joos, H. D. (2012). Worst-case parameter search based clearance using parallel nonlinear programming methods. Lecture Notes in Control and Information Sciences, 416, 149–159. https://doi.org/10.1007/978-3-642-22627-4_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free