期刊文献+

一种基于简化可视图的建图和规划方法 被引量:1

A Mapping and Planning Method Based on Simplified Visibility Graph
下载PDF
导出
摘要 当前车辆路径规划大部分是基于栅格地图的规划方法,这种方法在搜索面积较大时计算量也会大幅增加。相比之下,基于可视图的方法能够在路径搜索时减小计算量,但是受到障碍物复杂程度的影响较大。针对这一问题,本文结合SLAM和可视图的方法,提出了一种简化可视图的建图和规划方法。首先使用改进的SLAM算法生成点云地图,并进行动态障碍物的剔除。接着生成可视图,并基于障碍物的大小和顶点处内凹角的大小对可视图中多边形的复杂边缘进行简化,剔除冗余的顶点。最后通过仿真和实车实验证明,该方法相对原有的算法,在保证建图精度的情况下,可视图中多边形的顶点数量减少20%~30%,地图更新时间和整体算法的运行时间减少30%以上。这表明本文方法能够有效减小建图和规划过程的计算量和算法的运行时间。 Most of the current vehicle route planning is based on the grid map planning method,which will greatly increase the amount of calculation when the search area is large.In contrast,the method based on visibility graph can reduce the amount of calculation during path search,but is greatly affected by the complexity of obsta-cles.For this problem,combining the SLAM and visibility graph methods,a simplified visibility graph construction and planning method is proposed in this paper.Firstly,the improved SLAM algorithm is used to generate point cloud maps,and dynamic obstacles are removed.Then a visibility graph is generated,and the complex edges of polygons in the visibility graph are simplified based on the size of the obstacle and the size of the concave angle at the vertex to eliminate redundant vertices.Finally,through simulation experiments and real vehicle experiments,it is proved that compared with the original algorithm,this method can reduce the number of polygon vertices in the visibility graph by 20%-30%while ensuring the accuracy of mapping.The map update time and the running time of the overall algorithm are also reduced by more than 30%.It shows that the method in this paper can effectively re-duce the amount of calculation and the running time of the algorithm in the mapping and planning process.
作者 范晓临 张旭东 邹渊 尹鑫 刘颖群 Fan Xiaolin;Zhang Xudong;Zou Yuan;Yin Xin;Liu Yingqun(School of Mechanical Engineering,Beijing Institute of Technology,Beijing 100081;Shanghai Hanrun Automotive Electronics Co.,Ltd.,Shanghai 201601)
出处 《汽车工程》 EI CSCD 北大核心 2024年第7期1249-1258,共10页 Automotive Engineering
基金 北京市科协金桥工程、北京市自然科学基金(3212013) 中国汽车工程学会青年托举人才项目(YESS20200301)资助。
关键词 可视图 路径规划 SLAM 智能车辆 visibility graph path planning SLAM intelligent vehicle
  • 相关文献

参考文献2

二级参考文献25

  • 1姚克明,刘燕斌,陆宇平,郭豫荣.火星探测无人机建模与拉起平飞控制[J].南京理工大学学报,2013,37(6):950-954. 被引量:2
  • 2Oommen 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.
  • 3Choset 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.
  • 4Parsons 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.
  • 5Liu 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.
  • 6Papadatos A. Research on Motion Planning of AutonomousMobile Robot[D]. Monterey, USA: Naval Postgraduate School, 1996.
  • 7Stentz 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.
  • 8Daniel 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.
  • 9Bote A, Mtiller M, Schaeffer J. Near Optimal Hierarchical Path-finding[J]. Journal of Game Development, 2004, 1(1): 7-28.
  • 10Lozano P T, Wesley M A. An Algorithm for Planning Collision-flee Paths Among Polyhedral Obstacles[J]. Communications of the ACM, 1979, 22(10): 560-570.

共引文献45

同被引文献16

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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