TY - GEN
T1 - Data-driven distributionally robust iterative risk-constrained model predictive control
AU - Zolanvari, Alireza
AU - Cherukuri, Ashish
N1 - Funding Information:
The authors are with the Engineering and Technology Institute Groningen, University of Groningen. Email: {a.zolanvari,a.k.cherukuri}@rug.nl. This work was partly supported with a scholarship from the Data Science and Systems Complexity (DSSC) Center, University of Groningen.
Publisher Copyright:
© 2022 EUCA.
PY - 2022/8/5
Y1 - 2022/8/5
N2 - This paper considers a risk-constrained infinite-horizon optimal control problem and proposes to solve it in an iterative manner. Each iteration of the algorithm generates a trajectory from the starting point to the target equilibrium state by implementing a distributionally robust risk-constrained model predictive control (MPC) scheme. At each iteration, a set of safe states (that satisfy the risk-constraint with high probability) and a certain number of samples of the uncertainty governing the risk constraint are available. These states and samples are accumulated in previous iterations. The safe states are used as terminal constraint in the MPC scheme and samples are used to construct a set of distributions, termed ambiguity set, such that it contains the underlying distribution of the uncertainty with high probability. The risk-constraint in each iteration is required to hold for all distributions in the ambiguity set. We establish that the trajectories generated by our iterative procedure are feasible, safe, and converge asymptotically to the equilibrium. Simulation example illustrates our results for the case of finding a risk-constrained path for a mobile robot in the presence of an uncertain obstacle.
AB - This paper considers a risk-constrained infinite-horizon optimal control problem and proposes to solve it in an iterative manner. Each iteration of the algorithm generates a trajectory from the starting point to the target equilibrium state by implementing a distributionally robust risk-constrained model predictive control (MPC) scheme. At each iteration, a set of safe states (that satisfy the risk-constraint with high probability) and a certain number of samples of the uncertainty governing the risk constraint are available. These states and samples are accumulated in previous iterations. The safe states are used as terminal constraint in the MPC scheme and samples are used to construct a set of distributions, termed ambiguity set, such that it contains the underlying distribution of the uncertainty with high probability. The risk-constraint in each iteration is required to hold for all distributions in the ambiguity set. We establish that the trajectories generated by our iterative procedure are feasible, safe, and converge asymptotically to the equilibrium. Simulation example illustrates our results for the case of finding a risk-constrained path for a mobile robot in the presence of an uncertain obstacle.
UR - http://www.scopus.com/inward/record.url?scp=85136612909&partnerID=8YFLogxK
U2 - 10.23919/ECC55457.2022.9838319
DO - 10.23919/ECC55457.2022.9838319
M3 - Conference contribution
AN - SCOPUS:85136612909
T3 - 2022 European Control Conference, ECC 2022
SP - 1578
EP - 1583
BT - 2022 European Control Conference, ECC 2022
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2022 European Control Conference, ECC 2022
Y2 - 12 July 2022 through 15 July 2022
ER -