Low-thrust Interplanetary Trajectories with Missed Thrust Events: a Numerical Approach

In this paper, the stochastic optimal control problems, which frequently occur in economic and finance are investigated. First, using Bellman’s dynamic programming method the stochastic optimal control problems are converted to Hamilton-Jacobi-Bellman (HJB) equation. Then, obtained HJB equation is solved through the method of separation of variables by guessing a solution via its terminal condition. Also, the non-linear optimal feedback control law is constructed. Finally, the solution procedure is illustrated for solving some examples that two of them are financial models. In fact, to highlight the applications of stochastic optimal control problems in financial mathematics, some financial models are presented.

This article addresses the problem of quantifying the uncertainty in planning aircraft ground movement operations using towbarless robotic tractors taking into account the inherent uncertainties of the problem, specifically, the uncertainties in the weight of the aircraft and in the rolling resistance of the wheels of the main landing gear. The tractor‐aircraft system is represented as a tractor‐trailer system with random parameters characterized by means of probability density functions. The quantification of the uncertainties is conducted within an optimal control framework using the formulation of a stochastic optimal control problem, which is solved through a stochastic collocation method based on generalized polynomial chaos. Specifically, the stochastic optimal control problem is converted into a set of deterministic optimal control problems, in which a reduced number of sample values of the random parameters are employed to solve particular instances of the problem. Using these sample values, it is possible to express the obtained optimal solutions as orthogonal polynomial expansions in terms of the uncertain parameters, which allows both statistical and global sensitivity analysis of the stochastic optimal solutions to be carried out in an efficient way. The objectives of this article are to understand the effects of the uncertainties in the model parameters of the tractor‐aircraft system on the solutions of the optimal control problem and to identify which uncertain parameters have more influence on the variability of these solutions. The ultimate goal is to determine the best approach for executing aircraft ground movement operations in the presence of such uncertainties.

In this paper, we consider a class of optimal switching control problems with multiple time-delays and a cost on changing control and subject to terminal state constraints. A computational method involving three stages is developed to solve this class of optimal control problems. First, by parameterizing the control function with piecewise-constant functions, the optimal switching control problem is approximated by a sequence of finite-dimensional optimization problems, where the original switching times, the control heights and the control switching times are decision variables. Second, by introducing new variables, the total variation of the control variables is transformed into an equivalently smooth function. Third, we convert the constrained optimization problem into one only with box constraints by an exact penalty function method. The gradients of the cost functional are then derived, which can be combined with any gradient-based optimization method to determine the optimal solution. Finally, a numerical example is given to illustrate the effectiveness of the proposed algorithm.

In this paper, we consider a class of optimal control problems in which the system is to be determined in an optimal way. This class of problems involves the choice of a fixed number of switching time points which divide the system’s time horizon into a number of time periods. For each of these time periods, a subsystem is selected, from a finite number of given candidate subsystems, to run during that time periods. The choice of the switching points and the selection of the subsystems are carried out in such a way that a given cost functional is minimized. We consider only problems involving ordinary differential equations over a finite time horizon. A computational method is developed for solving these problems. In our method, the candidate subsystems are combined into a single system by considering their ‘linear combination’. By introducing suitable constraints on the coefficients of the linear combination and using a time rescaling technique, the original problem is transformed into an equivalent optimal control problem with system parameters. An algorithm is proposed for solving this transformed problem and the required gradient formulae are derived. To show the effectiveness of the method, a numerical example is solved.

A stochastic minimax optimal time-delay state feedback control strategy for uncertain quasi-integrable Hamiltonian systems is proposed. First, a stochastic optimal state feedback control problem of uncertain quasi-integrable Hamiltonian system with time delay in feedback control subjected to Gaussian white noise is formulated. Then, the time-delayed state feedback control forces are approximated by the control forces without time delay and the original problem is converted into a stochastic optimal state feedback control problem of an uncertain system without time delay. After that, by following a procedure based on the stochastic averaging method and stochastic differential game, the worst-case disturbances and the optimal controls are obtained from solving a Hamiltonian–Jacobi–Isaacs (HJI) equation. As an example, the stochastic minimax optimal state feedback control of a Duffing oscillator with parametric disturbances and time-delayed feedback control is worked out in detail to illustrate the procedure and effectiveness of the proposed control strategy.

We introduce a novel generic methodology to solve continuous finite-horizon stochastic optimal control problems (SOCPs). We treat controlled stochastic differential equations (SDEs) within the Wiener chaos framework by utilizing Malliavin calculus and developing innovative ideas to preserve the feedback character of optimal Markov decision rules. This allows a direct reformulation of SOCPs into deterministic ones. Hence, it facilitates using Bock’s direct multiple shooting method for solving SOCPs and pioneers the extension of sophisticated methods for deterministic control to the broad context of SDEs. Numerical examples validate this new framework with huge computational advantages compared to standard ideas in SOC.

This work presents the approach to solving the functional equation of non-local type that appears in the study of a stochastic optimal control problem. This experience demonstrates the challenges and possible solutions in the analysis of optimal control problems with Poisson uncertainty.

