期刊文献+

大面积三维场景中的无人机碰撞检测快速算法

A Effective Collision Detection Algorithm for UAV in Large 3D Scene
下载PDF
导出
摘要 无人机实时监控与驾驶员模拟训练系统的三维可视化子系统具有计算无人机与其他物体 (包括山脉、树木、建筑物等 )碰撞可能性、具体碰撞点、碰撞方向和碰撞力量的功能。但无人机测控系统中的三维场景可视面积很大 ,场景中的物体数量庞大 ,至使碰撞检测的运算量很大 ,因而会大幅度降低三维场景的实时性。因此 ,设计快速有效的碰撞检查算法十分必要。作者设计的快速算法快速有效 。 One of the major functions of the 3D visualization sub-system of the UAV (Unmanned Aerial Vehicle)TT&C and operator training simulation system is used to detect the collision between the UAV and the surrounding objects (such as mountations,trees and buildings).Because of the area in the 3D scene of the UAV TT&C system is very wide,and there is a large number of objects,collision detection will spend much time and reduce the fresh rate of the 3D scene.So,it is necessary to design a effective collision detection algorithm.The algorithm presented in this paper can be used to detect the collision rapidly and effectively.
作者 赵刚 张晓林
出处 《遥测遥控》 2003年第4期52-55,共4页 Journal of Telemetry,Tracking and Command
关键词 三维场景 碰撞检查 快速算法 遥测 D scene Collision detection Effective algorithm Telemetry
  • 相关文献

参考文献2

二级参考文献15

  • 1[1]Cameron S A.Collision detection by four-dimensional intersection testing[J].IEEE Trans Robotics and Automat,1990;6(3):291-302
  • 2[2]Hubbard P M.Collision Detection for Interactive Graphics Applications[J].IEEE Trans Visualization and Computer Graphics, 1995; 1 (3):218-230
  • 3[3]Bouma H' ,Vanecek G.Collision detection and analysis in a physical based simulation[C]Jn:Eurographies Workshop on Animation and Simu lation ,Vienna, 1991:191
  • 4[4]Thomas F,Torras C.Interference detection between non-convex polyhedra revisited with a practical aim[ClAn:Proceedings of the IEEE International Conference on Robotics and Automation,San Diegn,CA,1994: 587-594
  • 5[5]Chazelle B,Palios L. Decomposition algorithms in geometry[C].In :Bajaj C,ed.Algebraie Geometry and its Applications, Berlin Springer: 1994:419-447
  • 6[6]Boyse JW.lnterference detection among solids and surfaces[J].Communication of the Association of the Computing Machinery, 1979;22( 1 ):3-9
  • 7[7]Lin MC.Canny JF.A fast algorithm for incremental distance calcula-tion[C].In :Proceedings of the IEEE International Conference nn Ro-botics and Automation,Sacramento,CA, 1991: 1008-1014
  • 8[8]Chazelle B.Convex partitions of polyhedra:a lower bound and a worstcase optimal algorithm[J].SIAM Journal on Computing, 1984; 13:488-507
  • 9[9]Bajaj C,Dey T. Convex decomposition of polyhedra and robustness[J]. SIAM Journal on Computing, 1992;21(2) :339-364
  • 10[10]Gottschalk S,Lin M,Manocha D.OBB-Tree:A Hierarchical Structure for Rapid Interference Detection[C].In:Proceedings of ACM S1GGRA-PH 96, New Orlean: LA, 1996:171 - 180

共引文献35

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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