基于Bresenham画线原理的游戏追逐算法研究  

Study on Game Chasing Algorithm Based-on Bresenham

作　　者：刘小华[1] 肖正兴[1] 

机构地区：[1]深圳职业技术学院电子与信息工程学院,广东深圳518055

出　　处：《深圳职业技术学院学报》2009年第1期50-53,共4页Journal of Shenzhen Polytechnic

摘　　要：在分析传统游戏追逐算法弊端的基础上,提出修正该弊端的思路,并以Bresenham画线原理为基础,详细阐述了基于Bresenham画线原理的游戏追逐算法的实现过程,该过程结合游戏程序的性能需求和特点,对Bresenham算法进行了改造和简化;该游戏追逐算法和传统游戏追逐算法的追逐效率是相同的,但具有较高的AI级别。文章最后阐述了该追逐算法在追逐速度不为1和猎物本身有一定逃跑速度2种情况下的拓展应用方法。After an analysis of defects of traditional game chasing algorithm, methods of new chasing algorithm is put forward with performance requirement and characteristic of game program taken into account, which improved the original Bresenham. The new algorithm has the same chasing efficiency as the traditional one with higher AI level than the latter. At last, the paper discusses methods of applying the new algorithm to cases in which velocity of predator is not equal to 1 and velocity of prey is not equal to 0.

关 键 词：BRESENHAM 游戏AI 追逐算法 

分 类 号：TP311.1[自动化与计算机技术—计算机软件与理论]