Abstract In this paper the problem of guiding car drivers to parking facilities in an urban in termodal transportation network is considered. Origin-Destination (O-D) shortest paths are determined in different situations, corresponding to possible constraints in the network, while looking for available parking spaces. Presently, time, transit, and parking capacity constraints are considered. The proposed approach, which is based on a Constraint Satisfaction Problem (CSP) formalism, allows the integration of the parking management and the multimodal path planning. In particular, if no parking space is available within a “walking neighbourhood” of the required destination, the shortest O-D path is computed both on the private and on the public transportation networks.
A DSS Prototype for Urban Intermodal Path Planning with Parking Management
1996-01-01
19 pages
Aufsatz/Kapitel (Buch)
Elektronische Ressource
Englisch
A DSS Prototype for Urban Intermodal Path Planning with Parking Management
British Library Conference Proceedings | 1996
|OBSTACLE AVOIDANCE METHOD IN AUTOMATIC PARKING PATH PLANNING AND PARKING PATH PLANNING SYSTEM
Europäisches Patentamt | 2021
|Obstacle avoidance method for automatic parking path planning and parking path planning system
Europäisches Patentamt | 2020
|Parking path planning method, parking method and device
Europäisches Patentamt | 2023
|