1998
DOI: 10.2514/2.4306
|View full text |Cite
|
Sign up to set email alerts
|

Collocation Versus Differential Inclusion in Direct Optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
17
0

Year Published

2000
2000
2023
2023

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 36 publications
(17 citation statements)
references
References 10 publications
0
17
0
Order By: Relevance
“…As a result, we reduced the original problem to a nonlinear programming problem, meaning we obtained a problem of minimization for the scalar function of several (but not tens as in Refs. [24][25][26][27][28][29][30][31][32][33][34][35][36] variables:…”
Section: E Minimization Of Multivariable Scalar Functionmentioning
confidence: 99%
See 1 more Smart Citation
“…As a result, we reduced the original problem to a nonlinear programming problem, meaning we obtained a problem of minimization for the scalar function of several (but not tens as in Refs. [24][25][26][27][28][29][30][31][32][33][34][35][36] variables:…”
Section: E Minimization Of Multivariable Scalar Functionmentioning
confidence: 99%
“…The previously mentioned procedure can permit the reduction of the size of the parameter optimization problem. 33,34 Smaller problems can then be solved more quickly. Lu 35,36 used, for each piece, an approach similar to Taranenko's method.…”
mentioning
confidence: 99%
“…3, the more accurate integration rules such as trapezoid or Simpson are implicit integration rules that make it impossible to express the state derivatives at the i th node in terms of the state variables alone. With our formulation of the Legendre pseudospectral method, we have circumvented this dif culty and offer a method that is both accurate and adaptable to a differential inclusion formulation.…”
Section: Legendre Pseudospectral Methodsmentioning
confidence: 99%
“…3 The cart problem has an analytic solution and has a linear control and a quadratic cost function with a xed nal time. The state variables are x 1 , the displacement of the cart of unit mass, and x 2 the velocity, and the control u is the external force.…”
Section: Numerical Examplementioning
confidence: 99%
“…On the other hand, direct methods convert the calculus of the variation problem into a parameter optimization problem that minimizes the performance index by using nonlinear programming (NLP). It also transcribes the states and controls through direct transcription and collocation [16,17] or differential inclusion [18,19]. The entire trajectory to be optimized by this direct method is represented in terms of nodes [17], and a large number of design variables.…”
Section: Introductionmentioning
confidence: 99%