KOPS - The Institutional Repository of the University of Konstanz

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

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

Cite This

Files in this item

Files Size Format View

There are no files associated with this item.

CIARAMELLA, 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

@article{Ciaramella2021Multi-56277, title={Multilevel Techniques for the Solution of HJB Minimum-Time Control Problems}, year={2021}, doi={10.1007/s11424-021-0253-7}, 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 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/rdf/resource/123456789/56277"> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/39"/> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/39"/> <dc:creator>Fabrini, Giulia</dc:creator> <dc:contributor>Fabrini, Giulia</dc:contributor> <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> <dcterms:issued>2021</dcterms:issued> <dc:language>eng</dc:language> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:creator>Ciaramella, Gabriele</dc:creator> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2022-01-21T08:37:09Z</dcterms:available> <dcterms:title>Multilevel Techniques for the Solution of HJB Minimum-Time Control Problems</dcterms:title> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2022-01-21T08:37:09Z</dc:date> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/56277"/> <dc:contributor>Ciaramella, Gabriele</dc:contributor> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> </rdf:Description> </rdf:RDF>

This item appears in the following Collection(s)

Search KOPS


Browse

My Account