首页 | 本学科首页   官方微博 | 高级检索  
     

快速移动目标的瞄准算法和程序实现
引用本文:谢吉刚. 快速移动目标的瞄准算法和程序实现[J]. 电子测试, 2016, 0(17): 88-89. DOI: 10.3969/j.issn.1000-8519.2016.17.042
作者姓名:谢吉刚
作者单位:南京工业职业技术学院计算机与软件学院,江苏南京,210023
基金项目:基于Unity 3D的角色扮演游戏设计与开发;南京工业职业技术学院2014年度重点科研课题(YK14-04-06)
摘    要:在塔防游戏中,对于飞机等快速移动且距离较远的目标,火炮直接向目标射击是不可能命中的.本文在分析炮弹和飞机的运动情况的基础上,提出逐次迭代逼近的方法求解命中点,并将世界坐标系转换到火炮坐标系以简化求解过程,使火炮能够快速指向命中点,最后文章给出了主要的程序实现步骤.

关 键 词:瞄准  迭代  坐标变换

Realization of Algorithm and Program to Aim at the Quickly-moving Object
Abstract:In tower defense game,it's impossible for the artillery to hit directly the objects which are moving quickly and in faraway distance such as aircraft.Based on the analysis of artillery and aircraft movement,the article put forward the method of successive iteration approximation to get the impact point, as well as the transformation from the world coordinate system to artillery coordinate system to simplify the solution process.Using this method,the artillery can quickly point to the impact point.This article also gives the implementation steps of main programs.
Keywords:aim at  iteration  coordinate transformation
本文献已被 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号