학술논문

基于改进Prim算法的路径规划研究 / Research on path planning based on improved Prim algorithm
Document Type
Academic Journal
Source
现代电子技术 / Modern Electronics Technique. 47(4):176-181
Subject
路径规划
改进Prim算法
聚类分析
二分法
最小生成树
空间复杂度
path planning
improve Prim algorithm
cluster analysis
dichotomy
minimum spanning tree
spatial complexity
Language
Chinese
ISSN
1004-373X
Abstract
文中提出一种基于聚类分析改进Prim(普里姆)最小生成树的路径规划算法,采用二分法将站网中的站点先聚类,分成多个微小的站点聚类中心,再以各聚类中心进行Prim最小生成树的路径规划,量化站网空间分布特征,通过聚类增强最小生成树,达到路径优化的目的.实践结果证明,改进的Prim算法适用于大型稠密的站网,在稠密的连通图中,只要调整指数进而控制聚类中心的数量,就能简化站网布局,降低算法的空间复杂度,达到更好的实际应用.
A path planning algorithm based on clustering analysis to improve the Prim minimum spanning tree is proposed.The dichotomy is used to cluster the stations in the station network to divide them into several small cluster centers,and then the Prim minimum spanning tree path planning with each cluster center is conducted to quantify the spatial distribution characteristics of the station network.By clustering,the minimum spanning tree is enhanced to achieve the goal of the path optimization.The practical results show that the improved Prim algorithm is suitable for large and dense station networks.In dense connected graphs,adjusting the index to control the number of cluster centers can simplify the station network layout,reduce the spatial complexity of the algorithm,and achieve better practical applications.