اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدContinuity of Pontryagin extremals with respect to delays in nonlinear optimal control
107
0
0.0
(
0
)
تأليف
Bruno Herisse
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Consider a general nonlinear optimal control problem in finite dimension, with constant state and/or control delays. By the Pontryagin Maximum Principle, any optimal trajectory is the projection of a Pontryagin extremal. We establish that, under appropriate assumptions, Pontryagin extremals depend continuously on the parameter delays, for adequate topologies. The proof of the continuity of the trajectory and of the control is quite easy, however, for the adjoint vector, the proof requires a much finer analysis. The continuity property of the adjoint with respect to the parameter delay opens a new perspective for the numerical implementation of indirect methods, such as the shooting method. We also discuss the sharpness of our assumptions.
قيم البحث
اقرأ أيضاً
In this article, we propose a new unifying framework for the investigation of multi-agent control problems in the mean-field setting. Our approach is based on a new definition of differential inclusions for continuity equations formulated in the Wass
erstein spaces of optimal transport. The latter allows to extend several known results of the classical theory of differential inclusions, and to prove an exact correspondence between solutions of differential inclusions and control systems. We show its appropriateness on an example of leader-follower evacuation problem.
This paper addresses the problem of control synthesis for nonlinear optimal control problems in the presence of state and input constraints. The presented approach relies upon transforming the given problem into an infinite-dimensional linear program
over the space of measures. To generate approximations to this infinite-dimensional program, a sequence of Semi-Definite Programs (SDP)s is formulated in the instance of polynomial cost and dynamics with semi-algebraic state and bounded input constraints. A method to extract a polynomial control function from each SDP is also given. This paper proves that the controller synthesized from each of these SDPs generates a sequence of values that converge from below to the value of the optimal control of the original optimal control problem. In contrast to existing approaches, the presented method does not assume that the optimal control is continuous while still proving that the sequence of approximations is optimal. Moreover, the sequence of controllers that are synthesized using the presented approach are proven to converge to the true optimal control. The performance of the presented method is demonstrated on three examples.
In this note we prove in the nonlinear setting of $CD(K,infty)$ spaces the stability of the Krasnoselskii spectrum of the Laplace operator $-Delta$ under measured Gromov-Hausdorff convergence, under an additional compactness assumption satisfied, for
instance, by sequences of $CD^*(K,N)$ metric measure spaces with uniformly bounded diameter. Additionally, we show that every element $lambda$ in the Krasnoselskii spectrum is indeed an eigenvalue, namely there exists a nontrivial $u$ satisfying the eigenvalue equation $- Delta u = lambda u$.
This paper provides necessary conditions of optimality for optimal control problems with time delays in both state and control variables. Differen
This paper presents a new method for solving a class of nonlinear optimal control problems with a quadratic performance index. In this method, first the original optimal control problem is transformed into a nonlinear two-point boundary value problem
(TPBVP) via the Pontryagins maximum principle. Then, using the Homotopy Perturbation Method (HPM) and introducing a convex homotopy in topologic space, the nonlinear TPBVP is transformed into a sequence of linear time-invariant TPBVPs. By solving the presented linear TPBVP sequence in a recursive manner, the optimal control law and the optimal trajectory are determined in the form of infinite series. Finally, in order to obtain an accurate enough sub-optimal control law, an iterative algorithm with low computational complexity is introduced. An illustrative example demonstrates the simplicity and efficiency of proposed method.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
