期刊文献+

基于A*算法的汽车总线拓扑图自动绘制设计

Automatic Drawing Design of Automobile Bus Topology Diagram Based on A* Algorithm
下载PDF
导出
摘要 为了适应现代汽车通信系统日益复杂化的需求,消除汽车总线拓扑图因人工绘制带来的出错隐患,提升研发效率,文章提出了一种基于A*算法的汽车总线拓扑图的自动绘制设计方案。首先,文章提炼出实际工程项目中拓扑图绘制所需要素,随后梳理拓扑图自动绘制流程,最后使用A*算法优化节点与网段间连线过程。基于某车实际通信系统,同传统人工绘制比较,验证了本设计可在保证清晰、美观、准确的同时,显著提高汽车总线拓扑图的绘制效率。 To adapt to the increasingly complex requirements of modern automobile communication systems,eliminate the hidden dangers of errors caused by manual drawing of automobile bus topology diagram,and improve research and development efficiency,this paper proposes an automatic drawing design scheme of automobile bus topology diagram based on A*algorithm.Firstly,this paper extracts the elements needed for topological graph drawing in actual engineering projects,then combs the automatic drawing process of topological graph,and finally uses A*algorithm to optimize the connection process between nodes and network segments.Based on the actual communication system of a car,compared with the traditional manual drawing,it is verified that this design can significantly improve the drawing efficiency of the automobile bus topology while ensuring clear,beautiful and accurate.
作者 郑生文 卢利宁 李志文 ZHENG Shengwen;LU Lining;LI Zhiwen(Asin Auto R&D Company Limited,Changsha 410000,China)
出处 《汽车实用技术》 2024年第6期124-130,共7页 Automobile Applied Technology
关键词 汽车总线 拓扑图绘制 A*算法 软件设计 Automobile bus Topology diagram drawing A*algorithm Software development
  • 相关文献

参考文献5

二级参考文献36

  • 1段海滨,王道波,朱家强,黄向华.蚁群算法理论及应用研究的进展[J].控制与决策,2004,19(12):1321-1326. 被引量:211
  • 2王娜.移动机器人拓扑地图创建研究[D].山东:山东大学,2009.
  • 3Oommen B, lyengar S, Rao N S V, et al. Robot Navigation in Unknown Terrains Using Learned Visibility Graphs[J]. IEEE Journal of Robotics and Automation, 1987, 3(6): 672-681.
  • 4Choset H, Burdick J. Sensor Based Planning, Part I: The Generalized Voronoi Graph[C]//Proc. of IEEE International Conference on Robotics and Automation. [S. 1.]: IEEE Press, 1995: 1643-1648.
  • 5Parsons D, Canny J F. A Motion Planner for Multiple Mobile Robots[C]//Proc. of IEEE Intemational Conference on Robotics and Automation. [S. 1.]: IEEE Press, 1990: 8-13.
  • 6Liu Yunhui, Arimoto S. Computation of the Tangent Graph of Polygonal Obstacles by Moving-line Processing[J]. IEEE Transactions on Robotics and Automation, 1994, 10(6): 823-830.
  • 7Papadatos A. Research on Motion Planning of AutonomousMobile Robot[D]. Monterey, USA: Naval Postgraduate School, 1996.
  • 8Stentz A. The Focussed D* Algorithm for Real-time Re- planning[C]//Proc, of the 14th International Joint Conference on Artificial Intelligence. San Francisco, USA: ACM Press, 1995: 1652-1659.
  • 9Daniel K, Nash A, Koenig S, et al. Theta*: Any-angle Path Planning on Grids[J]. Journal of Artificial Intelligence Research, 2010, 39(1): 533-579.
  • 10Bote A, Mtiller M, Schaeffer J. Near Optimal Hierarchical Path-finding[J]. Journal of Game Development, 2004, 1(1): 7-28.

共引文献50

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部