An Iterative Data-Driven Linear Quadratic Method to Solve Nonlinear Discrete-Time Tracking Problems

نویسندگان

چکیده

The objective of this article is to introduce a novel data-driven iterative linear quadratic (LQ) control method for solving class nonlinear optimal tracking problems. Specifically, an algorithm proposed approximate the Q-factors arising from LQ stochastic This then coupled with LQ-methods determining local solutions problems in purely setting. Simulation results highlight potential field applications.

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

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

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

منابع مشابه

An iterative method to solve a nonlinear matrix equation

In this paper, an iterative method to solve one kind of nonlinear matrix equation is discussed. For each initial matrix with some conditions, the matrix sequences generated by the iterative method are shown to lie in a fixed open ball. The matrix sequences generated by the iterative method are shown to converge to the only solution of the nonlinear matrix equation in the fixed closed ball. In a...

متن کامل

An iterative method for tri-level quadratic fractional programming problems using fuzzy goal programming approach

Tri-level optimization problems are optimization problems with three nested hierarchical structures, where in most cases conflicting objectives are set at each level of hierarchy. Such problems are common in management, engineering designs and in decision making situations in general, and are known to be strongly NP-hard. Existing solution methods lack universality in solving these types of pro...

متن کامل

Linear quadratic problems with indefinite cost for discrete time systems

This paper deals with the discrete-time infinite-horizon linear quadratic problem with indefinite cost criterion. Given a discrete-time linear system, an indefinite costfunctional and a linear subspace of the state space, we consider the problem of minimizing the costfunctional over all inputs that force the state trajectory to converge to the given subspace. We give a geometric characterizatio...

متن کامل

A time-domain decomposition iterative method for the solution of distributed linear quadratic optimal control problems

We study a class of time-domain decomposition-based methods for the numerical solution of large-scale linear quadratic optimal control problems. Our methods are based on a multiple shooting reformulation of the linear quadratic optimal control problem as a discrete-time optimal control (DTOC) problem. The optimality conditions for this DTOC problem lead to a linear block tridiagonal system. The...

متن کامل

Bézier control points method to solve constrained quadratic optimal control of time varying linear systems

A computational method based on Bézier control points is presented to solve optimal control problems governed by time varying linear dynamical systems subject to terminal state equality constraints and state inequality constraints. The method approximates each of the system state variables and each of the control variables by a Bézier curve of unknown control points. The new approximated proble...

متن کامل

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


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

ژورنال

عنوان ژورنال: IEEE Transactions on Automatic Control

سال: 2021

ISSN: ['0018-9286', '1558-2523', '2334-3303']

DOI: https://doi.org/10.1109/tac.2021.3056398