期刊文献+

海上失事飞机黑匣子定位分析与建模 被引量:1

Analysis and Modeling of the Sea Crashed Aircraft Black Box Positioning
下载PDF
导出
摘要 寻找海上失事坠落飞机,其中一项重要工作便是寻找黑匣子踪迹。文章分析了海上失事飞机黑匣子落水点的定位、沉降点以及黑匣子搜寻等问题,并采用物理力学和运动学模型、微分方程模型、广度优先搜索算法模型对这些问题进行建模和求解。MATLAB仿真结果表明该模型思路清晰、通用性强,适用于常规状态下失事飞机黑匣子搜寻。 Search for the whereabouts of the crashed aircraft at sea, one of the important work is to find the black box. In this paper, we analyze the problem of the black box, the settlement point and the black box search. The model of physical mechanics and kinematics, differential equation and breadth first search algorithm are used to solve these problems. MATLAB simulation results show that the proposed model is clear and versatile, and can be used in different models, different search engines and different sea area. Provide ideas and a good method for searching the black box of the crashed aircraft at sea.
作者 解瑞云 赵欣莹 XIE Rui-yun(Department of Computer Science and Technology,Henan Institute of Technology,Xinxiang 453003,China)
出处 《河南机电高等专科学校学报》 CAS 2018年第4期18-22,共5页 Journal of Henan Mechanical and Electrical Engineering College
关键词 黑匣子 建模 微分方程 广度优先搜索算法 black box modeling differential equation breadth first search algorithm
  • 相关文献

参考文献3

二级参考文献24

  • 1肖业伦 金长江.大气扰动中的飞行原理[M].北京:国防工业出版社,1993..
  • 2Kulkarni M, Burtscher M, Inkulu R, et al. How much parallelism is there in irregular applications [C]. In Proceedings of the 14th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP'09, 2009 :3-14.
  • 3Hassaan M A, Burtscher M, Pingali K. Ordered vs. unordered: a comparison of parallelism and work-efficiency in irregular algorithms[C]. In Proceedings of the 16th ACM Symposium on Principles and Practice of Parallel Programming,PPoPP'l1 ,2011 :3-12.
  • 4Harish P, Narayanan P J. Accelerating large graph algorithms on the gpu using cuda [C]. In Proceedings of the 14 th International Conference on High Performance Computing, HiPC' 07, 2007: 197-208.
  • 5Deng Y S, Wang B D, Mu S. Taming irregular eda applications on gpus [C]. In Proceedings of the 2009 International Conference on Computer-Aided Design, ICCAD '09, 2009: 539-546.
  • 6Pingali K, Kulkarni M, Nguyen D, et al. Amorphous data-parallelism in irregular algorithms [R]. TR-09-05, 2009.
  • 7Scarpazza D, Villa 0, Petrini F. Efficient breadth-first search on the cell/be processor[J]. IEEE Transactions on Parallel and Distributed Systems, 2008, 19 (10) : 1381-1395.
  • 8Luo L, Wong M, Hwu W M. An effective gpu implementation of breadth-first search [C]. In Design Automation Conference (DAC) , 2010 47th ACWIEEE, 2010: 52-55.
  • 9Lefohn A E, Kniss J, Strzodka R, et al. Glift: generic, efficient, random access gpu data structures [J]. ACM Transactions on Graphics, 2006,25 (1 ) : 60-99.
  • 10Harish P, Vineet V, Narayanan P J. Large graph algorithms for massively multithreaded architectures [R J. IIIT/TRl2009/74, 2009.

共引文献6

同被引文献2

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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