Shaher Alshammrei¹, Sahbi Boubaker^2,*, Lioua Kolsi^1,3

CMC-Computers, Materials & Continua, Vol.72, No.3, pp. 5939-5954, 2022, DOI:10.32604/cmc.2022.028165

Abstract 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… More >

Haolong Yang¹, Chunqiang Hu¹, Guwei Li^2,*, Jingchun Fan³

Computer Systems Science and Engineering, Vol.39, No.3, pp. 365-372, 2021, DOI:10.32604/csse.2021.016377

Abstract Despite the support of all kinds of fire prevention measures and high-tech fire prevention equipment, fires still occur frequently because of both anthropogenic factors and natural disasters. This issue has drawn the attention of schools, all levels of government, and other organizations. Many types of organizations 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… More >