The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This article proposes two control strategies to track a desired altitude of an Unmanned Aircraft System (UAS). These strategies are a Super-Twisting Sliding Mode Controller (Super Twisting-SMC) and a Modified Super-Twisting Sliding Mode Controller (Modified Super Twisting-SMC), both controllers are robusts and present a satisfactory effectiveness even under external disturbances. The Lyapunov Stability...
In order to overcome the premature convergence problem of clonal selection algorithm (CSA), a hybrid quantum crossover is proposed to improve the performance of CSA. The hybrid crossover is composed of two crossovers and well balance the exploration and exploitation search during immune maturation process. The effectiveness of the new crossover based CSA is evaluated on a class of traveling salesman...
An adaptive ant colony algorithm is proposed to overcome the premature convergence problem in the conventional ant colony algorithm. The adaptive ant colony is composed of three groups of ants: ordinary ants, abnormal ants and random ants. Each ordinary ant searches the path with the high concentration pheromone at the high probability, each abnormal ant searches the path with the high concentration...
An improved ant colony algorithm is proposed in this paper for Traveling Salesman Problems (TSPs). In the process of searching, the ants are more sensitive to the optimal path because the inverse of distance among cities is chosen as the heuristic information, while a candidate list is used to limit the number of candidate city. The method of local and global dynamic phenomenon update is used in order...
The maximum flow problem is one of the classical combinatorial optimization problems. Most of the traditional maximum flow problems are based on "Augmented chain theorem". According to the characteristics of ant system algorithm, we transform the maximum flow problem correspondingly, and then we utilize the ant system algorithm to resolve the problem. In this paper we use ant system algorithm...
Peer-to-Peer (P2P) reputation aggregation methods are used to evaluate the trustworthiness of participating peers and to combat dishonest and malicious peer behaviors. The reputation aggregation method is to calculate the global reputation score from local score gained from each individual peer in P2P networks. On unstructured P2P networks, each individual peer exchanges own local score for other's...
In this paper, we study the evolution of industrial clusters around cities under different cities' industry development policies. Companies in different industries are considered as agents. Techniques of multi-agent systems are used to investigate the relationships between two companies, companies and cities. Theoretical convergence analysis as well as simulation results are presented. The work can...
As a new model of intelligent computing, ant colony optimization (ACO) is a great success on combinatorial optimization problems, however, but research is relatively less in solving problems on continuous space optimization. Based on the mechanism and mathematical model of ant colony algorithm, mutation operation is introduced. The global and local updating rules of ant colony algorithm are improved...
Multiple traveling salesman problem, which uses the shortest total route as an optimization criteria, has huge application in both theoretical research and industry. This paper presents an improved genetic algorithm to provide an alternative and effective solution to the problem. The initial population was generated by greedy strategy, this enabled selected sub-route to be included in the initial...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.