Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA Game Theoretic Approach for Parking Spot Search with Limited Parking Lot Information
81
0
0.0
(
0
)
Added by
Yutong Li
Publication date
2020
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
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 layout and the current number of cars in it. Considering the fact that such information is or can be easily made available for many structured parking lots, the proposed approach can be applicable without requiring major updates to existing parking facilities. For large parking lots, a sampling-based strategy is integrated with the proposed approach to overcome the associated computational challenge. The proposed approach is compared against a state-of-the-art heuristic-based parking spot search strategy in the literature through simulation studies and demonstrates its advantage in terms of achieving lower cost function values.
rate research
Read More
We use a new version of the reversible Parking Lot Model to study the compaction of vibrated polydisperse media. The particle sizes are distributed according to a truncated power law. We introduce a self-consistent desorption mechanism with a hierarchical initialization of the system. In this way, we approach densities close to unity. The final density depends on the polydispersity of the system as well as on the initialization and will reach a maximum value for a certain exponent in the power law.
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 fluctuations, and an annealing effect can all be understood by recognizing that two different time scales are present in the problem. One of these scales corresponds to the fast filling of existing voids, the other is associated with collective processes that overcome partial ergodicity breaking. The results of the theory are in a good agreement with simulation data; they provide a simple qualitative picture for understanding recent granular compaction experiments and other glassy systems.
For a foreseeable future, autonomous vehicles (AVs) will operate in traffic together with human-driven vehicles. Their planning and control systems need extensive testing, including early-stage testing in simulations where the interactions among autonomous/human-driven vehicles are represented. Motivated by the need for such simulation tools, we propose a game-theoretic approach to modeling vehicle interactions, in particular, for urban traffic environments with unsignalized intersections. We develop traffic models with heterogeneous (in terms of their driving styles) and interactive vehicles based on our proposed approach, and use them for virtual testing, evaluation, and calibration of AV control systems. For illustration, we consider two AV control approaches, analyze their characteristics and performance based on the simulation results with our developed traffic models, and optimize the parameters of one of them.
Autonomous parking technology is a key concept within autonomous driving research. This paper will propose an imaginative autonomous parking algorithm to solve issues concerned with parking. The proposed algorithm consists of three parts: an imaginative model for anticipating results before parking, an improved rapid-exploring random tree (RRT) for planning a feasible trajectory from a given start point to a parking lot, and a path smoothing module for optimizing the efficiency of parking tasks. Our algorithm is based on a real kinematic vehicle model; which makes it more suitable for algorithm application on real autonomous cars. Furthermore, due to the introduction of the imagination mechanism, the processing speed of our algorithm is ten times faster than that of traditional methods, permitting the realization of real-time planning simultaneously. In order to evaluate the algorithms effectiveness, we have compared our algorithm with traditional RRT, within three different parking scenarios. Ultimately, results show that our algorithm is more stable than traditional RRT and performs better in terms of efficiency and quality.
The objective behind this project is to maximize the efficiency of land space, to decrease the driver stress and frustration, along with a considerable reduction in air pollution. Our contribution is in the form of an automatic parking system that is controlled by cellular phones. The structure is a hexagon shape that uses conveyor belts, to transport the vehicles from the entrance into the parking spaces over an elevating platform. The entrance gate includes length-measuring sensors to determine whether the approaching vehicle is eligible to enter. Our system is controlled through a microcontroller, and using cellular communications to connect to the customer. The project can be applied to different locations and is capable of capacity extensions.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
