This paper is about dynamic obstacle avoidance. Delaunay Graph is used for modeling the working space, an approximate shortest path of mobile robot is determined by using floyd algorithm. Path can be found easily with...
详细信息
ISBN:
(纸本)9783037850756
This paper is about dynamic obstacle avoidance. Delaunay Graph is used for modeling the working space, an approximate shortest path of mobile robot is determined by using floyd algorithm. Path can be found easily with genetic algorithm. Then genetic algorithm is used for obtaining the optimum path. It may meet which dynamic obstacle when robot follows optimum path. so it should avoid it. Results of simulation show that this path planning method is simple and realized easily.
A novel path planning approach based on floyd algorithm for Intelligence Transportation System (ITS) is presented in this paper. For the route net can be converted into a topology, the optima path in the route net of ...
详细信息
ISBN:
(纸本)9781424410910
A novel path planning approach based on floyd algorithm for Intelligence Transportation System (ITS) is presented in this paper. For the route net can be converted into a topology, the optima path in the route net of transportation system can be treated as the shortest path in a topology as well. So floyd algorithm, which solves the shortest path in topology perfectly., is developed to solve the optima route. And the globally optimal solution for ITS is obtained.
This paper is about dynamic obstacle avoidance. Delaunay Graph is used for modeling the working space, an approximate shortest path of mobile robot is determined by using floyd algorithm. Path can be found easily with...
详细信息
This paper is about dynamic obstacle avoidance. Delaunay Graph is used for modeling the working space, an approximate shortest path of mobile robot is determined by using floyd algorithm. Path can be found easily with genetic algorithm. Then genetic algorithm is used for obtaining the optimum path. It may meet which dynamic obstacle when robot follows optimum path. so it should avoid it. Results of simulation show that this path planning method is simple and realized easily.
This paper presents an optimization approach to the problem of marine cargo in the Aegean, using the Simulated Annealing algorithm. Our main target is minimizing the total crossing costs of thirteen harbors in the Aeg...
详细信息
This paper presents an optimization approach to the problem of marine cargo in the Aegean, using the Simulated Annealing algorithm. Our main target is minimizing the total crossing costs of thirteen harbors in the Aegean, when a ship can visit a harbor exactly once, with regard to the total cost of fuel and port fees. Our method utilizes floyds algorithm in order to determine the minimum distances and then apply the Simulated Annealing algorithm to the hard combinatorial problem.
On the basis of floyd algorithm with the extended path matrix, a parallel algorithm which resolves all-pair shortest path （APSP） problem on cluster environment is analyzed and designed. Meanwhile, the parallel APSP ...
详细信息
On the basis of floyd algorithm with the extended path matrix, a parallel algorithm which resolves all-pair shortest path （APSP） problem on cluster environment is analyzed and designed. Meanwhile, the parallel APSP pipelining algorithm makes full use of overlapping technique between computation and communication. Compared with broadcast operation, the parallel algorithm reduces communication cost. This algorithm has been implemented on MPI on PC-cluster. The theoretical analysis and experimental results show that the parallel algorithm is an efficient and scalable algorithm.
With the rapid development of the robot technology, the autonomous conveying robot has been widely applied in the industrial and serving fields. Thus, looking for a kind time and space efficient algorithm and then pla...
详细信息
ISBN:
(纸本)7506278413
With the rapid development of the robot technology, the autonomous conveying robot has been widely applied in the industrial and serving fields. Thus, looking for a kind time and space efficient algorithm and then planning an optimal conveying path for the ACR is important to the actual application. The concept, application and path planning problems of autonomous conveying robot are generalized, and its mathematic model is also introduced. Besides, it is transformed to TSP problem and simulated annealing algorithm is adopted to get the optimal path. Moreover, some strategies are used to modify the standard SA algorithm and the converging speed is improved. A good conveying path planning example is given. Simulation results show that the proposed method is an effective approach to solve this problem and the operating efficiency is greatly improved.
Since the delivery is the key point of logistics, shortest path decision is essential for the efficiency of delivery. Classical Dijkstar algorithm and floyd algorithm are analyzed from the point of view of Graph Theor...
详细信息
Since the delivery is the key point of logistics, shortest path decision is essential for the efficiency of delivery. Classical Dijkstar algorithm and floyd algorithm are analyzed from the point of view of Graph Theory. It points out these two algorithms deficiencies such as: Dijkstar algorithm efficiency will drop fast with the number of delivery point increasing, floyd algorithm mainly solves the direction graph problem and not fit for non-direction graph problem. Then some improvement methods are brought forward such as: for Dijkstar algorithm, the whole graph is divided into some child graph and then it will increase the efficiency, for floyd algorithm, the abut matrix is modified to an equal matrix and then it solves non-direction graph problem based on floyd algorithm. Finally, an example of logistics delivery route optimization based on floyd algorithm is given.
With the rapid development of the robot technology, the autonomous conveying robot has been widely applied in the industrial and serving fields. Thus, looking for a kind time and space efficient algorithm and then pla...
详细信息
With the rapid development of the robot technology, the autonomous conveying robot has been widely applied in the industrial and serving fields. Thus, looking for a kind time and space efficient algorithm and then planning an optimal conveying path for the ACR is important to the actual application. The concept, application and path planning problems of autonomous conveying robot are generalized, and its mathematic model is also introduced. Besides, it is transformed to TSP problem and simulated annealing algorithm is adopted to get the optimal path. Moreover, some strategies are used to modify the standard SA algorithm and the converging speed is improved. A good conveying path planning example is given. Simulation results show that the proposed method is an effective approach to solve this problem and the operating efficiency is greatly improved.
暂无评论