中大機構典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/89645
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 80990/80990 (100%)
Visitors : 41647644      Online Users : 2282
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/89645


    Title: 基於聚類演算法之車用電子地圖繪製技術研究;Research of Vehicle Electronic Mapping Technology based on Clustering Algorithm
    Authors: 譚正功;Tan, Cheng-Kung
    Contributors: 通訊工程學系
    Keywords: 非監督式學習演算法;聚類分析;unsupervised learning algorithm;clustering algorithm analysis;K-means;DBSCAN
    Date: 2022-07-14
    Issue Date: 2022-10-04 11:50:48 (UTC+8)
    Publisher: 國立中央大學
    Abstract: 由於近年來電動車、自駕車的科技技術演進,利用車用感測器快速探測障礙 物成為近期熱門討論的話題。車用感測器對於車用輔助系統例如主動式巡航定速 系統(Adaptive Cruise Control, ACC)、自動緊急煞車系統(Autonomous Emergency Braking, AEB)、自動停車系統(Automatic Parking System, APS)等有著重大的幫 助。
    在本篇論文中,將會先介紹聚類演算法,從中挑選兩種類別(劃分法及密度 法)後再選出兩種方法:一、劃分法_K-平均演算法(K-means),二、密度法_ 基於密度的聚類演算法(Density-based spatial clustering of applications with noise, DBSCAN)。將兩種方法分別的介紹及說明其運作流程,接著完成初步模擬的結 果圖,最後再來判斷是否適合用於車用電子聚類演算法。
    最終,選擇了 DBSCAN 來完成聚類演算法用於地圖繪製技術的可行性研究, 透過 C 程式語言以及 OpenGL 開放式圖型庫,成功模擬出障礙物位置的聚類結 果,以及完成區分雜訊的效果。證實 DBSCAN 演算法適合當作車用電子聚類演 算法的其中一種。
    ;Due to the technological evolution of electric vehicles and self-driving cars in recent years, the use of to instantly detect obstacles has become a hot topic of discussion nowadays. Vehicle sensors are in a great help of Advanced Driver Assistance System (ADAS); for instance, Adaptive Cruise Control (ACC), Autonomous Emergency Braking (AEB), Automatic Parking System (APS), etc.
    In this study, the clustering algorithm will be introduced first, from which two categories will be selected: division method and density method; then, two methods will be selected from those two categories: 1. K-means algorithm (K-means) 2. Density- based clustering algorithm (Density-based spatial clustering of applications with noise, DBSCAN). From the following paragraph, first of all, these two methods will be introduced and explained respectively. Then, the result diagram of the preliminary simulation will be completed. Last, the result diagram of K-means and DBSCAN will be analyzed whether it is suitable for the vehicle electronic clustering algorithm.
    In the end, DBSCAN was selected to complete the feasibility study on using clustering algorithm for mapping technology. Through the C Programming Language and the OpenGL (Open Graphics Library), the clustering results of the obstacle positions were successfully simulated, and the method of distinguishing the noise was completed. It is confirmed that the DBSCAN algorithm is suitable as one of the vehicle electronic clustering algorithms.
    Appears in Collections:[Graduate Institute of Communication Engineering] Electronic Thesis & Dissertation

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML43View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明