排序方式: 共有11条查询结果,搜索用时 15 毫秒
1.
2.
3.
传统的DBSCAN聚类算法是基于密度的聚类算法,原始算法在搜索精度和搜索效率上存在一定的局限性。基于LUX4线激光雷达数据点的点云特点,结合DBSCAN算法存在的不足与路面目标物的实际情况,提出了1种基于改进的DBSCAN聚类算法,选取4个代表点取代对所有点的搜索和改进搜索半径使其随扫描的距离而变化的方法,实现激光雷达目标物的快速、准确检测。通过改进DBSCAN算法对雷达数据进行去噪声和聚类处理,根据检测物在激光雷达探测中的形状特征模型进行形状匹配。实验结果表明该改进算法能较好的识别出目标物,行人检测率由原始算法的61.90%提高到了80.95%,搜索时间较原始算法缩短了44.7%,解决了原始算法精度低、搜索慢的缺点。 相似文献
4.
5.
作为传统公交车的有力补充,需求响应式公交的出现为人们提供了解决问题的新思路,它能够即时采集乘客出行需求信息,确定走行路线,提供个性化定制服务。但自需求响应式公交运营以来,步行距离长、候车时间久等问题也日益凸显,极大地影响了乘客的出行体验。文章充分考虑乘客的步行距离及等待时间成本,基于DBSCAN算法、K-means算法,就需求响应式公交合乘站点布设问题进行研究,采用启发式插入算法对建立的软时间窗、多车队模型进行求解。可以实现对具有时间窗空间分散点的聚类及路径规划,对优化需求响应式公交的乘客出行体验,提高车辆上座率具有重要意义。 相似文献
6.
7.
出租车的载客轨迹直接体现了车辆的行驶状态和居民的出行规律,热点载客路径的挖掘为交通管理与规划,居民行为模式发现及出租车载客推荐等具有重要价值. 本文以兰州市3 000 辆出租车载客轨迹为研究对象,提出了基于时空相似性聚类的热点载客路径挖掘算法. 首先,根据出租车的GPS轨迹数据提取出载客轨迹及其核心轨迹;然后,根据提出的相似性度量算法计算核心轨迹的空间相似性、时间相似性及时空相似性,并结合DBSCAN聚类算法对载客轨迹进行聚类;最后,根据聚类结果获取城市热点载客路径的空间分布,并分析了其在工作日和非工作日的差异. 实验结果表明,本文提出的挖掘算法能有效、快速地发现城市热点载客路径的分布. 相似文献
8.
为更好地监测船舶动态和船舶在港口的作业情况,通过对K-Means算法和DBSCAN(Density-Based Spa-tial Clustering of Applications with Noise)密度聚类算法进行对比,选择DBSCAN密度聚类算法对港口泊位进行聚类,对港口泊位的位置和大小进行识别.基于船舶自动... 相似文献
9.
出租车的载客轨迹直接体现了车辆的行驶状态和居民的出行规律,热点载客路径的挖掘为交通管理与规划,居民行为模式发现及出租车载客推荐等具有重要价值. 本文以兰州市3 000 辆出租车载客轨迹为研究对象,提出了基于时空相似性聚类的热点载客路径挖掘算法. 首先,根据出租车的GPS轨迹数据提取出载客轨迹及其核心轨迹;然后,根据提出的相似性度量算法计算核心轨迹的空间相似性、时间相似性及时空相似性,并结合DBSCAN聚类算法对载客轨迹进行聚类;最后,根据聚类结果获取城市热点载客路径的空间分布,并分析了其在工作日和非工作日的差异. 实验结果表明,本文提出的挖掘算法能有效、快速地发现城市热点载客路径的分布. 相似文献
10.
This paper presents a trajectory clustering method to discover spatial and temporal travel patterns in a traffic network. The study focuses on identifying spatially distinct traffic flow groups using trajectory clustering and investigating temporal traffic patterns of each spatial group. The main contribution of this paper is the development of a systematic framework for clustering and classifying vehicle trajectory data, which does not require a pre-processing step known as map-matching and directly applies to trajectory data without requiring the information on the underlying road network. The framework consists of four steps: similarity measurement, trajectory clustering, generation of cluster representative subsequences, and trajectory classification. First, we propose the use of the Longest Common Subsequence (LCS) between two vehicle trajectories as their similarity measure, assuming that the extent to which vehicles’ routes overlap indicates the level of closeness and relatedness as well as potential interactions between these vehicles. We then extend a density-based clustering algorithm, DBSCAN, to incorporate the LCS-based distance in our trajectory clustering problem. The output of the proposed clustering approach is a few spatially distinct traffic stream clusters, which together provide an informative and succinct representation of major network traffic streams. Next, we introduce the notion of Cluster Representative Subsequence (CRS), which reflects dense road segments shared by trajectories belonging to a given traffic stream cluster, and present the procedure of generating a set of CRSs by merging the pairwise LCSs via hierarchical agglomerative clustering. The CRSs are then used in the trajectory classification step to measure the similarity between a new trajectory and a cluster. The proposed framework is demonstrated using actual vehicle trajectory data collected from New York City, USA. A simple experiment was performed to illustrate the use of the proposed spatial traffic stream clustering in application areas such as network-level traffic flow pattern analysis and travel time reliability analysis. 相似文献