This paper proposes a Genetic Programming-Based Modeling (GPM) algorithm on chaotic time series. GP is used here to search for appropriate model structures in function space, and the Particle Swarm Optimization (PSO) ...This paper proposes a Genetic Programming-Based Modeling (GPM) algorithm on chaotic time series. GP is used here to search for appropriate model structures in function space, and the Particle Swarm Optimization (PSO) algorithm is used for Nonlinear Parameter Estimation (NPE) of dynamic model structures. In addition, GPM integrates the results of Nonlinear Time Series Analysis (NTSA) to adjust the parameters and takes them as the criteria of established models. Experiments showed the effectiveness of such improvements on chaotic time series modeling.展开更多
In this paper,an approach of square coordinate transformation is proposed to approximate the spectral abscissa for continuous-time switched linear systems.By applying elementary transformations iteratively,a series of...In this paper,an approach of square coordinate transformation is proposed to approximate the spectral abscissa for continuous-time switched linear systems.By applying elementary transformations iteratively,a series of minimums of least μ1 matrix set measures are obtained,which are utilized to approximate the spectral abscissa of the switched system.The approach is developed into tractable numerical algorithms that provide upper bound estimates of the spectral abscissa.Numerical simulations show the effectiveness of the proposed method.展开更多
Equivalent simplification is an effective method for solving large-scale complex problems. In this paper, the authors simplify a classic project scheduling problem, which is the nonlinear continuous time-cost tradeoff...Equivalent simplification is an effective method for solving large-scale complex problems. In this paper, the authors simplify a classic project scheduling problem, which is the nonlinear continuous time-cost tradeoff problem(TCTP). Simplifying TCTP is a simple path problem in a critical path method(CPM) network. The authors transform TCTP into a simple activity float problem and design a complex polynomial algorithm for its solution. First, the authors discover relationships between activity floats and path lengths by studying activity floats from the perspective of path instead of time.Second, the authors perform simplification and improve the efficiency and accuracy of the solution by deleting redundant activities and narrowing the duration intervals of non-redundant activities. Finally,the authors compare our method with current methods. The relationships between activity floats and path lengths provide new approaches for other path and correlative project problems.展开更多
This paper addresses the stability problem for a class of switched nonlinear time varying delay systems modeled by delay differential equations. By transforming the system representation under the arrow form and using...This paper addresses the stability problem for a class of switched nonlinear time varying delay systems modeled by delay differential equations. By transforming the system representation under the arrow form and using a new constructed Lyapunov function,the aggregation techniques,the Borne-Gentina practical stability criterion associated with the properties, new delay-independent stability conditions of the considered systems are established. Compared with the existing results in this area, the obtained result is explicit, simple to use and allows us to avoid the problem of searching a common Lyapunov function. Finally, an example is provided, with numerical simulations,to demonstrate the effectiveness of the proposed method.展开更多
In this paper, the problem of consensus for continuous time singular systems of multi-agent networks is considered. The definition of r-consensus is introduced for singular systems of multi-agent networks. Firstly, li...In this paper, the problem of consensus for continuous time singular systems of multi-agent networks is considered. The definition of r-consensus is introduced for singular systems of multi-agent networks. Firstly, linear systems with algebraic constraints are considered, and the corresponding results about consensus and average-consensus are derived. Then r-consensus and consensus problems of singular systems are investigated. Sufficient conditions of r-consensus and consensus are obtained,respectively. Finally, an illustrative example is given to show the effectiveness of the proposed method.展开更多
基金Project (Nos. 60174009 and 70071017) supported by the NationalNatural Science Foundation of China
文摘This paper proposes a Genetic Programming-Based Modeling (GPM) algorithm on chaotic time series. GP is used here to search for appropriate model structures in function space, and the Particle Swarm Optimization (PSO) algorithm is used for Nonlinear Parameter Estimation (NPE) of dynamic model structures. In addition, GPM integrates the results of Nonlinear Time Series Analysis (NTSA) to adjust the parameters and takes them as the criteria of established models. Experiments showed the effectiveness of such improvements on chaotic time series modeling.
基金supported by the National Key Basic Research Program(973 Plan)under Grant No.2014CB845302the National Natural Science Foundation of China under Grant No.61273121
文摘In this paper,an approach of square coordinate transformation is proposed to approximate the spectral abscissa for continuous-time switched linear systems.By applying elementary transformations iteratively,a series of minimums of least μ1 matrix set measures are obtained,which are utilized to approximate the spectral abscissa of the switched system.The approach is developed into tractable numerical algorithms that provide upper bound estimates of the spectral abscissa.Numerical simulations show the effectiveness of the proposed method.
基金supported by the Science and Technology Foundation of Jiangxi Provincial Department of Education in China under Grant No.GJJ161114the Natural Science Foundation of China under Grant No.71271081the Soft Science Research Base of Water Security and Sustainable Development of Jiangxi Province in China
文摘Equivalent simplification is an effective method for solving large-scale complex problems. In this paper, the authors simplify a classic project scheduling problem, which is the nonlinear continuous time-cost tradeoff problem(TCTP). Simplifying TCTP is a simple path problem in a critical path method(CPM) network. The authors transform TCTP into a simple activity float problem and design a complex polynomial algorithm for its solution. First, the authors discover relationships between activity floats and path lengths by studying activity floats from the perspective of path instead of time.Second, the authors perform simplification and improve the efficiency and accuracy of the solution by deleting redundant activities and narrowing the duration intervals of non-redundant activities. Finally,the authors compare our method with current methods. The relationships between activity floats and path lengths provide new approaches for other path and correlative project problems.
文摘This paper addresses the stability problem for a class of switched nonlinear time varying delay systems modeled by delay differential equations. By transforming the system representation under the arrow form and using a new constructed Lyapunov function,the aggregation techniques,the Borne-Gentina practical stability criterion associated with the properties, new delay-independent stability conditions of the considered systems are established. Compared with the existing results in this area, the obtained result is explicit, simple to use and allows us to avoid the problem of searching a common Lyapunov function. Finally, an example is provided, with numerical simulations,to demonstrate the effectiveness of the proposed method.
基金supported by the National Natural Science Foundation of China under Grant Nos.61174141 and 61374025Research Awards Young and Middle-Aged Scientists of Shandong Province under Grant Nos.BS2011SF009 and BS2011DX019Excellent Youth Foundation of Shandong Province under Grant No.JQ201219
文摘In this paper, the problem of consensus for continuous time singular systems of multi-agent networks is considered. The definition of r-consensus is introduced for singular systems of multi-agent networks. Firstly, linear systems with algebraic constraints are considered, and the corresponding results about consensus and average-consensus are derived. Then r-consensus and consensus problems of singular systems are investigated. Sufficient conditions of r-consensus and consensus are obtained,respectively. Finally, an illustrative example is given to show the effectiveness of the proposed method.
