Engineering topics

Voulgaris, Petros G.

Publications and source records attributed to Voulgaris, Petros G..

5 records

NASA NTRS1997

On-Line Modal State Monitoring of Slowly Time-Varying Structures

Monitoring the dynamic response of structures is often performed for a variety of reasons. These reasons include condition-based maintenance, health monitoring, performance improvements, and control. In many cases the data analysis that is performed is part of a repetitive decision-making process, and in these cases the development of effective on-line monitoring schemes help to speed the decision-making process and reduce the risk of erroneous decisions. This report investigates the use of spatial modal filters for tracking the dynamics of slowly time-varying linear structures. The report includes an overview of modal filter theory followed by an overview of several structural system identification methods. Included in this discussion and comparison are H-infinity, eigensystem realization, and several time-domain least squares approaches. Finally, a two-stage adaptive on-line monitoring scheme is developed and evaluated.

Johnson, Erik A.↗

NASA NTRS1992

Optimal and robust controllers for periodic and multirate systems

The problem of optimal rejection of bounded persistent disturbances is solved in the case of linear discrete-time periodic systems. The solution consists of solving an equivalent time-invariant standard l1 optimization problem subject to an additional constraint. This constraint assures the causality of the resulting periodic controller. By the duality theory, the problem is shown to be equivalent to a linear programming problem, which is no harder than the standard l1 problem. Also, it is shown that the method of solution presented applies exactly to the problem of disturbance rejection in the case of multirate sampled data systems. Finally, the results are applied to the problem of robust stabilization of periodic and multirate systems.

Dahleh, Munther A.↗

NASA NTRS1992

On slowly varying systems - l-infinity to l-infinity performance and implications to robust adaptive control

The authors present a result on the l-infinity to l-infinity performance of slowly time varying systems. In particular, it is shown that the performance of such systems cannot be much worse than that of the frozen-time systems which are time invariant. This result is used to characterize a class of indirect adaptive controllers that can stabilize a time-invariant system subjected to both parametric and l-infinity to l-infinity bounded unstructured uncertainty. Pertaining to this class of controllers, a particular indirect adaptive scheme is proposed that provides the greatest upper bound on the size of the unstructured uncertainty for which stability is ensured.

Voulgaris, Petros G.↗

NASA NTRS1991

H(infinity) and H2 optimal controllers for periodic and multi-rate systems

The solutions to the optimal l2 to l2 disturbance rejection problem H(infinity) as well as to the LQG (linear quadratic Gaussian) H2 problem in periodic systems using the lifting technique are presented. Both problems involve a causality condition on the optimal LTI (linear time invariant) compensator when viewed in the lifted domain. The H(infinity) problem is solved using the Nehari's theorem, whereas in the H2 problem the solution is obtained using the projection theorem in Hilbert spaces. The authors demonstrate that exactly the same method of solution to the H(infinity) and H2 problems in periodic systems applies when considering the same problems in multirate sampled data systems.

Voulgaris, Petros G.↗

NASA NTRS1990

Optimal rejection of bounded persistent disturbances in periodic systems

The problem of optimal rejection of bounded persistent disturbances is solved in the case of linear discrete-time period systems. The solution consists of solving an equivalent time-invariant standard l1 optimization problem subject to an additional constraint. This constraint ensures the causality of the resulting periodic controller. By the duality theory, the problem is shown to be equivalent to a linear programming problem, which is no harder than the standard l1 problem.

Dahleh, Munther A.↗