• • 上一篇    下一篇

网络虚拟环境中两运动物体安全避障互寻相遇的一种算法及实现

唐文政%白成杰   

  • 基金资助:
    国家自然科学基金[61340019]、山东省自然科学基金(ZR2012FM029)

An Algorithm and Implementation of Two Moving Objects Find and Meet Each Other and Avoid Obstacle Safely in Network Virtual Environment

TANG Wen-zheng%BAI Cheng-jie   

  • About author:山东师范大学物理与电子科学学院,山东济南,250014

摘要: 文章提出了一种在网络虚拟环境中两运动物体安全避障互寻相遇的方法。已知两个运动物体的初始位置,通过碰撞检测算法、相互寻找算法以及相遇判定算法,判断两物体是否相遇,模拟两物体移动的路线,准确定位两物体的相遇地点并记录互寻路线图。该算法能够准确定位两运动物体相遇的位置,确定安全避障后相遇的路线。

Abstract: The article puts forward a method to ifnd a path between two moving objects which can ifnd and meet each other and avoid obstacles safely in network virtual environment. Having known the initial positions of the two moving objects, with the collision detection algorithm, the ifnd-each-other algorithm and the meet-decision algorithm, the system can judge whether the two objects meet each other, and locate accurately the meeting place and record the route map by simulating the walking routes of the two objects. The algorithm can locate accurately the meeting position and look for the route effectively in network virtual environment.