This paper investigates the robust exponential stability for discrete-time Cohen-Grossberg neural networks with both time-varying and distributed *** constructing a novel Lyapunov-Krasovskii functional and introducing...
详细信息
This paper investigates the robust exponential stability for discrete-time Cohen-Grossberg neural networks with both time-varying and distributed *** constructing a novel Lyapunov-Krasovskii functional and introducing some free-weighting matrices,two delay-dependent sufficient conditions are obtained by using convex *** criteria are presented in terms of LMIs and their feasibility can be easily checked with the help of LMI in Matlab *** addition,the activation function can be described more generally,which generalizes those earlier ***,the effectiveness of the obtained results is further illustrated by a numerical example in comparison with the existent ones.
In order to improve the convergence speed of traditional genetic algorithm for path planning of robot, a knowledge-guided genetic algorithm is designed by introducing domain knowledge of a path planning problem into t...
详细信息
In order to improve the convergence speed of traditional genetic algorithm for path planning of robot, a knowledge-guided genetic algorithm is designed by introducing domain knowledge of a path planning problem into the coding of chromosome, initialization of population, genetic operators and optimization operators. The length, safety and smoothness of paths are considered simultaneously during the process of path planning. Four optimization operators, deletion, simplification, modification and smoothness operators, are used to optimize paths searched by the genetic operators. Simulation results show that the proposed method can improve the ability and efficiency of genetic algorithm in solving the practical path planning problem of robot.
To solve the weapon network system optimization problem against small raid objects with low attitude,the concept of direction probability and a new evaluation index system are *** calculating the whole damaging probab...
详细信息
To solve the weapon network system optimization problem against small raid objects with low attitude,the concept of direction probability and a new evaluation index system are *** calculating the whole damaging probability that changes with the defending angle,the efficiency of the whole weapon network system can be subtly *** such method,we can avoid the inconformity of the description obtained from the traditional index *** new indexes are also proposed,*** index,overlap index and cover index,which help manage the relationship among several *** normalizing the computation results with the Sigmoid function,the matching problem between the optimization algorithm and indexes is well ***,the algorithm of improved marriage in honey bees optimization that proposed in our previous work is applied to optimize the embattlement *** is carried out to show the efficiency of the proposed indexes and the optimization algorithm.
In this paper, the exponential synchronization problem of a class of chaotic delayed neural networks(DNNs)via impulsive control method is *** on the theory of impulsive functional differential equations(FDEs), some ne...
详细信息
In this paper, the exponential synchronization problem of a class of chaotic delayed neural networks(DNNs)via impulsive control method is *** on the theory of impulsive functional differential equations(FDEs), some new synchronization criteria expressed in the form of linear matrix inequalities(LMIs) are *** designed impulsive controller not only can globally exponentially stabilize the error dynamics, but also can control the exponential synchronization rate of the error ***, to estimate the stable region, a novel optimization control algorithm is developed,which can deal with the minimum problem with two nonlinear terms coexisting in LMIs ***, simulation results demonstrate the effectiveness of the proposed method.
A new simultaneous localization and mapping approach based on mixed map model using laser data and odometry information is presented in this paper. Mixed model composed of occupancy grids and line maps is utilized to ...
详细信息
A new simultaneous localization and mapping approach based on mixed map model using laser data and odometry information is presented in this paper. Mixed model composed of occupancy grids and line maps is utilized to represent environment maps. At the same time Hough transform is introduced to extract line features. Then robot localization and map building task is accomplished using line features matching and extended Kalman filter. Experimental results indicate the feasibility and validity of this approach.
This paper proposes an adaptive observer for discrete MIMO systems with unknown dynamics and *** case that the system output equation has time-delay and nonlinearities is also *** delayed states in the system are with...
详细信息
This paper proposes an adaptive observer for discrete MIMO systems with unknown dynamics and *** case that the system output equation has time-delay and nonlinearities is also *** delayed states in the system are with a nonlinear form and only the estimated delay is *** using a high-order neural network(HONN),the precise system model,and the Lipschitz or norm-boundedness assumption of unknown nonlinearities are not required.A novel converse Lyapunov Lemma is also developed to prove the uniform ultimate boundedness(UUB) of the proposed *** of the presented scheme is verified by simulation.
The dual heuristic programming (DHP) approach has a superior ability for solving approximate dynamic programming problems in adaptive critic designs (ACD). The common approaches applied in the DHP are design the multi...
详细信息
The dual heuristic programming (DHP) approach has a superior ability for solving approximate dynamic programming problems in adaptive critic designs (ACD). The common approaches applied in the DHP are design the multilayer feedforward neural networks (MLFNN) as the differential model of the plant for training the critic and action networks. However, the problems of overfitting and premature convergence to local optima usually pose great challenges in the practice of MLFNNs during the training procedure. In this paper a least squares support vector machine (LS-SVM) regressor optimized by particle swarm algorithm (PSO) is proposed for generating the control actions and the learning rules for the critic and action networks. PSO is introduced to select the LS-SVM's hyper-parameters. The introduction of the SVM based training mechanism imparts the developed algorithm with inherent capacity for combating the overfitting problem as well as showing relatively high efficiency in converging to the optima. Simulation on the balancing of a cart pole plant shows that the proposed learning strategy is verified as faster convergence and higher efficiency as compared to traditional BP based adaptive dynamic programming approaches.
In order to intercept maneuvering targets, a guidance law based on nonsingular terminal sliding mode (NTSM) technique is presented. The proposed NTSM contains the line-of-sight (LOS) angular rate and a desired LOS ang...
详细信息
In order to intercept maneuvering targets, a guidance law based on nonsingular terminal sliding mode (NTSM) technique is presented. The proposed NTSM contains the line-of-sight (LOS) angular rate and a desired LOS angular. Through introducing the nonlinear sliding mode surface to improve the convergent characteristics of the system, the states of the closed-loop system can be converged to the origin in finite time and the system performance is improved greatly. The LOS angular rate is nullified in finite time to guarantee the zero miss-distance between the missile and the target;the LOS angular reaches the desired value in finite time to guarantee the missile attitude of hitting the target. With the maneuverability of acceleration of the target regarded as an unknown bounded disturbance, the proposed guidance law is robust to target maneuvering by using the invariance of the variable structure control. The guidance law has a simple structure and is easy to be implemented. Two cases of target maneuvering are simulated to validate the effectiveness of the method. The simulation results show that the algorithm has strong robustness and high guidance accuracy.
In this paper, an iterative adaptive critic design (ACD) algorithm is proposed to solve a class of discrete-time two-person zero-sum games for Roesser type 2-D system. The idea is to use adaptive critic technique to o...
详细信息
In this paper, an iterative adaptive critic design (ACD) algorithm is proposed to solve a class of discrete-time two-person zero-sum games for Roesser type 2-D system. The idea is to use adaptive critic technique to obtain the optimal control pair iteratively to make the performance index function reach the saddle point of the zero-sum games. The proposed iterative ACD algorithm can be implemented based on the input and state data without the system model. Stability analysis of the 2-D system is presented and the convergence property of the performance index function is also proved. Neural networks are used to approximate the performance index function and compute the optimal control policies, respectively, for facilitating the implementation of the iterative ACD algorithm. The optimal control scheme of the air drying process is given to illustrate the performance of the proposed method.
This paper is concerned with the estimation of the domain of attraction for a class of linear continuous-time systems subject to both interval time-varying delay and actuator saturation. A new type of delay-range-depe...
详细信息
This paper is concerned with the estimation of the domain of attraction for a class of linear continuous-time systems subject to both interval time-varying delay and actuator saturation. A new type of delay-range-dependent condition is firstly proposed using the free-weighting matrix technique to derive a tighter upper bound on the derivative of a Lyapunov-Krasovskii functional. Based on it, a state feedback controller is then designed with the solution of a set of linear matrix inequalities. An optimization problem with LMI constraints is formulated in order to find an initial set as large as possible to obtain a less conservative estimate of the domain of attraction for such systems. An example is carried out to illustrate the theoretical results.
暂无评论