重庆理工大学学报2025，Vol.39Issue(5)：93-100,8.DOI:10.3969/j.issn.1674-8425(z).2025.03.012
智能推盘车库邻域逐步多空位存取算法研究
Neighborhood sequential multi-escort retrieval algorithm for intelligent puzzle-based parking system
摘要
Abstract
Along with urbanization and a growing number of vehicles,the shortage of parking space has become increasingly prominent.Traditional parking lots fail to meet the demand for high-density parking in urban areas.As a new parking solution,intelligent puzzle-based parking systems have emerged to maximize the utilization of parking space.However,the access process of intelligent puzzle-based parking system is complex.Moreover,reducing both time and costs is a critical challenge.To address these issues,we propose a neighborhood sequential multi-escort retrieval algorithm to reduce the number of moves and cut the access time.Our results show our algorithm effectively reduces the average number of moves,improves the access efficiency of intelligent puzzle-based parking system,thereby enhancing its applicability.关键词
智能推盘车库/存取算法/并行移动/移动步数Key words
intelligent puzzle-based parking system/retrieval algorithm/parallel movement/number of moves分类
计算机与自动化引用本文复制引用
魏衍行,谷帅悌,刘铭启,刚宪约..智能推盘车库邻域逐步多空位存取算法研究[J].重庆理工大学学报,2025,39(5):93-100,8.基金项目
山东省自然科学基金项目(ZR2020ME140) （ZR2020ME140）
