Smart Parking Lot Navigation: A Heuristic A* Search Approach for Design of Entry and Exit Algorithms
Summary
No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.
Summarise with VIRAT Free to try with your Science Catalogs account.Abstract
Efficient parking management remains critical due to traffic congestion caused by inefficient slot assignments and exit routing in a parking zone. Increasing volume of traffic generates the need for intelligent and smart parking lot allocation for optimal resource utilization and smart urban planning. This paper presents an intelligent parking navigation framework leveraging a three-stage pathfinding strategy. Initially, synthetic parking layouts are generated using a scripting language and validated for connectivity. A multi-target Dijkstra algorithm assigns vehicles to the nearest available parking slots for vehicle entry process. Upon exit, the system employs heuristic-driven A* search (HD-A*) to find optimal departure paths from restricted exit routes. A bidirectional search procedure enhances the computational complexity of the proposed method. Comparative experiments conducted on synthetic datasets generated on some real world scenario demonstrate that our approach achieves up to 50% reduction in planning time compared to conventional algorithms, while guaranteeing route optimality.
Fields of Study & Subjects
Smart Parking Systems Research
Robotic Path Planning Algorithms
Vehicle Routing Optimization Methods
Publication details
- Journal / source
- International Conference on Intelligent Systems for Communication, IoT and Security (ICISCoIS)
- Pages
- 1–6
- Publication date
- 8 January 2026
- Language
- EN