This paper proposes a new method of robot path rolling planning based on automatic shunt ant algorithm. When a node is selected by multiple ants, later ants choose other paths to realize automatic shunting, thereby ex...
详细信息
ISBN:
(纸本)9781510642782;9781510642775
This paper proposes a new method of robot path rolling planning based on automatic shunt ant algorithm. When a node is selected by multiple ants, later ants choose other paths to realize automatic shunting, thereby expanding the search range, enhancing the search diversity, and helping to obtain the optimal solution. The overall idea of the algorithm in this paper is to map the target point near the inner boundary of the robot's field of view, and use the new algorithm to plan the local optimal path of the robot, and the robot will move forward according to this local path. The robot repeats the process every time it advances, and reaches the end safely along a globally optimized path. Simulation experiments show that even in a complex unknown static environment, the algorithm in this paper can also be used to plan a global optimization path.
The set coverings problem using mathematical methods in which principles of natural mechanisms of solution-making are proposed. For compact representation of the set covering solution the matrix of boundary requiremen...
详细信息
ISBN:
(纸本)9781479976300
The set coverings problem using mathematical methods in which principles of natural mechanisms of solution-making are proposed. For compact representation of the set covering solution the matrix of boundary requirements is used. This allowed forming the space of solutions in which frameworks the search process which is based on simulation of adaptive ant colony behavior is organized. In comparison with existing algorithms improvement of results is reached.
The basic ant optimization algorithm is improved by introducing ant colony scatterance and discrete search. In order to solve the optimization problem with mixed-discrete variables, a program of ant algorithm is desig...
详细信息
ISBN:
(纸本)9780769538044
The basic ant optimization algorithm is improved by introducing ant colony scatterance and discrete search. In order to solve the optimization problem with mixed-discrete variables, a program of ant algorithm is designed by using MATLAB. Based on the introduce of support vector regression (SVR) which is used to compute the values of nonlinear functions such as fuzzy probability, the computational efficiency of robust design optimization is distinctly improved. An example of robust design optimization with mixed-discrete variables is presented, and it shows that the proposed method is effective in engineering application.
Finding the optimum path or routing always is an important and difficult issue in a practical dynamic network. In this paper, a new routing approach that due to multiple requirements in the reconfigurable network is b...
详细信息
ISBN:
(纸本)9781424423101
Finding the optimum path or routing always is an important and difficult issue in a practical dynamic network. In this paper, a new routing approach that due to multiple requirements in the reconfigurable network is briefly discussed. In order to obtain the optimum path between two nodes, we use the ant algorithm with which the problem can be attached to select the path. Simulation results shows that, especially having considered two factors of cost and delay, the proposed approach can be used to search the routing efficiently by the available nodes and paths provided with the reconstructed network topology even if the network changed.
Rapid resource discovery in P2P networks is a challenging problem because users search for different resources at different times, and, nodes and their resources can vary dynamically as nodes join and leave the networ...
详细信息
ISBN:
(纸本)3540297553
Rapid resource discovery in P2P networks is a challenging problem because users search for different resources at different times, and, nodes and their resources can vary dynamically as nodes join and leave the network. Traditional resource discovery techniques such as flooding generate enormous amounts of traffic, while improved P2P resource discovery mechanisms such as distributed hash tables(DHT) introduce additional overhead for maintaining content hashes on different nodes. In contrast, self-adaptive systems such as ant algorithms provide a suitable paradigm for controlled dissemination of P2P query messages. In this paper, we describe an evolutionary ant algorithm for rapidly discovering resources in a P2P network.
In an ever increasingly competitive market environment, virtual enterprise has been gradually becoming a main corporate operating model. More and more enterprises are beginning to form virtual enterprises with other f...
详细信息
ISBN:
(纸本)9781424413119
In an ever increasingly competitive market environment, virtual enterprise has been gradually becoming a main corporate operating model. More and more enterprises are beginning to form virtual enterprises with other firms. In this way they can also take on the investment risks together. Information system is the very foundation for the virtual enterprises to achieve a highly effective operation, member selecting is the important function of many information systems of virtual enterprise. But presently the related technology concerning the virtual enterprise information system cannot satisfy the needs of the users. This paper researches the member selecting of virtual enterprise, puts forward a selecting method of virtual enterprise group members based upon the ant algorithm, which can be used to deal with the issue of selecting virtual enterprise group members under the condition of multi optimization objects. Then it presents the realization steps of the algorithm and examines some real cases.
A mobile ad hoc network (MANET) is a wireless network with high of mobility, no fixed infrastructure and no central administration. These characteristics make MANET more vulnerable to attack. In ad hoc network, active...
详细信息
ISBN:
(纸本)9781479920037
A mobile ad hoc network (MANET) is a wireless network with high of mobility, no fixed infrastructure and no central administration. These characteristics make MANET more vulnerable to attack. In ad hoc network, active attack i.e. DOS, and blackhole attack can easily occur. These attacks could decrease the performance of the routing protocol. We have proposed a new trust mechanism to secure the AODV routing protocol called Trust AODV. In this paper, we improve the performance of our proposed secure protocol by using an ant algorithm. ant agent put a positive pheromone when the node is trusted. Path communication is chosen based on pheromone value. We evaluate and compare the performance of proposed protocol before and after using ant algorithm under DOS/DDOS attack. The simulation result shows the performance of proposed protocol increases while using ant algorithm in term of packet delivery ratio and throughput. However, in term of end-to-end delay there is no significant effect to the performance.
we presents a new algorithm for urban power system planning. The new algorithm combines an improved ant algorithm with ecological theory and transforms the urban power system-planning problem into an ecosystem optimiz...
详细信息
ISBN:
(纸本)9780769538167
we presents a new algorithm for urban power system planning. The new algorithm combines an improved ant algorithm with ecological theory and transforms the urban power system-planning problem into an ecosystem optimization problem. The substation is regarded as an ant nest and the load point is regarded as food in the algorithm presented in this paper. It can simultaneously optimize the substation's size, position, service region and the structure of power network by imitating ecosystem evolvement. The result of calculation shows that the structure of power network is radial, and needs no inspection. Therefore it is easier to be programmed. An example shows that the algorithm is efficient.
ant algorithm is an optimization algorithm that gained by observing the real ant colonies, and it is very useful in solving difficult optimization problems and distributed control problems. The algorithm is modeled on...
详细信息
ISBN:
(纸本)0780379144
ant algorithm is an optimization algorithm that gained by observing the real ant colonies, and it is very useful in solving difficult optimization problems and distributed control problems. The algorithm is modeled on a key concept called "stigmergy" of the ant societies, which is used in our algorithm to design the cooperation of multi-robots. In an unknown environment, one of the most important problems to the multi-robot system is to decide a task be completed by how many robots. With the concept "stigmergy", the number of the robots cooperating on a task is decided according to the difficulty of the task Given the definition of the "Task Deadlock", an adaptive attenuation factor to eliminate task deadlock is introduced in the cooperation algorithm. Simulations show the effectiveness of the algorithm.
An undirected graph can demonstrate adjacency relationships among regions in a planar map, and the four-coloring map problem is then converted into a graph vertex coloring problem with constraints. In order to solve t...
详细信息
ISBN:
(纸本)9781467347143
An undirected graph can demonstrate adjacency relationships among regions in a planar map, and the four-coloring map problem is then converted into a graph vertex coloring problem with constraints. In order to solve the graph vertex coloring problem, an ant algorithm hybridized with a greedy algorithm was proposed. In this algorithm, ants in an ant colony with a given size separately move from one vertex to another according to their transition probability, and a greedy algorithm is used to initialize the proposed algorithm for improving its efficiency. Finally, the improved algorithm was tested by coloring the administrative map of Hunan Province, China, and results show that it is good at finding the optimal value, speed and stability.
暂无评论