In accordance with regulations and requirements, the editorial department's website domain has been changed to arocmag.cn. The original domain (arocmag.com) has been redirecting to new domain since Jan. 1st, 2025.

Improved dijkstra's algorithm based on optimized time window for autonomous maglev guided vehicle path planning

Gu Yufeng
Ling Hao
Zhao Yaojing
Li Chengshan
Key Laboratory for Highway Construction Technology & Equipment of Ministry of Education Chang'an University, Xi'an 710016, China

Abstract

Aiming at the characteristics of multi-vehicle operation on the same track and high vehicle density of autonomous maglev, this paper studied a path planning algorithm for maglev based on optimized time window and improved Dijkstra's algorithm, which took into account a series of realistic problems such as path conflict and scheduling cost, and combined Dijkstra's algorithm with the time window to sequentially plan the paths of individual maglevs. Firstly, it pre-processed the map information before path planning, then generated the shortest path index according to the map nodes, and found the paths according to the index. Secondly, it used the time window to check the paths with or without conflicts. Then, analyzed the conflict paths specifically, and changed the speed of vehicle to avoid the obstacle with shorter conflict time, then it avoided the paths replanning, and optimized the order running time on the basis of collision-free. Finally, it used the OpenTCS software to simulate the algorithm. The results show that under the same conditions, the average execution time of the Dijkstra algorithm after optimizing the time window is 0.328ms, and the vehicle running time per kilometer is 36.64s. Under the premise of no conflict paths, it improved the real-time performance of the orders and the vehicle operation efficiency. As the operating kilometers increases, the advantages of the algorithm become increasingly apparent. The algorithm in this paper can meet the requirements of collision-free path planning for autonomous magnetic guided vehicles.

Foundation Support

国家自然科学基金资助项目(52205249)
陕西省自然科学基础研究计划(2022JQ-434)

Publish Information

DOI: 10.19734/j.issn.1001-3695.2024.12.0515
Publish at: Application Research of Computers Accepted Paper, Vol. 42, 2025 No. 7

Publish History

[2025-03-14] Accepted Paper

Cite This Article

古玉锋, 凌浩, 赵耀晶, 等. 优化时间窗改进Dijkstra算法的无人驾驶磁悬浮车路径规划 [J]. 计算机应用研究, 2025, 42 (7). (2025-03-14). https://doi.org/10.19734/j.issn.1001-3695.2024.12.0515. (Gu Yufeng, Ling Hao, Zhao Yaojing, et al. Improved dijkstra's algorithm based on optimized time window for autonomous maglev guided vehicle path planning [J]. Application Research of Computers, 2025, 42 (7). (2025-03-14). https://doi.org/10.19734/j.issn.1001-3695.2024.12.0515. )

About the Journal

  • Application Research of Computers Monthly Journal
  • Journal ID ISSN 1001-3695
    CN  51-1196/TP

Application Research of Computers, founded in 1984, is an academic journal of computing technology sponsored by Sichuan Institute of Computer Sciences under the Science and Technology Department of Sichuan Province.

Aiming at the urgently needed cutting-edge technology in this discipline, Application Research of Computers reflects the mainstream technology, hot technology and the latest development trend of computer application research at home and abroad in a timely manner. The main contents of the journal include high-level academic papers in this discipline, the latest scientific research results and major application results. The contents of the columns involve new theories of computer discipline, basic computer theory, algorithm theory research, algorithm design and analysis, blockchain technology, system software and software engineering technology, pattern recognition and artificial intelligence, architecture, advanced computing, parallel processing, database technology, computer network and communication technology, information security technology, computer image graphics and its latest hot application technology.

Application Research of Computers has many high-level readers and authors, and its readers are mainly senior and middle-level researchers and engineers engaged in the field of computer science, as well as teachers and students majoring in computer science and related majors in colleges and universities. Over the years, the total citation frequency and Web download rate of Application Research of Computers have been ranked among the top of similar academic journals in this discipline, and the academic papers published are highly popular among the readers for their novelty, academics, foresight, orientation and practicality.


Indexed & Evaluation

  • The Second National Periodical Award 100 Key Journals
  • Double Effect Journal of China Journal Formation
  • the Core Journal of China (Peking University 2023 Edition)
  • the Core Journal for Science
  • Chinese Science Citation Database (CSCD) Source Journals
  • RCCSE Chinese Core Academic Journals
  • Journal of China Computer Federation
  • 2020-2022 The World Journal Clout Index (WJCI) Report of Scientific and Technological Periodicals
  • Full-text Source Journal of China Science and Technology Periodicals Database
  • Source Journal of China Academic Journals Comprehensive Evaluation Database
  • Source Journals of China Academic Journals (CD-ROM Version), China Journal Network
  • 2017-2019 China Outstanding Academic Journals with International Influence (Natural Science and Engineering Technology)
  • Source Journal of Top Academic Papers (F5000) Program of China's Excellent Science and Technology Journals
  • Source Journal of China Engineering Technology Electronic Information Network and Electronic Technology Literature Database
  • Source Journal of British Science Digest (INSPEC)
  • Japan Science and Technology Agency (JST) Source Journal
  • Russian Journal of Abstracts (AJ, VINITI) Source Journals
  • Full-text Journal of EBSCO, USA
  • Cambridge Scientific Abstracts (Natural Sciences) (CSA(NS)) core journals
  • Poland Copernicus Index (IC)
  • Ulrichsweb (USA)