相关论文: Parking in the city

We study random points on the real line generated by the eigenvalues in unitary invariant random matrix ensembles or by more general repulsive particle systems. As the number of points tends to infinity, we prove convergence of the…

Public charging infrastructure plays a crucial role in the context of electrifying the private mobility sector in particular for urban regions. Against this background, we develop a new mathematical model for the optimal placement of public…

In this work, we propose the use of radar with advanced deep segmentation models to identify open space in parking scenarios. A publically available dataset of radar observations called SCORP was collected. Deep models are evaluated with…

The global electric car sales in 2020 continued to exceed the expectations climbing to over 3 millions and reaching a market share of over 4%. However, uncertainty of generation caused by higher penetration of renewable energies and the…

In this article, we establish new results on the probabilistic parking model (introduced by Durm\'ic, Han, Harris, Ribeiro, and Yin) with $m$ cars and $n$ parking spots and probability parameter $p\in[0,1]$. For any $ m \leq n$ and $p \in…

A parking function of length $n$ is a sequence $\pi=(\pi_1,\dots, \pi_n)$ of positive integers such that if $\lambda_1\leq\cdots\leq \lambda_n$ is the increasing rearrangement of $\pi_1,\dots,\pi_n$, then $\lambda_i\leq i$ for $1\leq i\leq…

We compute the stationary distribution of a continuous-time Markov chain which is constructed by gluing together two finite, irreducible Markov chains by identifying a pair of states of one chain with a pair of states of the other and…

Lane-change maneuver has always been a challenging task for both manual and autonomous driving, especially in an urban setting. In particular, the uncertainty in predicting the behavior of other vehicles on the road leads to indecisive…

Parking problems derive from works in combinatorics by Konheim and Weiss in the 1960s. In a memorable contribution, Lackner and Panholzer (2016) studied parking on a random tree and established a phase transition for this process when \(m…

In this paper we focus on spatial Markov population models, describing the stochastic evolution of populations of agents, explicitly modelling their spatial distribution, representing space as a discrete, finite graph. More specifically, we…

We consider two variations of the discrete car parking problem where at every vertex of the integers a car arrives with rate one, now allowing for parking in two lines. a) The car parks in the first line whenever the vertex and all of its…

Urban traffic congestion, exacerbated by inefficient parking management and cruising for parking, significantly hampers mobility and sustainability in smart cities. Drivers often face delays searching for parking spaces, influenced by…

In this paper, we develop a method to detect vacant parking spaces in an environment with unclear segments and contours with the help of MATLAB image processing capabilities. Due to the anomalies present in the parking spaces, such as…

Mitigating traffic congestion on urban roads, with paramount importance in urban development and reduction of energy consumption and air pollution, depends on our ability to foresee road usage and traffic conditions pertaining to the…

Suppose that $m$ drivers each choose a preferred parking space in a linear car park with $n$ spots. In order, each driver goes to their chosen spot and parks there if possible, and otherwise takes the next available spot if it exists. If…

The displacement of a car with respect to a parking function is the number of spots it must drive past its preferred spot in order to park. An $\ell$-interval parking function is one in which each car has displacement at most $\ell$. Among…

We present a class of iterative fully distributed fixed point methods to solve a system of linear equations, such that each agent in the network holds one of the equations of the system. Under a generic directed, strongly connected network,…

We investigate 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. Parked cars also depart at rate 1. An entering driver cannot see beyond the parked cars for…

Discrete-time discrete-state finite Markov chains are versatile mathematical models for a wide range of real-life stochastic processes. One of most common tasks in studies of Markov chains is computation of the stationary distribution.…

In recent years, we have witnessed a remarkable surge of usage in shared vehicles in our cities. Shared mobility offers a future of no congestion in busy city roads with increasing populations of travelers, passengers, and drivers. Given…