Related papers: Parking on the integers
Real-time parking occupancy information is critical for a parking management system to facilitate drivers to park more efficiently. Recent advances in connected and automated vehicle technologies enable sensor-equipped cars (probe cars) to…
In this paper, the parking problem of a swarm of mobile robots has been studied. The robots are deployed at the nodes of an infinite grid, which has a subset of prefixed nodes marked as parking nodes. Each parking node p_i has a capacity of…
We introduce the class of bilateral parking procedures on the integer line. While cars try to park in the nearest available spot to their right in the classical case, we consider more general parking rules that allow cars to use the nearest…
In congested urban areas, it remains a pressing challenge to reduce unnecessary vehicle circling for parking while at the same time maximize parking space utilization. In observance of new information technologies that have become readily…
The excessive search for parking, known as cruising, generates pollution and congestion. Cities are looking for approaches that will reduce the negative impact associated with searching for parking. However, adequately measuring the number…
With the number of vehicles continuously increasing, parking monitoring and analysis are becoming a substantial feature of modern cities. In this study, we present a methodology to monitor car parking areas and to analyze their occupancy in…
Public road authorities and private mobility service providers need information derived from the current and predicted traffic states to act upon the daily urban system and its spatial and temporal dynamics. In this research, a real-time…
We introduce parking assortments, a generalization of parking functions with cars of assorted lengths. In this setting, there are $n\in\mathbb{N}$ cars of lengths $\mathbf{y}=(y_1,y_2,\ldots,y_n)\in\mathbb{N}^n$ entering a one-way street…
In urban environments, parking has proven to be a significant source of congestion and inefficiency. In this study, we propose a methodology that offers a systematic solution to minimize the time spent by drivers in finding parking spaces.…
Parking functions correspond with preferences of $n$ cars which enter sequentially to park on a one-way street where (1) each car parks in the first available spot greater than or equal to its preference and (2) all cars successfully park.…
Smart-parking solutions use sensors, cameras, and data analysis to improve parking efficiency and reduce traffic congestion. Computer vision-based methods have been used extensively in recent years to tackle the problem of parking lot…
This article proposes two different approaches to automatically create a map for valid on-street car parking spaces. For this, we use car sharing park-out events data. The first one uses spatial aggregation and the second a machine learning…
We propose a game theoretic approach to address the problem of searching for available parking spots in a parking lot and picking the ``optimal'' one to park. The approach exploits limited information provided by the parking lot, i.e., its…
All over the world, especially in the university environment, planning managers and traffic engineers are constantly faced with the problem of inadequate allocation of car parking spaces to demanded users. Users could either prefer reserved…
Automated parking requires accurate localization for quick and precise maneuvering in tight spaces. While the longitudinal velocity can be measured using wheel encoders, the estimation of the lateral velocity remains a key challenge due to…
Consider a rooted tree on the top of which we let cars arrive on its vertices. Each car tries to park on its arriving vertex but if it is already occupied, it drives towards the root of the tree and parks as soon as possible. In this…
We study several deterministic one-dimensional traffic models. For integer positions and velocities we find the typical high and low density phases separated by a simple transition. If positions and velocities are continuous variables the…
Parking in large metropolitan areas is often a time-consuming task with further implications toward traffic patterns that affect urban landscaping. Reducing the premium space needed for parking has led to the development of automated…
We study a variant of the R\'enyi parking problem in which car length is repeatedly halved and determine the rate at which the remaining space decays.
In this paper, we investigate the parking process on a uniform random rooted binary tree with $n$ vertices. Viewing each vertex as a single parking space, a random number of cars independently arrive at and attempt to park on each vertex…