On the Time-optimality of Bang-bang Trajectories in R
نویسندگان
چکیده
where ƒ and g are smooth vector fields. Admissible controls are arbitrary measurable functions with values in [—1,4-1] and a trajectory of the system corresponding to a control u( ) is an absolutely continuous curve such that x(t) — f{x(t)) + u(t)g(x(t)) holds almost everywhere. In every optimal control problem the question of regularity of the solutions comes up naturally. The standard existence theorems only prove the existence of an optimal solution within the class of measurable functions. Necessary conditions for optimality put certain restrictions on optimal controls, in particular on their regularity properties. But, in general, they do not exclude a pathological behavior of optimal controls. In principle, the sets of discontinuities of an optimal control could even be a Cantor-like set with positive measure. On the other hand, certain regularity properties are necessary to construct a regular synthesis, i.e. to obtain sufficient conditions. For this one of the essential properties needed is that for every compact set K there exists an integer N = N(K) such that any time-optimal trajectory that lies in K is a concatenation of at most N "nice" pieces [3]. For our problem "nice" simply means trajectories corresponding to the constant controls u = -hi and u = 1 (bang arcs) or to a singular control (singular arc), which is a control usually with values in the interior of the control set and which satisfies certain compatibility conditions. (These are the possible candidates for time-optimal controls to which the necessary conditions of the Pontryagin maximum principle lead.) For smooth single-input control-linear systems in the plane Sussmann showed that generically every point has a neighborhood U such that timeoptimal trajectories that lie in U are finite concatenations of bang and singular arcs with a bound on the number of pieces [4]. This was the key element in the proof of the existence of a regular synthesis for basically arbitrary analytic systems of this form in the plane [5, 6]. A major issue in the proof of these results is to exclude the optimality of bang-bang trajectories with a large number of switchings in small times. (A bang-bang trajectory is a concatenation of bang arcs.) Since Sussmann's argument depended heavily on being in R , even for the three-dimensional case so far only partial results
منابع مشابه
Using Modified IPSO-SQP Algorithm to Solve Nonlinear Time Optimal Bang-Bang Control Problem
In this paper, an intelligent-gradient based algorithm is proposed to solve time optimal bang-bang control problem. The proposed algorithm is a combination of an intelligent algorithm called improved particle swarm optimization algorithm (IPSO) in the first stage of optimization process together with a gradient-based algorithm called successive quadratic programming method (SQP) in the second s...
متن کاملCOMPARISON BETWEEN MINIMUM AND NEAR MINIMUM TIME OPTIMAL CONTROL OF A FLEXIBLE SLEWING SPACECRAFT
In this paper, a minimum and near-minimum time optimal control laws are developed and compared for a rigid space platform with flexible links during an orientating maneuver with large angle of rotation. The control commands are considered as typical bang-bang with multiple symmetrical switches, the time optimal control solution for the rigid-body mode is obtained as a bang-bang function and app...
متن کاملModeling of Jitter Characteristics for the Second Order Bang-Bang CDR
Bang-Bang clock and data recovery (BBCDR) circuits are hard nonlinear systems due to the nonlinearity introduced by the binary phase detector (BPD). The specification of the CDR frequency response is determined by jitter tolerance and jitter transfer. In this paper, jitter transfer and jitter tolerance of the second-order BBCDR are characterized by formulating the time domain waveforms. As a re...
متن کاملSolution of Bang-Bang Optimal Control Problems by Using Bezier Polynomials
In this paper, a new numerical method is presented for solving the optimal control problems of Bang-Bang type with free or fixed terminal time. The method is based on Bezier polynomials which are presented in any interval as $[t_0,t_f]$. The problems are reduced to a constrained problems which can be solved by using Lagrangian method. The constraints of these problems are terminal state and con...
متن کاملBang-bang trajectories with a double switching time: sufficient strong local optimality conditions
This paper gives sufficient conditions for a class of bang-bang extremals with multiple switches to be locally optimal in the strong topology. The conditions are the natural generalizations of the ones considered in [5, 14] and [16]. We require both the strict bang-bang Legendre condition, and the second order conditions for the finite dimensional problem obtained by moving the switching times ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007