A Self-optimization Algorithm of Multi-style Smart Parking Driven by Experience, Knowledge and Data

Huifen Xie, Ze Zhang, K. Song
{"title":"A Self-optimization Algorithm of Multi-style Smart Parking Driven by Experience, Knowledge and Data","authors":"Huifen Xie, Ze Zhang, K. Song","doi":"10.1109/CVCI54083.2021.9661152","DOIUrl":null,"url":null,"abstract":"In this paper, a new algorithm based on experience, knowledge, and data was proposed to address the problems that the traditional automatic parking algorithms, specifically for parallel parking, have large global computing requirements, high real-time computing power requirements, and limit the optimization space. Firstly, a parking operation model based on segmented logic and judgment criteria from the driver’s experience was built for the entire parking process. Secondly, a multi-style evaluation system based on parking knowledge and customer demand was established. It refers to the volatility boundary of the index and uses Technique for Order Preference by Similarity to an Ideal Solution (TOPSIS), Rank Correlation Analysis (G1), and entropy methods to determine the weight distributing model. Finally, based on an optimization test, the data was analyzed and the parameter relationship between variable and index was fit. A rapid self-optimizing algorithm was designed by combining the relation-ship mentioned above with the Particle Swarm Optimization (PSO) algorithm. It has been verified that the algorithm has increased the parking scores of SUVs and light buses at different starting points by 28.35% and 16.68% in 5.77s and 4.72s. Compared with traditional optimization algorithms, the algorithm designed in this paper saves 84.47% and 85.10% of the time. Therefore, the efficiency and adaptability in multiple situations of the rapid self-optimization algorithm have been verified.","PeriodicalId":419836,"journal":{"name":"2021 5th CAA International Conference on Vehicular Control and Intelligence (CVCI)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 5th CAA International Conference on Vehicular Control and Intelligence (CVCI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CVCI54083.2021.9661152","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, a new algorithm based on experience, knowledge, and data was proposed to address the problems that the traditional automatic parking algorithms, specifically for parallel parking, have large global computing requirements, high real-time computing power requirements, and limit the optimization space. Firstly, a parking operation model based on segmented logic and judgment criteria from the driver’s experience was built for the entire parking process. Secondly, a multi-style evaluation system based on parking knowledge and customer demand was established. It refers to the volatility boundary of the index and uses Technique for Order Preference by Similarity to an Ideal Solution (TOPSIS), Rank Correlation Analysis (G1), and entropy methods to determine the weight distributing model. Finally, based on an optimization test, the data was analyzed and the parameter relationship between variable and index was fit. A rapid self-optimizing algorithm was designed by combining the relation-ship mentioned above with the Particle Swarm Optimization (PSO) algorithm. It has been verified that the algorithm has increased the parking scores of SUVs and light buses at different starting points by 28.35% and 16.68% in 5.77s and 4.72s. Compared with traditional optimization algorithms, the algorithm designed in this paper saves 84.47% and 85.10% of the time. Therefore, the efficiency and adaptability in multiple situations of the rapid self-optimization algorithm have been verified.
基于经验、知识和数据的多风格智能停车自优化算法
针对传统自动泊车算法(特别是并行泊车)全局计算量大、实时性要求高、优化空间受限等问题,提出了一种基于经验、知识和数据的新算法。首先,建立了基于分段逻辑和基于驾驶员经验判断标准的停车操作模型。其次,建立了基于停车知识和客户需求的多模式评价体系;它参考指标的波动边界,使用TOPSIS (Order Preference Technique for Similarity to a Ideal Solution)、G1 (Rank Correlation Analysis)和熵值法确定权重分布模型。最后,在优化试验的基础上,对数据进行分析,拟合变量与指标之间的参数关系。将上述关系与粒子群优化(PSO)算法相结合,设计了一种快速自优化算法。经验证,该算法在5.77秒和4.72秒内将suv和小客车在不同起点的停车分数分别提高了28.35%和16.68%。与传统的优化算法相比,本文设计的算法分别节省了84.47%和85.10%的时间。因此,验证了快速自优化算法在多种情况下的效率和适应性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信