scholarly journals Anti-Congestion Route Planning Scheme Based on Dijkstra Algorithm for Automatic Valet Parking System

2019 ◽  
Vol 9 (23) ◽  
pp. 5016 ◽  
Author(s):  
Yu ◽  
Jiang ◽  
Hua
Keyword(s):  
Intelligent Transportation System ◽  
New Technology ◽  
Influence Factors ◽  
Route Planning ◽  
Parking Space ◽  
Dijkstra Algorithm ◽  
Static State ◽  
Shortest Route ◽  
Planning Scheme ◽  
Parking Lot

Based on the Dijkstra algorithm, with the parking parameters in the static state, the shortest route to each parking space of the parking lot without dynamic influence factors can be calculated. In the new technology background of the combination of the V2X environment and driverless technology, the dynamic influence factors, for example, the lanes occupancy situation caused by parking, can be considered to improve the shortest route with the new scheme in this paper. Then the final route that costs the least time to reach each parking space will be calculated. This is very important for the development of the intelligent transportation system in the parking lot environment.

scholarly journals Design and Implementation of the Optimization Algorithm in the Layout of Parking Lot Guidance

2021 ◽  
Vol 2021 ◽  
pp. 1-6
Author(s):  
Zhendong Liu ◽  
Dongyan Li ◽  
Yurong Yang ◽  
Xi Chen ◽  
Xinrong Lv ◽  
...  
Keyword(s):  
Optimization Algorithm ◽  
Guidance System ◽  
Parking Space ◽  
Dijkstra Algorithm ◽  
Parking Lots ◽  
Design And Implementation ◽  
Parking Lot ◽  
Big Cities

The information guidance system for parking spaces in large- and medium-sized parking lots is not efficient at present. It tends to be difficult to find an empty parking space in parking lots in big cities. One of the problems is the large amount of calculation in the traditional Dijkstra algorithm. In this paper, an improved Dijkstra algorithm is presented and optimized to find the best parking path with the purpose of looking for the nearest free parking space based on the layout model in parking lot parking guidance. The experiments show that the improved Dijkstra algorithm can find the optimal parking space and the optimal parking path and improve the parking efficiency.

scholarly journals A Routing Algorithm Based on Zigbee Technology

2018 ◽  
Vol 14 (11) ◽  
pp. 90 ◽  
Author(s):  
Xieji Gang
Keyword(s):  
Routing Algorithm ◽  
Route Planning ◽  
Utilization Rate ◽  
Parking Space ◽  
Filtering Algorithm ◽  
Zigbee Technology ◽  
Parking System ◽  
Parking Lot ◽  
The Status ◽  
Urban Parking

To realize the exploration of A routing algorithm for ZigBee technology, a kind of intelligent parking system based on ZigBee wireless sensor network is designed, and the parking space is managed by online and offline interaction. First of all, the status of parking at home and abroad is studied, and the demand for parking is analyzed. Secondly, the intelligent scheme of parking system is studied, including parking guidance technology and parking space intelligent recommendation technology. The former is based on the A routing algorithm to search the shortest path, and uses Unity for route planning simulation, and the latter is based on collaboration filtering algorithm to discuss the recommendation method of similar parking spaces. The result shows that the prototype of an intelligent parking system based on ZigBee is eventually realized, and the functions of online viewing, online parking reservation, online path planning and parking guidance are realized. As a result, the purpose of managing offline parking spaces through online is achieved, the utilization rate of resources in the existing parking lot is improved and the use rate of parking space is promoted. At last, it effectively alleviates the urban parking chaos and has certain application value.

scholarly journals Optimization design and evaluation of parking route based on automatic assignment mechanism of parking lot

2017 ◽  
Vol 9 (7) ◽  
pp. 168781401771241 ◽  
Author(s):  
Yan Han ◽  
Jiawen Shan ◽  
Meng Wang ◽  
Guang Yang
Keyword(s):  
Optimization Design ◽  
Causal Chain ◽  
Walking Distance ◽  
Parking Space ◽  
Dijkstra Algorithm ◽  
Automatic Assignment ◽  
Traffic Conflicts ◽  
Parking Lot ◽  
Individual Demand ◽  
The Individual

