Optimal control can be of help to test and compare different vaccination strategies of a certain disease.In this paper we propose the introduction ofconstraints involving state variables on an optimal control problem applied to a compartmental SEIR (Susceptible. Exposed, Infectious and Recovered) model. We study the solution of such problems when mixed state control constraints are used to impose upper bounds on the available vaccines at each instant of time. We also explore the possibility of imposing upper bounds on the number of susceptible individuals with and without limitations on the number of vaccines available. In the case of mere mixed constraints a numerical and analytical study is conducted while in the other two situations only numerical results are presented.
When using direct methods to solve continuous-time nonlinear optimal control problems, regular time meshes having equidistant spacing are most frequently used. However, in some cases, these meshes cannot cope accurately with nonlinear behaviour and increasing uniformly the number of mesh nodes may lead to a more complex problem. We propose an adaptive time--mesh refinement algorithm, considering different levels of refinement and several mesh refinement criteria. Namely, we use information of the adjoint multipliers to decide where to refine further. This technique is here tested to solve two optimal control problems. One involving nonholonomic vehicles with state constraints which is characterized by having strong nonlinearities and by discontinuous controls; the other is also a nonlinear problem of a compartmental SEIR system. The proposed strategy leads to results with higher accuracy and yet with lower overall computational time, when compared to results obtained by meshes having equidistant spacing. We also apply the necessary condition of optimality in the form of the Maximum Principle of Pontryagin to characterize the solution and to validate the numerical results.
For an efficient and reliable operation of an Airborne Wind Energy System, it is widely accepted that the kite should follow a pre-defined optimized path. In this article, we address the problem of designing a trajectory controller so that such path is closely followed. The path-following controllers investigated are based on a well-known nonlinear guidance logic termed L1 and on a proposed modification of it, which we termed L0. We have developed and implemented both L0 and L1 controllers for an AWES. The two controllers have an easy implementation with an explicit expression for the control law based on the cross-track error, on the heading angle relative to the path, and on a single parameter L ( or , depending on each controller) that we are able to tune. The L0 controller has an even easier implementation since the explicit control law can be used without the need to switch controllers. Since the switching of controllers might jeopardize stability, the L0 controller has an important theoretical advantage in being able to guarantee stability on a larger domain of attraction.The simulation study shows that both nonlinear guidance logic controllers exhibit appropriate performance when the L parameter is adequately tuned, with the L0 controller showing a better performance when measured in terms of the average cross-track error.
In the context of continuous–time control systems, we address the problem of guaranteeing that the constraints imposed along the trajectory are in fact satisfied for all times. The problem is relevant and non–trivial in situations in which a continuous–time internal representation of the system is used with a digital device, such as in sampled–data model–based control, in an optimal control solver, or in sampled-data model predictive control. In this paper, we establish a condition that when verified on a finite set of time instants (using limited computational power) can guarantee that the trajectory constraints are satisfied on an uncountable set of times. The case of constrained optimal control problems is further explored here. We develop an algorithm for the numerical solution of constrained nonlinear optimal control problems that combines a guaranteed constraint satisfaction strategy with an adaptive mesh refinement strategy.