Aiming at the problems of low efficiency, high labor cost, and high drug harm in the traditional manual spraying method in orchard planting, an autonomous spraying robot for orchard was designed to replace manual pest...
详细信息
ISBN:
(纸本)9781450376457
Aiming at the problems of low efficiency, high labor cost, and high drug harm in the traditional manual spraying method in orchard planting, an autonomous spraying robot for orchard was designed to replace manual pesticide spraying. In order to solve the problem of path planning for orchard spraying robots, the traditional RRT algorithm has the disadvantages of poor target, strong randomness, and the planned path is not necessarily the optimal path in the search path process. With the help of the optimization ability of dijkstra algorithm, a method is proposed. An orchard spraying robot path optimization method based on improved RRT algorithm. In order to verify the feasibility and effectiveness of the improved RRT algorithm in the path planning application of the orchard spraying robot, the MATLAB platform is used for simulation analysis, and the traditional RRT algorithm is compared with the improved RRT algorithm. The simulation experiment results show that: compared with the traditional RRT algorithm, the improved RRT path planning algorithm's optimization ability and convergence performance have been significantly improved, the planned path length is shortened by 10%, the number of nodes is reduced by nearly 86%, and the path is improved. The ability to find the best, reduce the degree of tortuous path, help reduce the energy loss of agricultural spraying robots in the working process, and effectively solve the path planning problem of orchard spraying robots, making it safer and more efficient to avoid obstacles to achieve autonomy Spraying task.
Generator start-up sequence is critical to power system restoration. A new algorithm to optimize the start-up sequence of generators based on dijkstra method is proposed in this paper. First, a combined weight is prop...
详细信息
ISBN:
(纸本)9781479913022
Generator start-up sequence is critical to power system restoration. A new algorithm to optimize the start-up sequence of generators based on dijkstra method is proposed in this paper. First, a combined weight is proposed for the dijkstra method to balance various optimization objects. Based on the modified weights, a priority index considering the branch weight, generator start-up requirement and ramping rate is proposed to optimize the generator start-up sequence. Second, we analyze the backtracking algorithm in detail and found its limitation and disadvantages, which leads a large amount of calculation and start-up failure. A new algorithm to calculate the start-up sequence is proposed. It can avoid the repetition calculation of dijkstra and reduce the computation cost by avoiding backtracking. Finally, the IEEE 30-Bus system and Guangdong power grid system are used to validate the proposed algorithm. Simulation results show that the proposed method is efficiency and it can decrease the restoration time significantly.
Due to many factors,vegetable transportation scheme decision is more complicated,thus we put forward a reasonable and practical meaningful vegetables transport model that has considerable practical *** on the rational...
详细信息
ISBN:
(纸本)9781510811980
Due to many factors,vegetable transportation scheme decision is more complicated,thus we put forward a reasonable and practical meaningful vegetables transport model that has considerable practical *** on the rationality and feasibility of transportation scheme,and the limitation of vegetables supply and demand,we establish the linear programming model,and do AMPL procedure of the *** calculate the data of vegetables transportation about the city of planting base as an example,the solving speed and the results show the rationality of the model.
optimization design of Water supply network is based on alignment. This research is done by analysis of cost per water quantity of cubic meter for supplying, and takes expenses as weights of pipe *** is designed accor...
详细信息
optimization design of Water supply network is based on alignment. This research is done by analysis of cost per water quantity of cubic meter for supplying, and takes expenses as weights of pipe *** is designed according to dijkstra's algorithm, and the scheme which cost least is chosen at this section, so it can get the optimization quickly.
As the basic theory of shortest path calculation, dijkstra algorithm is widely used in various aspects, such as: transportation, construction of signal station, laying of high-speed rail. Based on graph theory, this p...
详细信息
As the basic theory of shortest path calculation, dijkstra algorithm is widely used in various aspects, such as: transportation, construction of signal station, laying of high-speed rail. Based on graph theory, this paper studies dijkstra algorithm to analyze network communication problems, introduces the principle of dijkstra algorithm in detail, and makes a contribution to the research of shortest path.
People are considered as important resources nowadays. When we are caught in some problem, how to find a direct or indirect friend, who is professional in the specific field, to help us is the key point. The popularit...
详细信息
People are considered as important resources nowadays. When we are caught in some problem, how to find a direct or indirect friend, who is professional in the specific field, to help us is the key point. The popularity of social network provides a great platform for the solution of the problem through computer automation. dijkstra is a classical algorithm for searching the shortest path between two nodes. However, the time complexity is enormous, especially when the network is complex like social networks. A novel algorithm is proposed in the paper for improving the situation. The weight used in the novel algorithm is decided by three-dimensional factors while the dijkstra algorithm only involves the one for edges in a graph. And we validate that comparing to dijkstra it is more efficient in both theory and experiment.
Route selection for dangerous goods transportation is a hot issue which involved in much uncertainty,fuzziness and *** this paper,D numbers theory is used in the route selection for dangerous goods to deal with these ...
详细信息
ISBN:
(纸本)9781467397155
Route selection for dangerous goods transportation is a hot issue which involved in much uncertainty,fuzziness and *** this paper,D numbers theory is used in the route selection for dangerous goods to deal with these information,both complete and incomplete,qualitative and *** three main criteria "transportation cost","risk during the transportation" and "emergency response ability" are considered to evaluate the routes and dijkstra algorithm is used to find out the optional *** illustrative example is presented to demonstrate the effectiveness of the proposed method.
The shortest path analysis is the most basic function of GIS network *** algorithm is widely recognized as a good shortest path *** this paper, to save storage space and improve computational speed departure, based on...
详细信息
The shortest path analysis is the most basic function of GIS network *** algorithm is widely recognized as a good shortest path *** this paper, to save storage space and improve computational speed departure, based on the dijkstra algorithm, we improved the adjacent edge algorithm, and propose adjacent node algorithms, and gives the algorithm implementation of object-oriented.
In order to meet the traveler's planning on the travel routes,the optimal single-objective path model with the shortest time and the lowest cost and the shortest multi-objective path model based on cost and time w...
详细信息
In order to meet the traveler's planning on the travel routes,the optimal single-objective path model with the shortest time and the lowest cost and the shortest multi-objective path model based on cost and time were established separately with reference to the mathematic modeling competition set for the graduate students and in combination with the influence of weather on the travel according to different ways of *** algorithm was adopted to solve the models so as to obtain the optimal multi-objective path,which can provide multiple possible choices for the travelers.
This paper proposes a new algorithm for crack detection based on the selection of minimal paths. It takes account of both photometric and geometric characteristics and requires few information a priori. It is validate...
详细信息
ISBN:
(纸本)9781479957521
This paper proposes a new algorithm for crack detection based on the selection of minimal paths. It takes account of both photometric and geometric characteristics and requires few information a priori. It is validated on synthetic and real images.
暂无评论