Show simple item record

dc.contributor.advisorAnthony T. Patera.en_US
dc.contributor.authorOliveira, Ivan B. (Ivan Borges), 1975-en_US
dc.contributor.otherMassachusetts Institute of Technology. Department of Mechanical Engineering.en_US
dc.date.accessioned2014-09-19T21:26:30Z
dc.date.available2014-09-19T21:26:30Z
dc.date.copyright2002en_US
dc.date.issued2002en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/89883
dc.descriptionThesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 2002.en_US
dc.descriptionIncludes bibliographical references (p. 145-147).en_US
dc.description.abstractOptimal control problems often arise in engineering applications when a known desired behavior is to be imposed on a dynamical system. Typically, there is a performance and controller use trade-off that can be quantified as a total cost functional of the state and control histories. Problems stated in such a manner are not required to follow an exact desired behavior, alleviating potential controllability issues. We present a method for solving large deterministic optimal control problems defined by quadratic cost functionals, nonlinear state equations, and box-type constraints on the control variables. The algorithm has been developed so that systems governed by general parabolic partial differential equations can be solved. The problems addressed are of the regulator-terminal type, in which deviations from specified state variable behavior are minimized over the entire trajectory as well as at the final time. The core of the algorithm consists of an extension of the Hilbert Uniqueness Method which, we show, can be considered a statement of the dual. With the definition of a problem-specific inner-product space, a formulation is constructed around a well-conditioned, stable, SPD operator, thus leading to fast rates of convergence when solved by, for instance, a conjugate gradient procedure (denoted here TRCG). Total computational time scales roughly as twice the order of magnitude of the computational cost of a single initial-value problem.en_US
dc.description.abstract(cont.) Standard logarithmic barrier functions and Newton methods are employed to address the hard constraints on control variables of the type Umin < U < Umax. We have shown that the TRCG algorithm allows for the incorporation of these techniques, and that convergence results maintain advantageous properties found in the standard (linear programming) literature. The TRCG operator is shown to maintain its symmetric positive-definiteness for temporal discretizations, a property that is crucial to the practical implementation of the proposed algorithm. Sample calculations are presented which illustrate the performance of the method when applied to a nonlinear heat transfer problem governed by partial differential equations.en_US
dc.description.statementofresponsibilityby Ivan B. Oliveira.en_US
dc.format.extent147 p.en_US
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technologyen_US
dc.rightsM.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.en_US
dc.rights.urihttp://dspace.mit.edu/handle/1721.1/7582en_US
dc.subjectMechanical Engineering.en_US
dc.titleA "HUM" conjugate gradient algorithm for constrained nonlinear optimal control : terminal and regular problemsen_US
dc.typeThesisen_US
dc.description.degreePh.D.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Mechanical Engineering
dc.identifier.oclc50500046en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record