政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/135513
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  全文筆數/總筆數 : 113873/144892 (79%)
造訪人次 : 51935038      線上人數 : 420
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧：
  • 您可在西文檢索詞彙前後加上"雙引號"，以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋，建議至進階搜尋限定作者欄位，可獲得較完整資料
    •  進階搜尋
    政大機構典藏 > 資訊學院 > 資訊科學系 > 會議論文 >  Item 140.119/135513


    請使用永久網址來引用或連結此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/135513


    題名: A Study on the Effectiveness of A2C and A3C Reinforcement Learning in Parking Space Search in Urban Areas Problem
    作者: 張宏慶
    Jang, Hung-Chin
    Huang, Yi-Chen
    Chiu, Hsien-An
    貢獻者: 資科系
    關鍵詞: A2C;A3C;parking space search;reinforcement learning
    日期: 2020-10
    上傳時間: 2021-06-04 14:35:31 (UTC+8)
    摘要: Reinforcement learning (RL) helps to select a strategy to execute by gradually predicting and learning according to the reward or punishment feedback given by the environment after selecting a particular strategy to optimize the benefits. The advantage of this model-free method is that it does not need to understand the environment, nor does it take a long time to build a model, but based on what the environment gives, wait for feedback, and take the next step based on the feedback. Reinforcement learning is also suitable for immediate problem-solving applications. This research uses reinforcement learning to solve the problem of searching for parking spaces in urban areas quickly. The proposed method only needs to set up sensors at the road intersections to sense the vehicles and count the number of vehicles passing through, and the probability of parking vacancy can be estimated based on the length of the road and the number of vehicles entering and exiting the road in a specific time interval. Then through the evaluation results of the policy-based A2C (Advantage Actor-Critic) and A3C (Asynchronous Advantage Actor-Critic), it provides vehicles with the most likely parking routes suggestions. This research uses the traffic flow and parking information of each time period in the road segment of the Taipei city. At last, we compare the expected searching time of A2C and A3C reinforcement learning in the parking space search problem in urban areas.
    關聯: Proceeding of the 11th International Conference on ICT Convergence (ICTC2020), KICS, IEEE ComSoc, IEICE Communications Society
    資料類型: conference
    DOI 連結: https://doi.org/10.1109/ICTC49870.2020.9289269
    DOI: 10.1109/ICTC49870.2020.9289269
    顯示於類別:[資訊科學系] 會議論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    273.pdf1612KbAdobe PDF2257檢視/開啟


    在政大典藏中所有的資料項目都受到原著作權保護.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回饋