Simple parking strategies

  title={Simple parking strategies},
  author={Paul L. Krapivsky and Sidney Redner},
  journal={Journal of Statistical Mechanics: Theory and Experiment},
  • P. Krapivsky, S. Redner
  • Published 14 April 2019
  • Education
  • Journal of Statistical Mechanics: Theory and Experiment
We investigate simple strategies that embody the decisions that one faces when trying to park near a popular destination. Should one park far from the target (destination), where finding a spot is easy, but then be faced with a long walk, or should one attempt to look for a desirable spot close to the target, where spots may be hard to find? We study an idealized parking process on a one-dimensional geometry where the desired target is located at $x=0$, cars enter the system from the right at a… 
Where Should You Park Your Car ? The 12 Rule
We investigate parking in a one-dimensional lot, where cars enter at a rate λ and each attempts to park close to a target at the origin. Parked cars also depart at rate 1. An entering driver cannot
Where to Park Your Car?
When arriving at a popular destination, where should you park your car? Distant parking spots are typically plentiful, but then you must walk a long way. Conversely, looking for a spot close to the
A Game Theoretic Approach for Parking Spot Search with Limited Parking Lot Information
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 and demonstrates its advantage in terms of achieving lower cost function values.
Where should you park your car? The $\frac{1}{2}$ rule
This work investigates parking in a one-dimensional lot, where cars enter at a rate $\lambda$ and each attempts to park close to a target at the origin, and analyzes a class of strategies in which a driver ignores open spots beyond $\tau L$ and tries to park at the first available spot encountered closer than $L$.
Parking Search in the Physical World: Calculating the Search Time by Leveraging Physical and Graph Theoretical Methods
This work frame the parking problem in a mathematically well posed manner which puts the focus on the role of the street network and the unequal attractiveness of parking spaces, and derives a generic mean-field relation giving the parking search time as a function of the occupancy of parking spots.
Mathematics of Parking: Varying Parking Rate
In the classical parking problem, unit intervals (“car lengths”) are placed uniformly at random without overlapping. The process terminates at saturation, i.e. until no more unit intervals can be
Lifetime-Efficient Indoor Guidance for Smart Parking
The proposed lifetime-efficient guidance allows reducing significantly the number of interventions relating to the batteries replacement of IoT parking sensors and push back the fall of the first sensor so extend the parking overall lifetime.
No-boarding buses: Synchronisation for efficiency
A no-boarding policy is investigated in a system of N buses serving M bus stops in a loop, which is an entrainment mechanism to keep buses synchronised in a reasonably staggered configuration and shows that a no- boarding policy can dramatically reduce the average waiting time.
Phase separation induces congestion waves in electric vehicle charging.
This work demonstrates a type of congestion that arises if charging infrastructure is limited or electric vehicle density is high, and shows that the resulting congestion waves always propagate forward in the direction of travel, in contrast to typically backward-propagating congestion waves known from traditional traffic jams.


Intelligent parking systems
Car parking is an issue of significance both at the local and at the strategic level of planning. Parking policy and supply play a major role in the management of transportation systems in dense
Choice of parking: Stated preference approach
Over recent years, parking policy has become a key element of transport policy in many countries. Parking policy measures can affect many different dimensions of travel behaviour but are likely to be
Glassy behavior of the parking lot model
We present a theoretical discussion of the reversible parking problem, which appears to be one of the simplest systems exhibiting glassy behavior. The existence of slow relaxation, nontrivial
Who Solved the Secretary Problem
The object of this article is to give a fresh view of the origins of the problem, touching upon Cayley and Kepler, and review of the field (listing the subfields of recent interest), partly serious (to answer the question posed in the title), and partly entertainment.
Reversible polydisperse parking lot model.
An improved reversible parking lot model is used to study the compaction of vibrated polydisperse media and a self-consistent desorption mechanism with a hierarchical initialization of the system is introduced to approach densities close to unity.
Coverage fluctuations in theater models
We introduce the theater model, which is the simplest variant of directed random sequential adsorption in one dimension with point source and steric interactions. Particles enter sequentially an