Robust nonlinear control of vectored thrust aircraft

An interdisciplinary program in robust control for nonlinear systems with applications to a variety of engineering problems is outlined. Major emphasis will be placed on flight control, with both experimental and analytical studies. This program builds on recent new results in control theory for stability, stabilization, robust stability, robust performance, synthesis, and model reduction in a unified framework using Linear Fractional Transformations (LFT's), Linear Matrix Inequalities (LMI's), and the structured singular value micron. Most of these new advances have been accomplished by the Caltech controls group independently or in collaboration with researchers in other institutions. These recent results offer a new and remarkably unified framework for all aspects of robust control, but what is particularly important for this program is that they also have important implications for system identification and control of nonlinear systems. This combines well with Caltech's expertise in nonlinear control theory, both in geometric methods and methods for systems with constraints and saturations

A nonmonotone GRASP

A greedy randomized adaptive search procedure (GRASP) is an itera- tive multistart metaheuristic for difficult combinatorial optimization problems. Each GRASP iteration consists of two phases: a construction phase, in which a feasible solution is produced, and a local search phase, in which a local optimum in the neighborhood of the constructed solution is sought. Repeated applications of the con- struction procedure yields different starting solutions for the local search and the best overall solution is kept as the result. The GRASP local search applies iterative improvement until a locally optimal solution is found. During this phase, starting from the current solution an improving neighbor solution is accepted and considered as the new current solution. In this paper, we propose a variant of the GRASP framework that uses a new “nonmonotone” strategy to explore the neighborhood of the current solu- tion. We formally state the convergence of the nonmonotone local search to a locally optimal solution and illustrate the effectiveness of the resulting Nonmonotone GRASP on three classical hard combinatorial optimization problems: the maximum cut prob- lem (MAX-CUT), the weighted maximum satisfiability problem (MAX-SAT), and the quadratic assignment problem (QAP)

Restructurable Controls

Restructurable control system theory, robust reconfiguration for high reliability and survivability for advanced aircraft, restructurable controls problem definition and research, experimentation, system identification methods applied to aircraft, a self-repairing digital flight control system, and state-of-the-art theory application are addressed

Space communications scheduler: A rule-based approach to adaptive deadline scheduling

Job scheduling is a deceptively complex subfield of computer science. The highly combinatorial nature of the problem, which is NP-complete in nearly all cases, requires a scheduling program to intelligently transverse an immense search tree to create the best possible schedule in a minimal amount of time. In addition, the program must continually make adjustments to the initial schedule when faced with last-minute user requests, cancellations, unexpected device failures, quests, cancellations, unexpected device failures, etc. A good scheduler must be quick, flexible, and efficient, even at the expense of generating slightly less-than-optimal schedules. The Space Communication Scheduler (SCS) is an intelligent rule-based scheduling system. SCS is an adaptive deadline scheduler which allocates modular communications resources to meet an ordered set of user-specified job requests on board the NASA Space Station. SCS uses pattern matching techniques to detect potential conflicts through algorithmic and heuristic means. As a result, the system generates and maintains high density schedules without relying heavily on backtracking or blind search techniques. SCS is suitable for many common real-world applications

Full Envelope Control of Nonlinear Plants with Parameter Uncertainty by Fuzzy Controller Scheduling

A full envelope controller synthesis technique is developed for multiple-input single-output (MISO) nonlinear systems with structured parameter uncertainty. The technique maximizes the controller\u27s valid region of operation, while guaranteeing pre-specified transient performance. The resulting controller does not require on-line adaptation, estimation, prediction or model identification. Fuzzy Logic (FL) is used to smoothly schedule independently designed point controllers over the operational envelope and parameter space of the system\u27s model. These point controllers are synthesized using techniques chosen by the designer, thus allowing an unprecedented amount of design freedom. By using established control theory for the point controllers, the resulting nonlinear dynamic controller is able to handle the dynamics of complex systems which can not otherwise be addressed by Fuzzy Logic Control. An analytical solution for parameters describing the membership functions allows the optimization to yield the location of point designs: both quantifying the controller\u27s coverage, and eliminating the need of extensive hand tuning of these parameters. The net result is a decrease in the number of point designs required. Geometric primitives used in the solution all have multi-dimensional interpretations (convex hull, ellipsoid, Voronoi-Delaunay diagrams) which allow for scheduling on n-dimensions, including uncertainty due to nonlinearities and parameter variation. Since many multiple-input multiple-output (MIMO) controller design techniques are accomplished by solving several MISO problems, this work bridges the gap to full envelope control of MIMO nonlinear systems with parameter variation