期刊文献+

基于实时定位的城市巷战训练系统 被引量:2

Training system of city street battle based on real-time location
下载PDF
导出
摘要 为提高城市巷战训练中信息化和自动化水平,实现城市巷战训练效果的立体化展示并便于教官全面客观地评价,提出一种利用RFID及其相关技术构建城市巷战训练系统的方案。以实时RFID定位技术、滤波技术和事件检测技术为依托,分析研究城市巷战训练系统的总体构架和关键技术,介绍实时RFID定位算法、滤波算法和事件检测等核心技术并提出相应解决方案。通过该系统的实际应用验证了其可行性。 To improve the information technology of city street battle training,to achieve the display of city street battle training effectively and to facilitate instructors to evaluate the training and give objective scores,aprogram using RFID and related technologies were proposed to build city street battle training system.Based on RFID real-time location technology,filter technology and real-time event detection technology,the overall architecture and key technologies of city street battle training system were analyzed.Real-time RFID positioning algorithm,filtering algorithms and event detection and other core technical issues were detailed.The practical application of the city street battle training system verifies its feasibility.
出处 《计算机工程与设计》 北大核心 2015年第10期2866-2871,共6页 Computer Engineering and Design
关键词 城市巷战 射频识别 实时RFID定位 滤波 事件检测 city street battle RFID real-time RFID location filter event detection
  • 相关文献

参考文献2

二级参考文献7

  • 1王涛,李伟生.低代价最短路径树的快速算法[J].软件学报,2004,15(5):660-665. 被引量:29
  • 2Dijkstra E. A note on two problems in connection with graphs[J]. Numerical Mathematic, 1959 (1): 269-271. 被引量:1
  • 3Zhang Baoxian, Mouftah H T. A destination-driven shortest path tree algorithm [C] //Proc of the 2002 IEEE Int Conf on Communication. Piscataway, NJ: IEEE, 2002:2258-2261. 被引量:1
  • 4Hiroshi F, Kenneth J C. The new shortest best path tree (SBPT) algorithm for dynamic multicast trees [C] //Proc of the 24th IEEE Int Conf on Local Computer Networks. Piscataway, NJ: IEEE, 1999:204-210. 被引量:1
  • 5Anees S, Kang S. Destination-driven routing for low-cost multicast [J]. IEEE Journal on Selected Areas in Communications, 1997, 15(3): 373-381. 被引量:1
  • 6Salama H F. Multicast routing for real-time communication on high-speed networks [D]. Carolina: North Carolina State University, 1996. 被引量:1
  • 7Xue G, et al. Finding a path subject to many additive QoS constraints [J]. IEEE/ACM Trans on Networking, 2007, 15 (1) :201-211. 被引量:1

共引文献6

同被引文献18

引证文献2

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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