Combining Direct and Indirect Methods in Optimal Control: Range Maximization of a Hang Glider View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

1993

AUTHORS

Roland Bulirsch , Edda Nerz , Hans Josef Pesch , Oskar von Stryk

ABSTRACT

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. More... »

PAGES

273-288

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-0348-7539-4_20

DOI

http://dx.doi.org/10.1007/978-3-0348-7539-4_20

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1004585554


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/01", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Mathematical Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0102", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Applied Mathematics", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0103", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Numerical and Computational Mathematics", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Mathematisches Institut, Technische Universit\u00e4t M\u00fcnchen, Postfach 20 24 20, D-8000, M\u00fcnchen 2, Germany", 
          "id": "http://www.grid.ac/institutes/grid.6936.a", 
          "name": [
            "Mathematisches Institut, Technische Universit\u00e4t M\u00fcnchen, Postfach 20 24 20, D-8000, M\u00fcnchen 2, Germany"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Bulirsch", 
        "givenName": "Roland", 
        "id": "sg:person.0767272315.31", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0767272315.31"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Mathematisches Institut, Technische Universit\u00e4t M\u00fcnchen, Postfach 20 24 20, D-8000, M\u00fcnchen 2, Germany", 
          "id": "http://www.grid.ac/institutes/grid.6936.a", 
          "name": [
            "Mathematisches Institut, Technische Universit\u00e4t M\u00fcnchen, Postfach 20 24 20, D-8000, M\u00fcnchen 2, Germany"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Nerz", 
        "givenName": "Edda", 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Mathematisches Institut, Technische Universit\u00e4t M\u00fcnchen, Postfach 20 24 20, D-8000, M\u00fcnchen 2, Germany", 
          "id": "http://www.grid.ac/institutes/grid.6936.a", 
          "name": [
            "Mathematisches Institut, Technische Universit\u00e4t M\u00fcnchen, Postfach 20 24 20, D-8000, M\u00fcnchen 2, Germany"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Pesch", 
        "givenName": "Hans Josef", 
        "id": "sg:person.014543723551.22", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014543723551.22"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Mathematisches Institut, Technische Universit\u00e4t M\u00fcnchen, Postfach 20 24 20, D-8000, M\u00fcnchen 2, Germany", 
          "id": "http://www.grid.ac/institutes/grid.6936.a", 
          "name": [
            "Mathematisches Institut, Technische Universit\u00e4t M\u00fcnchen, Postfach 20 24 20, D-8000, M\u00fcnchen 2, Germany"
          ], 
          "type": "Organization"
        }, 
        "familyName": "von Stryk", 
        "givenName": "Oskar", 
        "id": "sg:person.014313516176.44", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014313516176.44"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "1993", 
    "datePublishedReg": "1993-01-01", 
    "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.", 
    "editor": [
      {
        "familyName": "Bulirsch", 
        "givenName": "R.", 
        "type": "Person"
      }, 
      {
        "familyName": "Miele", 
        "givenName": "A.", 
        "type": "Person"
      }, 
      {
        "familyName": "Stoer", 
        "givenName": "J.", 
        "type": "Person"
      }, 
      {
        "familyName": "Well", 
        "givenName": "K.", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-0348-7539-4_20", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-0348-7541-7", 
        "978-3-0348-7539-4"
      ], 
      "name": "Optimal Control", 
      "type": "Book"
    }, 
    "keywords": [
      "boundary value problem", 
      "optimal control problem", 
      "multiple shooting method", 
      "adjoint variables", 
      "control problem", 
      "shooting method", 
      "indirect multiple shooting method", 
      "direct method", 
      "necessary condition", 
      "optimal control theory", 
      "multipoint boundary value problem", 
      "direct collocation method", 
      "trajectory optimization problem", 
      "appropriate initial estimates", 
      "nonlinear programming problem", 
      "appropriate initial guess", 
      "hang glider", 
      "initial estimates", 
      "non-optimal solutions", 
      "optimal control", 
      "direct collocation", 
      "multiple shooting", 
      "homotopy technique", 
      "collocation method", 
      "control theory", 
      "inequality constraints", 
      "iterative solution", 
      "optimization problem", 
      "numerical solution", 
      "Lagrange multipliers", 
      "initial guess", 
      "programming problem", 
      "optimal solution", 
      "sensitive dependence", 
      "precise computation", 
      "switching structure", 
      "range maximization", 
      "approximation", 
      "indirect method", 
      "appropriate estimates", 
      "large domains", 
      "problem", 
      "solution", 
      "high accuracy", 
      "adjoint", 
      "estimates", 
      "iteration", 
      "convergence", 
      "collocation", 
      "computation", 
      "guess", 
      "variables", 
      "multipliers", 
      "low accuracy", 
      "accuracy", 
      "theory", 
      "maximization", 
      "constraints", 
      "upwind", 
      "extension", 
      "dependence", 
      "subsequent extension", 
      "first step", 
      "model", 
      "conditions", 
      "glider", 
      "detail", 
      "technique", 
      "way", 
      "structure", 
      "reliability", 
      "domain", 
      "step", 
      "shooting", 
      "procedure", 
      "results", 
      "control", 
      "possibility", 
      "difficulties", 
      "disadvantages", 
      "competition", 
      "fusion", 
      "relationship", 
      "method", 
      "example"
    ], 
    "name": "Combining Direct and Indirect Methods in Optimal Control: Range Maximization of a Hang Glider", 
    "pagination": "273-288", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1004585554"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-0348-7539-4_20"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-0348-7539-4_20", 
      "https://app.dimensions.ai/details/publication/pub.1004585554"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-08-04T17:19", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220804/entities/gbq_results/chapter/chapter_370.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-0348-7539-4_20"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/978-3-0348-7539-4_20'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/978-3-0348-7539-4_20'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-0348-7539-4_20'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-0348-7539-4_20'


 

This table displays all metadata directly associated to this object as RDF triples.

183 TRIPLES      22 PREDICATES      111 URIs      103 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-0348-7539-4_20 schema:about anzsrc-for:01
2 anzsrc-for:0102
3 anzsrc-for:0103
4 schema:author N58a4859f776540ce9d5f39699376ea4d
5 schema:datePublished 1993
6 schema:datePublishedReg 1993-01-01
7 schema: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.
8 schema:editor N5dabaf14436a422a987e74c1ea04eda1
9 schema:genre chapter
10 schema:isAccessibleForFree false
11 schema:isPartOf N626363f0e4a5445bbcaa3519c999082d
12 schema:keywords Lagrange multipliers
13 accuracy
14 adjoint
15 adjoint variables
16 appropriate estimates
17 appropriate initial estimates
18 appropriate initial guess
19 approximation
20 boundary value problem
21 collocation
22 collocation method
23 competition
24 computation
25 conditions
26 constraints
27 control
28 control problem
29 control theory
30 convergence
31 dependence
32 detail
33 difficulties
34 direct collocation
35 direct collocation method
36 direct method
37 disadvantages
38 domain
39 estimates
40 example
41 extension
42 first step
43 fusion
44 glider
45 guess
46 hang glider
47 high accuracy
48 homotopy technique
49 indirect method
50 indirect multiple shooting method
51 inequality constraints
52 initial estimates
53 initial guess
54 iteration
55 iterative solution
56 large domains
57 low accuracy
58 maximization
59 method
60 model
61 multiple shooting
62 multiple shooting method
63 multipliers
64 multipoint boundary value problem
65 necessary condition
66 non-optimal solutions
67 nonlinear programming problem
68 numerical solution
69 optimal control
70 optimal control problem
71 optimal control theory
72 optimal solution
73 optimization problem
74 possibility
75 precise computation
76 problem
77 procedure
78 programming problem
79 range maximization
80 relationship
81 reliability
82 results
83 sensitive dependence
84 shooting
85 shooting method
86 solution
87 step
88 structure
89 subsequent extension
90 switching structure
91 technique
92 theory
93 trajectory optimization problem
94 upwind
95 variables
96 way
97 schema:name Combining Direct and Indirect Methods in Optimal Control: Range Maximization of a Hang Glider
98 schema:pagination 273-288
99 schema:productId N75e6571f1fef4a8ebff44512ae60bf01
100 Nb642c2e7e8824731a997895fd34bd301
101 schema:publisher N1783b96ecc6d40d08d4f579d2ff02f39
102 schema:sameAs https://app.dimensions.ai/details/publication/pub.1004585554
103 https://doi.org/10.1007/978-3-0348-7539-4_20
104 schema:sdDatePublished 2022-08-04T17:19
105 schema:sdLicense https://scigraph.springernature.com/explorer/license/
106 schema:sdPublisher Nd134a158f78440118b5e50019ad9117c
107 schema:url https://doi.org/10.1007/978-3-0348-7539-4_20
108 sgo:license sg:explorer/license/
109 sgo:sdDataset chapters
110 rdf:type schema:Chapter
111 N1281b0fabcbb44db94f383df66a028b1 rdf:first sg:person.014543723551.22
112 rdf:rest N3c9b6aef9065489081fd3a9b9e1fca1b
113 N1783b96ecc6d40d08d4f579d2ff02f39 schema:name Springer Nature
114 rdf:type schema:Organisation
115 N29e44bdc096f4cacb69a04e39bcd8294 rdf:first Ne3244b875b714a269ac641b5707b7a9e
116 rdf:rest N1281b0fabcbb44db94f383df66a028b1
117 N30796ec6f7d9400d9cb968c9d5de2df5 schema:familyName Bulirsch
118 schema:givenName R.
119 rdf:type schema:Person
120 N3c9b6aef9065489081fd3a9b9e1fca1b rdf:first sg:person.014313516176.44
121 rdf:rest rdf:nil
122 N423ccf949716441da51694ffb1a01d06 schema:familyName Miele
123 schema:givenName A.
124 rdf:type schema:Person
125 N58a4859f776540ce9d5f39699376ea4d rdf:first sg:person.0767272315.31
126 rdf:rest N29e44bdc096f4cacb69a04e39bcd8294
127 N5dabaf14436a422a987e74c1ea04eda1 rdf:first N30796ec6f7d9400d9cb968c9d5de2df5
128 rdf:rest Nce8fc6c837304769ae14af9a2d069d84
129 N626363f0e4a5445bbcaa3519c999082d schema:isbn 978-3-0348-7539-4
130 978-3-0348-7541-7
131 schema:name Optimal Control
132 rdf:type schema:Book
133 N6def47a500c247ed914208790e30d7c9 rdf:first Nd9083c89123e4ab5adcd9619be9e3a4f
134 rdf:rest rdf:nil
135 N75e6571f1fef4a8ebff44512ae60bf01 schema:name doi
136 schema:value 10.1007/978-3-0348-7539-4_20
137 rdf:type schema:PropertyValue
138 N7822db6d44f240939151f1fc81182b41 schema:familyName Stoer
139 schema:givenName J.
140 rdf:type schema:Person
141 N8e03692215bc47dda7c84433dc0a3f99 rdf:first N7822db6d44f240939151f1fc81182b41
142 rdf:rest N6def47a500c247ed914208790e30d7c9
143 Nb642c2e7e8824731a997895fd34bd301 schema:name dimensions_id
144 schema:value pub.1004585554
145 rdf:type schema:PropertyValue
146 Nce8fc6c837304769ae14af9a2d069d84 rdf:first N423ccf949716441da51694ffb1a01d06
147 rdf:rest N8e03692215bc47dda7c84433dc0a3f99
148 Nd134a158f78440118b5e50019ad9117c schema:name Springer Nature - SN SciGraph project
149 rdf:type schema:Organization
150 Nd9083c89123e4ab5adcd9619be9e3a4f schema:familyName Well
151 schema:givenName K.
152 rdf:type schema:Person
153 Ne3244b875b714a269ac641b5707b7a9e schema:affiliation grid-institutes:grid.6936.a
154 schema:familyName Nerz
155 schema:givenName Edda
156 rdf:type schema:Person
157 anzsrc-for:01 schema:inDefinedTermSet anzsrc-for:
158 schema:name Mathematical Sciences
159 rdf:type schema:DefinedTerm
160 anzsrc-for:0102 schema:inDefinedTermSet anzsrc-for:
161 schema:name Applied Mathematics
162 rdf:type schema:DefinedTerm
163 anzsrc-for:0103 schema:inDefinedTermSet anzsrc-for:
164 schema:name Numerical and Computational Mathematics
165 rdf:type schema:DefinedTerm
166 sg:person.014313516176.44 schema:affiliation grid-institutes:grid.6936.a
167 schema:familyName von Stryk
168 schema:givenName Oskar
169 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014313516176.44
170 rdf:type schema:Person
171 sg:person.014543723551.22 schema:affiliation grid-institutes:grid.6936.a
172 schema:familyName Pesch
173 schema:givenName Hans Josef
174 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014543723551.22
175 rdf:type schema:Person
176 sg:person.0767272315.31 schema:affiliation grid-institutes:grid.6936.a
177 schema:familyName Bulirsch
178 schema:givenName Roland
179 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0767272315.31
180 rdf:type schema:Person
181 grid-institutes:grid.6936.a schema:alternateName Mathematisches Institut, Technische Universität München, Postfach 20 24 20, D-8000, München 2, Germany
182 schema:name Mathematisches Institut, Technische Universität München, Postfach 20 24 20, D-8000, München 2, Germany
183 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...