In this paper, an improved formulation of optimal guidance law (OGL) based on genetic algorithms (GAs) is proposed. Linear quadratic optimal control theory is derived to consider terminal velocity maximisation, also G...
详细信息
Real-world optimization involving multiple objectives in changing environment known as dynamic multi-objective optimization (DMO) is a challenging task, especially special regions are preferred by decision maker (DM)....
详细信息
ISBN:
(纸本)9781450300728
Real-world optimization involving multiple objectives in changing environment known as dynamic multi-objective optimization (DMO) is a challenging task, especially special regions are preferred by decision maker (DM). Based on a novel preference dominance concept called sphere-dominance and the theory of artificial immune system. (AIS), a sphere-dominance preference immune-inspired algorithm (SPIA) is proposed for DMO in this paper. The main contributions of SPIA are its preference mechanism and its sampling study, which are based on the novel spheredominance and probability statistics, respectively. Besides, SPIA introduces two hypermutation strategies based on history information and Gaussian mutation, respectively. In each generation, which way to do hypermutation is automatically determined by a sampling study for accelerating the search process. Furthermore, The interactive scheme of SPIA enables DM to include his/her preference without modifying the main structure of the algorithm. The results show that SPIA can obtain a well distributed solution set efficiently converging into the DM's preferred region for DMO. Copyright 2010 ACM.
For given graphs G1,G2, the 2-color Ramsey number R(G1,G2) is defined to be the least positive integer n such that every 2-coloring of the edges of complete graph Kn contains a copy of G1 colored with the first color ...
详细信息
For given graphs G1,G2, the 2-color Ramsey number R(G1,G2) is defined to be the least positive integer n such that every 2-coloring of the edges of complete graph Kn contains a copy of G1 colored with the first color or a copy of G2 colored with the second color. In this note, we obtained some new exact values of generalized Ramsey numbers such as cycle versus book, book versus book, complete bipartite graph versus complete bipartite graph.
The Ramsey multiplicity M(G) of a graph G is defined to be the smallest number of monochromatic copies of G in any two-coloring of edges of K R(G), where R(G) is the smallest integer n such that every graph on n verti...
详细信息
The Ramsey multiplicity M(G) of a graph G is defined to be the smallest number of monochromatic copies of G in any two-coloring of edges of K R(G), where R(G) is the smallest integer n such that every graph on n vertices either contains G or its complement contains G. With the help of computer algorithms, we obtain the exact values of Ramsey multiplicities for most of isolate-free graphs on five vertices, and establish upper bounds for a few others.
Roadmap methods were widely used in route planning fields, both for robots and unmanned aircrafts. Traditional roadmap is constituted by connecting the vertexes of convex obstacle, which is related to the locations of...
详细信息
The look-ahead is a forbidding condition formalized by a set of forbidden rules that are checked after all assignment of objects to rules are done. The look-ahead mode can decrease the inherent non-determinism of P sy...
详细信息
The look-ahead is a forbidding condition formalized by a set of forbidden rules that are checked after all assignment of objects to rules are done. The look-ahead mode can decrease the inherent non-determinism of P systems and helps to the practical implementation of P systems on computers. In this work, the computational power of P systems with symport/antiport rules working in the look-ahead mode are investigated. Communication P systems with 3 membranes and the weight of symport and antiport rules being 2 and 1, respectively, working in the look-ahead mode, can recognize any recursively enumerable languages; a characterization of context-sensitive languages is obtained by communication P systems with 2 membranes working in the look-ahead mode.
An upper limb robotic exoskeleton of three degrees of freedom (DOF) is designed for the patients who survived stroke and the elderly who have not enough strength to move their limbs freely. Particular attention is pai...
详细信息
An upper limb robotic exoskeleton of three degrees of freedom (DOF) is designed for the patients who survived stroke and the elderly who have not enough strength to move their limbs freely. Particular attention is paid to the realization of a intention-driven robotic control approach, by which the robotic exoskeleton can assist the user moving his/her arm freely to where he/she intends to go. A force sensing system made of multiple force sensing resisters (FSRs) is embedded in the robotic exoskeleton. A static force model of the upper limb in a relaxed state is obtained when the user wears the exoskeleton. A hybrid model is proposed to describe the behavior modes of human upper limb motion. Filtering technology is designed to infer the intended moving direction of upper limb based on the measured force information and the static force model. The motion intention of user's upper limb can be online estimated using the filter and a mode transition detector. Guided by the inferred intention, an admittance control strategy is assumed to control the motors of each DOF. The effectiveness of proposed robotic system and control approaches is evaluated by experiments.
This paper deals with anisotropic diffusion in image affected by speckle. The classical SRAD can remove speckle efficiently, but blur the low-contrast edges. To solve this problem, a low-contrast edge enhancement meth...
详细信息
In this paper, we propose a novel unsupervised evolutionary clustering algorithm for mixed type data, evolutionary k-prototype algorithm (EKP). As a partitional clustering algorithm, k-prototype (KP) algorithm is a we...
详细信息
In this paper, we propose a novel unsupervised evolutionary clustering algorithm for mixed type data, evolutionary k-prototype algorithm (EKP). As a partitional clustering algorithm, k-prototype (KP) algorithm is a well-known one for mixed type data. However, it is sensitive to initialization and converges to local optimum easily. Global searching ability is one of the most important advantages of evolutionary algorithm (EA), so an EA framework is introduced to help KP overcome its flaws. In this study, KP is applied as a local search strategy, and runs under the control of the EA framework. Experiments on synthetic and real-life datasets show that EKP is more robust and generates much better results than KP for mixed type data.
In this paper, a novel constrained multiobjective immune algorithm for optimizing detector distribution in V-detector negative selection is proposed. The theory of artificial immune system (AIS) and the spirit of popu...
详细信息
In this paper, a novel constrained multiobjective immune algorithm for optimizing detector distribution in V-detector negative selection is proposed. The theory of artificial immune system (AIS) and the spirit of population evolution are introduced to generate detectors. By combining the constraint handling technique and AIS-based multiobjective optimization, the algorithm is able to steadily maximize the anomaly coverage with little extra cost, which means the distribution with maximized coverage of the non-self space and minimized overlapping among detectors with fixed size will be well realized. Furthermore, the new approach is tested on some benchmark problems. The experimental results show that compared with some state-of-the-art methods, our algorithm can remarkably outperform them in terms of enhancing the detection rate by optimizing distribution without increasing the number of detectors.
暂无评论