Abstract

In this paper, we propose an efficient zero-order algorithm that can be used to compute an approximate solution to robust optimal control problems (OCP) and robustified nonconvex programs in general. In particular, we focus on robustified OCPs that make use of ellipsoidal uncertainty sets and show that, with the proposed zero-order method, we can efficiently obtain suboptimal, but robustly feasible solutions. The main idea lies in leveraging an inexact sequential quadratic programming (SQP) algorithm in which an advantageous sparsity structure is enforced. The obtained sparsity allows one to eliminate the variables associated

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call