Multi-Robot Path Planning for High-Density Parking Environments Considering Efficiency and Fairness

考虑效率和公平性的高密度停车环境多机器人路径规划

阅读:1

Abstract

As parking congestion at airport parking lots intensifies, high-density parking (HDP) systems with multiple parking robots are gaining attention for improving operational efficiency. However, conventional multi-agent pathfinding (MAPF) methods primarily focus on overall efficiency improvement, often neglecting the priority of individual parking tasks. Additionally, these methods assume robots are ideal agents, resulting in physically infeasible paths for parking robots. We propose a multi-robot path planning approach that balances efficiency and priority. The proposed method improves priority-based search (PBS) by dynamically adjusting priorities, thereby ensuring both operational efficiency and priority of individual vehicles. A simulator replicating a real airport parking environment with 100 parking slots and parking robots under development was implemented to validate the approach. Real-world parking data from an airport was used as input, demonstrating that the proposed autonomous parking system can effectively handle peak-season parking demand. The proposed method achieves a throughput exceeding 41 vehicles per hour with appropriate weight value, meeting the peak-season demand while maintaining acceptable fairness. Our approach provides a practical foundation for establishing time-based parking operation strategies and estimating the number of robots recommended for a given parking scenario.

特别声明

1、本页面内容包含部分的内容是基于公开信息的合理引用;引用内容仅为补充信息,不代表本站立场。

2、若认为本页面引用内容涉及侵权,请及时与本站联系,我们将第一时间处理。

3、其他媒体/个人如需使用本页面原创内容,需注明“来源:[生知库]”并获得授权;使用引用内容的,需自行联系原作者获得许可。

4、投稿及合作请联系:info@biocloudy.com。