The congestion causes of parking lot were analyzed with causal chain method and a questionnaire about individual demand of parking users was carried out. The results show that more than 90% of the users hope parking spaces can be automatically assigned to them when it’s difficult to find a parking space. The layout principles of WiFi in parking lot were provided. The automatic assignment mechanism of parking lot was given considering the individual demand of parking users and the avoidance of traffic conflicts. Some attribute decision factors such as lane occupancy conditions, travel distance, walking distance, and the occupancy situation of parking space on both sides were selected and optimal parking lot assignment model was established. Optimal paths were calculated through Dijkstra algorithm, and the information about the assignment location and path was sent to the drivers’ cell phones. The driver’s compliance was evaluated by comparing the driver’s parking trajectory with system recommended path. Finally, a large parking lot in Beijing was taken as an example. The results can offer constructive suggestions on parking route design and parking assignment mechanism, which can make the use of the limited parking resources more effectively.

scholarly journals Automated Parking Space Allocation during Transition with both Human-Operated and Autonomous Vehicles

2021 ◽  
Vol 11 (2) ◽  
pp. 855
Author(s):  
Mingkang Wu ◽  
Haobin Jiang ◽  
Chin-An Tan
Keyword(s):  
Autonomous Vehicles ◽  
Transition Period ◽  
Search Algorithm ◽  
Parking Space ◽  
Key Factors ◽  
Comprehensive Method ◽  
Space Allocation ◽  
Shortest Distance ◽  
Parking Lot ◽  
Ranking Order

As fully automated valet parking systems are being developed, there is a transition period during which both human-operated vehicles (HVs) and autonomous vehicles (AVs) are present in the same parking infrastructure. This paper addresses the problem of allocation of a parking space to an AV without conflicting with the parking space chosen by the driver of a HV. A comprehensive assessment of the key factors that affect the preference and choice of a driver for a parking space is established by the fuzzy comprehensive method. The algorithm then generates a ranking order of the available parking spaces to first predict the driver’s choice of parking space and then allocate a space for the AV. The Floyd algorithm of shortest distance is used to determine the route for the AV to reach its parking space. The proposed allocation and search algorithm is applied to the examples of a parking lot with three designed scenarios. It is shown that parking space can be reasonably allocated for AVs.

scholarly journals THE PREDICTION OF PARKING SPACE AVAILABILITY

Transport ◽  
2020 ◽  
Vol 35 (5) ◽  
pp. 462-473
Author(s):  
Helena Brožová ◽  
Miroslav Růžička
Keyword(s):  
Real Time ◽  
Personal Communication ◽  
Navigation Systems ◽  
Parking Space ◽  
Transition Matrices ◽  
Communication Services ◽  
Proposed Model ◽  
Harmful Emissions ◽  
Parking Lot ◽  
Car Park

Intelligent Parking Systems (IPS) allow customers to select a car park according to their preferences, rapidly park their vehicle without searching for the available parking space (place) or even book their place in advance avoiding queues. IPS provides the possibility to reduce the wastage of fuel (energy) while finding a parking place and consequently reduce harmful emissions. Some systems interact with in-vehicle navigation systems and provide users with information in real-time such as free places available at a given parking lot (car park), the location and parking fees. Few of these systems, however, provide information on the forecasted utilisation at specific time. This paper describes results of a traffic survey carried out at the parking lot of supermarket and the proposal of the model predicting real-time parking space availability based on these surveyed data. The proposed model is formulated as the non-homogenous Markov chains that are used as a tool for the forecasting of parking space availability. The transition matrices are calculated for different time periods, which allow for and include different drivers’ behaviour and expectations. The proposed forecasting model is adequate for potential use by IPS with the support of different communication means such as the internet, navigation systems (GPS, Galileo etc.) and personal communication services (mobile-phones).

scholarly journals Implementasi Honey Bee Mating Optimization Pada Vehicle Routing Problem With Time Windows Dalam Perencanaan Jalur Wisata Malang

