This study is trying to address the critical need for efficient routing in Mobile Ad Hoc Networks(MANETs)from dynamic topologies that pose great challenges because of the mobility of nodes.Themain objective was to del...This study is trying to address the critical need for efficient routing in Mobile Ad Hoc Networks(MANETs)from dynamic topologies that pose great challenges because of the mobility of nodes.Themain objective was to delve into and refine the application of the Dijkstra’s algorithm in this context,a method conventionally esteemed for its efficiency in static networks.Thus,this paper has carried out a comparative theoretical analysis with the Bellman-Ford algorithm,considering adaptation to the dynamic network conditions that are typical for MANETs.This paper has shown through detailed algorithmic analysis that Dijkstra’s algorithm,when adapted for dynamic updates,yields a very workable solution to the problem of real-time routing in MANETs.The results indicate that with these changes,Dijkstra’s algorithm performs much better computationally and 30%better in routing optimization than Bellman-Ford when working with configurations of sparse networks.The theoretical framework adapted,with the adaptation of the Dijkstra’s algorithm for dynamically changing network topologies,is novel in this work and quite different from any traditional application.The adaptation should offer more efficient routing and less computational overhead,most apt in the limited resource environment of MANETs.Thus,from these findings,one may derive a conclusion that the proposed version of Dijkstra’s algorithm is the best and most feasible choice of the routing protocol for MANETs given all pertinent key performance and resource consumption indicators and further that the proposed method offers a marked improvement over traditional methods.This paper,therefore,operationalizes the theoretical model into practical scenarios and also further research with empirical simulations to understand more about its operational effectiveness.展开更多
A solution to compute the optimal path based on a single-line-single-directional（SLSD）road network model is proposed.Unlike the traditional road network model,in the SLSD conceptual model,being single-directional an...A solution to compute the optimal path based on a single-line-single-directional（SLSD）road network model is proposed.Unlike the traditional road network model,in the SLSD conceptual model,being single-directional and single-line style,a road is no longer a linkage of road nodes but abstracted as a network node.Similarly,a road node is abstracted as the linkage of two ordered single-directional roads.This model can describe turn restrictions,circular roads,and other real scenarios usually described using a super-graph.Then a computing framework for optimal path finding（OPF）is presented.It is proved that classical Dijkstra and A algorithms can be directly used for OPF computing of any real-world road networks by transferring a super-graph to an SLSD network.Finally,using Singapore road network data,the proposed conceptual model and its corresponding optimal path finding algorithms are validated using a two-step optimal path finding algorithm with a pre-computing strategy based on the SLSD road network.展开更多
Optimal path planning avoiding obstacles is among the most attractive applications of mobile robots(MRs)in both research and education.In this paper,an optimal collision-free algorithm is designed and implemented prac...Optimal path planning avoiding obstacles is among the most attractive applications of mobile robots(MRs)in both research and education.In this paper,an optimal collision-free algorithm is designed and implemented practically based on an improved Dijkstra algorithm.To achieve this research objectives,first,the MR obstacle-free environment is modeled as a diagraph including nodes,edges and weights.Second,Dijkstra algorithm is used offline to generate the shortest path driving the MR from a starting point to a target point.During its movement,the robot should follow the previously obtained path and stop at each node to test if there is an obstacle between the current node and the immediately following node.For this aim,the MR was equipped with an ultrasonic sensor used as obstacle detector.If an obstacle is found,the MR updates its diagraph by excluding the corresponding node.Then,Dijkstra algorithm runs on the modified diagraph.This procedure is repeated until reaching the target point.To verify the efficiency of the proposed approach,a simulation was carried out on a hand-made MR and an environment including 9 nodes,19 edges and 2 obstacles.The obtained optimal path avoiding obstacles has been transferred into motion control and implemented practically using line tracking sensors.This study has shown that the improved Dijkstra algorithm can efficiently solve optimal path planning in environments including obstacles and that STEAM-based MRs are efficient cost-effective tools to practically implement the designed algorithm.展开更多
A novel method of global optimal path planning for mobile robot was proposed based on the improved Dijkstra algorithm and ant system algorithm. This method includes three steps: the first step is adopting the MAKLINK ...A novel method of global optimal path planning for mobile robot was proposed based on the improved Dijkstra algorithm and ant system algorithm. This method includes three steps: the first step is adopting the MAKLINK graph theory to establish the free space model of the mobile robot, the second step is adopting the improved Dijkstra algorithm to find out a sub-optimal collision-free path, and the third step is using the ant system algorithm to adjust and optimize the location of the sub-optimal path so as to generate the global optimal path for the mobile robot. The computer simulation experiment was carried out and the results show that this method is correct and effective. The comparison of the results confirms that the proposed method is better than the hybrid genetic algorithm in the global optimal path planning.展开更多
Bidirectional Dijkstra algorithm whose time complexity is 8O(n~2) is proposed. The theory foundation is that the classical Dijkstra algorithm has not any directional feature during searching the shortest path. The alg...Bidirectional Dijkstra algorithm whose time complexity is 8O(n~2) is proposed. The theory foundation is that the classical Dijkstra algorithm has not any directional feature during searching the shortest path. The algorithm takes advantage of the adjacent link and the mechanism of bidirectional search, that is, the algorithm processes the positive search from start point to destination point and the negative search from destination point to start point at the same time. Finally, combining with the practical application of route-planning algorithm in embedded real-time vehicle navigation system (ERTVNS), one example of its practical applications is given, analysis in theory and the experimental results show that compared with the Dijkstra algorithm, the new algorithm can reduce time complexity, and guarantee the searching precision, it satisfies the needs of ERTVNS.展开更多
Dijkstra algorithm is a theoretical basis to solve transportation network problems of the shortest path, which has a wide range of application in path optimization. Through analyzing traditional Dijkstra algorithm,on ...Dijkstra algorithm is a theoretical basis to solve transportation network problems of the shortest path, which has a wide range of application in path optimization. Through analyzing traditional Dijkstra algorithm,on account of the insufficiency of this algorithm in path optimization,this paper uses adjacency list and circular linked list with combination to store date,and through the improved quick sorting algorithm for weight sorting, accomplish a quick search to the adjacent node,and so an improved Dijkstra algorithm is got.Then apply it to the optimal path search,and make simulation analysis for this algorithm through the example,also verify the effectiveness of the proposed algorithm.展开更多
In this figure, it finds a vertex to another vertex k shortest path algorithm. Provided there are n vertices and edges in the diagram. If the path loops, the time complexity of the algorithm is allowed O（w ＋ n log 2...In this figure, it finds a vertex to another vertex k shortest path algorithm. Provided there are n vertices and edges in the diagram. If the path loops, the time complexity of the algorithm is allowed O（w ＋ n log 2 n ＋ kw log 2 k）. If the request path does not contain the loop, the time complexity of the algorithm O（kn（w ＋ n log2 n）＋ kw log2 k）. The algorithm utilizes a simple extension of the Dijkstra algorithm determined the end of the length of the shortest path to the other vertices, and then, based on these data, branch and bound method to identify the required path. Experimental results show that the actual running time has relations with the structure of FIG.展开更多
Despite the support of all kinds of fire prevention measures and high-tech fire prevention equipment,fires still occur frequently because of both anthro-pogenic factors and natural disasters.This issue has drawn the a...Despite the support of all kinds of fire prevention measures and high-tech fire prevention equipment,fires still occur frequently because of both anthro-pogenic factors and natural disasters.This issue has drawn the attention of schools,all levels of government,and other organizations.Many types of organi-zations carry out fire drills throughout the year.Because this kind of drill cannot anticipate the specific circumstances of each fire,which are generally far more complicated than drills,most people cannot correctly choose the optimal escape route from real fires.Thus,a fire-scene virtual simulation system based on the Dijkstra algorithm is here proposed to address such problems as casualties caused by frequent fires and the inability of most people to correctly choose a fire escape route.This virtual fire escape simulation system uses Maya to carry out 3D recon-struction of the fire scene,the Unity engine to conduct interactive function design,and the Dijkstra algorithm to calculate the best escape route.The results of the example indicate that the simulation system solves the problems of the traditional simulation system,such as stiffness,lack of intelligence,and poor simulation.展开更多
Nowadays, the development of “smart cities” with a high level of quality of life is becoming a prior challenge to be addressed. In this paper, promoting the model shift in railway transportation using tram network t...Nowadays, the development of “smart cities” with a high level of quality of life is becoming a prior challenge to be addressed. In this paper, promoting the model shift in railway transportation using tram network towards more reliable, greener and in general more sustainable transportation modes in a potential world class university is proposed. “Smart mobility” in a smart city will significantly contribute to achieving the goal of a university becoming a world class university. In order to have a regular and reliable rail system on campus, we optimize the route among major stations on campus, using shortest path problem Dijkstra algorithm in conjunction with a computer software called LINDO to arrive at the optimal route. In particular, it is observed that the shortest path from the main entrance gate (Canaan land entrance gate) to the Electrical Engineering Department is of distance 0.805 km.展开更多
The optimal path algorithm analysis of GPS navigation in taxi management system based on A＊ algorithm was introduced in this paper. Through improving the traditional Dijkstra algorithm and avoiding problems such as ...The optimal path algorithm analysis of GPS navigation in taxi management system based on A＊ algorithm was introduced in this paper. Through improving the traditional Dijkstra algorithm and avoiding problems such as ＂time-consuming and low efficiency＂ in Dijkstra algorithm with traversal search for each node, A＊ algorithm could help the taxi find the optimal path and bring convenience for traffic management.展开更多
The recent rapid development of China’s foreign trade has led to the significant increase in waterway transportation and automated container ports. Automated terminals can significantly improve the loading and unload...The recent rapid development of China’s foreign trade has led to the significant increase in waterway transportation and automated container ports. Automated terminals can significantly improve the loading and unloading efficiency of container terminals. These terminals can also increase the port’s transportation volume while ensuring the quality of cargo loading and unloading, which has become an inevitable trend in the future development of ports. However, the continuous growth of the port’s transportation volume has increased the horizontal transportation pressure on the automated terminal, and the problems of route conflicts and road locks faced by automated guided vehicles (AGV) have become increasingly prominent. Accordingly, this work takes Xiamen Yuanhai automated container terminal as an example. This work focuses on analyzing the interference problem of path conflict in its horizontal transportation AGV scheduling. Results show that path conflict, the most prominent interference factor, will cause AGV scheduling to be unable to execute the original plan. Consequently, the disruption management was used to establish a disturbance recovery model, and the Dijkstra algorithm for combining with time windows is adopted to plan a conflict-free path. Based on the comparison with the rescheduling method, the research obtains that the deviation of the transportation path and the deviation degree of the transportation path under the disruption management method are much lower than those of the rescheduling method. The transportation path deviation degree of the disruption management method is only 5.56%. Meanwhile, the deviation degree of the transportation path under the rescheduling method is 44.44%.展开更多
Vulnerability assessment is a systematic process to identify security gaps in the design and evaluation of physical protection systems.Adversarial path planning is a widely used method for identifying potential vulner...Vulnerability assessment is a systematic process to identify security gaps in the design and evaluation of physical protection systems.Adversarial path planning is a widely used method for identifying potential vulnerabilities and threats to the security and resilience of critical infrastructures.However,achieving efficient path optimization in complex large-scale three-dimensional(3D)scenes remains a significant challenge for vulnerability assessment.This paper introduces a novel A^(*)-algorithmic framework for 3D security modeling and vulnerability assessment.Within this framework,the 3D facility models were first developed in 3ds Max and then incorporated into Unity for A^(*)heuristic pathfinding.The A^(*)-heuristic pathfinding algorithm was implemented with a geometric probability model to refine the detection and distance fields and achieve a rational approximation of the cost to reach the goal.An admissible heuristic is ensured by incorporating the minimum probability of detection(P_(D)^(min))and diagonal distance to estimate the heuristic function.The 3D A^(*)heuristic search was demonstrated using a hypothetical laboratory facility,where a comparison was also carried out between the A^(*)and Dijkstra algorithms for optimal path identification.Comparative results indicate that the proposed A^(*)-heuristic algorithm effectively identifies the most vulnerable adversarial pathfinding with high efficiency.Finally,the paper discusses hidden phenomena and open issues in efficient 3D pathfinding for security applications.展开更多
Because of the limitations of electric vehicle(EV)battery technology and relevant supporting facilities,there is a great risk of breakdown of EVs during driving.The resulting driver“range anxiety”greatly affects the...Because of the limitations of electric vehicle(EV)battery technology and relevant supporting facilities,there is a great risk of breakdown of EVs during driving.The resulting driver“range anxiety”greatly affects the travel quality of EVs.These limitations should be overcome to promote the use of EVs.In this study,a method for travel path planning considering EV power supply was developed.First,based on real-time road conditions,a dynamic energy model of EVs was established considering the driving energy and accessory energy.Second,a multi-objective travel path planning model of EVs was constructed considering the power supply,taking the distance,time,energy,and charging cost as the optimization objectives.Finally,taking the actual traffic network of 15 km×15 km area in a city as the research object,the model was simulated and verified in MATLAB based on Dijkstra shortest path algorithm.The simulation results show that compared with the traditional route planning method,the total distance in the proposed optimal route planning method increased by 1.18%,but the energy consumption,charging cost,and driving time decreased by 11.62%,41.26%and 11.00%,respectively,thus effectively reducing the travel cost of EVs and improving the driving quality of EVs.展开更多
Based on the definition of class shortest path in weighted rough graph, class shortest path algorithm in weighted rough graph is presented, which extends classical shortest path algorithm. The application in relations...Based on the definition of class shortest path in weighted rough graph, class shortest path algorithm in weighted rough graph is presented, which extends classical shortest path algorithm. The application in relationship mining shows effectiveness of it.展开更多
We propose a high-performance path planning algorithm for automatic target tracking in the applications of real-time simulation and visualization of large-scale terrain datasets, with a large number of moving objects ...We propose a high-performance path planning algorithm for automatic target tracking in the applications of real-time simulation and visualization of large-scale terrain datasets, with a large number of moving objects （such as vehicles） tracking multiple moving targets. By using a modified Dijkstra＇s algorithm, an optimal path between each vehicle-target pair over a weighted grid-presented terrain is computed and updated to eliminate the problem of local minima and losing of tracking. Then, a dynamic path re-planning strategy using multi-resolution representation of a dynamic updating region is proposed to achieve high-performance by trading-off precision for efficiency, while guaranteeing accuracy. Primary experimental results showed that our algorithm successfully achieved l0 to 96 frames per second interactive path-replanning rates during a terrain simulation scenario with 10 to 100 vehicles and multiple moving targets.展开更多
Rational planning of agricultural product transport route from initial node to destination node can effectively reduce the cost price of agricultural products,and the calculation of shortest path between any two point...Rational planning of agricultural product transport route from initial node to destination node can effectively reduce the cost price of agricultural products,and the calculation of shortest path between any two points also affects people’s daily travel.Taking Heze Railway Station to Heze College for example,with remote sensing image data as the base map,we conduct vectorization and topological analysis on roads in the target area.With Dijkstra as theoretical basis of shortest path algorithm,we use ArcG IS network analysis method to build road network,and calculate the planning program of the shortest distance path,the shortest path by driving and the shortest path by walking.展开更多
In this paper, the map of a network of air routes was updated by removing the non-optimal routes and replacing them with the best ones. An integer linear programming model was developed. The aim was to find optimal ro...In this paper, the map of a network of air routes was updated by removing the non-optimal routes and replacing them with the best ones. An integer linear programming model was developed. The aim was to find optimal routes in superspace based on performance-based navigation. The optimal routes were found from a DIJKSTRA algorithm that calculates the shortest path in a graph. Simulations with python language on real traffic areas showed the improvements brought by surface navigation. In this work, the conceptual phase and the upper airspace were studied.展开更多
In the shipbuilding industry,market competition is currently operating in an intense state.To be able to strive in the global market,the shipbuilders must able to produce ships that are more efficient and can be const...In the shipbuilding industry,market competition is currently operating in an intense state.To be able to strive in the global market,the shipbuilders must able to produce ships that are more efficient and can be constructed in a relatively short amount of time.The piping layouts in the engine room requires a lot of time for the designer to design the best possible route and in a way are not the most efficient route.This paper presents an automatic piping support system in the ship’s engine room based on the Dijkstra’s algorithm of pathfinding method.The proposed method is focused on finding the shortest possible route with a consideration of the following things:cost of the bend pipe,cost of the crossing pipe,cost reduction by pipe support,restriction on piping,reduction of calculation time,and design procedure of piping route.Dijkstra’s shortest path algorithm is adopted to find the shortest path route between the start and goal point that is determined based on the layout of the ship’s engine room.Genetic algorithm is adopted to decide the sequence of the pipe execution.The details of the proposed method are explained in this paper.This paper also discusses the application of the proposed method on an actual ship and evaluates its effectiveness.展开更多
Simulation of egress is vital for minimizing losses during fire disasters, however accurate simulations are scarce and real-life data is hard to come by. In this paper, a Proposed Wireless Fire Evacuation Model (PWFEM...Simulation of egress is vital for minimizing losses during fire disasters, however accurate simulations are scarce and real-life data is hard to come by. In this paper, a Proposed Wireless Fire Evacuation Model (PWFEM) is proposed to simulate fire evacuation process in a short time<span><span><span style="font-family:;" "=""> </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">to minimize evacuee’s exposure to the harmful radiation and fire hazards. The PWFEM</span></span></span><span><span><span style="font-family:;" "=""> </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">simulation realistic by supposing fire scenario at</span></span></span><span><span><span style="font-family:;" "=""> </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">cabined contains electrical cables inside a standard Main Control Room (MCR) in a Nuclear Power Plant (NPP) building.</span></span></span><span><span><span style="font-family:;" "=""> </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">In addition, a</span></span></span><span><span><span style="font-family:;" "=""> </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">new Hybrid Safest Shortest Exit (HSSE) is developed</span></span></span><span><span><span style="font-family:;" "=""> </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">which consists of three stages: safest route based </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">o</span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">n rules-based technique, evacuees location based on the DV-hop technique </span></span></span><span><span><span style="font-family:" color:#c45911;"=""><a href="#ref1" target="_blank"><span style="font-family:Verdana;">[1]</span></a></span><span></span></span></span><span><span></span></span><span></span><span><span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;"> and shortest route that depends on Dijkstra techniqu</span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">e</span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">. The PWFEM Simulations </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">are </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">appreciated</span></span></span><span><span><span style="font-family:;" "=""> </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">to yield a realistic fire scenario by using a telecommunications TCP/IP network in</span></span></span><span><span><span style="font-family:;" "=""> </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">form of server and client sides that help in transfer data inside internal networks in the NPP building. </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">O</span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">n the server-side, suppose that</span></span></span><span><span><span style="font-family:;" "=""> </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">Consolidated Model of Fire Growth and Smoke Transport (CFAST) fire modeling is applied to simulate the fire scenario in MCR through CFAST model to generate fire products as output data in excel sheets and sends them to the client-side. The client-side then runs HSSE to produce the tree map for safest and shortest routes to help the evacuee for safe exit from his/her location.</span></span></span><span><span><span style="font-family:;" "=""> </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">HSSE can be implemented on evacuee’s watches. From the results, </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">it is </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">concluded that PWFEM can simulate the fire scenario inside MCR,</span></span></span><span><span><span style="font-family:;" "=""> </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">furthermore </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">it is </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">validated that HSEE can be used as an efficient emergency fire evacuation technique that can produce safest and shortest exit route for evacuee in any location inside NPP in very small time. In addition, PWFEM can be used for simulating</span></span></span><span><span><span style="font-family:;" "=""> </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">fire evacuation inside any high-risk buildings and can appreciate</span></span></span><span><span><span style="font-family:;" "=""> </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">yield</span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">ing</span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;"> any realistic fire scenario with many types of fire sources in different places inside buildings.</span></span></span>展开更多
In order to make the manager can well grasp the whole road network each section of the traffic flow on the assumption of the situation, the selected low section of the appropriate flow distribution, the selected high ...In order to make the manager can well grasp the whole road network each section of the traffic flow on the assumption of the situation, the selected low section of the appropriate flow distribution, the selected high degree of road drainage, in order to alleviate traffic congestion, improve the road utilization rate. Based on Dijkstra algorithm, OD pair, weighted topological structure with travel time as edge weight and the actual situation of Beijing great outer ring road, the road section selection degree model is established. The results show that the three indexes in the generalized topology, the number of sections, the number of nodes and the node degree in the dual topology can well reflect the degree of road selection, and the weights of these three indexes are 0.35, 0.32 and 0.33, respectively.展开更多
基金supported by Northern Border University,Arar,Kingdom of Saudi Arabia,through the Project Number“NBU-FFR-2024-2248-03”.
文摘This study is trying to address the critical need for efficient routing in Mobile Ad Hoc Networks(MANETs)from dynamic topologies that pose great challenges because of the mobility of nodes.Themain objective was to delve into and refine the application of the Dijkstra’s algorithm in this context,a method conventionally esteemed for its efficiency in static networks.Thus,this paper has carried out a comparative theoretical analysis with the Bellman-Ford algorithm,considering adaptation to the dynamic network conditions that are typical for MANETs.This paper has shown through detailed algorithmic analysis that Dijkstra’s algorithm,when adapted for dynamic updates,yields a very workable solution to the problem of real-time routing in MANETs.The results indicate that with these changes,Dijkstra’s algorithm performs much better computationally and 30%better in routing optimization than Bellman-Ford when working with configurations of sparse networks.The theoretical framework adapted,with the adaptation of the Dijkstra’s algorithm for dynamically changing network topologies,is novel in this work and quite different from any traditional application.The adaptation should offer more efficient routing and less computational overhead,most apt in the limited resource environment of MANETs.Thus,from these findings,one may derive a conclusion that the proposed version of Dijkstra’s algorithm is the best and most feasible choice of the routing protocol for MANETs given all pertinent key performance and resource consumption indicators and further that the proposed method offers a marked improvement over traditional methods.This paper,therefore,operationalizes the theoretical model into practical scenarios and also further research with empirical simulations to understand more about its operational effectiveness.
基金The National Key Technology R&D Program of China during the 11th Five Year Plan Period(No.2008BAJ11B01)
文摘A solution to compute the optimal path based on a single-line-single-directional（SLSD）road network model is proposed.Unlike the traditional road network model,in the SLSD conceptual model,being single-directional and single-line style,a road is no longer a linkage of road nodes but abstracted as a network node.Similarly,a road node is abstracted as the linkage of two ordered single-directional roads.This model can describe turn restrictions,circular roads,and other real scenarios usually described using a super-graph.Then a computing framework for optimal path finding（OPF）is presented.It is proved that classical Dijkstra and A algorithms can be directly used for OPF computing of any real-world road networks by transferring a super-graph to an SLSD network.Finally,using Singapore road network data,the proposed conceptual model and its corresponding optimal path finding algorithms are validated using a two-step optimal path finding algorithm with a pre-computing strategy based on the SLSD road network.
基金This research has been funded by Scientific Research Deanship at University of Ha’il–Saudi Arabia through Project Number BA-2107.
文摘Optimal path planning avoiding obstacles is among the most attractive applications of mobile robots(MRs)in both research and education.In this paper,an optimal collision-free algorithm is designed and implemented practically based on an improved Dijkstra algorithm.To achieve this research objectives,first,the MR obstacle-free environment is modeled as a diagraph including nodes,edges and weights.Second,Dijkstra algorithm is used offline to generate the shortest path driving the MR from a starting point to a target point.During its movement,the robot should follow the previously obtained path and stop at each node to test if there is an obstacle between the current node and the immediately following node.For this aim,the MR was equipped with an ultrasonic sensor used as obstacle detector.If an obstacle is found,the MR updates its diagraph by excluding the corresponding node.Then,Dijkstra algorithm runs on the modified diagraph.This procedure is repeated until reaching the target point.To verify the efficiency of the proposed approach,a simulation was carried out on a hand-made MR and an environment including 9 nodes,19 edges and 2 obstacles.The obtained optimal path avoiding obstacles has been transferred into motion control and implemented practically using line tracking sensors.This study has shown that the improved Dijkstra algorithm can efficiently solve optimal path planning in environments including obstacles and that STEAM-based MRs are efficient cost-effective tools to practically implement the designed algorithm.
文摘A novel method of global optimal path planning for mobile robot was proposed based on the improved Dijkstra algorithm and ant system algorithm. This method includes three steps: the first step is adopting the MAKLINK graph theory to establish the free space model of the mobile robot, the second step is adopting the improved Dijkstra algorithm to find out a sub-optimal collision-free path, and the third step is using the ant system algorithm to adjust and optimize the location of the sub-optimal path so as to generate the global optimal path for the mobile robot. The computer simulation experiment was carried out and the results show that this method is correct and effective. The comparison of the results confirms that the proposed method is better than the hybrid genetic algorithm in the global optimal path planning.
文摘Bidirectional Dijkstra algorithm whose time complexity is 8O(n~2) is proposed. The theory foundation is that the classical Dijkstra algorithm has not any directional feature during searching the shortest path. The algorithm takes advantage of the adjacent link and the mechanism of bidirectional search, that is, the algorithm processes the positive search from start point to destination point and the negative search from destination point to start point at the same time. Finally, combining with the practical application of route-planning algorithm in embedded real-time vehicle navigation system (ERTVNS), one example of its practical applications is given, analysis in theory and the experimental results show that compared with the Dijkstra algorithm, the new algorithm can reduce time complexity, and guarantee the searching precision, it satisfies the needs of ERTVNS.
基金supported by the "Taishan Scholarship" Construction Engineering and Shandong Province Graduate Innovative Project(SDYC08011).
文摘Dijkstra algorithm is a theoretical basis to solve transportation network problems of the shortest path, which has a wide range of application in path optimization. Through analyzing traditional Dijkstra algorithm,on account of the insufficiency of this algorithm in path optimization,this paper uses adjacency list and circular linked list with combination to store date,and through the improved quick sorting algorithm for weight sorting, accomplish a quick search to the adjacent node,and so an improved Dijkstra algorithm is got.Then apply it to the optimal path search,and make simulation analysis for this algorithm through the example,also verify the effectiveness of the proposed algorithm.
文摘In this figure, it finds a vertex to another vertex k shortest path algorithm. Provided there are n vertices and edges in the diagram. If the path loops, the time complexity of the algorithm is allowed O（w ＋ n log 2 n ＋ kw log 2 k）. If the request path does not contain the loop, the time complexity of the algorithm O（kn（w ＋ n log2 n）＋ kw log2 k）. The algorithm utilizes a simple extension of the Dijkstra algorithm determined the end of the length of the shortest path to the other vertices, and then, based on these data, branch and bound method to identify the required path. Experimental results show that the actual running time has relations with the structure of FIG.
文摘Despite the support of all kinds of fire prevention measures and high-tech fire prevention equipment,fires still occur frequently because of both anthro-pogenic factors and natural disasters.This issue has drawn the attention of schools,all levels of government,and other organizations.Many types of organi-zations carry out fire drills throughout the year.Because this kind of drill cannot anticipate the specific circumstances of each fire,which are generally far more complicated than drills,most people cannot correctly choose the optimal escape route from real fires.Thus,a fire-scene virtual simulation system based on the Dijkstra algorithm is here proposed to address such problems as casualties caused by frequent fires and the inability of most people to correctly choose a fire escape route.This virtual fire escape simulation system uses Maya to carry out 3D recon-struction of the fire scene,the Unity engine to conduct interactive function design,and the Dijkstra algorithm to calculate the best escape route.The results of the example indicate that the simulation system solves the problems of the traditional simulation system,such as stiffness,lack of intelligence,and poor simulation.
文摘Nowadays, the development of “smart cities” with a high level of quality of life is becoming a prior challenge to be addressed. In this paper, promoting the model shift in railway transportation using tram network towards more reliable, greener and in general more sustainable transportation modes in a potential world class university is proposed. “Smart mobility” in a smart city will significantly contribute to achieving the goal of a university becoming a world class university. In order to have a regular and reliable rail system on campus, we optimize the route among major stations on campus, using shortest path problem Dijkstra algorithm in conjunction with a computer software called LINDO to arrive at the optimal route. In particular, it is observed that the shortest path from the main entrance gate (Canaan land entrance gate) to the Electrical Engineering Department is of distance 0.805 km.
文摘The optimal path algorithm analysis of GPS navigation in taxi management system based on A＊ algorithm was introduced in this paper. Through improving the traditional Dijkstra algorithm and avoiding problems such as ＂time-consuming and low efficiency＂ in Dijkstra algorithm with traversal search for each node, A＊ algorithm could help the taxi find the optimal path and bring convenience for traffic management.
文摘The recent rapid development of China’s foreign trade has led to the significant increase in waterway transportation and automated container ports. Automated terminals can significantly improve the loading and unloading efficiency of container terminals. These terminals can also increase the port’s transportation volume while ensuring the quality of cargo loading and unloading, which has become an inevitable trend in the future development of ports. However, the continuous growth of the port’s transportation volume has increased the horizontal transportation pressure on the automated terminal, and the problems of route conflicts and road locks faced by automated guided vehicles (AGV) have become increasingly prominent. Accordingly, this work takes Xiamen Yuanhai automated container terminal as an example. This work focuses on analyzing the interference problem of path conflict in its horizontal transportation AGV scheduling. Results show that path conflict, the most prominent interference factor, will cause AGV scheduling to be unable to execute the original plan. Consequently, the disruption management was used to establish a disturbance recovery model, and the Dijkstra algorithm for combining with time windows is adopted to plan a conflict-free path. Based on the comparison with the rescheduling method, the research obtains that the deviation of the transportation path and the deviation degree of the transportation path under the disruption management method are much lower than those of the rescheduling method. The transportation path deviation degree of the disruption management method is only 5.56%. Meanwhile, the deviation degree of the transportation path under the rescheduling method is 44.44%.
基金supported by the fundings from 2024 Young Talents Program for Science and Technology Thinking Tanks(No.XMSB20240711041)2024 Student Research Program on Dynamic Simulation and Force-on-Force Exercise of Nuclear Security in 3D Interactive Environment Using Reinforcement Learning,Natural Science Foundation of Top Talent of SZTU(No.GDRC202407)+2 种基金Shenzhen Science and Technology Program(No.KCXFZ20240903092603005)Shenzhen Science and Technology Program(No.JCYJ20241202124703004)Shenzhen Science and Technology Program(No.KJZD20230923114117032)。
文摘Vulnerability assessment is a systematic process to identify security gaps in the design and evaluation of physical protection systems.Adversarial path planning is a widely used method for identifying potential vulnerabilities and threats to the security and resilience of critical infrastructures.However,achieving efficient path optimization in complex large-scale three-dimensional(3D)scenes remains a significant challenge for vulnerability assessment.This paper introduces a novel A^(*)-algorithmic framework for 3D security modeling and vulnerability assessment.Within this framework,the 3D facility models were first developed in 3ds Max and then incorporated into Unity for A^(*)heuristic pathfinding.The A^(*)-heuristic pathfinding algorithm was implemented with a geometric probability model to refine the detection and distance fields and achieve a rational approximation of the cost to reach the goal.An admissible heuristic is ensured by incorporating the minimum probability of detection(P_(D)^(min))and diagonal distance to estimate the heuristic function.The 3D A^(*)heuristic search was demonstrated using a hypothetical laboratory facility,where a comparison was also carried out between the A^(*)and Dijkstra algorithms for optimal path identification.Comparative results indicate that the proposed A^(*)-heuristic algorithm effectively identifies the most vulnerable adversarial pathfinding with high efficiency.Finally,the paper discusses hidden phenomena and open issues in efficient 3D pathfinding for security applications.
基金Projects(51908388,51508315,51905320)supported by the National Natural Science Foundation of ChinaProject(2019 JZZY 010911)supported by the Key R&D Program of Shandong Province,China+1 种基金Project supported by the Shandong University of Technology&Zibo City Integration Develo pment Project,ChinaProject(ZR 2021 MG 012)supported by Shandong Provincial Natural Science Foundation,China。
文摘Because of the limitations of electric vehicle(EV)battery technology and relevant supporting facilities,there is a great risk of breakdown of EVs during driving.The resulting driver“range anxiety”greatly affects the travel quality of EVs.These limitations should be overcome to promote the use of EVs.In this study,a method for travel path planning considering EV power supply was developed.First,based on real-time road conditions,a dynamic energy model of EVs was established considering the driving energy and accessory energy.Second,a multi-objective travel path planning model of EVs was constructed considering the power supply,taking the distance,time,energy,and charging cost as the optimization objectives.Finally,taking the actual traffic network of 15 km×15 km area in a city as the research object,the model was simulated and verified in MATLAB based on Dijkstra shortest path algorithm.The simulation results show that compared with the traditional route planning method,the total distance in the proposed optimal route planning method increased by 1.18%,but the energy consumption,charging cost,and driving time decreased by 11.62%,41.26%and 11.00%,respectively,thus effectively reducing the travel cost of EVs and improving the driving quality of EVs.
基金Natural Science Foundation of Shandong Province of China (Y2004A04)Natural Science Foundation of Shandong Province of China (Y2006A12)Foundation of Ministry of Fujian Province Education of China (JA04268).
文摘Based on the definition of class shortest path in weighted rough graph, class shortest path algorithm in weighted rough graph is presented, which extends classical shortest path algorithm. The application in relationship mining shows effectiveness of it.
基金Project partially supported by NSF (No. CCR0306438) and theBoeing Company, USA
文摘We propose a high-performance path planning algorithm for automatic target tracking in the applications of real-time simulation and visualization of large-scale terrain datasets, with a large number of moving objects （such as vehicles） tracking multiple moving targets. By using a modified Dijkstra＇s algorithm, an optimal path between each vehicle-target pair over a weighted grid-presented terrain is computed and updated to eliminate the problem of local minima and losing of tracking. Then, a dynamic path re-planning strategy using multi-resolution representation of a dynamic updating region is proposed to achieve high-performance by trading-off precision for efficiency, while guaranteeing accuracy. Primary experimental results showed that our algorithm successfully achieved l0 to 96 frames per second interactive path-replanning rates during a terrain simulation scenario with 10 to 100 vehicles and multiple moving targets.
基金Supported by Science Foundation of Heze University(XY14SK14)
文摘Rational planning of agricultural product transport route from initial node to destination node can effectively reduce the cost price of agricultural products,and the calculation of shortest path between any two points also affects people’s daily travel.Taking Heze Railway Station to Heze College for example,with remote sensing image data as the base map,we conduct vectorization and topological analysis on roads in the target area.With Dijkstra as theoretical basis of shortest path algorithm,we use ArcG IS network analysis method to build road network,and calculate the planning program of the shortest distance path,the shortest path by driving and the shortest path by walking.
文摘In this paper, the map of a network of air routes was updated by removing the non-optimal routes and replacing them with the best ones. An integer linear programming model was developed. The aim was to find optimal routes in superspace based on performance-based navigation. The optimal routes were found from a DIJKSTRA algorithm that calculates the shortest path in a graph. Simulations with python language on real traffic areas showed the improvements brought by surface navigation. In this work, the conceptual phase and the upper airspace were studied.
基金supported the Directorate of Research and Community Engagement,Universitas Indonesia,and scheme of Research Collaboration,contract number:NKB-1954/UN2.R3.1/HKP.05.00/2019.
文摘In the shipbuilding industry,market competition is currently operating in an intense state.To be able to strive in the global market,the shipbuilders must able to produce ships that are more efficient and can be constructed in a relatively short amount of time.The piping layouts in the engine room requires a lot of time for the designer to design the best possible route and in a way are not the most efficient route.This paper presents an automatic piping support system in the ship’s engine room based on the Dijkstra’s algorithm of pathfinding method.The proposed method is focused on finding the shortest possible route with a consideration of the following things:cost of the bend pipe,cost of the crossing pipe,cost reduction by pipe support,restriction on piping,reduction of calculation time,and design procedure of piping route.Dijkstra’s shortest path algorithm is adopted to find the shortest path route between the start and goal point that is determined based on the layout of the ship’s engine room.Genetic algorithm is adopted to decide the sequence of the pipe execution.The details of the proposed method are explained in this paper.This paper also discusses the application of the proposed method on an actual ship and evaluates its effectiveness.
文摘Simulation of egress is vital for minimizing losses during fire disasters, however accurate simulations are scarce and real-life data is hard to come by. In this paper, a Proposed Wireless Fire Evacuation Model (PWFEM) is proposed to simulate fire evacuation process in a short time<span><span><span style="font-family:;" "=""> </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">to minimize evacuee’s exposure to the harmful radiation and fire hazards. The PWFEM</span></span></span><span><span><span style="font-family:;" "=""> </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">simulation realistic by supposing fire scenario at</span></span></span><span><span><span style="font-family:;" "=""> </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">cabined contains electrical cables inside a standard Main Control Room (MCR) in a Nuclear Power Plant (NPP) building.</span></span></span><span><span><span style="font-family:;" "=""> </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">In addition, a</span></span></span><span><span><span style="font-family:;" "=""> </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">new Hybrid Safest Shortest Exit (HSSE) is developed</span></span></span><span><span><span style="font-family:;" "=""> </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">which consists of three stages: safest route based </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">o</span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">n rules-based technique, evacuees location based on the DV-hop technique </span></span></span><span><span><span style="font-family:" color:#c45911;"=""><a href="#ref1" target="_blank"><span style="font-family:Verdana;">[1]</span></a></span><span></span></span></span><span><span></span></span><span></span><span><span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;"> and shortest route that depends on Dijkstra techniqu</span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">e</span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">. The PWFEM Simulations </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">are </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">appreciated</span></span></span><span><span><span style="font-family:;" "=""> </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">to yield a realistic fire scenario by using a telecommunications TCP/IP network in</span></span></span><span><span><span style="font-family:;" "=""> </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">form of server and client sides that help in transfer data inside internal networks in the NPP building. </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">O</span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">n the server-side, suppose that</span></span></span><span><span><span style="font-family:;" "=""> </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">Consolidated Model of Fire Growth and Smoke Transport (CFAST) fire modeling is applied to simulate the fire scenario in MCR through CFAST model to generate fire products as output data in excel sheets and sends them to the client-side. The client-side then runs HSSE to produce the tree map for safest and shortest routes to help the evacuee for safe exit from his/her location.</span></span></span><span><span><span style="font-family:;" "=""> </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">HSSE can be implemented on evacuee’s watches. From the results, </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">it is </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">concluded that PWFEM can simulate the fire scenario inside MCR,</span></span></span><span><span><span style="font-family:;" "=""> </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">furthermore </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">it is </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">validated that HSEE can be used as an efficient emergency fire evacuation technique that can produce safest and shortest exit route for evacuee in any location inside NPP in very small time. In addition, PWFEM can be used for simulating</span></span></span><span><span><span style="font-family:;" "=""> </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">fire evacuation inside any high-risk buildings and can appreciate</span></span></span><span><span><span style="font-family:;" "=""> </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">yield</span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">ing</span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;"> any realistic fire scenario with many types of fire sources in different places inside buildings.</span></span></span>
文摘In order to make the manager can well grasp the whole road network each section of the traffic flow on the assumption of the situation, the selected low section of the appropriate flow distribution, the selected high degree of road drainage, in order to alleviate traffic congestion, improve the road utilization rate. Based on Dijkstra algorithm, OD pair, weighted topological structure with travel time as edge weight and the actual situation of Beijing great outer ring road, the road section selection degree model is established. The results show that the three indexes in the generalized topology, the number of sections, the number of nodes and the node degree in the dual topology can well reflect the degree of road selection, and the weights of these three indexes are 0.35, 0.32 and 0.33, respectively.
