Finding a parking space in San Francisco City Area is really a headache issue. We try to find a reliable way to give parking information by prediction. We reveals the effect of aggregation on prediction for parking occupancy in San Francisco. Different empirical aggregation levels are tested with several prediction models. Moreover it proposes a sufficient condition leading to prediction error ...

In this paper we present a method for calculation timeoptimal movements for parking of non-holonomic mobile platforms. The parking problem is considered as specialization of the general problem of path planning for nonholonomic robots. This is formulated as a non-linear optimal control problem and solved using advanced numerical methods. The concept of artificial potential field is used for acc...

Considering the condition of small sample sizes, quantifies uncertainty from systematic measurement error, this paper presents an accuracy Comprehensive evaluation method for Auto-Parking System based on bootstrap method. Collecting parking precision data by 8 practical experiments and taking the full use of the various information of limited sample data, we resample from the original samples, ...

Smart Parking Systems obtain information about available parking spaces, process it and then place the car at a certain position. A prototype of the parking assistance system based on the proposed architecture was constructed here. The adopted hardware, software, and implementation solutions in this prototype construction are described in this paper. The effective circular design is introduced ...

Maneuvers of a nonholonomic vehicle in a structured dynamic environment are considered. The paper focuses on motion generation and control methods to autonomously perform lane following/changing and parallel parking maneuvers. Lane following/changing involves the tracking of a nominal trajectory in the traac lane, and the generation and tracking of local lane-changing trajectories, for instance...

Let G be a connected graph with vertex set {0, 1, 2, . . . , n}. We allow G to have multiple edges and loops. In this paper, we give a characterization of external activity by some parameters of G-parking functions. In particular, we give the definition of the bridge vertex of a G-parking function and obtain an expression of the Tutte polynomial TG(x, y) of G in terms of G-parking functions. We...

We propose a new “smart parking” system for an urban environment. The system assigns and reserves an optimal resource (parking space) for a user (driver) based on the user’s objective function that combines proximity to destination and parking cost, while also ensuring that the overall parking capacity is efficiently utilized. Our approach solves a Mixed Integer Linear Program (MILP) problem at...

We propose a “smart parking” system for an urban environment based on a dynamic resource allocation approach. The system assigns and reserves an optimal resource (parking space) for a user (driver) based on the user’s objective function that combines proximity to destination with parking cost, while also ensuring that the overall parking capacity is efficiently utilized. Our approach solves a M...

We propose a novel “smart parking” system for an urban environment. The system assigns and reserves an optimal parking space based on the driver’s cost function that combines proximity to destination and parking cost. Our approach solves a mixed-integer linear programming (MILP) problem at each decision point defined in a time-driven sequence. The solution of each MILP is an optimal allocation ...