Repositor ◽  
2020 ◽  
Vol 2 (4) ◽  
pp. 495
Author(s):  
M Syawaluddin Putra Jaya ◽  
Yufiz Azhar ◽  
Nur Hayatin
Keyword(s):  
Honey Bee ◽  
Royal Jelly ◽  
Time Windows ◽  
Route Planning ◽  
Routing Problem ◽  
Capacity Limit ◽  
Shortest Route ◽  
Mutation Ratio ◽  
Bee Colonies ◽  
Honey Bee Mating Optimization

Abstrak Vahicle Routing Problem adalah suatu masalah pencaian jalur yang akan dilalui dengan tujuan mencari rute yang paling cepat atau pendek. Vahicle Routing Problem with Time Windows (VRPTW) yang merupakan sebutan bagi VRP dengan kendala tambahan berupa adanya time windows pada masing-masing pelanggan yang dalam hal ini berupa destinasi wisata. Dalam penelitian ini diterapkan Honey Bee Mating Optimization (HBMO) dalam menyelesaikan VRPTW. HBMO sendiri terinspirasi oleh perilaku koloni lebah ketika bereproduksi. Algoritma tersebut bertujuan untuk mengevaluasi pencarian individu atau solusi terbaik. Tujuan dari penelitian ini adalah bagaimana mengimplementasikan Honey Bee Mating Optimization dalam menyelesaikan VRPTW pada perencanaan jalur wisata di Malang. Sehingga dapat meminimumkan waktu dan jarak tempuh perjalanan. Berdasarkan hasil pengujian, parameter yang optimal untuk optimasi VRPTW menggunakan HBMO pada kasus perencannan jalur wisata Malang yaitu dengan menggunakan 800 generasi, populasi lebah jantan sebesar 300, batas kapasitas spermatheca sejumlah 100, nilai mutation ratio (Pm) dan royal jelly masing-masing bernilai 0.5.Abstract Vahicle Routing Problem is a problem of finding the best route that will be passed with the purpose to finding the fastest or shortest route. Vahicle Routing Problem with Time Windows (VRPTW) is a part of VRP with additional obstacles in the form of time windows in each customer. In this research, Honey Bee Mating Optimization (HBMO) was applied to completing VRPTW. HBMO itself was inspired by the behavior of bee colonies when reproducing. The purpose of this algorithm is to evaluate the best individual or the best solutions. The purpose of this research is how to implement Honey Bee Mating Optimization to completing VRPTW in Malang tourism route planning. So that it can minimize travel time and distance. Based on the results of the testing, the optimal parameters for VRPTW optimization using HBMO in Malang tourism route planning case are using 800 generations, the male bee population is 300, the capacity limit of spermatheca is 100, the mutation ratio (Pm) and royal jelly are respectively 0.5.

scholarly journals Smart Parking Guidance System on IoT

2019 ◽  
Vol 8 (2S11) ◽  
pp. 2793-2798 ◽  
Keyword(s):  
Video Processing ◽  
Guidance System ◽  
Raspberry Pi ◽  
Parking Space ◽  
Shopping Malls ◽  
Public Facilities ◽  
Parking System ◽  
Parking Lot ◽  
Smart Parking ◽  
Haar Cascade

Nowadays, smart parking guidance system is a crucial research for people’s convenience where the integrating concept of IoT that include hardware and software with the connection of internet for image or video processing technology is a powerful application which made up a complete smart parking system. The main objective of this research is to develop and analyze on a smart parking guidance system where current available system was compared to this new proposed system. Limited parking space has become serious issue since the number of Malaysia’s populations are using car keep increasing. Some of the big companies, shopping malls and other public facilities already deployed a smart parking system on their building. However, there are still a lot of buildings that do not own it because the system required a lot of investment, where the huge parking areas need higher cost to install sensors on each parking lot available and cameras are costly and lower in reliability. The proposed smart parking guidance system in this research was depending on a 360° camera that was modified on Raspberry Pi camera module and 360o lens that process with De-Warping techniques for the normal view rather than 360-degree view and Haar-Cascade classifier. The image and video processing was done by Open CV and python program to detect the available parking space and cloud firebase was used to update data where users can access the parking space availability by android mobile phone specifically at a closed parking space. A single 360°camera was replaced several sensors and cameras which were implemented on traditional parking guidance system. In the end of the paper, it is proved that prototype based smart parking is the convenient way to find the parking space availability.

Sign in / Sign up

Export Citation Format

Share Document