To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
We introduce a class of discrete-time stochastic processes, called disjunctive processes, which are important for reliable simulations in random iteration algorithms. Their definition requires that all possible patterns of states appear with probability 1. Sufficient conditions for nonhomogeneous chains to be disjunctive are provided. Suitable examples show that strongly mixing Markov chains and pairwise independent sequences, often employed in applications, may not be disjunctive. As a particular step towards a general theory we shall examine the problem arising when disjunctiveness is inherited under passing to a subsequence. An application to the verification problem for switched control systems is also included.
This paper presents an integrated guidance and control (IGC) design method for an unmanned aerial vehicle with static stability which is described by a nonlinear six-degree-of-freedom (6-DOF) model. The model is linearized by using small disturbance linearization. The dynamic characteristics of pitching mode, rolling mode and Dutch rolling mode are obtained by analysing the linearized model. Furthermore, an IGC design procedure is also proposed in conjunction with a proportional–integral–derivative (PID) control method and fuzzy control method. A PID controller is applied in the control loop of the elevator and aileron, and the attitude angle and attitude angular velocity are used as compensation feedback, giving a simple and low-order control law. A fuzzy control method is applied to perform the cross-coupling control of rolling and yawing. Finally, the 6-DOF simulation shows the effectiveness of the developed method.
We present an application of optimal control theory to a simple SIR disease model of avian influenza transmission dynamics in birds. Basic properties of the model, including the epidemic threshold, are obtained. Optimal control theory is adopted to minimize the density of infected birds subject to an appropriate system of ordinary differential equations. We conclude that an optimally controlled seasonal vaccination strategy saves more birds than when there is a low uniform vaccination rate as in resource-limited places.
The inadequacy of the traditional sliding mode variable structure (SMVS) control method for cruise missiles is addressed. An improved SMVS control method is developed, in which the reaching mode segment of the SMVS control is decomposed into an acceleration accessing segment, a speed keeping segment, and a deceleration buffer segment. A time-fuel optimal control problem is formulated as an optimal control problem involving a switched system with unknown switching times and subject to a continuous state inequality constraint. The new design method is developed based on a control parametrization, a time scaling transform and the constraint transcription method. A sequence of approximate optimal parameter selection problems is obtained with fixed switching time points and a canonical state inequality constraint. Each approximate optimal parameter selection problem can be solved effectively by using existing gradient-based optimization techniques. The convergence of these approximate optimal solutions to the true optimal solution is assured. Simulation results show that the proposed method is highly effective. The response speed of the missile under the control law obtained by the proposed method is improved significantly, while the elevator of the missile is constrained to operate within its permitted range.
This paper studies the problem of delay-dependent robust H∞ control for singular systems with multiple delays. Based on a Lyapunov–Krasovskii functional approach, an improved delay-dependent bounded real lemma (BRL) for singular time-delay systems is established without using any of the model transformations and bounding techniques on the cross product terms. Then, by applying the obtained BRL, a delay-dependent condition for the existence of a robust state feedback controller, which guarantees that the closed-loop system is regular, impulse free, robustly stable and satisfies a prescribed H∞ performance index, is proposed in terms of a nonlinear matrix inequality. The explicit expression for the H∞ controller is designed by using linear matrix inequalities and the cone complementarity iterative linearization algorithm. Numerical examples are also given to illustrate the effectiveness of the proposed method.
A queueing network with arbitrary topology, state dependent routing and flow control is considered. Customers may enter the network at any queue and they are routed through it until they reach certain queues from which they may leave the system. The routing is based on local state information. The service rate of a server is controlled based on local state information as well. A distributed policy for routing and service rate control is identified that achieves maximum throughput. The policy can be implemented without knowledge of the arrival and service rates. The importance of flow control is demonstrated by showing that, in certain networks, if the servers cannot be forced to idle, then no maximum throughput policy exists when the arrival rates are not known. Also a model for exchange of state information among neighboring nodes is presented and the network is studied when the routing is based on delayed state information. A distributed policy is shown to achieve maximum throughput in the case of delayed state information. Finally, some implications for deterministic flow networks are discussed.