Year: 2010
Author: J. Peter, N. C. Parida, S. Raha
International Journal of Numerical Analysis and Modeling, Vol. 7 (2010), Iss. 2 : pp. 240–260
Abstract
This paper describes an algorithm for "direct numerical integration" of the initial value Differential-Algebraic Inequalities (DAI) in a time stepping fashion using a sequential quadratic programming (SQP) method solver for detecting and satisfying active path constraints at each time step. The activation of a path constraint generally increases the condition number of the active discretized differential algebraic equation’s (DAE) Jacobian and this difficulty is addressed by a regularization property of the $α$ method. The algorithm is locally stable when index 1 and index 2 active path constraints and bounds are active. Subject to available regularization it is seen to be stable for active index 3 active path constraints in the numerical examples. For the high index active path constraints, the algorithm uses a user-selectable parameter to perturb the smaller singular values of the Jacobian with a view to reducing the condition number so that the simulation can proceed. The algorithm can be used as a relatively cheaper estimation tool for trajectory and control planning and in the context of model predictive control solutions. It can also be used to generate initial guess values of optimization variables used as input to inequality path constrained dynamic optimization problems. The method is illustrated with examples from space vehicle trajectory and robot path planning.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/2010-IJNAM-718
International Journal of Numerical Analysis and Modeling, Vol. 7 (2010), Iss. 2 : pp. 240–260
Published online: 2010-01
AMS Subject Headings: Global Science Press
Copyright: COPYRIGHT: © Global Science Press
Pages: 21
Keywords: Differential-algebraic equations trajectory planning numerical optimization inequality path constraints.