In this paper a recursive state-space model identification method is proposed for non-uniformly sampled systems in industrial applications. Two cases for measuring all states and only output(s) of such a system are co...In this paper a recursive state-space model identification method is proposed for non-uniformly sampled systems in industrial applications. Two cases for measuring all states and only output(s) of such a system are considered for identification. In the case of state measurement, an identification algorithm based on the singular value decomposition(SVD) is developed to estimate the model parameter matrices by using the least-squares fitting. In the case of output measurement only, another identification algorithm is given by combining the SVD approach with a hierarchical identification strategy. An example is used to demonstrate the effectiveness of the proposed identification method.展开更多
In this paper, it is supposed that the B&B algorithm finds the first optimal solution after h nodes have been expanded and m active nodes have been created in the state-space tree. Then the lower bound Ω(m+h log ...In this paper, it is supposed that the B&B algorithm finds the first optimal solution after h nodes have been expanded and m active nodes have been created in the state-space tree. Then the lower bound Ω(m+h log h) of the running time for the general sequential B&B algorithm and the lower bound Ω(m/p+h log p) for the general parallel best-first B&B algorithm in PRAM-CREW are proposed, where p is the number of processors available. Moreover, the lower bound Ω(M/p+H+(H/p) log (H/p)) is presented for the parallel algorithms on distributed memory system, where M and H represent total number of the active nodes and that of the expanded nodes processed by p processors, respectively. In addition, a nearly fastest general parallel best-first B&B algorithm is put forward. The parallel algorithm is the fastest one as p = max{hε, r}, where ε = 1/ rootlogh, and r is the largest branch number of the nodes in the state-space tree.展开更多
The working of Canonical switching cell(CSC)converter was studied and its equivalent circuit during ON and OFF states were obtained.State space model of CSC converter in ON and OFF states were developed using the Kirc...The working of Canonical switching cell(CSC)converter was studied and its equivalent circuit during ON and OFF states were obtained.State space model of CSC converter in ON and OFF states were developed using the Kirchhoff laws.The state space matrices were used to construct the transfer functions of ON&OFF states.The step response of the converter was simulated using MATLAB.The step response curve was obtained using different values of circuit components(L,C1,C2 and RL)and optimized.The characteristic parameters such as rise time,overshoot,settling time,steady state error and stability were determined using the step response curve.The response curve shows that there is no overshoot;the rise time and settling time are very low as expected for a converter and its stability is very high but the amplitude is very.The circuit was tuned to attain the expected amplitude using PID controller with the help of Genetic algorithm.The excellent results of circuits’characteristic parameters are very useful guideline for constructing such CSC converters for DC-DC conversions.The circuit characteristic parameters are useful in constructing such CSC converters for DCDC conversions in driving solar energy using solar panel.展开更多
State-space equations were applied to formulate the queuing and delay of traffic at a single intersection in this paper. The signal control of a single intersection was then modeled as a discrete-time optimal control ...State-space equations were applied to formulate the queuing and delay of traffic at a single intersection in this paper. The signal control of a single intersection was then modeled as a discrete-time optimal control problem, with consideration of the constraints of stream conflicts, saturation flow rate, minimum green time, and maximum green time. The problem cannot be solved directly due to the nonlinear constraints. However, the results of qualitative analysis were used to develop a first-phase signal control algorithm. Simulation results show that the algorithm substantially reduces the total delay compared to fixed-time control.展开更多
基金Supported in part by the National Thousand Talents Program of Chinathe National Natural Science Foundation of China(61473054)the Fundamental Research Funds for the Central Universities of China
文摘In this paper a recursive state-space model identification method is proposed for non-uniformly sampled systems in industrial applications. Two cases for measuring all states and only output(s) of such a system are considered for identification. In the case of state measurement, an identification algorithm based on the singular value decomposition(SVD) is developed to estimate the model parameter matrices by using the least-squares fitting. In the case of output measurement only, another identification algorithm is given by combining the SVD approach with a hierarchical identification strategy. An example is used to demonstrate the effectiveness of the proposed identification method.
基金This paper was supported by Ph. D. Foundation of State Education Commission of China.
文摘In this paper, it is supposed that the B&B algorithm finds the first optimal solution after h nodes have been expanded and m active nodes have been created in the state-space tree. Then the lower bound Ω(m+h log h) of the running time for the general sequential B&B algorithm and the lower bound Ω(m/p+h log p) for the general parallel best-first B&B algorithm in PRAM-CREW are proposed, where p is the number of processors available. Moreover, the lower bound Ω(M/p+H+(H/p) log (H/p)) is presented for the parallel algorithms on distributed memory system, where M and H represent total number of the active nodes and that of the expanded nodes processed by p processors, respectively. In addition, a nearly fastest general parallel best-first B&B algorithm is put forward. The parallel algorithm is the fastest one as p = max{hε, r}, where ε = 1/ rootlogh, and r is the largest branch number of the nodes in the state-space tree.
文摘The working of Canonical switching cell(CSC)converter was studied and its equivalent circuit during ON and OFF states were obtained.State space model of CSC converter in ON and OFF states were developed using the Kirchhoff laws.The state space matrices were used to construct the transfer functions of ON&OFF states.The step response of the converter was simulated using MATLAB.The step response curve was obtained using different values of circuit components(L,C1,C2 and RL)and optimized.The characteristic parameters such as rise time,overshoot,settling time,steady state error and stability were determined using the step response curve.The response curve shows that there is no overshoot;the rise time and settling time are very low as expected for a converter and its stability is very high but the amplitude is very.The circuit was tuned to attain the expected amplitude using PID controller with the help of Genetic algorithm.The excellent results of circuits’characteristic parameters are very useful guideline for constructing such CSC converters for DC-DC conversions.The circuit characteristic parameters are useful in constructing such CSC converters for DCDC conversions in driving solar energy using solar panel.
基金Supported by the National Natural Science Foundation of China (No. 60572005)
文摘State-space equations were applied to formulate the queuing and delay of traffic at a single intersection in this paper. The signal control of a single intersection was then modeled as a discrete-time optimal control problem, with consideration of the constraints of stream conflicts, saturation flow rate, minimum green time, and maximum green time. The problem cannot be solved directly due to the nonlinear constraints. However, the results of qualitative analysis were used to develop a first-phase signal control algorithm. Simulation results show that the algorithm substantially reduces the total delay compared to fixed-time control.
