期刊文献+

基于黎曼流形的野外综合地形路径规划方法

Path Planning Method for ComprehensiveWild Terrain Based on Riemannian Manifold
下载PDF
导出
摘要 在野外综合地形上实现路径规划具有较大的现实意义,它需综合考虑高程、地表覆盖分类、植被密度和风向等多种行进阻力。针对此类多阻力要素下的全局路径规划问题,目前的方案由于欧式距离空间的限制,无法给出此类问题的统一数学表达,使得在各向同性、各向异性阻力并存的情况下,求解系统较为混乱。从黎曼流形的视角来看待大地表面,便可以导出能够反映局部信息的黎曼度量,并导出广义测地距离(综合寻路代价)形成距离空间,从而给出此类问题具备一定的推广性的统一数学表达形式,能够十分贴切地反映野外行进的现实情况与需求。以此为基础,使用改进热方法给出森林火灾逃生路径规划问题的求解,作为野外综合路径规划应用实例。 It is of great practical significance to realize the path planning on the comprehensive wild terrain.It needs to consider various travel resistances such as elevation,land cover classification,vegetation density and wind direction.For the global path planning problem under such multi-resistance elements,the current solution cannot give a unified mathematical expression for this kind of problem due to the limitation of the Euclidean distance space.This makes the solution system chaotic,especially under the coexistence of isotropic and anisotropic resistances.Viewing the Earth’s surface from the perspective of a Riemannian manifold,the Riemannian metric that reflects local information and the generalized geodesic distance(comprehensive pathfinding cost)that helps form a distance spacecan be derived,thus giving a generalization for such problems.The unified mathematical expression reflects the actual situation and needs of field travelprecisely.Based on this,the improved heat method is used to solve the forest fire escape path planning problem as an application example of path planning on the comprehensive wild terrain.
作者 王帅 刘向阳 WANG Shuai;LIU Xiangyang(College of Science,Hohai University,Nanjing 211100,China)
机构地区 河海大学理学院
出处 《计算机工程与应用》 CSCD 北大核心 2023年第7期92-101,共10页 Computer Engineering and Applications
关键词 黎曼流形 测地距离 路径规划 LIDAR点云 Riemannian manifold geodesic distance path planning LiDAR points cloud
  • 相关文献

参考文献1

二级参考文献13

  • 1Arun K S,Huang T S,Blostein S D.Least-squares fitting of two 3-D point sets. IEEE Transactions on Pattern Analysis and Machine Intelligence . 1987
  • 2Rusinkiewicz S,Levoy M.Efficient variants of the ICP algorithm. Third International Conference on 3-D Digi- tal Imaging and Modeling . 2001
  • 3Dror Aiger,Niloy J. Mitra,Daniel Cohen-Or.4-points congruent sets for robust pairwise surface registration[J]. ACM Transactions on Graphics (TOG) . 2008 (3)
  • 4Helmut Pottmann,Stefan Leopoldseder,Michael Hofer.Registration without ICP[J]. Computer Vision and Image Understanding . 2004 (1)
  • 5Agarwal,Sharir.The Number of Congruent Simplices in a Point Set[J]. Discrete & Computational Geometry . 2002 (2)
  • 6Gérard Blais,Martin D. Levine.Registering Multiview Range Data to Create 3D Computer Objects. IEEE Transactions on Pattern Analysis and Machine Intelligence . 1995
  • 7Kung S Y,Arun K S,Rao D V B.State space and SVD based approximation methods for the harmonic retrieval problem. Journal of the Optical Society of America . 1983
  • 8Martin A. Fischler,Robert C. Bolles.Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography. Communications of the ACM . 1981
  • 9Chen Y,Medioni G.Object modeling by registration of multiple range images. Proceedings of the 1991 IEEE International Conference on Robotics and Automation . 1991
  • 10Chen, Chu-Song,Hung, Yi-Ping,Cheng, Jen-Bo.RANSAC-based DARCES: A new approach to fast automatic registration of partially overlapping range images. IEEE Transactions on Pattern Analysis and Machine Intelligence . 1999

共引文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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