On the Guaranteed Nonsingularity of a Class of Banded Matrices for Optimal Control Generation
-
Published:2003-12-01
Issue:4
Volume:125
Page:672-673
-
ISSN:0022-0434
-
Container-title:Journal of Dynamic Systems, Measurement, and Control
-
language:en
-
Short-container-title:
Author:
Driessen Brian J.1, Sadegh Nader2
Affiliation:
1. Department of Mechanical and Aerospace Engineering, University of Alabama in Huntsville, Huntsville, AL 35899 2. Department of Mechanical Engineering, Georgia Institute of Technology, Atlanta, GA 30332
Abstract
The contribution of the present paper is to further extend the generality of the method presented in [Driessen et al., [2]], for model-based minimum-time trajectory generation for dynamic systems with equality and inequality path constraints. In the above reference, the guaranteed nonsingularity of the sub-problem’s banded-matrix (footnote 2 therein) was stated for the case where no constraint involved both inputs and states. In the last sentence here we are referring to the modified-Gauss-Newton (MGN) matrix from footnote 2 of [Driessen et al., [2]]. We are simultaneously referring to the matrix in the left hand side of equation (3.8) of the present paper; the two differ only in a re-ordering of the rows and columns. Herein, this matrix will be referred to as the MGN matrix irrespective of row/column-ordering which has no bearing on the singularity/nonsingularity of a matrix. While it is often the case that no constraint contains both inputs and states, it is not the case for some problems. The contribution of the present paper is the proof that the above-mentioned banded MGN matrix is guaranteed nonsingular for absolutely any constraints, with or without mixed terms, and is furthermore still assured to provide the descent property.
Publisher
ASME International
Subject
Computer Science Applications,Mechanical Engineering,Instrumentation,Information Systems,Control and Systems Engineering
Reference7 articles.
1. Bazaraa, M., et al., 1979, Nonlinear Programming, Theory and Applications, Second Edition, New York: John Wiley & Sons, Inc. 2. Driessen, B., Sadegh, N., Parker, G., and Eisler, G., 1999, “A Robust Algorithm for General Inequality/Equality Constrained Minimum Time Problems,” ASME J. Dyn. Syst., Meas., Control, 121, pp. 337–345. 3. Driessen, B., and Sadegh, N., 2002, “Inequality/Equality Constrained Optimization: An Analytical Robustness Comparison of a Feasibility Method Versus L1 Sequential Quadratic Programming,” Optimization Methods and Software, 17(4), pp. 701–716. 4. Ruxton, D. J.
, 1993, “Differential Dynamic Programming Applied to Continuous Optimal Control Problems With State Variable Inequality Constraints,” Dyn. Control, 3, pp. 175–185. 5. Strang, G., 1988, Linear Algebra and Its Applications, 3rd edition, San Diego: Harcourt Brace Jovanovich, Inc.
|
|