اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOptimal Control Problems with Symmetry Breaking Cost Functions
91
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We investigate symmetry reduction of optimal control problems for left-invariant control systems on Lie groups, with partial symmetry breaking cost functions. Our approach emphasizes the role of variational principles and considers a discrete-time setting as well as the standard continuous-time formulation. Specifically, we recast the optimal control problem as a constrained variational problem with a partial symmetry breaking Lagrangian and obtain the Euler--Poincare equations from a variational principle. By applying a Legendre transformation to it, we recover the Lie-Poisson equations obtained by A. D. Borum [Masters Thesis, University of Illinois at Urbana-Champaign, 2015] in the same context. We also discretize the variational principle in time and obtain the discrete-time Lie-Poisson equations. We illustrate the theory with some practical examples including a motion planning problem in the presence of an obstacle.
قيم البحث
اقرأ أيضاً
- In this paper we introduce a new method to solve fixed-delay optimal control problems which exploits numerical homotopy procedures. It is known that solving this kind of problems via indirect methods is complex and computationally demanding because
their implementation is faced with two difficulties: the extremal equations are of mixed type, and besides, the shooting method has to be carefully initialized. Here, starting from the solution of the non-delayed version of the optimal control problem, the delay is introduced by numerical homotopy methods. Convergence results, which ensure the effectiveness of the whole procedure, are provided. The numerical efficiency is illustrated on an example.
This paper studies an optimal consensus problem for a group of heterogeneous high-order agents with unknown control directions. Compared with existing consensus results, the consensus point is further required to an optimal solution to some distribut
ed optimization problem. To solve this problem, we first augment each agent with an optimal signal generator to reproduce the global optimal point of the given distributed optimization problem, and then complete the global optimal consensus design by developing some adaptive tracking controllers for these augmented agents. Moreover, we present an extension when only real-time gradients are available. The trajectories of all agents in both cases are shown to be well-defined and achieve the expected consensus on the optimal point. Two numerical examples are given to verify the efficacy of our algorithms.
In this paper, we investigate a sparse optimal control of continuous-time stochastic systems. We adopt the dynamic programming approach and analyze the optimal control via the value function. Due to the non-smoothness of the $L^0$ cost functional, in
general, the value function is not differentiable in the domain. Then, we characterize the value function as a viscosity solution to the associated Hamilton-Jacobi-Bellman (HJB) equation. Based on the result, we derive a necessary and sufficient condition for the $L^0$ optimality, which immediately gives the optimal feedback map. Especially for control-affine systems, we consider the relationship with $L^1$ optimal control problem and show an equivalence theorem.
This paper introduces and studies the optimal control problem with equilibrium constraints (OCPEC). The OCPEC is an optimal control problem with a mixed state and control equilibrium constraint formulated as a complementarity constraint and it can be
seen as a dynamic mathematical program with equilibrium constraints. It provides a powerful modeling paradigm for many practical problems such as bilevel optimal control problems and dynamic principal-agent problems. In this paper, we propose weak, Clarke, Mordukhovich and strong stationarities for the OCPEC. Moreover, we give some sufficient conditions to ensure that the local minimizers of the OCPEC are Fritz John type weakly stationary, Mordukhovich stationary and strongly stationary, respectively. Unlike Pontryagains maximum principle for the classical optimal control problem with equality and inequality constraints, a counter example shows that for general OCPECs, there may exist two sets of multipliers for the complementarity constraints. A condition under which these two sets of multipliers coincide is given.
We consider the problem of optimally insulating a given domain $Omega$ of ${mathbb{R}}^d$; this amounts to solve a nonlinear variational problem, where the optimal thickness of the insulator is obtained as the boundary trace of the solution. We deal
with two different criteria of optimization: the first one consists in the minimization of the total energy of the system, while the second one involves the first eigenvalue of the related differential operator. Surprisingly, the second optimization problem presents a symmetry breaking in the sense that for a ball the optimal thickness is nonsymmetric when the total amount of insulator is small enough. In the last section we discuss the shape optimization problem which is obtained letting $Omega$ to vary too.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
