首页> 外文会议>Brazilian Conference on Intelligent Systems >Grouping Similar Trajectories for Carpooling Purposes
【24h】

Grouping Similar Trajectories for Carpooling Purposes

机译:为拼车目的将相似的轨迹分组

获取原文

摘要

Vehicle congestion is a serious concern in metropolitan areas. Some policies have been adopted in order to soften the problem: construction of alternative routes, encouragement for the use of bicycles, improvement on public transportation, among others. A practice that might help is carpooling. Carpooling consists in sharing private vehicle space among people with similar trajectories. Although there exist some software initiatives to facilitate the carpooling practice, none of them actually provides some key facilities such as searching for people with similar trajectories. The way in which such a trajectory is represented is also central. In the specific context of carpooling, the use of Points of Interest (POI) as a method for trajectory discretization is rather relevant. In this paper, we consider that and other assumptions to propose an innovative approach to generate trajectory clusters for carpooling purposes, based on Optics algorithm. We also propose a new similarity measure for trajectories. Two experiments have been performed in order to prove the feasibility of the approach. Furthermore, we compare our approach with K-means and Optics. Results have showed that the proposed approach has results similar for Davies-Boulding index (DBI).
机译:在大都市地区,车辆拥堵是一个严重的问题。为了缓解这一问题,已采取了一些政策:修建替代路线,鼓励使用自行车,改善公共交通等。一种可能有用的做法是拼车。拼车是指在轨迹相似的人之间共享私家车空间。尽管有一些软件计划可以促进拼车实践,但是它们实际上都没有提供一些关键功能,例如搜索具有相似轨迹的人。这种轨迹的表示方式也很重要。在拼车的特定环境中,使用兴趣点(POI)作为轨迹离散化的方法非常重要。在本文中,我们认为该假设和其他假设提出了一种基于光学算法的创新方法来生成用于拼车目的的轨迹簇。我们还为轨迹提出了一种新的相似性度量。为了证明该方法的可行性,已经进行了两个实验。此外,我们将我们的方法与K均值和光学进行了比较。结果表明,所提出的方法对于Davies-Boulding指数(DBI)具有相似的结果。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号