@prefix ns1: .
@prefix ns2: .
@prefix rdf: .
@prefix rdfs: .
@prefix xml: .
@prefix xsd: .
a ns1:Chapter ;
ns1:about ,
,
;
ns1:author ( [ a ns1:Person ;
ns1:affiliation ;
ns1:familyName "Nerz" ;
ns1:givenName "Edda" ] ) ;
ns1:datePublished "1993" ;
ns1:datePublishedReg "1993-01-01" ;
ns1:description "When solving optimal control problems, indirect methods such as multiple shooting suffer from difficulties in finding an appropriate initial guess for the adjoint variables. For, this initial estimate must be provided for the iterative solution of the multipoint boundary-value problems arising from the necessary conditions of optimal control theory. Direct methods such as direct collocation do not suffer from this problem, but they generally yield results of lower accuracy and their iteration may even terminate with a non-optimal solution. Therefore, both methods are combined in such a way that the direct collocation method is at first applied to a simplified optimal control problem where all inequality constraints are neglected as long as the resulting problem is still well-defined. Because of the larger domain of convergence of the direct method, an approximation of the optimal solution of this problem can be obtained easier. The fusion between direct and indirect methods is then based on a relationship between the Lagrange multipliers of the underlying nonlinear programming problem to be solved by the direct method and the adjoint variables appearing in the necessary conditions which form the boundary-value problem to be solved by the indirect method. Hence, the adjoint variables, too, can be estimated from the approximation obtained by the direct method. This first step then facilitates the subsequent extension and competition of the model by homotopy techniques and the solution of the arising boundary-value problems by the indirect multiple shooting method. Proceeding in this way, the high accuracy and reliability of the multiple shooting method, especially the precise computation of the switching structure and the possibility to verify many necessary conditions, is preserved while disadvantages caused by the sensitive dependence on an appropriate estimate of the solution are considerably cut down. This procedure is described in detail for the numerical solution of the maximum-range trajectory optimization problem of a hang glider in an upwind which provides an example for a control problem where appropriate initial estimates for the adjoint variables are hard to find." ;
ns1:editor ( [ a ns1:Person ;
ns1:familyName "Bulirsch" ;
ns1:givenName "R." ] [ a ns1:Person ;
ns1:familyName "Miele" ;
ns1:givenName "A." ] [ a ns1:Person ;
ns1:familyName "Stoer" ;
ns1:givenName "J." ] [ a ns1:Person ;
ns1:familyName "Well" ;
ns1:givenName "K." ] ) ;
ns1:genre "chapter" ;
ns1:isAccessibleForFree false ;
ns1:isPartOf [ a ns1:Book ;
ns1:isbn "978-3-0348-7539-4",
"978-3-0348-7541-7" ;
ns1:name "Optimal Control" ] ;
ns1:keywords "Lagrange multipliers",
"accuracy",
"adjoint",
"adjoint variables",
"appropriate estimates",
"appropriate initial estimates",
"appropriate initial guess",
"approximation",
"boundary value problem",
"collocation",
"collocation method",
"competition",
"computation",
"conditions",
"constraints",
"control",
"control problem",
"control theory",
"convergence",
"dependence",
"detail",
"difficulties",
"direct collocation",
"direct collocation method",
"direct method",
"disadvantages",
"domain",
"estimates",
"example",
"extension",
"first step",
"fusion",
"glider",
"guess",
"hang glider",
"high accuracy",
"homotopy technique",
"indirect method",
"indirect multiple shooting method",
"inequality constraints",
"initial estimates",
"initial guess",
"iteration",
"iterative solution",
"large domains",
"low accuracy",
"maximization",
"method",
"model",
"multiple shooting",
"multiple shooting method",
"multipliers",
"multipoint boundary value problem",
"necessary condition",
"non-optimal solutions",
"nonlinear programming problem",
"numerical solution",
"optimal control",
"optimal control problem",
"optimal control theory",
"optimal solution",
"optimization problem",
"possibility",
"precise computation",
"problem",
"procedure",
"programming problem",
"range maximization",
"relationship",
"reliability",
"results",
"sensitive dependence",
"shooting",
"shooting method",
"solution",
"step",
"structure",
"subsequent extension",
"switching structure",
"technique",
"theory",
"trajectory optimization problem",
"upwind",
"variables",
"way" ;
ns1:name "Combining Direct and Indirect Methods in Optimal Control: Range Maximization of a Hang Glider" ;
ns1:pagination "273-288" ;
ns1:productId [ a ns1:PropertyValue ;
ns1:name "dimensions_id" ;
ns1:value "pub.1004585554" ],
[ a ns1:PropertyValue ;
ns1:name "doi" ;
ns1:value "10.1007/978-3-0348-7539-4_20" ] ;
ns1:publisher [ a ns1:Organisation ;
ns1:name "Springer Nature" ] ;
ns1:sameAs ,
;
ns1:sdDatePublished "2022-08-04T17:19" ;
ns1:sdLicense "https://scigraph.springernature.com/explorer/license/" ;
ns1:sdPublisher [ a ns1:Organization ;
ns1:name "Springer Nature - SN SciGraph project" ] ;
ns1:url "https://doi.org/10.1007/978-3-0348-7539-4_20" ;
ns2:license ;
ns2:sdDataset "chapters" .
a ns1:DefinedTerm ;
ns1:inDefinedTermSet ;
ns1:name "Mathematical Sciences" .
a ns1:DefinedTerm ;
ns1:inDefinedTermSet ;
ns1:name "Applied Mathematics" .
a ns1:DefinedTerm ;
ns1:inDefinedTermSet ;
ns1:name "Numerical and Computational Mathematics" .
a ns1:Person ;
ns1:affiliation ;
ns1:familyName "von Stryk" ;
ns1:givenName "Oskar" ;
ns1:sameAs .
a ns1:Person ;
ns1:affiliation ;
ns1:familyName "Pesch" ;
ns1:givenName "Hans Josef" ;
ns1:sameAs .
a ns1:Person ;
ns1:affiliation ;
ns1:familyName "Bulirsch" ;
ns1:givenName "Roland" ;
ns1:sameAs .
a ns1:Organization ;
ns1:alternateName "Mathematisches Institut, Technische Universität München, Postfach 20 24 20, D-8000, München 2, Germany" ;
ns1:name "Mathematisches Institut, Technische Universität München, Postfach 20 24 20, D-8000, München 2, Germany" .