For Meyer type optimal control problems the principle of optimality states that every subarc of an optimal solution that extends to the final time furnishes again a solution to the same optimal control problem, only with different initial conditions. Through a simple counter example it is shown in this paper that this principle is not satisfied, in general, for solutions obtained from a standard collocation approach. Introduction The principle of optimality [1] is one of the most intuitive and yet most fundamental theorems in the theory of optimal control. Its basic statement is that for Meyer type optimal control problems every subarc of an optimal solution that extends to the final time furnishes again a solution to the same optimal control problem, only with different initial conditions. This theorem has significant implications. For example, it is the starting point for the derivation of the Hamilton-Jacobi-Bellman equations [2] and it is the underlying principle in Bellman's dynamic programming approach [1], [3]. The present paper shows that the principle of optimality is not satisfied, in general, for solutions obtained from a standard collocation approach[4]. For a simple example whose collocation solution can be generated analytically it is shown that further improvements are possible along an optimal collocation solution if the design parameters along a number of leading nodes are frozen and the remainder of the trajectory is re-optimized. I. Continuous Optimal Control Problem In this section of the paper we introduce a simple class of optimal control problems without state and control constraints. In Section 1.2 we present the associated necessary conditions for optimality [2], [5]. For ease of notation we assume that the right-hand side of the 'Supervising Engineer, Member AIAA, t Senior Engineer, Member AIAA, *17 Research Drive, Hampton, VA 23666. ^Graduate Student, Member AIAA, Department, 304 Town Engineering, Ames, IA 50011 equations of motion does not depend explicitly on time t. This does not represent a loss of generality, as it is always possible to transform explicit time dependence away through the introduction of an additional, timelike state variable. 1. Problem Formulation Let us consider the following class of optimal control problems: min «e(Pwc[*o,*/]), (1) subject to the conditions ±(t) = /(*(*),«(*)), tf.(z(*oMo) = 0, (2)

This paper introduces a numerical technique for solving a class of optimal control problems containing nonlinear dynamical system and functional of state variables. This numerical method consists of two major parts. In the first part, using linear combination property of intervals, we convert the nonlinear dynamical system into an equivalent linear system. And in the second part, which we are dealing with a linear dynamical system, using Legendre expansions for approximating both the state and associated control together with discretizing the constraints over the Chebyshev-Gauss-Lobatto points, the optimal control problem is transformed into a corresponding NLP problem which is diretly solved. The proposed idea is illustrated by several numerical examples.

In this paper, we investigate the problem of maximizing the expected exponential utility for an insurer. In the problem setting, the insurer can invest his/her wealth into the market and he/she can also purchase the proportional reinsurance. To control the risk exposure, we impose a value-at-risk constraint on the portfolio, which results in a constrained stochastic optimal control problem. It is difficult to solve a constrained stochastic optimal control problem by using traditional dynamic programming or Martingale approach. However, for the frequently used exponential utility function, we show that the problem can be simplified significantly using a decomposition approach. The problem is reduced to a deterministic constrained optimal control problem, and then to a finite dimensional optimization problem. To show the effectiveness of the approach proposed, we consider both complete and incomplete markets; the latter arises when the number of risky assets are fewer than the dimension of uncertainty. We also conduct numerical experiments to demonstrate the effect of the risk constraint on the optimal strategy.

Optimal control of systems with noisy memory and BSDEs with Malliavin derivatives

A nonlinear stochastic control problem related to ow control is considered. It is assumed that the state of a link is described by a controlled hidden Markov process with a finite state set, while the loss ow is described by a counting process with intensity depending on a current transmission rate and an unobserved link state. The control is the transmission rate, and it has to be chosen as a nonanticipating process depending on the observation of the loss process. The aim of the control is to achieve the maximum of some utility function that takes into account losses of the transmitted information. Originally, the problem belongs to the class of stochastic control problems with incomplete information; however, optimal filtering equations that provide estimation of the current link state based on observations of the loss process allow one to reduce the problem to a standard stochastic control problem with full observations. Then a necessary optimality condition is derived in the form of a stochastic maximum principle, which allows us to obtain explicit analytic expressions for the optimal control in some particular cases. Optimal and suboptimal controls are investigated and compared with the ow control schemes used in TCP/IP (Transmission Control Protocols/Internet Protocols) networks. In particular, the optimal control demonstrates a much smoother behavior than the TCP/IP congestion control currently used.

Most of the existing literature concerning lifetime extension of battery energy storage (BES) devices mainly focus on designing controllers in BES devices themselves. In this paper, the problem of BES lifetime extension in an islanded microgrid is considered from a different perspective, in the sense that such target is achieved by adjusting output power of controllable power generation devices. To obtain accurate power models of photovoltaic panels and loads, a new hybrid modeling method utilizing both neural networks and stochastic differential equations is proposed. We formulate the problem of extending the service life of BES devices as a stochastic optimal control problem. Meanwhile, the situation of over-control in micro-turbines is effectively avoided. We solve such stochastic optimization problem using the dynamic programming solver provided by the open source C++ program BOCOPHJB. Finally, the obtained optimal controller is verified with simulations.

The stochastic reach-avoid problem and set characterization for diffusions

The authors study the asymptotic behavior of stochastic evolutionary systems with Markov-modulated Poisson perturbation in the diffusion approximation scheme. They consider combining the Poisson process with the Markov process, which allows for describing random transitions between different modes of evolution. The ergodic properties of the Markov-modulated Poisson process that ensure the stable behavior of the system on average are presented. Boundary generators for the original system of stochastic differential equations are constructed. The results allow for studying stochastic optimization and optimal control problems. Keywords: stochastic evolution, Markov-modulated Poisson process, diffusion approximation schema.