CN112687110B - Parking space level navigation method and system based on big data analysis - Google Patents

Parking space level navigation method and system based on big data analysis Download PDF

Info

Publication number
CN112687110B
CN112687110B CN202011541535.1A CN202011541535A CN112687110B CN 112687110 B CN112687110 B CN 112687110B CN 202011541535 A CN202011541535 A CN 202011541535A CN 112687110 B CN112687110 B CN 112687110B
Authority
CN
China
Prior art keywords
parking
vehicle
parking space
data
time
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202011541535.1A
Other languages
Chinese (zh)
Other versions
CN112687110A (en
Inventor
严春波
丁兴华
吕静波
曹健
严单君磊
徐颖
王玲
刘雯婷
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Jiangsu Gaoli Parking Technology Co ltd
Original Assignee
Jiangsu Gaoli Parking Technology Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Jiangsu Gaoli Parking Technology Co ltd filed Critical Jiangsu Gaoli Parking Technology Co ltd
Priority to CN202011541535.1A priority Critical patent/CN112687110B/en
Publication of CN112687110A publication Critical patent/CN112687110A/en
Application granted granted Critical
Publication of CN112687110B publication Critical patent/CN112687110B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Traffic Control Systems (AREA)

Abstract

The invention discloses a parking space level navigation method and a system thereof based on big data analysis, comprising the following steps: acquiring daily vehicle in-out data, wherein the vehicle in-out-in data at least comprises license plate numbers, entry time, departure time, parking cost and parking space numbers; performing modeling analysis on the daily vehicle in-out database; and scheduling the vehicle parking according to the modeling analysis result. According to the invention, the daily parking data is systematically analyzed in a big data mode, the schedulable number of empty parking spaces is dynamically submitted to the parking space scheduling system, and the redundant empty parking spaces are distributed to the outside under the condition of ensuring the sufficiency of daily parking spaces, so that the overall use efficiency of the garage is improved. The parking space dispatching system can perform manual intervention, does not perform parking space distribution in a certain time period, deals with emergency situations, improves management flexibility, achieves reasonable dispatching of vehicles, improves the utilization rate of parked vehicles, and facilitates parking of vehicle owners.

Description

Parking space level navigation method and system based on big data analysis
Technical Field
The invention relates to the technical field of big data analysis and processing, in particular to a parking space level navigation method and system based on big data analysis.
Background
The parking lot is a place for parking vehicles. The parking lot has a simple parking lot without management and charge by drawing parking spaces, and also has a charge parking lot with entrance and exit gates, a parking manager and a time-keeping cashier. Modern parking lots often have automated time-based toll collection systems, closed-circuit televisions, and video recorder systems. The legal responsibilities of the parking lot owner and the administrator are usually only provided for the driving person to park the vehicle, the damage and the vehicle loss responsibilities are not guaranteed, and generally, the legal responsibilities are attached to the exemption terms outside the parking lot gate and are referred by the owner.
However, the existing parking lot can not reasonably schedule vehicles by combining parking data (license plate number, entrance time, departure time, parking duration, parking cost and parking space number) in the parking lot so as to improve the utilization rate of the parked vehicles and facilitate the parking of car owners. For example, the use conditions of the garage in daytime and at night every day are analyzed according to big data, and under the condition that the vacant parking spaces in the garage are redundant, the system automatically allocates parking spaces with a certain proportion to be used for outside through the result of parking space analysis, so that the use efficiency is maximized. And a certain proportion of parking spaces can be analyzed by daily parking data, a small part of parking spaces are reserved under the condition that the daily parking spaces are enough to be parked, and other parking spaces are automatically distributed by the system for external use.
Disclosure of Invention
In view of the above-mentioned defects in the prior art, the technical problem to be solved by the present invention is to provide a parking space level navigation method and system based on big data analysis, so as to solve the deficiencies in the prior art.
In order to achieve the purpose, the invention provides a parking space level navigation method based on big data analysis, which comprises the following steps: acquiring daily vehicle in-out data, wherein the vehicle in-out-in data comprises license plate numbers, entry time, departure time, parking cost and parking space numbers; modeling and analyzing the daily vehicle in-out database; according to the modeling analysis result, scheduling the vehicle parking; when the parking spaces are scheduled to guide the vehicle to park, an optimal navigation line is drawn on the map by using a shortest path algorithm on the map according to the current position of the mobile terminal and the target parking space.
The modeling analysis of the daily vehicle in-out-of-warehouse data is modeled from the following dimensions: dimension of parking duration: counting the parking time of each vehicle, and classifying the data according to the parking time to obtain the proportion of the parking time of the user in each stage and the average parking time; dimension of parking period: counting the number of vehicles scattered in 24 hours by taking the entering time and the leaving time as analysis bases, and analyzing the time point of the largest number of parked vehicles in one day; meanwhile, the parking amount of a specific date is analyzed to be compared with the usual parking amount, and the data change of the specific date is analyzed, wherein the specific date is weekend or holiday; parking vehicle identity dimension: analyzing the attribution of the vehicle according to the license plate number; dimension of parking space utilization rate: according to the parking records, the utilization rates of the parking spaces in the time periods are analyzed according to the statistics of the parking spaces in the time periods of one year, half year, one month and one day.
Scheduling the vehicle parking, including manual intervention allocation and automatic allocation of vacant parking spaces;
the manual intervention allocation of the vacant parking spaces is to manually allocate the redundant vacant parking spaces to the car owners within a certain time period, or not to manually allocate some parking spaces to the car owners within a certain time period so as to reserve emergency standby;
the automatic allocation of the vacant parking spaces is the allocation of optimal distances to all the vacant parking spaces, and when the license plate number of a user is scanned at the entrance of the parking lot, one vacant parking space closest to the entrance is automatically allocated.
When the license plate number of the user is scanned at the entrance of the parking lot, a vacant parking space closest to the entrance is automatically allocated, and the method specifically comprises the following steps: a rectangular coordinate system is established by the vehicle position, then the coordinates (0, 0) of the vehicle are set as L1, L2 \8230, 8230, LN, the linear distance between the vehicle and each vacant parking space is set as X1, Y1, (X2, Y2) \8230, 8230and (XN, YN), then according to the Pythagorean theorem:
L1=sqrt(X1 2 +Y1 2 ),L2=sqrt(X2 2 +Y2 2 )……LN=sqrt(XN 2 +YN 2 ),
then L1, L2 \8230; LN are compared, and the smallest is recommended to the user as the shortest distance.
The data of the vacant parking spaces are collected through a parking space camera; and the vehicle entrance and exit data are collected through an RFID (radio frequency identification) identifier or an electric railing at the vehicle entrance and exit.
And recognizing and collecting the license plate through the parking space camera, and when the parking space automatically distributed by the system is occupied by other vehicles, the system recommends a new parking space for the current vehicle owner according to a scheduling method and provides an indoor navigation line.
The guide user goes to the target parking stall, and at the in-process of guide, the target parking stall is occupied, and a vacant parking stall is recommended again to the system, catches through the camera on the parking stall, and when the camera was found the parking stall state and changed, can transmit the server through the network with information, and the server can revise the state of current parking stall, recommends a vacant parking stall simultaneously to through the propelling movement agreement notice of removing the end at present mobile terminal who navigates to, change the route.
Drawing a parking lot by using a map, regarding each fork road as a vertex, regarding a road between the fork roads as an edge, and regarding the length of the road as the weight of the edge; if the path is a one-way path, drawing a directed edge between the two vertexes; if the road is a double-way road, drawing two edges with different directions between two vertexes, and abstracting the whole map into a directed weighted map; the shortest path algorithm is specifically as follows:
step 1: regarding the initial point on the graph as a set S, regarding other points as another set;
step 2: according to the initial point, calculating the distance d [ i ] from other points to the initial point; if adjacent, d [ i ]
Is the edge weight value; if not, then di is infinite;
and step 3: selecting the smallest di and recording as d [ x ], recording the point corresponding to the di side as x, adding the set S, wherein the d [ x ] value of the point added to the set is the shortest distance from the point to the initial point;
and 4, step 4: and updating the value of d [ y ] of the point y adjacent to the x according to the x: d [ y ] = min { d [ y ], d [ x ] + edge weight w [ x ] [ y ] }, since the distance may be adjusted smaller, this update operation is called a relaxation operation;
and 5: and repeating the step 3 and the step 4 until the target point is added with the set, wherein the d [ i ] corresponding to the target point is the shortest path length.
A system for dispatching parking spaces based on big data analysis comprises
The system comprises a parking data acquisition module, a parking data acquisition module and a parking data processing module, wherein the parking data acquisition module is used for acquiring daily vehicle in and out warehouse data, and the vehicle in and out warehouse data comprises license plate numbers, entry time, departure time, parking duration, parking cost and parking space numbers;
the parking data analysis module is used for carrying out modeling analysis on the vehicle in-out database data every day;
the parking scheduling module is used for scheduling the vehicle parking according to the modeling analysis result;
and the optimal navigation route generation module is used for drawing an optimal navigation route on the map by using a shortest path algorithm on the map according to the current position of the mobile terminal and the target parking space when the parking space is scheduled to guide the vehicle to park.
The parking data acquisition module is an RFID recognizer arranged at the entrance and the exit of each parking garage or an electric railing arranged at the entrance and the exit of a vehicle, and a plurality of cameras arranged in the parking garage.
The invention has the beneficial effects that:
according to the invention, the daily parking data is systematically analyzed in a big data mode, the operation condition of the parking lot parking space number in each time period is counted through data modeling, the parking space vacancy data is submitted to the parking space scheduling system, the holiday and each time period can be analyzed, and the schedulable vacancy parking space number is dynamically submitted to the parking space scheduling system. The parking space dispatching system is provided with a set of distribution mode for the empty parking spaces, under the condition that the daily parking spaces are enough, the unnecessary empty parking spaces are distributed outwards, and the overall use efficiency of the garage is improved. The parking space dispatching system can perform manual intervention, does not perform parking space distribution in a certain time period, deals with emergency situations, improves management flexibility, achieves reasonable dispatching of vehicles, improves the utilization rate of parked vehicles, and facilitates parking of vehicle owners.
The conception, specific structure and technical effects of the present invention will be further described in conjunction with the accompanying drawings to fully understand the purpose, characteristics and effects of the present invention.
Drawings
FIG. 1 is a schematic view of a parking space site configuration of the present invention;
FIG. 2 is a functional block diagram of the parking control system of the present invention;
FIG. 3 is a system framework diagram of the present invention;
FIG. 4 is a flow chart of a method of the present invention;
fig. 5 is an optimal navigation route diagram.
Detailed Description
As shown in fig. 4, the invention provides a parking space level navigation method based on big data analysis, which comprises the following steps:
acquiring daily vehicle in-out database data, wherein the vehicle in-out database data at least comprises license plate numbers, entry time, departure time, parking duration, parking cost and parking space numbers;
carrying out modeling analysis on daily vehicle in-out database data;
according to the modeling analysis result, scheduling the vehicle parking;
when the parking spaces are scheduled to guide the vehicle to park, an optimal navigation line is drawn on the map by using a shortest path algorithm on the map according to the current position of the mobile terminal and the target parking space.
In this embodiment, modeling analysis is performed on daily vehicle warehousing/ex-warehouse data to model from the following dimensions:
dimension of parking duration: counting the parking time of each vehicle, and classifying the data according to the parking time to obtain the proportion of the parking time of the user in each stage and the average parking time;
dimension of parking period: counting the number of vehicles scattered in 24 hours by taking the entering time and the leaving time as analysis bases, and analyzing the time point of the largest number of parked vehicles in one day; meanwhile, analyzing the parking amount of a specific date to compare with the normal date, and analyzing the data change of the specific date, wherein the specific date is weekend or holiday;
parking vehicle identity dimension: analyzing the attribution of the vehicle according to the license plate number;
dimension of parking space utilization rate: according to the parking records, the utilization rate in the parking space time period is analyzed by counting the parking spaces in the time periods of one year, half year, one month and one day respectively.
In the embodiment, the vehicle parking is scheduled, and the scheduling comprises manual intervention allocation and automatic allocation of vacant parking spaces;
manually intervening and allocating the vacant parking spaces, namely manually allocating the redundant vacant parking spaces to the car owners within a certain time period, or not manually allocating some parking spaces to the car owners within a certain time period to reserve emergency standby;
the automatic allocation of the vacant parking spaces is the allocation of optimal distances to all the vacant parking spaces, and when the license plate number of a user is scanned at the entrance of the parking lot, one vacant parking space closest to the entrance is automatically allocated.
In this embodiment, when the license plate number of the user is scanned at the entrance of the parking lot, a vacant parking space closest to the entrance is automatically allocated, specifically according to the following algorithm: a rectangular coordinate system is established by the vehicle position, then the coordinates (0, 0) of the vehicle are set as L1, L2 \8230 \ 8230, LN, the linear distance from the vehicle to each vacant parking space is set as 8230, the coordinates (X1, Y1), (X2, Y2) \8230 \ 8230and (XN, YN) of the vacant parking spaces are set as follows according to the Pythagorean theorem:
L1=sqrt(X1 2 +Y1 2 ),L2=sqrt(X2 2 +Y2 2 )……LN=sqrt(XN 2 +YN 2 ),
then L1, L2 \8230; LN are compared, and the smallest is recommended to the user as the shortest distance.
In this embodiment, the data of vacant parking stall is gathered through the camera.
In this embodiment, the vehicle warehouse entry and exit data is collected through an RFID identifier or an electric railing at the vehicle entrance and exit.
Referring to fig. 5, a parking lot is mapped, each intersection is regarded as a vertex, a road between each intersection is regarded as an edge, and the length of the road is the weight of the edge; if the path is a one-way path, drawing a directed edge between the two vertexes; if the road is a double-row road, drawing two edges with different directions between two vertexes, and abstracting the whole map into a directed weighted graph; the shortest path algorithm is specifically as follows:
1. regarding the initial points on the graph as a set S, and regarding other points as another set;
2. according to the initial point, finding the distance d [ i ] from other points to the initial point (if adjacent, d [ i ] is the side weight, if not, d [ i ] is infinite);
3. selecting the smallest di (marked as d [ x ]), and adding the corresponding point (marked as x) of the di edge into the set S (actually, the d [ x ] value of the point added into the set is the shortest distance from the point to the initial point);
4. and updating the value of d [ y ] of the point y adjacent to the x according to the x: d [ y ] = min { d [ y ], d [ x ] + edge weight w [ x ] [ y ] }, since it is possible to turn the distance down, this update operation is called a relaxation operation;
5. repeating the 3,4 steps until the target point is added into the set, and at this time, the d [ i ] corresponding to the target point is the shortest path length.
As shown in FIGS. 1, 2 and 3, the invention also provides a system for scheduling parking spaces based on big data analysis, which comprises
The parking data acquisition module is used for acquiring daily vehicle in-out warehouse data, and the vehicle in-out warehouse data at least comprises license plate numbers, entrance time, departure time, parking cost and parking space numbers;
the parking data analysis module is used for carrying out modeling analysis on daily vehicle in-out database data;
the parking scheduling module is used for scheduling the vehicle parking according to the modeling analysis result;
and the optimal navigation line generation module is used for drawing an optimal navigation line on the map by using a shortest path algorithm on the map according to the current position of the mobile terminal and the target parking space when the parking space is scheduled to guide the vehicle to park.
The parking data acquisition module is an RFID recognizer arranged at the entrance and the exit of each parking garage or an electric railing arranged at the entrance and the exit of a vehicle, and a plurality of cameras arranged in the parking garage. As shown in fig. 2, the RFID recognizer of each parking garage access & exit or vehicle access & exit electric railing, and set up a plurality of cameras in the parking garage, the vehicle output of collection passes through network transmission module (for example switch or wireless AP) and transmits the vehicle data modeling for backend server, the vehicle dispatch, then backend server's dispatch data can be sent for car owner's user client (special mobile phone APP) through the network in real time, this APP can show each parking stall parking circumstances in parking garage, can recommend for the car owner to leave the nearest parking stall of vehicle simultaneously, realize that the car owner is high-efficient convenient to park.
In conclusion, the invention carries out systematic analysis on the daily parking data in a big data mode, counts the operation condition of the number of parking spaces in the parking lot in each time period through data modeling, submits the vacant parking space data to the parking space scheduling system, can analyze holidays and each time period, and dynamically submits the number of the vacant parking spaces which can be scheduled to the parking space scheduling system. The parking space dispatching system is provided with a set of allocation mode for the redundant parking spaces, under the condition that the daily parking spaces are enough, the redundant parking spaces are allocated to the outside, and the overall use efficiency of the garage is improved. The parking space dispatching system can perform manual intervention, does not perform parking space distribution in a certain time period, deals with sudden situations, improves management flexibility, achieves reasonable dispatching of vehicles, improves the utilization rate of parking vehicles, and meanwhile brings convenience for car owners to park.
The foregoing detailed description of the preferred embodiments of the invention has been presented. It should be understood that numerous modifications and variations could be devised by those skilled in the art in light of the present teachings without departing from the inventive concepts. Therefore, the technical solutions that can be obtained by a person skilled in the art through logical analysis, reasoning or limited experiments based on the prior art according to the concepts of the present invention should be within the scope of protection determined by the claims.

Claims (6)

1. A parking space level navigation method based on big data analysis is characterized by comprising the following steps:
acquiring daily vehicle in-out data, wherein the vehicle in-out-in data comprises license plate numbers, entry time, departure time, parking cost and parking space numbers;
carrying out modeling analysis on the daily vehicle in-out and in-out data, wherein the daily vehicle in-out and in-out data comprises a dimension of parking time, a dimension of parking vehicle identity and a dimension of parking space utilization rate;
according to the modeling analysis result, vehicle parking is scheduled, the vehicle parking is scheduled, and the scheduling comprises manual intervention allocation and automatic allocation of vacant parking spaces, wherein the automatic allocation of the vacant parking spaces is the allocation of optimal distances to all the vacant parking spaces, and when the license plate number of a user is scanned at the entrance of the parking lot, one vacant parking space closest to the entrance is automatically allocated;
drawing a parking lot by using a map, regarding each fork road as a vertex, regarding a road between the fork roads as an edge, and regarding the length of the road as the weight of the edge; if the path is a one-way path, drawing a directed edge between the two vertexes; if the road is a double-row road, drawing two edges with different directions between two vertexes, and abstracting the whole map into a directed weighted graph; the shortest path algorithm is specifically as follows:
step 1: regarding the initial point on the graph as a set S, regarding other points as another set;
and 2, step: according to the initial point, calculating the distance d [ i ] from other points to the initial point; if adjacent, d [ i ] is the weight of the edge; if not, then di is infinite;
and step 3: selecting the minimum d [ i ] and recording as d [ x ], recording the point corresponding to the d [ i ] edge as x, adding the point into the set S, wherein the d [ x ] value of the point added into the set is the shortest distance from the point to the initial point;
and 4, step 4: and updating the value of d [ y ] of the point y adjacent to the x according to the x: d [ y ] = min { d [ y ], d [ x ] + edge weight w [ x ] [ y ] }, since the distance may be adjusted smaller, this update operation is called a relaxation operation;
and 5: repeating the step 3 and the step 4 until the target point is added with the set, wherein the d [ i ] corresponding to the target point is the shortest path length; when the parking space is scheduled to guide the vehicle to park, an optimal navigation line is drawn on the map by using a shortest path algorithm on the map according to the current position of the mobile terminal and a target parking space, the target parking space is occupied in the process of guiding the vehicle to park, the system recommends an empty parking space again, the system captures the parking space through a camera on the parking space, when the camera finds that the state of the parking space changes, the information is transmitted to a server through a network, the server modifies the state of the current parking space and recommends an empty parking space at the same time, and informs the mobile terminal currently navigating to through a push protocol of the mobile terminal to change a route; the modeling analysis of the daily vehicle in-and-out data is modeled from the following dimensions:
dimension of parking duration: counting the parking time of each vehicle, and classifying the parking time according to the parking time to obtain the proportion of the parking time of a user in each stage and the average parking time;
dimension of parking period: counting the number of vehicles scattered in 24 hours by taking the entering time and the leaving time as analysis bases, and analyzing the time point of the largest number of parked vehicles in one day; meanwhile, the parking amount of a specific date is analyzed to be compared with the usual parking amount, and the data change of the specific date is analyzed, wherein the specific date is weekend or holiday;
parking vehicle identity dimension: analyzing the attribution of the vehicle according to the license plate number;
dimension of parking space utilization rate: according to the parking records, respectively counting the parking spaces in time periods of one year, half year, one month and one day, and analyzing the utilization rate of the parking spaces in the time periods; when the license plate number of the user is scanned at the entrance of the parking lot, a vacant parking space closest to the entrance is automatically allocated, and the method specifically comprises the following steps: a rectangular coordinate system is established by the vehicle position, then the coordinates (0, 0) of the vehicle are set as L1, L2 \8230 \ 8230, LN, the linear distance from the vehicle to each vacant parking space is set as 8230, the coordinates (X1, Y1), (X2, Y2) \8230 \ 8230and (XN, YN) of the vacant parking spaces are set as follows according to the Pythagorean theorem:
l1= sqrt (X12 + Y12), L2= sqrt (X22 + Y22) \8230; LN = sqrt (XN 2+ YN 2), and then L1, L2 \8230; LN, the smallest is recommended to the user as the shortest distance.
2. The parking space level navigation method based on big data analysis as claimed in claim 1, wherein the manual intervention allocates the vacant parking spaces to the car owner manually within a certain time period, or does not manually allocate some parking spaces to the car owner within a certain time period to reserve emergency backup.
3. The parking space level navigation method based on big data analysis as claimed in claim 2, characterized in that the data of the vacant parking spaces are collected by a parking space camera; and the vehicle entrance and exit data are collected through an RFID (radio frequency identification) identifier or an electric railing at the vehicle entrance and exit.
4. The parking space level navigation method based on big data analysis as claimed in claim 3, characterized in that, through the recognition and collection of the parking space cameras, when the parking space automatically allocated by the system is occupied by other vehicles, the system recommends a new parking space for the current vehicle owner according to the scheduling method and gives an indoor navigation route.
5. The parking space level navigation system of the parking space level navigation method based on big data analysis as claimed in any one of claims 1-4, wherein the parking space level navigation system comprises
The system comprises a parking data acquisition module, a parking data acquisition module and a parking data processing module, wherein the parking data acquisition module is used for acquiring daily vehicle in and out warehouse data, and the vehicle in and out warehouse data comprises license plate numbers, entry time, departure time, parking duration, parking cost and parking space numbers;
the parking data analysis module is used for carrying out modeling analysis on the vehicle in-out database data every day;
the parking scheduling module is used for scheduling the vehicle parking according to the modeling analysis result;
and the optimal navigation route generation module is used for drawing an optimal navigation route on the map by using a shortest path algorithm on the map according to the current position of the mobile terminal and the target parking space when the parking space is scheduled to guide the vehicle to park.
6. The parking space level navigation system of claim 5, wherein the parking data collection module is an RFID identifier disposed at each entrance and exit of the parking garage or an electric railing disposed at each entrance and exit of the vehicle, and a plurality of cameras disposed in the parking garage.
CN202011541535.1A 2020-12-23 2020-12-23 Parking space level navigation method and system based on big data analysis Active CN112687110B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011541535.1A CN112687110B (en) 2020-12-23 2020-12-23 Parking space level navigation method and system based on big data analysis

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011541535.1A CN112687110B (en) 2020-12-23 2020-12-23 Parking space level navigation method and system based on big data analysis

Publications (2)

Publication Number Publication Date
CN112687110A CN112687110A (en) 2021-04-20
CN112687110B true CN112687110B (en) 2023-02-28

Family

ID=75451308

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011541535.1A Active CN112687110B (en) 2020-12-23 2020-12-23 Parking space level navigation method and system based on big data analysis

Country Status (1)

Country Link
CN (1) CN112687110B (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114519940B (en) * 2022-02-25 2023-05-09 深圳市道网科技有限公司 Big data analysis method and equipment applied to intelligent parking
CN117523906B (en) * 2023-10-18 2024-08-13 上海软杰智能设备有限公司 Intelligent parking space guiding management system and method based on Internet of things
CN118014404A (en) * 2024-04-08 2024-05-10 绿城科技产业服务集团有限公司 Intelligent optimization method and system based on parking lot system

Citations (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103514641A (en) * 2012-06-17 2014-01-15 余姚市精诚高新技术有限公司 Intelligent parking lot management system and management method
CN103996089A (en) * 2014-06-12 2014-08-20 国家电网公司 Electric transmission line optimal path generation method based on GIS
CN104616538A (en) * 2015-01-12 2015-05-13 江苏省交通规划设计院股份有限公司 Parking space state detector with parking index analyzing function and method thereof
CN105118323A (en) * 2015-06-29 2015-12-02 上海市政工程设计研究总院(集团)有限公司 Large-size parking lot self-service dynamic vehicle seeking system
CN105224914A (en) * 2015-09-02 2016-01-06 上海大学 A kind of based on obvious object detection method in the nothing constraint video of figure
CN105608896A (en) * 2016-03-14 2016-05-25 西安电子科技大学 Traffic bottleneck identification method in urban traffic network
CN105761543A (en) * 2016-04-28 2016-07-13 周新 Idle parking space sharing method and system
CN107146467A (en) * 2017-07-05 2017-09-08 华南理工大学 Share implementation in a kind of parking stall of residential area
CN108182823A (en) * 2017-12-14 2018-06-19 特斯联(北京)科技有限公司 A kind of blocking wisdom management in garden parking stall and guide service system
CN108615400A (en) * 2018-05-15 2018-10-02 广州市天眼互联网科技有限公司 A kind of parking lot intelligent parking management system and its application method
CN110866649A (en) * 2019-11-19 2020-03-06 中国科学院深圳先进技术研究院 Method and system for predicting short-term subway passenger flow and electronic equipment
CN111402616A (en) * 2020-02-20 2020-07-10 西安电子科技大学 Intelligent parking control method, system, storage medium, computer program and terminal

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105336025B (en) * 2015-10-21 2017-05-31 成都宜泊信息科技有限公司 Parking space management system and parking stall management method based on internet and mobile Internet

Patent Citations (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103514641A (en) * 2012-06-17 2014-01-15 余姚市精诚高新技术有限公司 Intelligent parking lot management system and management method
CN103996089A (en) * 2014-06-12 2014-08-20 国家电网公司 Electric transmission line optimal path generation method based on GIS
CN104616538A (en) * 2015-01-12 2015-05-13 江苏省交通规划设计院股份有限公司 Parking space state detector with parking index analyzing function and method thereof
CN105118323A (en) * 2015-06-29 2015-12-02 上海市政工程设计研究总院(集团)有限公司 Large-size parking lot self-service dynamic vehicle seeking system
CN105224914A (en) * 2015-09-02 2016-01-06 上海大学 A kind of based on obvious object detection method in the nothing constraint video of figure
CN105608896A (en) * 2016-03-14 2016-05-25 西安电子科技大学 Traffic bottleneck identification method in urban traffic network
CN105761543A (en) * 2016-04-28 2016-07-13 周新 Idle parking space sharing method and system
CN107146467A (en) * 2017-07-05 2017-09-08 华南理工大学 Share implementation in a kind of parking stall of residential area
CN108182823A (en) * 2017-12-14 2018-06-19 特斯联(北京)科技有限公司 A kind of blocking wisdom management in garden parking stall and guide service system
CN108615400A (en) * 2018-05-15 2018-10-02 广州市天眼互联网科技有限公司 A kind of parking lot intelligent parking management system and its application method
CN110866649A (en) * 2019-11-19 2020-03-06 中国科学院深圳先进技术研究院 Method and system for predicting short-term subway passenger flow and electronic equipment
CN111402616A (en) * 2020-02-20 2020-07-10 西安电子科技大学 Intelligent parking control method, system, storage medium, computer program and terminal

Also Published As

Publication number Publication date
CN112687110A (en) 2021-04-20

Similar Documents

Publication Publication Date Title
CN112687110B (en) Parking space level navigation method and system based on big data analysis
Polycarpou et al. Smart parking solutions for urban areas
CN111009151B (en) Parking space recommendation method, storage medium and terminal device
Tiedemann et al. Concept of a data thread based parking space occupancy prediction in a berlin pilot region
CN112016735B (en) Patrol route planning method and system based on traffic violation hotspot prediction and readable storage medium
CN105825350A (en) Video analysis-based intelligent tourism early warning decision-making system and use method thereof
CN111986337A (en) Robot-based roadside parking charge management system and method
CN112184930A (en) Intelligent reservation parking guidance system and parking guidance method
CN110930750A (en) Intelligent park personnel management method and system based on cloud platform
CN115311894A (en) Intelligent parking management method, system, terminal and medium based on big data analysis
CN114419924A (en) AI application control management system based on wisdom city
CN113963572A (en) AI parking space management system and parking space management method
CN113487877A (en) Road vehicle illegal parking monitoring method
CN115424470A (en) City-level intelligent parking system, integration analysis method and terminal
CN116258342A (en) Parking management service system
CN109615907A (en) A kind of shared shutdown system cloud platform of city intelligent interactive mode
CN110046535B (en) Intelligent travel time prediction system, method and storage medium based on machine learning
CN116645809A (en) Parking demand distribution analysis method based on parking lot user behaviors
CN115641744A (en) Intelligent community parking management system
CN115588306A (en) Parking space pushing method and device, computer readable storage medium and terminal
CN114299622A (en) Intelligent charging system for open park
CN114038202A (en) Parking guidance system and method based on intelligent park traffic flow
CN113112855A (en) Parking space identification system and method
CN118038705B (en) HPLC-based intelligent park management method and device, storage medium and electronic equipment
CN114141050B (en) Intelligent parking supervision method and system based on smart city

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant