Computer and Modernization ›› 2024, Vol. 0 ›› Issue (10): 80-86.doi: 10.3969/j.issn.1006-2475.2024.10.013
Previous Articles Next Articles
Online:
Published:
Abstract: The memory resources provided by embedded systems are very limited. In the calculation of large memory, the problem of low calculation efficiency or even crash often occurs. For this problem, a practical algorithm for nationwide path planning based on embedded systems is designed. The algorithm uses the domestic four-dimensional navigation data as the basic data for generating the navigation planning data model, including: the topological relationship of the basic computing nodes in the sub-map, the sequence list of traffic taboo information, and the connection information between nodes and roads. According to the characteristics of the embedded system, we propose the design based on the idea of key node enrichment to extract the national basic navigation road network, the data scheduling strategy for real-time planning and calculation, and the optimization of the practical two-way Dijkstra algorithm based on the embedded system. The experimental results show that the algorithm in this paper has good performance on embedded systems with limited computing power and computing memory.
Key words: 4 dimensional navigation data, three basic data structures, think of concentration, scheduling strategy, bidirectional Dijkstra optimization
CLC Number:
TP391.9
ZHANG Yongliang1, 2, WANG Jiarun2. National Path Planning Algorithm Based on Embedded System[J]. Computer and Modernization, 2024, 0(10): 80-86.
0 / / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://www.c-a-m.org.cn/EN/10.3969/j.issn.1006-2475.2024.10.013
http://www.c-a-m.org.cn/EN/Y2024/V0/I10/80