اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOptimal Control of Nonlinear Systems Using the Homotopy Perturbation Method
192
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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.
قيم البحث
اقرأ أيضاً
We propose a new algorithm for computing the luminosity distance in the flat universe with a cosmological constant based on Shchigolevs homotopy perturbation method, where the optimization idea is applied to prevent the arbitrariness of initial value
choice in Shchigolevs homotopy. Compared with the some existing numerical methods, the result of numerical simulation shows that our algorithm is a very promising and powerful technique for computing the luminosity distance, which has obvious advantages in computational accuracy,computing efficiency and robustness for a given {Omega_m}.
A generalized equation is constructed for a class of classical oscillators with strong anharmonicity which are not exactly solvable. Aboodh transform based homotopy perturbation method (ATHPM) is applied to get the approximate analytical solution for
the generalized equation and hence some physically relevant anharmonic oscillators are studied as the special cases of this solution. ATHPM is very simple and hence provides the approximate analytical solution of the generalized equation without any mathematical rigor. The solution from this simple method not only shows excellent agreement with the exact numerical results but also found to be better accuracy in comparison to the solutions obtained from other established approximation methods whenever compared for physically relevant special cases.
This paper considers the optimal control for hybrid systems whose trajectories transition between distinct subsystems when state-dependent constraints are satisfied. Though this class of systems is useful while modeling a variety of physical systems
undergoing contact, the construction of a numerical method for their optimal control has proven challenging due to the combinatorial nature of the state-dependent switching and the potential discontinuities that arise during switches. This paper constructs a convex relaxation-based approach to solve this optimal control problem. Our approach begins by formulating the problem in the space of relaxed controls, which gives rise to a linear program whose solution is proven to compute the globally optimal controller. This conceptual program is solved by constructing a sequence of semidefinite programs whose solutions are proven to converge from below to the true solution of the original optimal control problem. Finally, a method to synthesize the optimal controller is developed. Using an array of examples, the performance of the proposed method is validated on problems with known solutions and also compared to a commercial solver.
Optimization problems governed by Allen-Cahn systems including elastic effects are formulated and first-order necessary optimality conditions are presented. Smooth as well as obstacle potentials are considered, where the latter leads to an MPEC. Nume
rically, for smooth potential the problem is solved efficiently by the Trust-Region-Newton-Steihaug-cg method. In case of an obstacle potential first numerical results are presented.
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.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
