In this article, an optimal switching integrity attack problem is investigated to study the response of feedback controlsystems under attack. The authors model the malicious attacks on sensors as additive norm bounde...
详细信息
The problem of generating optimal paths for curvature-constrained unmanned aerial vehicles (UAVs) performing surveillance of multiple ground targets is addressed in this paper. UAVs are modeled as Dubins vehicles so...
详细信息
The problem of generating optimal paths for curvature-constrained unmanned aerial vehicles (UAVs) performing surveillance of multiple ground targets is addressed in this paper. UAVs are modeled as Dubins vehicles so that the constraints of UAVs' minimal turning radius can be taken into account. In view of the effective surveillance range of the sensors equipped on UAVs, the problem is formulated as a Dubins traveling salesman problem with neighborhood (DTSPN). Considering its prohibitively high computational complexity, the Dubins paths in the sense of terminal heading relaxation are introduced to simplify the calculation of the Dubins distance, and a boundary-based encoding scheme is proposed to determine the visiting point of every target neighborhood. Then, an evolutionary algorithm is used to derive the optimal Dubins tour. To further enhance the quality of the solutions, a local search strategy based on approximate gradient is employed to improve the visiting points of target neighborhoods. Finally, by a minor modification to the individual encoding, the algorithm is easily extended to deal with other two more sophisticated DTSPN variants (multi-UAV scenario and multiple groups of targets scenario). The performance of the algorithm is demonstrated through comparative experiments with other two state-of-the-art DTSPN algorithms identified in literature. Numerical simulations exhibit that the algorithm proposed in this paper can find high-quality solutions to the DTSPN with lower computational cost and produce significantly improved performance over the other algorithms.
This paper is devoted to further investigating the cloud controlsystems(CCSs). The benefits and challenges of CCSs are provided. Both new research results of ours and some typical work made by other researchers are p...
详细信息
This paper is devoted to further investigating the cloud controlsystems(CCSs). The benefits and challenges of CCSs are provided. Both new research results of ours and some typical work made by other researchers are presented. It is believed that the CCSs can have huge and promising effects due to their potential advantages.
Many real-world optimization problems involve multiple conflicting objectives. Such problems are called multiobjective optimization problems(MOPs). Typically, MOPs have a set of so-called Pareto optimal solutions rath...
详细信息
Many real-world optimization problems involve multiple conflicting objectives. Such problems are called multiobjective optimization problems(MOPs). Typically, MOPs have a set of so-called Pareto optimal solutions rather than one unique optimal solution. To assist the decision maker(DM) in finding his/her most preferred solution, we propose an interactive multiobjective evolutionary algorithm(MOEA)called iDMOEA-εC, which utilizes the DM's preferences to compress the objective space directly and progressively for identifying the DM's preferred region. The proposed algorithm employs a state-of-the-art decomposition-based MOEA called DMOEA-εC as the search engine to search for solutions. DMOEA-εC decomposes an MOP into a series of scalar constrained subproblems using a set of evenly distributed upper bound vectors to approximate the entire Pareto front. To guide the population toward only the DM's preferred part on the Pareto front, an adaptive adjustment mechanism of the upper bound vectors and two-level feasibility rules are proposed and integrated into DMOEA-εC to control the spread of the population. To ease the DM's burden, only a small set of representative solutions is presented in each interaction to the DM,who is expected to specify a preferred one from the set. Furthermore, the proposed algorithm includes a two-stage selection procedure, allowing to elicit the DM's preferences as accurately as possible. To evaluate the performance of the proposed algorithm, it was compared with other interactive MOEAs in a series of experiments. The experimental results demonstrated the superiority of iDMOEA-εC over its competitors.
A model-based offline policy iteration(PI) algorithm and a model-free online Q-learning algorithm are proposed for solving fully cooperative linear quadratic dynamic games. The PI-based adaptive Q-learning method can ...
详细信息
A model-based offline policy iteration(PI) algorithm and a model-free online Q-learning algorithm are proposed for solving fully cooperative linear quadratic dynamic games. The PI-based adaptive Q-learning method can learn the feedback Nash equilibrium online using the state samples generated by behavior policies, without sending inquiries to the system model. Unlike the existing Q-learning methods, this novel Q-learning algorithm executes both policy evaluation and policy improvement in an adaptive *** prove the convergence of the offline PI algorithm by proving its equivalence to Newton's method while solving the game algebraic Riccati equation(GARE). Furthermore, we prove that the proposed Q-learning method will converge to the Nash equilibrium under a small learning rate if the method satisfies certain persistence of excitation conditions, which can be easily met by suitable behavior policies. Our simulation results demonstrate the good performance of the proposed online adaptive Q-learning algorithm.
Compressive sensing is a revolutionary idea proposed recently to achieve much lower sampling rate for *** the image application with limited resources the camera data can be stored and processed in compressed *** algo...
详细信息
Compressive sensing is a revolutionary idea proposed recently to achieve much lower sampling rate for *** the image application with limited resources the camera data can be stored and processed in compressed *** algorithm for moving object and region detection in video using a compressive sampling is *** algorithm estimates motion information of the moving object and regions in the video from the compressive measurements of the current image and background *** algorithm does not perform inverse compressive operation to obtain the actual pixels of the current image nor the estimated *** leads to a computationally efficient method and a system compared with the existing motion estimation *** experimental results show that the sampling rate can reduce to 25% without sacrificing performance.
Dynamic image stabilization precision of an optical image-stable device is a key technical ***,a fast dynamic image stabilization precision test system for an optical image-stable device is developed.A large-aperture ...
详细信息
Dynamic image stabilization precision of an optical image-stable device is a key technical ***,a fast dynamic image stabilization precision test system for an optical image-stable device is developed.A large-aperture collimator with a designed cross divisional board is used to simulate the infinity *** image-stable device is installed on the motion simulator with six degrees of freedom which is used to simulate the moving state of the *** CCD camera installed behind the eyepiece lens of the image-stable device acquires images rapidly and in real *** local energy maxima center of the cross light spot can be acquired accurately through the proposed algorithm using the Hessian *** addition,to deal with the CCD non-uniformity,an adaptive non-uniformity correction algorithm based on bi-dimensional empirical mode decomposition is *** actual test results for the proposed method show that the test error of dynamic image stabilization is less than 0.7,and the time for the frame image acquisition and processing is less than 10 ms,which demonstrates the effectiveness of the test system.
The positioning accuracy of a short-haul target-locating system,the inverse-GPS(IGPS) ,was analyzed in detail. The relationship between IGPS and the positioning error was discussed. The multiplicative error minimal bo...
详细信息
The positioning accuracy of a short-haul target-locating system,the inverse-GPS(IGPS) ,was analyzed in detail. The relationship between IGPS and the positioning error was discussed. The multiplicative error minimal bound of the geometric dilution of precision (GDOP) about the four-base-station IGPS was also investigated. In order to clarify the practical implementation of IGPS,the multiplicative and additive error factors which affect the positioning accuracy and theoretical estimation of positioning accuracy were presented. By analyzing the experiments of locating a target's position in virtual three-dimensional areas,the positioning performance of IGPS was illustrated. The results show that the multiplicative and additive error factors should be eliminated in IGPS to improve the positioning accuracy.
This study addresses the issue of adaptive cooperative game control (ACGC) design for wing deformation and flight state tracking of morphing hypersonic vehicles (MHVs) with variable wing shapes, input constraints and ...
详细信息
Distributed stereoscopic rotating formation control of networks of second-order agents is investigated. A distributed control protocol is proposed to enable all agents to form a stereoscopic formation and surround a c...
详细信息
Distributed stereoscopic rotating formation control of networks of second-order agents is investigated. A distributed control protocol is proposed to enable all agents to form a stereoscopic formation and surround a common axis. Due to the existence of the rotating mode, the desired relative position between every two agents is time-varying, and a Lyapunov-based approach is employed to solve the rotating formation control problem. Finally, simulation results are provided to illustrate the effectiveness of the theoretical results.
暂无评论