一种基于广度优先搜索的移动对象轨迹简化算法  

A moving object trajectory simplification algorithm based on breadth-priority search

作　　者：杨彪 杨智应[1] Yang Biao;Yang Zhiying(School of Informat ion Engineering,Shanghai Maritime University,Shanghai 201306, China)

机构地区：[1]上海海事大学信息工程学院,上海201306

出　　处：《微型机与应用》2017年第21期74-77,共4页Microcomputer & Its Applications

摘　　要：移动对象产生的轨迹数据在许多实际应用中起着至关重要的作用。目前对移动对象轨迹简化方法的研究或多或少依赖轨迹的几何特性。这些方法没有突出移动对象的速度这一重要特征。文章介绍了基于速度的移动对象轨迹简化新方法,提出了基于广度优先搜索算法的多项式时间算法及其优化算法,通过大量实验证明所提出算法在权衡轨迹的简洁性和精确性上比DP算法、SP算法有较大优势。The trajectory data generated by the moving object plays a vital role in many practical applications. At present,the study of the moving object trajectory simplification method is more or less dependent on the geometric characteristics of the trajectory. These methods do not highlight the important feature of the moving speed of the object. In this paper,we introduced a new method to simplify the trajectory of moving objects based on speed,and proposed a polynomial time algorithm based on breadth-first search algorithm and its optimization algorithm.Through a large number of experiments,we proved that the proposed algorithm has a great advantage over the DP algorithm and the SP algorithm in the simplicity and accuracy of the trade-off trajectory.

关 键 词：移动对象 离线轨迹简化 速度阈值 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]