Parking Space Path Planning Frameworks Based on Bilevel Programming Planning

The bilevel programming planning can perform hierarchical optimization for two objectives with obvious priorities, which is well suited for application in pathfinding planning scenarios. In this paper, we propose a path planning framework for parking lot reservation pathfinding scenarios. The framework first constructs a real-time allocation model for dynamic parking space reservation based on factual demand data by developing a dynamic parking lot reservation system. Then, it is oriented to low carbon and optimal walking distance and solved using Floyd's algorithm. After that, based on the dynamic reservation real-time allocation model and the bilevel programming planning, the model is simulated and calculated with real cases, which shows that compared with the traditional model, the framework can reduce the carbon emission by about 6.9%-9.2%, and verifies the feasibility and effectiveness of the planning framework.