This paper proposes a new discrete-time Geo/G/1 queueing model under the control of bi-level randomized(p,N1,N2)-policy.That is,the server is closed down immediately when the system is empty.If N1(≥1)customers are ac...This paper proposes a new discrete-time Geo/G/1 queueing model under the control of bi-level randomized(p,N1,N2)-policy.That is,the server is closed down immediately when the system is empty.If N1(≥1)customers are accumulated in the queue,the server is activated for service with probability p(0≤p≤1)or still left off with probability(1−p).When the number of customers in the system becomes N_(2)(≥N1),the server begins serving the waiting customers until the system becomes empty again.For the model,firstly,we obtain the transient solution of the queue size distribution and the explicit recursive formulas of the stationary queue length distribution by employing the total probability decomposition technique.Then,the expressions of its probability generating function of the steady-state queue size and the expected steady-state queue size are presented.Additionally,numerical examples are conducted to discuss the effect of the system parameters on some performance indices.Furthermore,the steady-state distribution of queue length at epochs n−,n and outside observer’s observation epoch are explored,respectively.Finally,we establish a cost function to investigate the cost optimization problem under the constraint of the average waiting time.And the presented model provides a less expected cost as compared to the traditional N-policy.展开更多
A robust Adaptive Discrete-time Sliding Mode Controller (ADSMC) is formulated, and is applied to control the pitch motion of a simulated Flapping-Wing Micro Air Vehicle (FWMAV). There is great potential for FWMAVs to ...A robust Adaptive Discrete-time Sliding Mode Controller (ADSMC) is formulated, and is applied to control the pitch motion of a simulated Flapping-Wing Micro Air Vehicle (FWMAV). There is great potential for FWMAVs to be used as aerial tools to assist with gathering data and surveying environments. Thanks to modern manufacturing and technology, along with an increased comprehension behind the aerodynamics of wing flaps, these vehicles are now a reality, though not without limitations. Given their diminutive size, FWMAVs are susceptible to real-world disturbances, such as wind gusts, and are sensitive to particular variations in their build quality. While external forces such as wind gusts can be reasonably bounded, the unknown variations in the state may be difficult to characterize or bound without affecting performance. To address these problems, an ADSMC is developed. First, the FWMAV model is converted from continuous-time to discrete-time. Second, an ADSMC for the newly discretized FWMAV model is developed. Using this controller, the trajectory tracking performance of the FWMAV is assessed against a traditional discrete sliding mode controller, and is found to have a decreased chattering frequency and decreased control effort for the same task. Therefore, the ADSMC is assessed as the superior controller, despite being completely unaware of the model parameters or wind gust.展开更多
This paper considers the departure process and the optimal control strategy for a discretetime Geo/G/1 queueing model in which the system operates under the control of multiple server vacations and Min(N, V)-policy. U...This paper considers the departure process and the optimal control strategy for a discretetime Geo/G/1 queueing model in which the system operates under the control of multiple server vacations and Min(N, V)-policy. Using the law of total probability decomposition, the renewal theory and the probability generating function technique, the transient and the steady-state probabilities that the server is busy at any epoch n^+ are derived. The authors also obtain the explicit expression of the probability generating function for the expected number of departures occurring in the time interval (0^+, n^+] from any initial state. Meanwhile, the relationship among departure process, server's state process and service renewal process in server busy period is found, which shows the special structure of departure process. Especially, some corresponding results of departure process for special discrete-time queues are directly gained by our results. Furthermore, the approximate expansion for calculating the expected number of departures is presented. In addition, some other important performance measures,including the expected length of server busy period, server's actual vacation period and busy cycle period etc., are analyzed. Finally, some numerical results are provided to determine the optimum value N*for minimizing the system cost under a given cost structure.展开更多
This paper deals with a discrete-time Geo/Geo/1 queueing system with working breakdowns in which customers arrive at the system in variable input rates according to the states of the server. The server may be subject ...This paper deals with a discrete-time Geo/Geo/1 queueing system with working breakdowns in which customers arrive at the system in variable input rates according to the states of the server. The server may be subject to breakdowns at random when it is in operation. As soon as the server fails, a repair process immediately begins. During the repair period, the defective server still provides service for the waiting customers at a lower service rate rather than completely stopping service.We analyze the stability condition for the considered system. Using the probability generating function technique, we obtain the probability generating function of the steady-state queue size distribution.Also, various important performance measures are derived explicitly. Furthermore, some numerical results are provided to carry out the sensitivity analysis so as to illustrate the effect of different parameters on the system performance measures. Finally, an operating cost function is formulated to model a computer system and the parabolic method is employed to numerically find the optimum service rate in working breakdown period.展开更多
Congestion is one of the well-studied problems in computer networks,which occurs when the request for network resources exceeds the buffer capacity.Many active queue management techniques such as BLUE and RED have bee...Congestion is one of the well-studied problems in computer networks,which occurs when the request for network resources exceeds the buffer capacity.Many active queue management techniques such as BLUE and RED have been proposed in the literature to control congestions in early stages.In this paper,we propose two discrete-time queueing network analytical models to drop the arrival packets in preliminary stages when the network becomes congested.The first model is based on Lambda Decreasing and it drops packets from a probability value to another higher value according to the buffer length.Whereas the second proposed model drops packets linearly based on the current queue length.We compare the performance of both our models with the original BLUE in order to decide which of these methods offers better quality of service.The comparison is done in terms of packet dropping probability,average queue length,throughput ratio,average queueing delay,and packet loss rate.展开更多
This paper analyzes a discrete-time multiple vacations finite-buffer queueing system with batch renewal input in which inter-arrival time of batches are arbitrarily distributed. Service and vacation times are mutually...This paper analyzes a discrete-time multiple vacations finite-buffer queueing system with batch renewal input in which inter-arrival time of batches are arbitrarily distributed. Service and vacation times are mutually independent and geometrically distributed. The server takes vacations when the system does not have any waiting jobs at a service completion epoch or a vacation completion epoch. The system is analyzed under the assumptions of late arrival system with delayed access and early arrival system. Using the supplementary variable and the imbedded Markov chain techniques, the authors obtain the queue-length distributions at pre-arrival, arbitrary and outside observer＇s ob- servation epochs for partial-batch rejection policy. The blocking probability of the first, an arbitrary- and the last-job in a batch have been discussed. The analysis of actual waiting-time distributions measured in slots of the first, an arbitrary- and the last-job in an accepted batch, and other performance measures along with some numerical results have also been investigated.展开更多
We consider a discrete-time multi-server finite-capacity queueing system with correlated batch arrivals and deterministic service times (of single slot), which has a variety of potential applications in slotted digita...We consider a discrete-time multi-server finite-capacity queueing system with correlated batch arrivals and deterministic service times (of single slot), which has a variety of potential applications in slotted digital telecommunication systems and other related areas. For this queueing system, we present, based on Markov chain analysis, not only the steady-state distributions but also the transient distributions of the system length and of the system waiting time in a simple and unified manner. From these distributions, important performance measures of practical interest can be easily obtained. Numerical examples concerning the superposition of certain video traffics are presented at the end.展开更多
We consider a single server constant retrial queue,in which a state-dependent service policy is used to control the service rate.Customer arrival follows Poisson process,while service time and retrial time are exponen...We consider a single server constant retrial queue,in which a state-dependent service policy is used to control the service rate.Customer arrival follows Poisson process,while service time and retrial time are exponential distributions.Whenever the server is available,it admits the retrial customers into service based on a first-come first-served rule.The service rate adjusts in real-time based on the retrial queue length.An iterative algorithm is proposed to numerically solve the personal optimal problem in the fully observable scenario.Furthermore,we investigate the impact of parameters on the social optimal threshold.The effectiveness of the results is illustrated by two examples.展开更多
A novel discrete-time reaching law was proposed for uncertain discrete-time system,which contained process noise and measurement noise.The proposed method reserves all the advantages of discrete-time reaching law,whic...A novel discrete-time reaching law was proposed for uncertain discrete-time system,which contained process noise and measurement noise.The proposed method reserves all the advantages of discrete-time reaching law,which not only decreases the band width of sliding mode and strengthens the system robustness,but also improves the dynamic performance and stability capability of the system.Moreover,a discrete-time sliding mode control strategy based on Kalman filter method was designed,and Kalman filter was employed to eliminate the influence of system noise.Simulation results show that there is no chattering phenomenon in the output of controller and the state variables of controlled system,and the proposed algorithm is also feasible and has strong robustness to external disturbances.展开更多
To diagnose the fault of attitude sensors in satellites, this paper proposes a novel approach based on the Kalman filter of the discrete-time descriptor system. By regarding the sensor fault term as the auxiliary stat...To diagnose the fault of attitude sensors in satellites, this paper proposes a novel approach based on the Kalman filter of the discrete-time descriptor system. By regarding the sensor fault term as the auxiliary state vector, the attitude measurement system subjected to the attitude sensor fault is modeled by the discrete-time descriptor system. The condition of estimability of such systems is given. And then a Kalman filter of the discrete-time descriptor system is established based on the methodology of the maximum likelihood estimation. With the descriptor Kalman filter, the state vector of the original system and sensor fault can be estimated simultaneously. The proposed method is able to esti-mate an abrupt sensor fault as well as the incipient one. Moreover, it is also effective in the multiple faults scenario. Simulations are conducted to confirm the effectiveness of the proposed method.展开更多
A new approach for simultaneous online identification of unknown time delay and dynamic parameters of discrete-time delay systems is proposed in this paper.The proposed algorithm involves constructing a new generalize...A new approach for simultaneous online identification of unknown time delay and dynamic parameters of discrete-time delay systems is proposed in this paper.The proposed algorithm involves constructing a new generalized regression vector and defining the time delay and the rational dynamic parameters in the same vector.The gradient algorithm is used to deal with the identification problem.The effectiveness of this method is illustrated through simulation.展开更多
This study addresses the adaptive control and function projective synchronization problems between 2D Rulkov discrete-time system and Network discrete-time system. Based on backstepping design with three controllers, ...This study addresses the adaptive control and function projective synchronization problems between 2D Rulkov discrete-time system and Network discrete-time system. Based on backstepping design with three controllers, a systematic, concrete and automatic scheme is developed to investigate the function projective synchronization of discretetime chaotic systems. In addition, the adaptive control function is applied to achieve the state synchronization of two discrete-time systems. Numerical results demonstrate the effectiveness of the proposed control scheme.展开更多
This paper examines a consensus problem in multiagent discrete-time systems, where each agent can exchange information only from its neighbor agents. A decentralized protocol is designed for each agent to steer all ag...This paper examines a consensus problem in multiagent discrete-time systems, where each agent can exchange information only from its neighbor agents. A decentralized protocol is designed for each agent to steer all agents to the same vector. The design condition is expressed in the form of a linear matrix inequality. Finally, a simulation example is presented and a comparison is made to demonstrate the effectiveness of the developed methodology.展开更多
The main contribution of this paper is to present stability synthesis results for discrete-time piecewise affine （PWA） systems with polytopic time-varying uncertainties and for discrete-time PWA systems with norm-bo...The main contribution of this paper is to present stability synthesis results for discrete-time piecewise affine （PWA） systems with polytopic time-varying uncertainties and for discrete-time PWA systems with norm-bounded uncertainties respectively.The basic idea of the proposed approaches is to construct piecewise-quadratic （PWQ） Lyapunov functions to guarantee the stability of the closed-loop systems.The partition information of the PWA systems is taken into account and each polytopic operating region is outer approximated by an ellipsoid,then sufficient conditions for the robust stabilization are derived and expressed as a set of linear matrix inequalities （LMIs）.Two examples are given to illustrate the proposed theoretical results.展开更多
Two approximation laws of sliding mode for discrete-time variable structure control systems are proposed to overcome the limitations of the exponential approximation law and the variable rate approximation law. By app...Two approximation laws of sliding mode for discrete-time variable structure control systems are proposed to overcome the limitations of the exponential approximation law and the variable rate approximation law. By applying the proposed approximation laws of sliding mode to discrete-time variable structure control systems, the stability of origin can be guaranteed, and the chattering along the switching surface caused by discrete-time variable structure control can be restrained effectively. In designing of approximation laws, the problem that the system control input is restricted is also considered, which is very important in practical systems. Finally a simulation example shows the effectiveness of the two approximation laws proposed.展开更多
Stability analysis and stabilization for discrete-time singular delay systems are addressed,respectively.Firstly,a sufficient condition for regularity,causality and stability for discrete-time singular delay systems i...Stability analysis and stabilization for discrete-time singular delay systems are addressed,respectively.Firstly,a sufficient condition for regularity,causality and stability for discrete-time singular delay systems is derived.Then,by applying the skill of matrix theory,the state feedback controller is designed to guarantee the closed-loop discrete-time singular delay systems to be regular,casual and stable.Finally,numerical examples are given to demonstrate the effectiveness of the proposed method.展开更多
A new variable structure control algorithm based on sliding mode prediction for a class of discrete-time nonlinear systems is presented. By employing a special model to predict future sliding mode value, and combining...A new variable structure control algorithm based on sliding mode prediction for a class of discrete-time nonlinear systems is presented. By employing a special model to predict future sliding mode value, and combining feedback correction and receding horizon optimization methods which are extensively applied on predictive control strategy, a discrete-time variable structure control law is constructed. The closed-loop systems are proved to have robustness to uncertainties with unspecified boundaries. Numerical simulation and pendulum experiment results illustrate that the closed-loop systems possess desired performance, such as strong robustness, fast convergence and chattering elimination.展开更多
This paper presents a discrete-time model to describe the movements of a group of trains, in which some operational strategies, including traction operation, braking operation and impact of stochastic disturbance, are...This paper presents a discrete-time model to describe the movements of a group of trains, in which some operational strategies, including traction operation, braking operation and impact of stochastic disturbance, are defined. To show the dynamic characteristics of train traffic flow with stochastic disturbance, some numerical experiments on a railway line are simulated. The computational results show that the discrete-time movement model can well describe the movements of trains on a rail line with the moving-block signalling system. Comparing with the results of no disturbance, it finds that the traffic capacity of the rail line will decrease with the influence of stochastic disturbance. Additionally, the delays incurred by stochastic disturbance can be propagated to the subsequent trains, and then prolong their traversing time on the rail line. It can provide auxiliary information for rescheduling trains When the stochastic disturbance occurs on the railway.展开更多
This paper gives a novel delay-dependent admissibility condition of discrete-time singular systems with time-varying delays. For convenience, the time-varying delay is assumed to be the sum of delay lower bound and th...This paper gives a novel delay-dependent admissibility condition of discrete-time singular systems with time-varying delays. For convenience, the time-varying delay is assumed to be the sum of delay lower bound and the integral multiples of a constant delay. Specially, if the constant delay is of unit length, the delay is an interval-like time-varying delay. The proposed admissibility condition is presented and expressed in terms of linear matrix inequality (LMI) by Lyapunov approach. Generally, the uncertainty of time-varying delay would lead to conservatism. In this paper, this critical issue is tackled by accurately estimating the time-varying delay. Consequently, the proposed admissibility condition is less conservative than the existing results, which is demonstrated by a numerical example.展开更多
The robust stability and stabilization, and H-infinity control problems for discrete-time Markovian jump singular systems with parameter uncertainties are discussed. Based on the restricted system equivalent （r.s.e....The robust stability and stabilization, and H-infinity control problems for discrete-time Markovian jump singular systems with parameter uncertainties are discussed. Based on the restricted system equivalent （r.s.e.） transformation and by introducing new state vectors, the singular system is transformed into a discrete-time Markovian jump standard linear system, and the linear matrix inequality （LMI） conditions for the discrete-time Markovian jump singular systems to be regular, causal, stochastically stable, and stochastically stable with 7- disturbance attenuation are obtained, respectively. With these conditions, the robust state feedback stochastic stabilization problem and H-infinity control problem are solved, and the LMI conditions are obtained. A numerical example illustrates the effectiveness of the method given in the oaoer.展开更多
基金Supported by the National Natural Science Foundation of China(71571127)the Opening Fund of Key Laboratory of Higher Education of Sichuan Province for Enterprise Informationalization and Internet of Things(2023WZJ02)。
文摘This paper proposes a new discrete-time Geo/G/1 queueing model under the control of bi-level randomized(p,N1,N2)-policy.That is,the server is closed down immediately when the system is empty.If N1(≥1)customers are accumulated in the queue,the server is activated for service with probability p(0≤p≤1)or still left off with probability(1−p).When the number of customers in the system becomes N_(2)(≥N1),the server begins serving the waiting customers until the system becomes empty again.For the model,firstly,we obtain the transient solution of the queue size distribution and the explicit recursive formulas of the stationary queue length distribution by employing the total probability decomposition technique.Then,the expressions of its probability generating function of the steady-state queue size and the expected steady-state queue size are presented.Additionally,numerical examples are conducted to discuss the effect of the system parameters on some performance indices.Furthermore,the steady-state distribution of queue length at epochs n−,n and outside observer’s observation epoch are explored,respectively.Finally,we establish a cost function to investigate the cost optimization problem under the constraint of the average waiting time.And the presented model provides a less expected cost as compared to the traditional N-policy.
文摘A robust Adaptive Discrete-time Sliding Mode Controller (ADSMC) is formulated, and is applied to control the pitch motion of a simulated Flapping-Wing Micro Air Vehicle (FWMAV). There is great potential for FWMAVs to be used as aerial tools to assist with gathering data and surveying environments. Thanks to modern manufacturing and technology, along with an increased comprehension behind the aerodynamics of wing flaps, these vehicles are now a reality, though not without limitations. Given their diminutive size, FWMAVs are susceptible to real-world disturbances, such as wind gusts, and are sensitive to particular variations in their build quality. While external forces such as wind gusts can be reasonably bounded, the unknown variations in the state may be difficult to characterize or bound without affecting performance. To address these problems, an ADSMC is developed. First, the FWMAV model is converted from continuous-time to discrete-time. Second, an ADSMC for the newly discretized FWMAV model is developed. Using this controller, the trajectory tracking performance of the FWMAV is assessed against a traditional discrete sliding mode controller, and is found to have a decreased chattering frequency and decreased control effort for the same task. Therefore, the ADSMC is assessed as the superior controller, despite being completely unaware of the model parameters or wind gust.
基金supported by the National Natural Science Foundation of China under Grant Nos.71571127and 71171138
文摘This paper considers the departure process and the optimal control strategy for a discretetime Geo/G/1 queueing model in which the system operates under the control of multiple server vacations and Min(N, V)-policy. Using the law of total probability decomposition, the renewal theory and the probability generating function technique, the transient and the steady-state probabilities that the server is busy at any epoch n^+ are derived. The authors also obtain the explicit expression of the probability generating function for the expected number of departures occurring in the time interval (0^+, n^+] from any initial state. Meanwhile, the relationship among departure process, server's state process and service renewal process in server busy period is found, which shows the special structure of departure process. Especially, some corresponding results of departure process for special discrete-time queues are directly gained by our results. Furthermore, the approximate expansion for calculating the expected number of departures is presented. In addition, some other important performance measures,including the expected length of server busy period, server's actual vacation period and busy cycle period etc., are analyzed. Finally, some numerical results are provided to determine the optimum value N*for minimizing the system cost under a given cost structure.
基金Supported by the National Natural Science Foundation of China(71571127)the Training Fund Program of Excellent Paper of Sichuan Normal University([2016]4-1)
文摘This paper deals with a discrete-time Geo/Geo/1 queueing system with working breakdowns in which customers arrive at the system in variable input rates according to the states of the server. The server may be subject to breakdowns at random when it is in operation. As soon as the server fails, a repair process immediately begins. During the repair period, the defective server still provides service for the waiting customers at a lower service rate rather than completely stopping service.We analyze the stability condition for the considered system. Using the probability generating function technique, we obtain the probability generating function of the steady-state queue size distribution.Also, various important performance measures are derived explicitly. Furthermore, some numerical results are provided to carry out the sensitivity analysis so as to illustrate the effect of different parameters on the system performance measures. Finally, an operating cost function is formulated to model a computer system and the parabolic method is employed to numerically find the optimum service rate in working breakdown period.
文摘Congestion is one of the well-studied problems in computer networks,which occurs when the request for network resources exceeds the buffer capacity.Many active queue management techniques such as BLUE and RED have been proposed in the literature to control congestions in early stages.In this paper,we propose two discrete-time queueing network analytical models to drop the arrival packets in preliminary stages when the network becomes congested.The first model is based on Lambda Decreasing and it drops packets from a probability value to another higher value according to the buffer length.Whereas the second proposed model drops packets linearly based on the current queue length.We compare the performance of both our models with the original BLUE in order to decide which of these methods offers better quality of service.The comparison is done in terms of packet dropping probability,average queue length,throughput ratio,average queueing delay,and packet loss rate.
文摘This paper analyzes a discrete-time multiple vacations finite-buffer queueing system with batch renewal input in which inter-arrival time of batches are arbitrarily distributed. Service and vacation times are mutually independent and geometrically distributed. The server takes vacations when the system does not have any waiting jobs at a service completion epoch or a vacation completion epoch. The system is analyzed under the assumptions of late arrival system with delayed access and early arrival system. Using the supplementary variable and the imbedded Markov chain techniques, the authors obtain the queue-length distributions at pre-arrival, arbitrary and outside observer＇s ob- servation epochs for partial-batch rejection policy. The blocking probability of the first, an arbitrary- and the last-job in a batch have been discussed. The analysis of actual waiting-time distributions measured in slots of the first, an arbitrary- and the last-job in an accepted batch, and other performance measures along with some numerical results have also been investigated.
文摘We consider a discrete-time multi-server finite-capacity queueing system with correlated batch arrivals and deterministic service times (of single slot), which has a variety of potential applications in slotted digital telecommunication systems and other related areas. For this queueing system, we present, based on Markov chain analysis, not only the steady-state distributions but also the transient distributions of the system length and of the system waiting time in a simple and unified manner. From these distributions, important performance measures of practical interest can be easily obtained. Numerical examples concerning the superposition of certain video traffics are presented at the end.
基金supported by the National Natural Science Foundation of China(Grant No.11971486)。
文摘We consider a single server constant retrial queue,in which a state-dependent service policy is used to control the service rate.Customer arrival follows Poisson process,while service time and retrial time are exponential distributions.Whenever the server is available,it admits the retrial customers into service based on a first-come first-served rule.The service rate adjusts in real-time based on the retrial queue length.An iterative algorithm is proposed to numerically solve the personal optimal problem in the fully observable scenario.Furthermore,we investigate the impact of parameters on the social optimal threshold.The effectiveness of the results is illustrated by two examples.
基金Project(50721063) supported by the National Natural Science Foundation of China
文摘A novel discrete-time reaching law was proposed for uncertain discrete-time system,which contained process noise and measurement noise.The proposed method reserves all the advantages of discrete-time reaching law,which not only decreases the band width of sliding mode and strengthens the system robustness,but also improves the dynamic performance and stability capability of the system.Moreover,a discrete-time sliding mode control strategy based on Kalman filter method was designed,and Kalman filter was employed to eliminate the influence of system noise.Simulation results show that there is no chattering phenomenon in the output of controller and the state variables of controlled system,and the proposed algorithm is also feasible and has strong robustness to external disturbances.
基金supported by the National Natural Science Foundation of China (60874054)
文摘To diagnose the fault of attitude sensors in satellites, this paper proposes a novel approach based on the Kalman filter of the discrete-time descriptor system. By regarding the sensor fault term as the auxiliary state vector, the attitude measurement system subjected to the attitude sensor fault is modeled by the discrete-time descriptor system. The condition of estimability of such systems is given. And then a Kalman filter of the discrete-time descriptor system is established based on the methodology of the maximum likelihood estimation. With the descriptor Kalman filter, the state vector of the original system and sensor fault can be estimated simultaneously. The proposed method is able to esti-mate an abrupt sensor fault as well as the incipient one. Moreover, it is also effective in the multiple faults scenario. Simulations are conducted to confirm the effectiveness of the proposed method.
基金supported by Ministry of the Higher Education and Scientific Research in Tunisia
文摘A new approach for simultaneous online identification of unknown time delay and dynamic parameters of discrete-time delay systems is proposed in this paper.The proposed algorithm involves constructing a new generalized regression vector and defining the time delay and the rational dynamic parameters in the same vector.The gradient algorithm is used to deal with the identification problem.The effectiveness of this method is illustrated through simulation.
基金supported by the Natural Science Foundation of China under Grant Nos.10747141 and 10735030Zhejiang Provincial Natural Science Foundation under Grant No.605408+3 种基金Ningbo Natural Science Foundation under Grant Nos.2007A610049 and 2008A61001National Basic Research Program of China (973 Program 2007CB814800)Programme for Changjiang Scholars and Innovative Research Team in University (IRT0734)K.C.Wong Magna Fund in Ningbo University
文摘This study addresses the adaptive control and function projective synchronization problems between 2D Rulkov discrete-time system and Network discrete-time system. Based on backstepping design with three controllers, a systematic, concrete and automatic scheme is developed to investigate the function projective synchronization of discretetime chaotic systems. In addition, the adaptive control function is applied to achieve the state synchronization of two discrete-time systems. Numerical results demonstrate the effectiveness of the proposed control scheme.
基金supported by Deanship of Scientific research(CDSR)at KFUPM(RG-1316-1)
文摘This paper examines a consensus problem in multiagent discrete-time systems, where each agent can exchange information only from its neighbor agents. A decentralized protocol is designed for each agent to steer all agents to the same vector. The design condition is expressed in the form of a linear matrix inequality. Finally, a simulation example is presented and a comparison is made to demonstrate the effectiveness of the developed methodology.
基金supported by the National Science Fund of China for Distinguished Young Scholars(No.60725311)
文摘The main contribution of this paper is to present stability synthesis results for discrete-time piecewise affine （PWA） systems with polytopic time-varying uncertainties and for discrete-time PWA systems with norm-bounded uncertainties respectively.The basic idea of the proposed approaches is to construct piecewise-quadratic （PWQ） Lyapunov functions to guarantee the stability of the closed-loop systems.The partition information of the PWA systems is taken into account and each polytopic operating region is outer approximated by an ellipsoid,then sufficient conditions for the robust stabilization are derived and expressed as a set of linear matrix inequalities （LMIs）.Two examples are given to illustrate the proposed theoretical results.
基金This work was supported by the National Natural Science Foundation of China (No.60274099) and the Foundation of Key Laboratory of Process Industry Automation, Ministry of Education
文摘Two approximation laws of sliding mode for discrete-time variable structure control systems are proposed to overcome the limitations of the exponential approximation law and the variable rate approximation law. By applying the proposed approximation laws of sliding mode to discrete-time variable structure control systems, the stability of origin can be guaranteed, and the chattering along the switching surface caused by discrete-time variable structure control can be restrained effectively. In designing of approximation laws, the problem that the system control input is restricted is also considered, which is very important in practical systems. Finally a simulation example shows the effectiveness of the two approximation laws proposed.
基金supported by the National Natural Science Foundation of China (6090400960974004)
文摘Stability analysis and stabilization for discrete-time singular delay systems are addressed,respectively.Firstly,a sufficient condition for regularity,causality and stability for discrete-time singular delay systems is derived.Then,by applying the skill of matrix theory,the state feedback controller is designed to guarantee the closed-loop discrete-time singular delay systems to be regular,casual and stable.Finally,numerical examples are given to demonstrate the effectiveness of the proposed method.
基金This work is supported by the National Natural Science Foundation of China (No.60421002) Priority supported financially by the New Century 151 Talent Project of Zhejiang Province.
文摘A new variable structure control algorithm based on sliding mode prediction for a class of discrete-time nonlinear systems is presented. By employing a special model to predict future sliding mode value, and combining feedback correction and receding horizon optimization methods which are extensively applied on predictive control strategy, a discrete-time variable structure control law is constructed. The closed-loop systems are proved to have robustness to uncertainties with unspecified boundaries. Numerical simulation and pendulum experiment results illustrate that the closed-loop systems possess desired performance, such as strong robustness, fast convergence and chattering elimination.
基金Project supported by the National Natural Science Foundation of China (Grant Nos. 70901006 and 60634010)the State Key Laboratory of Rail Traffic Control and Safety (Grant Nos. RCS2009ZT001 and RCS2008ZZ001)Beijing Jiaotong University, and the Innovation Foundation of Science and Technology for Excellent Doctorial Candidate of Beijing Jiaotong University (Grant No. 141034522)
文摘This paper presents a discrete-time model to describe the movements of a group of trains, in which some operational strategies, including traction operation, braking operation and impact of stochastic disturbance, are defined. To show the dynamic characteristics of train traffic flow with stochastic disturbance, some numerical experiments on a railway line are simulated. The computational results show that the discrete-time movement model can well describe the movements of trains on a rail line with the moving-block signalling system. Comparing with the results of no disturbance, it finds that the traffic capacity of the rail line will decrease with the influence of stochastic disturbance. Additionally, the delays incurred by stochastic disturbance can be propagated to the subsequent trains, and then prolong their traversing time on the rail line. It can provide auxiliary information for rescheduling trains When the stochastic disturbance occurs on the railway.
基金supported by National Natural Science Foundation of China (Nos.61035005,61175041,60904009)Program for Liaoning Excellent Talents in University (No. LJQ2011118)Natural Science Foundation of Liaoning Province (No. 201202201)
文摘This paper gives a novel delay-dependent admissibility condition of discrete-time singular systems with time-varying delays. For convenience, the time-varying delay is assumed to be the sum of delay lower bound and the integral multiples of a constant delay. Specially, if the constant delay is of unit length, the delay is an interval-like time-varying delay. The proposed admissibility condition is presented and expressed in terms of linear matrix inequality (LMI) by Lyapunov approach. Generally, the uncertainty of time-varying delay would lead to conservatism. In this paper, this critical issue is tackled by accurately estimating the time-varying delay. Consequently, the proposed admissibility condition is less conservative than the existing results, which is demonstrated by a numerical example.
基金Postdoctoral Science Foundation of China (No. 20060400980)Postdoctoral Science Foundation of Shandong Province(No. 200603015)National Science Foundation of China (No. 10671112)
文摘The robust stability and stabilization, and H-infinity control problems for discrete-time Markovian jump singular systems with parameter uncertainties are discussed. Based on the restricted system equivalent （r.s.e.） transformation and by introducing new state vectors, the singular system is transformed into a discrete-time Markovian jump standard linear system, and the linear matrix inequality （LMI） conditions for the discrete-time Markovian jump singular systems to be regular, causal, stochastically stable, and stochastically stable with 7- disturbance attenuation are obtained, respectively. With these conditions, the robust state feedback stochastic stabilization problem and H-infinity control problem are solved, and the LMI conditions are obtained. A numerical example illustrates the effectiveness of the method given in the oaoer.
