By analyzing the drivers' main consideration about how to choose a parking space, this paper is committed to path optimization of parking lot by modified dijkstra algorithm. The main factors that impact drivers ch...
详细信息
ISBN:
(纸本)9781538635247
By analyzing the drivers' main consideration about how to choose a parking space, this paper is committed to path optimization of parking lot by modified dijkstra algorithm. The main factors that impact drivers choosing optimal parking lot are driving distance, the number of vehicle moved along motorway, and the occupancy situations of free parking space. Finally, an example would be analyzed to verify the feasibility of the method.
In order to ensure the safety of seafarer and comprehensively improve the intelligence of maritime field, the topic of unmanned ship has become more and more popular in recent years, and the ability of collision avoid...
详细信息
ISBN:
(纸本)9781665440899
In order to ensure the safety of seafarer and comprehensively improve the intelligence of maritime field, the topic of unmanned ship has become more and more popular in recent years, and the ability of collision avoidance path planning of unmanned ship is one of its key technologies, which is an important embodiment of its intelligence. In this paper, aiming at solving the path planning problem of unmanned ship in known environment map, using mathematical modeling software simulation, some algorithm fields of unmanned ship path planning are reproduced, and the running results of related algorithms are compared. dijkstra algorithm belongs to the single source shortest path algorithm. The original dijkstra classical algorithm is used to realize the path planning. The experimental results show that there are many unnecessary inflection points after using the dijkstra algorithm. The pheromone idea of ant colony algorithm is added to the classic dijkstra algorithm criterion. The experimental results show that the optimized algorithm can greatly reduce the redundant points in the process of path planning and reduce the moving cost of unmanned ship routing.
In the automated storage and retrieval system(AS/RS),a reasonable path-planning is fundamental for the effective work of *** the rectangular environment map of the AS/RS system,the traditional dijkstra algorithm can o...
详细信息
ISBN:
(纸本)9781509046584
In the automated storage and retrieval system(AS/RS),a reasonable path-planning is fundamental for the effective work of *** the rectangular environment map of the AS/RS system,the traditional dijkstra algorithm can only find one shortest path,and skip over other paths with the same *** improved dijkstra algorithm is proposed to solve the path-planning problem in the rectangular environment,which can find all equidistant shortest *** optimal path with both the shortest distance and time is obtained by adding running time to the path-planning *** algorithm is programmed using Visual C++,and the simulation results show that the algorithm is effective and feasible for path-planning in the AS/RS system.
This paper proposes a method of image seam line based on the combination of dijkstra algorithm and morphology. First, the method determines the differential images of the overlap part of two images. And then, morpholo...
详细信息
ISBN:
(纸本)9781510600294
This paper proposes a method of image seam line based on the combination of dijkstra algorithm and morphology. First, the method determines the differential images of the overlap part of two images. And then, morphological expansion processing is implemented based on the differential images and the eight-neighborhood sparse matrix is constructed according to the sparse matrix. Finally, the seam line with the optimal path can be obtained by automatic search of seam line on the differential images by dijkstra algorithm. The experimental results show that compared to the dijkstra method that is not subject to morphological processing, the improved algorithm can avoid the high brightness area as housing under the circumstance of less time (3.72s) in the process of automatic research seam line.
The dijkstra algorithm is a typical single-source shortest path algorithm for calculating the shortest path from one node to the other in a non-negative weight map, but its use of the roulette method greatly affects t...
详细信息
ISBN:
(纸本)9781450361910
The dijkstra algorithm is a typical single-source shortest path algorithm for calculating the shortest path from one node to the other in a non-negative weight map, but its use of the roulette method greatly affects the node selection. Speed and efficiency. Therefore, on the basis of ensuring the search accuracy, this paper improves the initial dijkstra algorithm to improve the efficiency of the algorithm and meet its needs in 2D or 3D path planning. In this paper, MATLAB2018a is used as the experimental platform to simulate the initial dijkstra algorithm and the improved dijkstra algorithm. The experimental results show that the improved algorithm greatly reduces the path planning vision and improves the operating efficiency.
In this paper, the authors propose an extended version of dijkstra' algorithm for finding the shortest path on a network where the edge weights are characterized by an interval valued neutrosophic numbers. Finally...
详细信息
ISBN:
(纸本)9781509042401
In this paper, the authors propose an extended version of dijkstra' algorithm for finding the shortest path on a network where the edge weights are characterized by an interval valued neutrosophic numbers. Finally, a numerical example is given to explain the proposed algorithm.
According to the specialty of fresh agricultural products, a delivery model was established. The model consists of single distribution center and multiple demand points. The integrated cost which consists of transport...
详细信息
ISBN:
(纸本)9783037857519
According to the specialty of fresh agricultural products, a delivery model was established. The model consists of single distribution center and multiple demand points. The integrated cost which consists of transport cost and time cost was taken as the optimization objective. It is used as weight in classic dijkstra algorithm instead of distance. We also used a case study to illustrate saving method and classic dijkstra algorithm with integrated cost. The comparison was conducted by calculating the integrated cost of optimal routes separately. Following the comparison, we draw a conclusion that in the field of fresh agricultural products distribution, classic dijkstra algorithm which takes integrated cost as optimization objective is superior to the saving method in which distance is the optimization objective.
As a typical and very challenging multi-agent system, Robot Soccer System is considered by many researchers as an ideal research platform for multi-agent system, and its purpose is to study multi-robot (or agent) in a...
详细信息
ISBN:
(纸本)9783642286575
As a typical and very challenging multi-agent system, Robot Soccer System is considered by many researchers as an ideal research platform for multi-agent system, and its purpose is to study multi-robot (or agent) in a complex dynamic environment and multiple constraints, the completion of multi-task and multi-target for real-time reasoning and planning techniques which has far-reaching significance for the future society. dijkstra algorithm is the most typical short-circuit algorithm used to calculate the shortest path of a node to all other nodes. Main features of a starting point as the center expand outward of layers, until the end of the extension. In this paper, the algorithm is applied to the robot soccer path planning and obstacle avoidance control and made a good effect. After Recognition the environment, Robot Soccer can determine the shortest path timely and the method has been applied to the actual robot control.
In this paper, we propose a novel method based on dijkstra algorithm for parking lot to find an optimal route and solve the difficulties in finding parking spaces and traffic congestion nowadays. Firstly, by means of ...
详细信息
ISBN:
(纸本)9781538612279
In this paper, we propose a novel method based on dijkstra algorithm for parking lot to find an optimal route and solve the difficulties in finding parking spaces and traffic congestion nowadays. Firstly, by means of the traditional dijkstra algorithm, which is a common way to solve the shortest path problem, we combine it with the impedance function model to obtain the dynamic time of the route. Secondly, the balance function between distance and time is adopted as the weight matrix of the algorithm for optimal path planning. Finally, the verification of the proposed method was conducted by using the numerical simulation. Experimental results validated that the proposed approach was able to provide an optimal personal navigation path effectively, thereby it enhancing the user experience in the parking lot.
Network analyses is an important function of GIS, and the shortest path analysis is the key problem of network analyses. dijkstra shortest path algorithm is one of the classic algorithms. Based on the analysis of this...
详细信息
ISBN:
(纸本)9781467344975
Network analyses is an important function of GIS, and the shortest path analysis is the key problem of network analyses. dijkstra shortest path algorithm is one of the classic algorithms. Based on the analysis of this algorithm, this paper describe from the point of application, using geographic information system (GIS) features, we designed a new data storage structure, improved node search method to improve the efficiency of the algorithm by using a heap to save nodes, and that can save storage space and shorten the searching time.
暂无评论