2020
DOI: 10.1007/978-3-030-41131-2_9
|View full text |Cite
|
Sign up to set email alerts
|

Guaranteed Optimal Reachability Control of Reaction-Diffusion Equations Using One-Sided Lipschitz Constants and Model Reduction

Abstract: We show that, for any spatially discretized system of reactiondiffusion, the approximate solution given by the explicit Euler timediscretization scheme converges to the exact time-continuous solution, provided that diffusion coefficient be sufficiently large. By "sufficiently large", we mean that the diffusion coefficient value makes the one-sided Lipschitz constant of the reaction-diffusion system negative. We apply this result to solve a finite horizon control problem for a 1D reactiondiffusion example. We a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
4
1

Relationship

3
2

Authors

Journals

citations
Cited by 5 publications
(6 citation statements)
references
References 44 publications
(60 reference statements)
0
6
0
Order By: Relevance
“…The optimization task is to find a control pattern π P U k which guarantees that all states in a given set S " r0, 1s n Ă R n 2 are steered at time t end " kτ as closely as possible to an end state y end P S. Let us explain the principle of the method based on DP and Euler integration method used in [CF19a;CF19b]. We consider the cost function: J k : S Û k Ñ R ě0 defined by: J k py, πq " }Y π y pkτ q ´yend }, where } ¨} denotes the Euclidean norm in R n3…”
Section: B Finite Horizon and Dynamic Programmingmentioning
confidence: 99%
See 2 more Smart Citations
“…The optimization task is to find a control pattern π P U k which guarantees that all states in a given set S " r0, 1s n Ă R n 2 are steered at time t end " kτ as closely as possible to an end state y end P S. Let us explain the principle of the method based on DP and Euler integration method used in [CF19a;CF19b]. We consider the cost function: J k : S Û k Ñ R ě0 defined by: J k py, πq " }Y π y pkτ q ´yend }, where } ¨} denotes the Euclidean norm in R n3…”
Section: B Finite Horizon and Dynamic Programmingmentioning
confidence: 99%
“…We then discretize the space S by means of a grid X such that any point y 0 P S has an "ε-representative" z 0 P X with }y 0 ´z0 } ď ε, for a given value ε ą 0. As explained in [CF19b], it is easy to construct via DP a procedure PROC ε k which, for any y P S, takes its representative z P X as input, and returns a pattern π ε k P U k corresponding to an approximate optimal value of v k pyq.…”
Section: B Finite Horizon and Dynamic Programmingmentioning
confidence: 99%
See 1 more Smart Citation
“…The optimization task is to find a control pattern π P U k which guarantees that all states in a given set S " r0, 1s M Ă R M 1 are steered at time t end " kτ as closely as possible to an end state y end P S. Let us explain the principle of the method based on DPP and Euler integration method used in [CF19a;CF19b]. We consider the cost function: J k : S ˆU k Ñ R ě0 defined by:…”
Section: Finite Horizon Control Problemsmentioning
confidence: 99%
“…We now give an upper bound to the error between the exact solution of the ODE and its Euler approximation on S (see [10,9]). Definition 1.…”
Section: Explicit Euler Time Integration and Error Boundsmentioning
confidence: 99%