Multilevel Techniques for the Solution of HJB Minimum-Time Control Problems

Vorschaubild nicht verfügbar
Dateien
Zu diesem Dokument gibt es keine Dateien.
Datum
2021
Herausgeber:innen
Kontakt
ISSN der Zeitschrift
eISSN
item.preview.dc.identifier.isbn
Bibliografische Daten
Verlag
Schriftenreihe
URI (zitierfähiger Link)
DOI (zitierfähiger Link)
ArXiv-ID
Internationale Patentnummer
Link zur Lizenz
oops
EU-Projektnummer
Projekt
Open Access-Veröffentlichung
Gesperrt bis
Titel in einer weiteren Sprache
Forschungsvorhaben
Organisationseinheiten
Zeitschriftenheft
Publikationstyp
Zeitschriftenartikel
Publikationsstatus
Published
Erschienen in
Journal of Systems Science and Complexity ; 34 (2021), 6. - S. 2069-2091. - Springer. - ISSN 1009-6124. - eISSN 1559-7067
Zusammenfassung
The solution of minimum-time feedback optimal control problems is generally achieved using the dynamic programming approach, in which the value function must be computed on numerical grids with a very large number of points. Classical numerical strategies, such as value iteration (VI) or policy iteration (PI) methods, become very inefficient if the number of grid points is large. This is a strong limitation to their use in real-world applications. To address this problem, the authors present a novel multilevel framework, where classical VI and PI are embedded in a full-approximation storage (FAS) scheme. In fact, the authors will show that VI and PI have excellent smoothing properties, a fact that makes them very suitable for use in multilevel frameworks. Moreover, a new smoother is developed by accelerating VI using Anderson’s extrapolation technique. The effectiveness of our new scheme is demonstrated by several numerical experiments.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
510 Mathematik
Schlagwörter
Konferenz
Rezension
undefined / . - undefined, undefined. - (undefined; undefined)
Zitieren
ISO 690CIARAMELLA, Gabriele, Giulia FABRINI, 2021. Multilevel Techniques for the Solution of HJB Minimum-Time Control Problems. In: Journal of Systems Science and Complexity. Springer. 34(6), pp. 2069-2091. ISSN 1009-6124. eISSN 1559-7067. Available under: doi: 10.1007/s11424-021-0253-7
BibTex
@article{Ciaramella2021Multi-56277,
  year={2021},
  doi={10.1007/s11424-021-0253-7},
  title={Multilevel Techniques for the Solution of HJB Minimum-Time Control Problems},
  number={6},
  volume={34},
  issn={1009-6124},
  journal={Journal of Systems Science and Complexity},
  pages={2069--2091},
  author={Ciaramella, Gabriele and Fabrini, Giulia}
}
RDF
<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/56277">
    <dc:creator>Fabrini, Giulia</dc:creator>
    <dc:contributor>Ciaramella, Gabriele</dc:contributor>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2022-01-21T08:37:09Z</dc:date>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2022-01-21T08:37:09Z</dcterms:available>
    <dc:contributor>Fabrini, Giulia</dc:contributor>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/56277"/>
    <dcterms:abstract xml:lang="eng">The solution of minimum-time feedback optimal control problems is generally achieved using the dynamic programming approach, in which the value function must be computed on numerical grids with a very large number of points. Classical numerical strategies, such as value iteration (VI) or policy iteration (PI) methods, become very inefficient if the number of grid points is large. This is a strong limitation to their use in real-world applications. To address this problem, the authors present a novel multilevel framework, where classical VI and PI are embedded in a full-approximation storage (FAS) scheme. In fact, the authors will show that VI and PI have excellent smoothing properties, a fact that makes them very suitable for use in multilevel frameworks. Moreover, a new smoother is developed by accelerating VI using Anderson’s extrapolation technique. The effectiveness of our new scheme is demonstrated by several numerical experiments.</dcterms:abstract>
    <dc:creator>Ciaramella, Gabriele</dc:creator>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/>
    <dc:language>eng</dc:language>
    <dcterms:title>Multilevel Techniques for the Solution of HJB Minimum-Time Control Problems</dcterms:title>
    <dcterms:issued>2021</dcterms:issued>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/>
  </rdf:Description>
</rdf:RDF>
Interner Vermerk
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Kontakt
URL der Originalveröffentl.
Prüfdatum der URL
Prüfungsdatum der Dissertation
Finanzierungsart
Kommentar zur Publikation
Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Ja
Begutachtet
Unbekannt