This paper introduces an optimal algorithm through analyzing and studying various algorithms used in DARPA Urban Challenge 2007 and making a numerical statement about each algorithm. The top eleven teams that passed t...
详细信息
ISBN:
(纸本)9788995003893
This paper introduces an optimal algorithm through analyzing and studying various algorithms used in DARPA Urban Challenge 2007 and making a numerical statement about each algorithm. The top eleven teams that passed the NQE (National Qualifying Event) used dijkstra, A*, RRTs, and D*. Therefore, this research will focus on those algorithms and study a method to apply an optimal algorithm.
The tender algorithm is one of the most commonly used algorithms in the distributed system resources management. The calculation of marked price has neglected the key consumption of sites and the reliability is low. T...
详细信息
ISBN:
(纸本)9781424440993
The tender algorithm is one of the most commonly used algorithms in the distributed system resources management. The calculation of marked price has neglected the key consumption of sites and the reliability is low. Through the improved algorithm, the introduction of resources coordinator and the adoption of dijkstra algorithm, the marked price can be calculated precisely. Then the improved tender algorithm greatly enhanced the performance and reliability of the distributed system.
In the research of wireless sensor networks, current location estimation techniques can generally be divided into direct approach and inferred approach, but their algorithms are too complicated to be used in practice....
详细信息
ISBN:
(纸本)9781424417186
In the research of wireless sensor networks, current location estimation techniques can generally be divided into direct approach and inferred approach, but their algorithms are too complicated to be used in practice. On the basis of the grid-based location estimation scheme (GLS), this paper represents a based on Euclidean distance distributed grid location estimation scheme (EDGLS), which seeks to predict the location of sensor nodes with respect to rectangular grid positions within the network area by using the hop counts these nodes are away from a number of fixed, known markers, and can save a great deal of energy in the whole network. Through the simulation on MATLAB, the results show that the location of EDGLS is more accurate and robust than that of GLS.
A novel Creed-backtracking algorithm (***) for the shortest path problem is proposed in this paper. Beginning with triples storage structure to save the data of a weighted directed graph, this paper lays emphasis on a...
详细信息
ISBN:
(纸本)9781424421138
A novel Creed-backtracking algorithm (***) for the shortest path problem is proposed in this paper. Beginning with triples storage structure to save the data of a weighted directed graph, this paper lays emphasis on a series of greedy strategies and the GBA implementation, there follows the realization of the GBA with Java. In the end, satisfied results are obtained when we applied the GBA to one of lite social development projects. Compared with the dijkstra algorithm, to solve the shortest path between any, two points in graph, the average time efficiency of the GBA is increased by 75%.
This paper presents a novel particle swarm optimization algorithm which can be used in the field of path planning for mobile robot. The first step to establish the MAKLINK graph with the work space model of the mobile...
详细信息
ISBN:
(纸本)9781424417339
This paper presents a novel particle swarm optimization algorithm which can be used in the field of path planning for mobile robot. The first step to establish the MAKLINK graph with the work space model of the mobile robot, using the dijkstra algorithm obtained the shortest path from the start point to the goal point in the graph;then the improved algorithm of particle swarm optimization is adopted to optimize this path. The algorithm is a probability search method, which is characterized by its parallel and distributed features. Simulation results show that the proposed method is effective and can meet the demands of global path planning.
The telecom industry is a typical data denseness *** Mining technology could offer decision making support for the telecom merchants'next scheme. This paper is about the key problems of the data mining application...
详细信息
The telecom industry is a typical data denseness *** Mining technology could offer decision making support for the telecom merchants'next scheme. This paper is about the key problems of the data mining application in the fiber network and the methods of *** will explain it through two examples, the one is to use the algorithrn of related regulation excavation to analyze the telecom alarm *** practical work,it will help the telecom administration department to make prognostic alarm and deal with the obstacles rapidly,the another one is to use the most common used dijkstra algorithm in shortcut algorithm about the single source point to analyze the problem of the random two nodes'shortest path in fiber network, and draw the flow chart of the algorithm's implement.
Reconfiguration of unmanned-aerial-vehicle(UAV) formation is one of most important step in field operation of UAV systems. Guidance law for reconfiguration of UAV is needed to satisfy requirements of optimality and co...
详细信息
ISBN:
(纸本)9784907764289
Reconfiguration of unmanned-aerial-vehicle(UAV) formation is one of most important step in field operation of UAV systems. Guidance law for reconfiguration of UAV is needed to satisfy requirements of optimality and constraints of short computational time. This paper describes rules of dijkstra algorithm based on the optimal trajectories. Calculation results show that the proposed algorithm provides almost mean value of optimal trajectory. The algorithm is useful to generate reference trajectory for minimum time rconfiguration of UAV formation.
dijkstra algorithm is regarded as the most classical method to settle the shortest path problem. But its ability would be not equal to case where subtractive-weight exists. This thesis raises an improved algorithm bas...
详细信息
ISBN:
(纸本)9781424413119
dijkstra algorithm is regarded as the most classical method to settle the shortest path problem. But its ability would be not equal to case where subtractive-weight exists. This thesis raises an improved algorithm based on dijkstra, but treats P-sign as an alterable sign as T-sign. The algorithm can commendably achieve the calculation assignment, but not form subtractive cycles or zero cycles in graph. It is based on tableau method to make the graph cleaner than graphic method, and calculate subtractive weight problems more effectively.
The dynamic vehicle routing problem is one of the most challenging combinatorial optimization tasks. The interest in this problem is motivated by its practical relevance as well as by its considerable difficulty. We p...
详细信息
ISBN:
(纸本)9783540725893
The dynamic vehicle routing problem is one of the most challenging combinatorial optimization tasks. The interest in this problem is motivated by its practical relevance as well as by its considerable difficulty. We present an approach to search for best routes in dynamic network. We propose a dynamic route evaluation model for modeling the responses of vehicles to changing traffic information, a modified dijkstra's double bucket algorithm for finding the real-time shortest paths, and an improved evolutionary algorithm for searching the best vehicle routes in dynamic network. The proposed approach has been evaluated by simulation experiment using DVRPSIM. It has been found that the proposed approach quite efficient in finding real-time best vehicle routes where the customer nodes and network information changes dynamically.
Modelling of the physical layer is an important factor in ad hoc wireless networks simulation. Thus, the aim of this study is to investigate a realistic physical layer simulator. More precisely, this last one is able ...
详细信息
ISBN:
(纸本)9781424411771
Modelling of the physical layer is an important factor in ad hoc wireless networks simulation. Thus, the aim of this study is to investigate a realistic physical layer simulator. More precisely, this last one is able to quantify each radio link by various physical layer criteria, thanks to a propagation model, and after compute the optimal route between a source and a destination by using the dijkstra algorithm.
暂无评论