Data‐driven policy iteration algorithm for continuous‐time stochastic linear‐quadratic optimal control problems

نویسندگان

چکیده

Abstract This paper studies a continuous‐time stochastic linear‐quadratic (SLQ) optimal control problem on infinite‐horizon. Combining the Kronecker product theory with an existing policy iteration algorithm, data‐driven algorithm is proposed to solve problem. In contrast most methods that need all information of system coefficients, eliminates requirement three matrices by utilizing data system. More specifically, this uses collected iteratively approximate and solution algebraic Riccati equation (SARE) corresponding SLQ The convergence analysis obtained given rigorously, simulation example provided illustrate effectiveness applicability algorithm.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Policy Iteration Algorithm for Shortest Path Problems

Abstract. The shortest paths tree problem consists in finding a spanning tree rooted at a given node, in a directed weighted graph, such that for each node i , the path of the tree which goes from i to the root has minimal weight. We propose an algorithm which is a deterministic version of Howard’s policy iteration scheme. We show that policy iteration is faster than the Bellman (or value itera...

متن کامل

Pareto-optimal Solutions for Multi-objective Optimal Control Problems using Hybrid IWO/PSO Algorithm

Heuristic optimization provides a robust and efficient approach for extracting approximate solutions of multi-objective problems because of their capability to evolve a set of non-dominated solutions distributed along the Pareto frontier. The convergence rate and suitable diversity of solutions are of great importance for multi-objective evolutionary algorithms. The focu...

متن کامل

An Accelerated Value/Policy Iteration Scheme for Optimal Control Problems and Games

We present an accelerated algorithm for the solution of static HamiltonJacobi-Bellman equations related to optimal control problems and differential games. The new scheme combines the advantages of value iteration and policy iteration methods by means of an efficient coupling. The method starts with a value iteration phase on a coarse mesh and then switches to a policy iteration procedure over ...

متن کامل

Dynamic consistency for stochastic optimal control problems

For a sequence of dynamic optimization problems, we aim at discussing a notion of consistency over time. This notion can be informally introduced as follows. At the very first time step t0, the decision maker formulates an optimization problem that yields optimal decision rules for all the forthcoming time step t0, t1, . . . , T ; at the next time step t1, he is able to formulate a new optimiza...

متن کامل

A New Optimal Solution Concept for Fuzzy Optimal Control Problems

In this paper, we propose the new concept of optimal solution for fuzzy variational problems based on the possibility and necessity measures. Inspired by the well–known embedding theorem, we can transform the fuzzy variational problem into a bi–objective variational problem. Then the optimal solutions of fuzzy variational problem can be obtained by solving its corresponding biobjective variatio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Asian Journal of Control

سال: 2023

ISSN: ['1934-6093', '1561-8625']

DOI: https://doi.org/10.1002/asjc.3223