In this paper, the problem of guarding a circular area is proposed and solved using a Stackelberg differential game theoretic approach. The objective of the attacker is to breach the perimeter of the defended area, wh...
详细信息
In this paper, the problem of guarding a circular area is proposed and solved using a Stackelberg differential game theoretic approach. The objective of the attacker is to breach the perimeter of the defended area, while the defenders endeavor to thwart such attempts. The dynamics of the attack-defense game are modeled according to the distance and position relations among defenders, attackers, and the center of defense area. The optimal Stackelberg equilibrium control strategies for both defenders and attackers are designed to guarantee the defense mission's success. Then, the effectiveness of the proposed method is validated through numerical simulation.
A novel statistical method using path integral Monte Carlo simulation based on quantum mechanics to detect edges of interested objects was proposed in this paper. Our method was inspired by essential characteristics o...
详细信息
According to the features of mid-wave and long-wave infrared images,they are decomposed into morphology pyramid respectively based on the new multiscale mathematical morphology filters proposed in the *** features suc...
详细信息
According to the features of mid-wave and long-wave infrared images,they are decomposed into morphology pyramid respectively based on the new multiscale mathematical morphology filters proposed in the *** features such as local maximum gray level and average gradient strength of every image are extracted at each level of morphology *** dualband infrared images based on fusion rule put forward in the paper,and then reconstruct original image and detect target using contrast threshold *** experiment results show that dualband infrared images target detection algorithm based on multiscale morphology algorithm is better than use mid-wave or long-wave infrared images detect targets alone.
Patients with limb dysfunction have limited mobility,which prevents them from performing daily *** have developed an assistive robot system with an intuitive head free gaze *** system consists of multiple modules,incl...
详细信息
Patients with limb dysfunction have limited mobility,which prevents them from performing daily *** have developed an assistive robot system with an intuitive head free gaze *** system consists of multiple modules,including 3 D gaze estimation,head free coordinate transformation,intention recognition,and robot trajectory *** robotic assistive system obtains clues from the user’s gaze to decode their intentions and implement *** allows the user only needs to look at the objects to make the robot system reach,grasp,and bring them to the *** 3 D gaze estimation is evaluated with 5 subjects,showing an overall accuracy of 5.53±1.2 *** integrated system’s experimental results show that the success rate is 96% in the implementation of automatic trajectory planning,and the success rate is 92% in the implementation of fixation-based trajectory ***,the results and work required to improve the system are discussed.
This paper proposes a new image denoising method which exploits spatial correlation among image wavelet coefficients and classification technique. By extending the neighbouring threshold of wavelet coefficients for 1D...
详细信息
This paper proposes a new image denoising method which exploits spatial correlation among image wavelet coefficients and classification technique. By extending the neighbouring threshold of wavelet coefficients for 1D signal to 2D image case, each coefficient in a subband is classified as "large" or "small" category, according to its corresponding neighbouring threshold. Different strategies are implemented to the classified coefficients. Simulation results show that although very simple, the performance of the proposed method can be competitive to the two excellent state of the art denoising algorithms with spatial adaptivity
This paper focuses on route planning, especially for unmanned aircrafts in marine environment. Firstly, new heuristic information is adopted such as threat-zone, turn maneuver and forbid-zone based on voyage heuristic...
详细信息
This paper focuses on route planning, especially for unmanned aircrafts in marine environment. Firstly, new heuristic information is adopted such as threat-zone, turn maneuver and forbid-zone based on voyage heuristic information. Then, the cost function is normalized to obtain more flexible and reasonable routes. Finally, an improved sparse A* search algorithm is employed to enhance the planning efficiency and reduce the planning time. Experiment results showed that the improved algorithm for aircraft in maritime environment could find a combinational optimum route quickly, which detoured threat-zones, with fewer turn maneuver, totally avoiding forbid-zones, and shorter voyage.
The piezoelectric actuator is one kind of device that can drive nanoscale motion. However, the nonlinear hysteresis effect induced by its natural material greatly degrades its positioning accuracy. To handle this chal...
The piezoelectric actuator is one kind of device that can drive nanoscale motion. However, the nonlinear hysteresis effect induced by its natural material greatly degrades its positioning accuracy. To handle this challenging issue, this work develops a Koopman model predict control (Koopman- MPC) framework for the piezoelectric actuator. Specifically, the Koopman operator theory is adapted for modeling the piezoelectric actuator dynamics. A simple yet powerful linear model spanned in a high-dimensional space is thus constructed to characterize the hysteresis dynamics. Subsequently, upon the established Koopman model, an MPC scheme is put forward for tracking control of piezoelectric actuators. Therein, by sustained optimizing a cost function containing future outputs and control increments, the control input is obtained. Moreover, extensive tracking simulations are carried out on a simulated piezoelectric actuator for verifying the feasibility and effectiveness of the Koopman- Mpc scheme.
Deep perception of the unmanned surface vehicle's surroundings is an inaccessible part of its fully autonomous navigation mission. The existing methods, whether based on traditional stereo matching or deep learnin...
Deep perception of the unmanned surface vehicle's surroundings is an inaccessible part of its fully autonomous navigation mission. The existing methods, whether based on traditional stereo matching or deep learning, do not fully consider the characteristics of water environment, resulting in severe error depths in weak textures (sky, calm lake) and water reflections regions, that increases the risk of running aground or collision. What is worse that there is not a public dataset for depth estimation in the water environment. Therefore, this work proposes a self-supervised model for depth estimation named Water Depth Perception Network (WDNet) to address these problems. The decoder of this network has a wider receptive field and can effectively handle the depth error in the weak texture region. Besides, the WDNet is trained with a novel and effective loss function which assist the network to reduce errors in sky and water region, and some indexes are proposed to evaluate the model's performances in sky and water region. Finally, our proposed WDNet achieves a 0.1056 absolute relative error in ranging, the average number of error pixels in the sky area drops from 15803.87 to 580.91, which only accounted for 0.29% of the image, and the error in water region drops from 51.04 to 6.75, all of them are superior to the performance of baseline model.
This paper solves USV path planning problem constrained by multiple factors via ant-colony optimization algorithm. First, this paper uses the ways of multi-objective optimization to model the USV path planning problem...
This paper solves USV path planning problem constrained by multiple factors via ant-colony optimization algorithm. First, this paper uses the ways of multi-objective optimization to model the USV path planning problem. An improved ant colony algorithm named ACO-SA is put forward afterwards to effectively solve the problem. The algorithm is a combination of ACO algorithm(ant colony algorithm) and SA algorithm(simulated annealing algorithm), which has three improments: change the initial distribution of pheromone to guide the search when the algorithm has just started running; change the heuristic function and state transition probability taking three factors into consideration; change the pheromone update rule and make the ants compete for the right to update pheromone by simulated annealing algorithm, and update the best solution by the same algorithm. Finally, simulation experiment and field experiment are conducted to check the validity of ACO-SA algorithm.
There are always some “key” nodes in a big complex network, which can joint the most connected subgraphs. How to identify these nodes, finding a minimum set of nodes to attack for reducing the size of residual netwo...
There are always some “key” nodes in a big complex network, which can joint the most connected subgraphs. How to identify these nodes, finding a minimum set of nodes to attack for reducing the size of residual network's Largest Connected Component(LCC) to break up the original network, has become a research hotspot. Therefore, a method for determining the “key” nodes based on reinforcement learning framework and supervised learning model is proposed. This algorithm can not only utilize the dynamic exploration ability of reinforcement learning to collect a rich training dataset, but also take advantage of the characteristics that supervised learning is adaptive and has strong generalization ability to possess high efficiency and strong robustness. In order to further improve the algorithm's performance, $\epsilon$ -greedy mechanism is used to explore more network states. The experiment results show that given the same fraction of removed nodes, our algorithm can make the residual LCC smaller in various networks which is superior to the state-of-the-art algorithms in terms of effectiveness and generalization.
暂无评论