Parallel machine problems with a single server and release times are generalizations of classical parallel machine problems. Before processing, each job must be loaded on a machine, which takes a certain release times...Parallel machine problems with a single server and release times are generalizations of classical parallel machine problems. Before processing, each job must be loaded on a machine, which takes a certain release times and a certain setup times. All these setups have to be done by a single server, which can handle at most one job at a time. In this paper, we continue studying the complexity result for parallel machine problem with a single and release times. New complexity results are derived for special cases.展开更多
The fault accommodation problem for time-delay system is studied in this paper. The progressive accommodation strategy based on the Newton-Raphson scheme is proposed to solve this problem. This accommodation scheme ca...The fault accommodation problem for time-delay system is studied in this paper. The progressive accommodation strategy based on the Newton-Raphson scheme is proposed to solve this problem. This accommodation scheme can significantly reduces the loss of performance and risk associated with system instability which results from the time-delay needed by fault accommodation algorithms to provide a solution. Simulation results are given to illustrate the efficiency of the provided method.展开更多
This paper presents a method for directly analyzing the stability of complex-DDEs on the basis of stability switches. Two novel criteria are developed for the stability of a class of complex- DDEs. These results not o...This paper presents a method for directly analyzing the stability of complex-DDEs on the basis of stability switches. Two novel criteria are developed for the stability of a class of complex- DDEs. These results not only generalize some known results in literature but also greatly reduce the complexity of analysis and computation. To validate the effectiveness of the proposed criteria, the stabilization problem of the extended time delay auto-synchronization （ETDAS） control and n time delay auto-synchronization （NTDAS） control are then further investigated, respectively. The numerical simulations are consistent with the above theoretical analysis.展开更多
In this paper, finite time consensus problem is discussed for multiple non-holonomic mobile agents with constant communication delay. The objective is to design non-smooth distributed control laws such that multiple n...In this paper, finite time consensus problem is discussed for multiple non-holonomic mobile agents with constant communication delay. The objective is to design non-smooth distributed control laws such that multiple non-holonomic mobile agents can be all in agreement within any given finite time larger than communication delay. The authors propose a novel switching control strategy with the help of Lyapunov-based method and graph theory.展开更多
文摘Parallel machine problems with a single server and release times are generalizations of classical parallel machine problems. Before processing, each job must be loaded on a machine, which takes a certain release times and a certain setup times. All these setups have to be done by a single server, which can handle at most one job at a time. In this paper, we continue studying the complexity result for parallel machine problem with a single and release times. New complexity results are derived for special cases.
基金National Natural Science Foundation of China (No.60574081)
文摘The fault accommodation problem for time-delay system is studied in this paper. The progressive accommodation strategy based on the Newton-Raphson scheme is proposed to solve this problem. This accommodation scheme can significantly reduces the loss of performance and risk associated with system instability which results from the time-delay needed by fault accommodation algorithms to provide a solution. Simulation results are given to illustrate the efficiency of the provided method.
基金This work was supported by National＇Science Foundation for Distinguished Young Scholars under Grant No. 10825207, and in part by Foundation for the Author of National Excellent Doctoral Dissertation of China under Grant No. 200430.
文摘This paper presents a method for directly analyzing the stability of complex-DDEs on the basis of stability switches. Two novel criteria are developed for the stability of a class of complex- DDEs. These results not only generalize some known results in literature but also greatly reduce the complexity of analysis and computation. To validate the effectiveness of the proposed criteria, the stabilization problem of the extended time delay auto-synchronization （ETDAS） control and n time delay auto-synchronization （NTDAS） control are then further investigated, respectively. The numerical simulations are consistent with the above theoretical analysis.
基金supported by the Young Faculty Foundation of Tianjin University under Grant No.TJUYFF-08B73
文摘In this paper, finite time consensus problem is discussed for multiple non-holonomic mobile agents with constant communication delay. The objective is to design non-smooth distributed control laws such that multiple non-holonomic mobile agents can be all in agreement within any given finite time larger than communication delay. The authors propose a novel switching control strategy with the help of Lyapunov-based method and graph theory.
