ScholarLens Back to search
2011•Jisuanji fangzhenRequires access

Parking Path Optimizationin Parking Lot

Xuan Wu

Open publisher page 0 citations

Abstract

With the widespread popularity of the automobile,the problem of parking guidance in modern large-scale parking lot is more and more prominent.For this problem,a parking lot structure model is built in this paper,and combined with the actual situation,the whole process of parking behavior is divided into two processes: parking into place and taking car from parking lot.The best parking space is chosen according to the total shortest parking guidance path of the two processes.An improved Dijkstra's algorithm is used in VC++6.0 environment simulation.The best parking space and the exact guiding parking paths of parking into place and taking car from parking lot are given out.The blindness in finding a parking space is overcome and the efficiency of parking behavior is improved to a certain extent.

About this research paper

What this paper is about

With the widespread popularity of the automobile,the problem of parking guidance in modern large-scale parking lot is more and more prominent.For this problem,a parking lot structure model is built in this paper,and combined with the actual situation,the whole process of parking behavior is divided into two processes: parking into place and taking car from parking lot.The best parking space is chosen according to the total shortest parking guidance path of the two processes.An improved Dijkstra's algorithm is used in VC++6.0 environment simulation.The best parking space and the exact guiding parking paths of parking into place and taking car from parking lot are given out.The blindness in finding a parking space is overcome and the efficiency of parking behavior is improved to a certain extent.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

With the widespread popularity of the automobile,the problem of parking guidance in modern large-scale parking lot is more and more prominent.For this problem,a parking lot structure model is built in this paper,and combined with the actual situation,the whole process of parking behavior is divided into two processes: parking into place and taking car from parking lot.The best parking space is chosen according to the total shortest parking guidance path of the two processes.An improved Dijkstra's algorithm is used in VC++6.0 environment simulation.The best parking space and the exact guiding parking paths of parking into place and taking car from parking lot are given out.The blindness in finding a parking space is overcome and the efficiency of parking behavior is improved to a certain extent.

Key concepts: Parking guidance and information, Parking lot, Parking space, Dijkstra's algorithm, Guidance system, Transport engineering, Process (computing), Computer science

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Parking Path Optimizationin Parking Lot — Research Paper | ScholarLens