摘要
目前对移动对象轨迹简化问题分为离线简化和在线简化。以往的简化方法中许多依赖轨迹的几何特性,而针对移动对象的速度这一重要特征没有足够关注。基于速度研究移动对象轨迹的离线简化新方法,提出了移动对象轨迹离线简化的动态规划算法、基于广度优先搜索的轨迹简化算法及其优化算法、时间复杂度更低的近似算法。通过大量实验验证所提出的算法比基于方向的简化算法和基于位置的简化算法具有更好的简化效率。
At present,the problem of moving object trajectory simplification is divided into offline simplification and online simplification.Many of the previous simplified methods rely on the geometric properties of the trajectory,and the important feature of the velocity of the moving object is not sufficiently concerned.This paper proposed a new method of moving object trajectories based on the new method of off-line simplification,and proposed a dynamic programming algorithm for moving object trajectory off-line,a trajectory simplification algorithm based on breadth-first search and its optimization algorithm,and an algorithm with lower time complexity.And through a large number of experiments to verify the proposed algorithm has a better simplification efficiency than the direction-based simplification algorithm and location-based simplification algorithm.
作者
杨彪
杨智应
Yang Biao;Yang Zhiying(College of Information Engineering,Shanghai Maritime University,Shanghai 201306,China)
出处
《计算机应用研究》
CSCD
北大核心
2018年第9期2666-2670,共5页
Application Research of Computers
关键词
移动对象
离线轨迹简化
速度阈值
近似算法
moving object
offline trajectory simplification
speed threshold
approximation algorithm
作者简介
杨彪(1992-),男,湖北荆州人,硕士,主要研究方向为移动对象轨迹化简(1980068026@qq.com);杨智应(1964-),男,教授,博士,主要研究方向为算法与复杂性、移动计算、分布式计算、软件工程
