Parking operation method and system for dynamic monitoring and analysis
By using grid-based virtual network maps and algorithms to generate optimal navigation paths in large parking garages, the problem of lack of navigation functions in traditional intelligent parking solutions is solved, and efficient and automated parking navigation and management effects are achieved.
Patent Information
- Application Number
- CN202411572071.9
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-11-06
- Publication Date
- 2024-12-06
- Estimated Expiration
- 2044-11-06
AI Technical Summary
Traditional intelligent parking solutions lack navigation functions, especially path optimization navigation functions, making it difficult to help car owners find the best spare parking space efficiently and accurately in large parking garages, especially in multi-story and multiple entrances and exits.
The navigation paths of spare parking spaces are generated in gridded underground garages. By building a virtualized garage network map, greedy algorithms and heuristic search algorithms are used to generate the optimal navigation paths, reducing the parking time and distance of car owners, improving parking efficiency and automated management Effect.
Real-time detection and automated parking navigation are realized, which improves the efficiency of garage parking management, ensures that car owners find the best vacant parking spaces and reduces the total number of grids during parking, and improves the automated management effect of vacant parking spaces in the garage.
Smart Images

Figure CN119091680A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of Internet of Things, and in particular to a parking operation method and system for dynamic monitoring and analysis. Background Art
[0002] At present, the traditional intelligent parking solution is still based on the detection of the number and location of vacant parking spaces in the garage. If there are vacant parking spaces, the location of the vacant parking spaces will be sent to the car owner. The car owner will judge the location of the nearest vacant parking space subjectively and drive the car to the corresponding vacant parking space for parking. In other words, in the traditional intelligent parking technology solution, for the car owner, the parking method of the vacant parking space lacks navigation function, especially the navigation function of path optimization. For large parking garages, there may be multi-story parking garages and multiple entrances and exits, and the number and location distribution of vacant parking spaces are different in different time periods. For car owners who are not familiar with large parking garages, how to efficiently and accurately find the target vacant parking space with the best path is a technical problem that urgently needs to be solved. Summary of the invention
[0003] One of the inventive purposes of the present invention is to provide a parking operation method and system for dynamic monitoring and analysis, wherein the method and system utilize a gridded underground garage to generate a gridded navigation path for available parking spaces, wherein the gridded area includes a garage main road and parking spaces, and the navigation path includes a gridded main road path and a temporary path composed of available parking spaces, and automatically generates multiple navigation paths including the main road path and the temporary path after searching and determining the locations of available parking spaces, and optimizes the paths of the multiple navigation paths according to different available parking spaces and garage entrance and exit locations, and determines the optimal available parking space and the optimal path; the navigation path composed of the temporary path and the main road path in the present invention can effectively reduce the overall parking driving time and distance of the car owner, and improve the parking efficiency of the car owner.
[0004] One of the inventive purposes of the present invention is to provide a parking operation method and system for dynamic monitoring and analysis, wherein the method and system perform path optimization based on multiple navigation paths of multiple vacant parking spaces, and the present invention adopts, including but not limited to, a heuristic algorithm to perform path optimization on the navigation paths of multiple grids and the initial vacant parking spaces at different corresponding navigation times, and searches for the grid position of the final target vacant parking space under the optimal path, and uses the grid position of the final target vacant parking space and the corresponding optimal path as the navigation path of the current vehicle in the garage; the above-mentioned multi-objective and multi-path optimization method of the present invention has the effect of real-time detection and automated parking navigation, effectively improving the effect of garage parking management.
[0005] One of the inventive purposes of the present invention is to provide a parking operation method and system for dynamic monitoring and analysis, wherein the method and system use the total number of grids traversed by a vehicle from the entrance to the exit in a garage as a path optimization condition for the vacant parking spaces for the vehicle, select the path with the lowest total number of grids traversed by the vehicle in a corresponding time period as the optimal target vacant parking space for path navigation of the corresponding grid, and automatically generate a complete navigation path, thereby improving the automated management effect of the vacant parking spaces in the garage.
[0006] In order to achieve at least one of the above-mentioned invention objects, the present invention further provides a parking operation method for dynamic monitoring and analysis, the method comprising: Constructing a virtualized network map of the garage, wherein the virtualized network map includes a plurality of standard grids, and the grids cover the main roads, parking spaces, and entrances and exits of the garage; Acquire parking space information of a garage in real time, wherein the parking space information of the garage includes vacant parking spaces and the grid position of each vacant parking space, and construct an initialization optimization path for initializing multiple vacant parking spaces according to the grid positions of the vacant parking spaces in the garage and the grid positions of garage entrances and exits; Setting a path optimization condition including the total number of grids that the vehicle passes through in the garage, and iterating the optimization path corresponding to the initialized vacant parking space using a greedy algorithm according to the optimization condition to obtain the grid where the optimal target vacant parking space is located based on the optimization condition; The grid position of the target vacant parking space and the optimal navigation path corresponding to the target vacant parking space are extracted, and a navigation operation of the vehicle in the garage within a corresponding time period is performed according to the optimal navigation path.
[0007] According to one of the preferred embodiments of the present invention, the method for constructing the optimal path includes: obtaining an entrance vehicle timestamp, searching for all vacant parking spaces in the garage and the grids where each vacant parking space is located according to the entrance vehicle timestamp, wherein a main road path is constructed according to the grid where the main road of the garage is located, a temporary path is constructed according to the connection between the grid where the vacant parking spaces corresponding to the current timestamp are located and the main road path grid, the initialized optimal path is constructed from the path including the main road path and / or the temporary path to the initialized vacant parking space grid, and the cost value of the optimal path to the grid where the initialized vacant parking spaces are located is calculated through heuristic search, and the optimal path is iterated according to the cost value.
[0008] According to another preferred embodiment of the present invention, the iterative method for finding the optimal path includes: defining the grid where the corresponding vacant parking space for initializing the optimization is located as the first target grid m s The grid where the vehicle is located in the garage is the current grid, and the distance from the current vehicle to the first target grid m is calculated according to the following formula s The first generation value F1(n,ms )=g(n)+h(n,m s ), where n is the grid movement identifier, g(n) is the actual grid travel distance from the grid where the garage entrance is located to the current grid n, h(n, m s ) represents the distance from the current grid n to the first target grid m s The estimated distance, where the first generation value F1 (n, m s ) is recalculated each time the vehicle moves to an adjacent main road path grid or a temporary path grid; the current grid n to the first target grid m s The estimated distance h(n, m s ) According to the coordinate point of the current grid n and the first target grid m s The straight-line distance between the coordinate points is calculated.
[0009] According to another preferred embodiment of the present invention, the temporary path construction method and vehicle movement iteration include: obtaining the grid position corresponding to the vacant parking space in the current garage according to the timestamp of the vehicle entering the garage, and judging whether at least two boundaries of the current vacant parking space grid are connected to the vacant parking space grid or the main road path grid according to the grid position of the vacant parking space, if so, constructing a temporary path with the current vacant parking space grid and the vacant parking space grid or the main road path grid connected by the at least two boundaries, and calculating the first generation value F1 (n, m) of the vehicle's current grid position from the vehicle entrance grid to the first target grid s ), and calculate the first generation value F1 (n+1,m s ), and the first generation value F1 (n+1,m s ) selects the smallest adjacent grid as the iterative grid movement direction.
[0010] According to another preferred embodiment of the present invention, the iterative method for finding the optimal path includes: defining the total cost value of the vehicle from the garage entrance grid to the first target grid and from the first target grid to the garage exit as F (m s ), obtain the timestamp t when the vehicle moves in each grid in real time, obtain the changed vacant parking space information in real time at the timestamp t, relocate and determine the location of the first target grid, and update the temporary path including the grid where the vacant parking space is located in real time, and further calculate the first generation value F1 (n, m) of all paths from the garage entrance grid to the first target grid s ) minimum path, and calculate the second generation value F2 (m s, v), where v represents the exit grid identifier; the total cost value is F(m s ) = F1 (n, m s )+F2(m s , v), select the sum cost value F(m s ) as a candidate recommended navigation path for the vehicle from the garage entrance to the vacant parking space grid, and from the vacant parking space grid to the corresponding garage exit.
[0011] According to another preferred embodiment of the present invention, according to the first generation value F1 (n, m s ) and the second generation value F2 (m s , v) The path optimization method comprises: determining a first target grid m according to the timestamp t s Then, all possible moving paths of the vehicle from the garage entrance grid to the first target grid are traversed, and the path with the minimum number of grids x in each possible moving path from the entrance grid to the first target grid is calculated as the first generation value F1 (n, m s ) minimum value; and calculate the path with the minimum number of main road grids y from the first target grid to the garage exit grid as the second generation value F2 (m s , v) minimum, the first generation value F1 (n,m s ) is the minimum path and the second generation value F2 (m s , the complete path when v) is the minimum value is taken as the candidate recommended path.
[0012] According to another preferred embodiment of the present invention, a greedy algorithm is used to optimize the position of the first target grid, including: constructing the first target grid m s The total cost value F(m s ) is minimized, all first target grids m are obtained according to the timestamp t, and a first target grid m is randomly selected s , according to the first generation value F1 (n,m s ) and the second generation value F2 (m s , v) path optimization method to calculate the first target grid m s The minimum total cost F min (m s ), randomly select another first target grid m s+1 Calculate the corresponding minimum sum cost F min (m s+1 ), and calculate the minimum sum cost value F of the two first target grids min (m s ) and F min (ms+1 ) size, if F min (m s+1 )<F min (m s ), then the first target grid m s+1 As a temporary solution for the greedy strategy; and randomly select another first target grid m s+2 Calculate the minimum total cost F min (m s+2 ), and the minimum sum cost value F of the temporary solution min (m s+1 ) for comparison, if F min (m s+2 )<F min (m s+1 ), then the first target grid m s+2 As a new temporary solution, until all the first target grids m at time stamp t are traversed; the minimum sum cost value F is selected among all the first target grids m min (m r ) of the second target grid m r As the final recommended parking grid, the second target grid m is extracted r The corresponding navigation path.
[0013] According to another preferred embodiment of the present invention, a first timestamp t1 and a second timestamp t2 are respectively acquired in real time, wherein the first timestamp t1 is the timestamp of the vehicle entering the entrance grid; the second timestamp t2 is the timestamp of the vehicle starting to leave the parking space; the first generation value F1 (n, m) of the first target grid is calculated according to the first timestamp t1. s ), according to the first generation value F1 (n,m s ) the smallest path to perform vehicle entry navigation; and calculate the second generation value F2 (m s , v, where the second generation value F2 (m s , v) includes the calculation of multiple exports v, selecting the second generation value F2 (m s , v) The smallest path is taken as the recommended path for the vehicle to exit at the second timestamp t2.
[0014] In order to achieve at least one of the above-mentioned invention objectives, the present invention further provides a parking operation system for dynamic monitoring and analysis, wherein the system executes the above-mentioned parking operation method for dynamic monitoring and analysis.
[0015] The present invention further provides a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, and the computer program is executed by a processor to implement the above-mentioned parking operation method of dynamic monitoring and analysis. BRIEF DESCRIPTION OF THE DRAWINGS
[0016] Figure 1 Shown is a schematic flow chart of a parking operation method for dynamic monitoring and analysis according to the present invention.
[0017] Figure 2 Shown is a schematic diagram of the main road path and temporary path structure of the garage grid coverage map of the present invention.
[0018] Attached Figure 2 The numbers and symbols mean: 1-parking space, 2-garage entrance, 3-main road, 4-garage exit, 5-temporary path, m s -First target grid. DETAILED DESCRIPTION
[0019] The following description is used to disclose the present invention so that those skilled in the art can implement the present invention. The preferred embodiments described below are only examples, and those skilled in the art can think of other obvious variations. The basic principles of the present invention defined in the following description can be applied to other embodiments, variations, improvements, equivalents, and other technical solutions that do not deviate from the spirit and scope of the present invention.
[0020] It is to be understood that the term "one" should be understood as "at least one" or "one or more", that is, in one embodiment, the number of an element may be one, while in another embodiment, the number of the element may be multiple, and the term "one" should not be understood as a limitation on the quantity.
[0021] Please combine Figure 1 and Figure 2The present invention discloses a parking operation method and system for dynamic monitoring and analysis, the method comprising the following steps: first, a gridded virtual network map needs to be constructed for the target garage, wherein the gridded virtual network map is composed of a plurality of grids of standard structures, and in the present invention, the grids of standard structures are preferably composed of square grids with fixed standard side lengths, wherein the gridded virtual map covers the main roads and corresponding parking spaces in the garage, so that the grids can be divided into main road path grids and parking space grids. The present invention constructs a main road path and a temporary path based on the main road path grid and the vacant parking space grid, and constructs an optimized navigation path in the garage based on the main road path and the temporary path. Since the vacant parking spaces in the garage are dynamically changing, the present invention needs to determine the changes in the number and position of the vacant parking spaces in the current garage according to the timestamp t of the vehicle entering the garage, and then find the parking spaces in the garage that are closer to the entrance and exit through a heuristic search algorithm, and use a greedy algorithm to obtain the optimal parking spaces and parking routes.
[0022] Specifically, since the presence of vehicles in different grid parking spaces in the garage changes dynamically, the parking status of the above parking spaces can be obtained by using a parking geomagnetic system including but not limited to the parking space to obtain the parking status information of the corresponding parking space. When the corresponding parking space has a corresponding vehicle parked, the geomagnetic detection device on the parking space detects that there is an obvious magnetic field change around, and uploads the magnetic field change data of the parking space to the parking monitoring system. The parking monitoring system determines whether there is a vehicle parked in the current geomagnetic detection device according to the magnetic field change data. The method for detecting vehicle parking by the above geomagnetic system is a prior art, and the present invention will not be described in detail. In the garage, the geomagnetic detection device is used as the center point to obtain the coordinate position of each parking space in the virtual network map, and the grid position of the parking space is determined by the corresponding parking space size. In the present invention, it is preferred to grid-position the parking space by the coordinate position of the geomagnetic detection device in the corresponding grid of the virtual network map. The grid size can be set to a square grid similar to the overall size of the parking space, and each parking space grid and the main road path grid are automatically marked. The above positioning technology may include but is not limited to radio frequency or RTK (carrier phase differential) positioning technology. The above positioning technology is prior art, and the technical details of how to implement radio frequency or RTK positioning are not described in detail in the present invention.
[0023] Further, after completing the positioning of the parking space grid, it is necessary to construct a main road path and a temporary path, wherein the main road path is the number of main road path grids and the moving direction of the corresponding grid during the vehicle driving process. The grid of the main road path can be obtained by calling the garage plan design and performing map overlap comparison according to the preset virtual network map, wherein the grid corresponding to the garage plan design covering at least 1 / 2 of the grid area can be marked as the main road grid. Generally speaking, the grid size of the main road path set on the virtual network map of the garage must meet the coverage of the corresponding main road width, and the grid on the main road path is constructed in the form of edge-to-edge connection on a continuous path. After the grid of the virtual network map overlaps with the corresponding garage plan design, the grid covering at least 1 / 2 of the grid area of the parking space position in the garage plan design can be marked as the parking space grid. And further construct the corresponding main road path and temporary path according to the marked main road grid and parking space grid.
[0024] The method for moving and constructing the main road path and the temporary path includes: determining the current grid type, if the current grid is a main road path, moving to the adjacent grid of the current grid, if the adjacent grid is a main road grid, then the moving path is the main road path. If the current grid is a vacant parking grid, and when at least one adjacent grid of the vacant parking grid is a vacant parking grid or a main road grid, the moving path of the current vacant parking grid to the adjacent vacant parking grid or the main road grid is a temporary path. It should be noted that the construction of the temporary path in the present invention is based on the timestamp t of the vehicle entering the warehouse. When the timestamp is different, the grid of the main road path is basically the same, but the grid of the temporary path may be different due to the different parking status of the parking space itself. The temporary path constructed for the vacant parking space in the present invention is to find a more optimal vacant parking grid relative to multiple different entrances and exits. The total moving distance between different vacant parking spaces and entrances and exits is different. Therefore, while performing path optimization, the optimal target vacant parking space should also be determined based on the path optimization. That is to say, the present invention is based on multiple path optimization of multiple uncertain targets, and has a more accurate path optimization effect compared with the traditional two-endpoint fixed path optimization.
[0025] Specifically, the method for path optimization in the present invention is mainly implemented through a heuristic function, and the empty parking space grid in the garage when the vehicle passes through the grid at the entrance according to the timestamp t is defined as the first target grid. The first target grid refers to a type of grid. The first target grid can be multiple grids. The present invention selects one of the first target grids to explain the path optimization method in the present invention: define the grid where the corresponding empty parking space for initial optimization is located as the first target grid m sThe grid where the vehicle is located in the garage is the current grid, and the distance from the current vehicle to the first target grid m is calculated according to the following formula s The first generation value F1(n,m s )=g(n)+h(n,m s ), where n is the vehicle moving to the corresponding grid, g(n) is the actual grid distance from the grid where the garage entrance is located to the current grid n of the vehicle, h(n, m s ) represents the distance from the current grid n to the first target grid m s The estimated distance, where the first generation value F1 (n, m s ) is recalculated each time the vehicle moves to an adjacent main road path grid or a temporary path grid; the current grid n to the first target grid m s The estimated distance h(n, m s ) According to the coordinate point of the current grid n and the first target grid m s The straight-line distance between the coordinate points is calculated. s The calculation method of the estimated distance includes: the positioning coordinates of the vehicle's current grid are (x n ,y n ), the positioning coordinate point of the first target grid is (x ms ,y ms ), then the estimated distance h(n, m s )= After the vehicle moves along the current grid to the adjacent grid, the first generation value F1 (n, m) is further updated. s ). The above-mentioned vehicle movement between different grids can be realized by path simulation, which will not be described in detail in the present invention. The actual grid distance from the grid where the garage entrance is located to the current grid n of the vehicle can be realized by the following formula: g(n, x) = , where λ is the preset linear coefficient of the corresponding grid movement, and x is the number of movement steps. It should be noted that the estimated distance h(n, m s ) and the calculation method of the actual grid experience distance g(n) are only examples, and those skilled in the art can clearly understand that it is not limited to the above method.
[0026] In one preferred embodiment of the present invention, the first generation value F1 (n+1, m) is defined when the current vehicle grid position moves to the main road path grid or temporary path grid adjacent to the current grid boundary. s ), and the first generation value F1 (n+1,m s) selects the smallest adjacent grid as the iterative grid movement direction. At this time, the first generation value will gradually decrease until the first target grid position m is reached. s .
[0027] Based on the first target grid m s The path optimization method comprises the following steps: when a vehicle enters the garage from the garage entrance, the total cost value of the vehicle from the garage entrance grid to the first target grid and from the first target grid to the garage exit is defined as F (m s ), that is, the sum cost value F(m s ) is the evaluation result of the movement mode and distance from the vehicle entering the warehouse to leaving the warehouse, and the vehicle can have multiple entrances and exits. The total cost value F (m s ) is not limited to fixed garage entrances and garage exits.
[0028] Furthermore, in one of the preferred embodiments of the present invention, there is a possibility of dynamic changes in the vacant parking spaces, so the present invention needs to monitor the number and position of the vacant parking spaces in the garage in real time: obtain the timestamp t when the vehicle moves in each grid in real time, obtain the changed vacant parking space information in real time at the timestamp t, relocate and determine the position of the first target grid, and update the temporary path including the grid where the vacant parking space is located in real time, and further calculate the first generation value F1 (n, m) of all paths from the garage entrance grid to the first target grid. s ) minimum path, and calculate the second generation value F2 (m s , v), where v represents the exit grid identifier; the total cost value is F(m s ) = F1 (n, m s )+F2(m s , v), select the sum cost value F(m s ) is used as the candidate recommended navigation path for the vehicle from the garage entrance to the vacant parking grid, and from the vacant parking grid to the corresponding garage exit. In the above embodiment, dynamic monitoring of parking space changes is achieved, and adjustments to the target parking space and navigation path are made at any time, effectively avoiding the problem of invalid search caused by the sudden occupation of vacant parking spaces.
[0029] It should be noted that according to the first generation value F1 (n,m s ) and the second generation value F2 (m s , v) The path optimization method comprises: determining a first target grid m according to the timestamp t sThen, all possible moving paths of the vehicle from the garage entrance grid to the first target grid are traversed, and the path with the minimum number of grids x in each possible moving path from the entrance grid to the first target grid is calculated as the first generation value F1 (n, m s ), then g(n) is the smallest, and h(n, m s )=0; and calculate the path with the minimum number of main road grids y from the first target grid to the garage exit grid as the second generation value F2 (m s , v) minimum value. In this embodiment, the second generation value F2 (m s , v) is the minimum path from the first target grid to the garage exit, and the second generation value F2 (m s The calculation method of the second generation value F2 (m s ,v) After only the fixed grid main road grid is used as the path optimization condition, after the first target vehicle is determined, the second generation value F2 (m s , v) is relatively fixed, and the first generation value F1 (n,m s ) is the minimum path and the second generation value F2 (m s , the complete path when v) is the minimum value is taken as the candidate recommended path.
[0030] The above technical solution provides a first target grid m at the vehicle entry time t s and based on the first target grid m s However, in actual situations, the first target grid m s It may not be the optimal parking grid, so it is necessary to s To optimize the target grid position, the present invention preferably adopts the following method:
[0031] It includes: constructing the first target grid m s The total cost value F(m s ) is minimized, all first target grids m are obtained according to the timestamp t, and a first target grid m is randomly selected s , according to the first generation value F1 (n,m s ) and the second generation value F2 (m s , v) path optimization method to calculate the first target grid m s The minimum total cost F min (m s ), randomly select another first target grid m s+1 Calculate the corresponding minimum sum cost Fmin (m s+1 ), and calculate the minimum sum cost value F of the two first target grids min (m s ) and F min (m s+1 ) size, if F min (m s+1 )<F min (m s ), then the first target grid m s+1 As a temporary solution for the greedy strategy; and randomly select another first target grid m s+2 Calculate the minimum total cost F min (m s+2 ), and the minimum sum cost value F of the temporary solution min (m s+1 ) for comparison, if F min (m s+2 )<F min (m s+1 ), then the first target grid m s+2 As a new temporary solution, until all the first target grids m at time stamp t are traversed; the minimum sum cost value F is selected among all the first target grids m min (m r ) of the second target grid m r As the final recommended parking grid, the second target grid m is extracted r The corresponding navigation path.
[0032] In another feasible embodiment of the present invention, the total cost value can be split into a first timestamp t1 based on the vehicle entering from the entrance grid and a second timestamp t2 based on the vehicle starting to leave the parking space, and the first cost value F1 (n, m) corresponding to the first timestamp t1 and the second timestamp t2 is calculated respectively. s ), according to the first generation value F1 (n,m s ) the smallest path to perform vehicle entry navigation; and calculate the second generation value F2 (m s , v, where the second generation value F2 (m s , v) includes the calculation of multiple exports v, selecting the second generation value F2 (m s , v) The smallest path is taken as the recommended path for the vehicle to exit at the second timestamp t2.
[0033] The embodiments disclosed in the present invention, the process described above with reference to the flowchart can be implemented as a computer software program. The embodiments disclosed in the present invention include a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program contains a program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from the network through the communication part, and / or installed from a removable medium. When the computer program is executed by the central processing unit (CPU), the above-mentioned functions defined in the method of the present application are executed. It should be noted that the above-mentioned computer-readable medium of the present application can be a computer-readable signal medium or a computer-readable storage medium or any combination of the above two. The computer-readable storage medium can be, for example, but not limited to, a system, device or device of an electrical, magnetic, optical, electromagnetic, infrared segment, or semiconductor, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to, an electrical connection with one or more wire segments, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In the present application, a computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in conjunction with an instruction execution system, apparatus, or device. In the present application, a computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, which carries a computer-readable program code. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. A computer-readable signal medium may also be any computer-readable medium other than a computer-readable storage medium, which may send, propagate, or transmit a program for use by or in conjunction with an instruction execution system, apparatus, or device. The program code embodied on the computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, electrical wire, optical cable, RF, etc., or any suitable combination of the foregoing.
[0034] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present invention. In this regard, each square box in the flow chart or block diagram can represent a module, a program segment or a part of a code, and the module, the program segment or a part of the code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the square box can also occur in a sequence different from that marked in the accompanying drawings. For example, two square boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each square box in the block diagram and / or flow chart, and the combination of the square boxes in the block diagram and / or flow chart can be implemented with a dedicated hardware-based system that performs the specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.
[0035] Those skilled in the art should understand that the embodiments of the present invention described above and shown in the accompanying drawings are only examples and do not limit the present invention. The objectives of the present invention have been fully and effectively achieved. The functional and structural principles of the present invention have been demonstrated and explained in the embodiments. Without departing from the principles, the implementation methods of the present invention may be deformed or modified in any way.
Claims
1. A parking operation method for dynamic monitoring and analysis, characterized in that: The method comprises: Constructing a virtualized network map of the garage, wherein the virtualized network map includes a plurality of standard grids, and the grids cover the main roads, parking spaces, and entrances and exits of the garage; Acquire parking space information of a garage in real time, wherein the parking space information of the garage includes vacant parking spaces and the grid position of each vacant parking space, and construct an initialization optimization path for initializing multiple vacant parking spaces according to the grid positions of the vacant parking spaces in the garage and the grid positions of garage entrances and exits; Setting a path optimization condition including the total number of grids that the vehicle passes through in the garage, and iterating the optimization path corresponding to the initialized vacant parking space using a greedy algorithm according to the optimization condition to obtain the grid where the optimal target vacant parking space is located based on the optimization condition; The grid position of the target vacant parking space and the optimal navigation path corresponding to the target vacant parking space are extracted, and a navigation operation of the vehicle in the garage within a corresponding time period is performed according to the optimal navigation path.
2. A parking operation method for dynamic monitoring and analysis according to claim 1, characterized in that: The method for constructing the optimal path includes: obtaining an entrance vehicle timestamp, searching for all vacant parking spaces in the garage and the grids where each vacant parking space is located according to the entrance vehicle timestamp, constructing a main road path according to the grid where the main road of the garage is located, constructing a temporary path according to the connection between the grid where the vacant parking spaces corresponding to the current timestamp are located and the main road path grid, constructing the initialized optimal path from the main road path and / or the temporary path to the initialized vacant parking space grid, calculating the cost value of the optimal path to the grid where the initialized vacant parking spaces are located through heuristic search, and iterating the optimal path according to the cost value.
3. The parking operation method for dynamic monitoring and analysis according to claim 1 is characterized in that: The iterative method for finding the optimal path includes: defining the grid where the corresponding vacant parking space for initializing the optimization is located as the first target grid m s The grid where the vehicle is located in the garage is the current grid, and the distance from the current vehicle to the first target grid m is calculated according to the following formula s The first generation value F1(n,m s )=g(n)+h(n,m s ), where n is the grid movement identifier, g(n) is the actual grid travel distance from the grid where the garage entrance is located to the current grid n, h(n, m s ) represents the distance from the current grid n to the first target grid m s The estimated distance, where the first generation value F1 (n, m s ) is recalculated each time the vehicle moves to an adjacent main road path grid or a temporary path grid; the current grid n to the first target grid m s The estimated distance h(n, m s ) According to the coordinate point of the current grid n and the first target grid m s The straight-line distance between the coordinate points is calculated.
4. The parking operation method for dynamic monitoring and analysis according to claim 3 is characterized in that: The temporary path construction method and vehicle movement iteration include: obtaining the grid position corresponding to the vacant parking space in the current garage according to the timestamp of the vehicle entering the garage, and judging whether at least two boundaries of the current vacant parking space grid are connected to the vacant parking space grid or the main road path grid according to the grid position of the vacant parking space, if so, constructing a temporary path with the current vacant parking space grid and the vacant parking space grid or the main road path grid connected by the at least two boundaries, and calculating the distance from the vehicle's current grid position to the first target grid m s The first generation value F1(n,m s ), and calculate the first generation value F1 (n+1,m s ), and the first generation value F1 (n+1,m s ) selects the smallest adjacent grid as the iterative grid movement direction.
5. The parking operation method for dynamic monitoring and analysis according to claim 4 is characterized in that: The iterative method for finding the optimal path includes: defining a path from the garage entrance grid to the first target grid m s and from the first target grid m s The total cost to the garage exit is F (m s ), obtain the timestamp t when the vehicle moves in each grid in real time, obtain the changed vacant parking space information in real time at the timestamp t, and reposition and determine the first target grid m s The location of the vacant parking space is updated in real time, and the temporary path including the grid where the vacant parking space is located is further calculated from the garage entrance grid to the first target grid m s The first generation value F1 (n, m s ) minimum path and calculate the minimum path from the first target grid m s The second generation value F2 (m s , v), where v represents the exit grid identifier; the total cost value is F(m s ) = F1 (n, m s )+F2(m s , v), select the sum cost value F(m s ) as a candidate recommended navigation path for the vehicle from the garage entrance to the vacant parking space grid, and from the vacant parking space grid to the corresponding garage exit.
6. A parking operation method for dynamic monitoring and analysis according to claim 5, characterized in that: According to the first generation value F1 (n,m s ) and the second generation value F2 (m s , v) The path optimization method comprises: determining a first target grid m according to the timestamp t s Then, traverse the vehicle from the garage entrance grid to the first target grid m s All possible movement paths of the vehicle are calculated from the entry grid to the first target grid m s The path with the smallest total number of grids x in each possible moving path is the first generation value F1 (n, m s ) minimum value; and calculate from the first target grid m s The path with the minimum number of main road grids y to the garage exit grid is taken as the second generation value F2 (m s , v) minimum, the first generation value F1 (n,m s ) is the minimum path and the second generation value F2 (m s , the complete path when v) is the minimum value is taken as the candidate recommendation path.
7. The parking operation method for dynamic monitoring and analysis according to claim 5 is characterized in that: Using a greedy algorithm to optimize the position of the first target grid, including: constructing the first target grid m s The total cost value F(m s ) is minimized, all first target grids m are obtained according to the timestamp t, and a first target grid m is randomly selected s , according to the first generation value F1 (n,m s ) and the second generation value F2 (m s , v) path optimization method to calculate the first target grid m s The minimum total cost F min (m s ), randomly select another first target grid m s+1 Calculate the corresponding minimum sum cost F min (m s+1 ), and calculate the minimum sum cost value F of the two first target grids min (m s ) and F min (m s+1 ) size, if F min (m s+1 )<F min (m s ), then the first target grid m s+1 As a temporary solution for the greedy strategy; and randomly select another first target grid m s+2 Calculate the minimum total cost F min (m s+2 ), and the minimum sum cost value F of the temporary solution min (m s+1 ) for comparison, if F min (m s+2 )<F min (m s+1 ), then the first target grid m s+2 As a new temporary solution, until all the first target grids m at time stamp t are traversed; the minimum sum cost value F is selected among all the first target grids m min (m r ) of the second target grid m r As the final recommended parking grid, the second target grid m is extracted r The corresponding navigation path.
8. The parking operation method for dynamic monitoring and analysis according to claim 5, characterized in that: Acquire a first timestamp t1 and a second timestamp t2 in real time respectively, wherein the first timestamp t1 is the timestamp of the vehicle entering the entrance grid; the second timestamp t2 is the timestamp of the vehicle starting to leave the parking space; Calculate the first target grid m according to the first timestamp t1 s The first generation value F1 (n,m s ), according to the first generation value F1 (n,m s ) the smallest path to perform vehicle entry navigation; and calculate the second generation value F2 (m s , v, where the second generation value F2 (m s , v) includes the calculation of multiple exports v, selecting the second generation value F2 (m s , v) The smallest path is taken as the recommended path for the vehicle to exit at the second timestamp t2.
9. A parking operation system for dynamic monitoring and analysis, characterized in that: The system executes a parking operation method for dynamic monitoring and analysis as described in any one of claims 1-8.
10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, and the computer program is executed by a processor to implement a parking operation method for dynamic monitoring and analysis as described in any one of claims 1-8.
Citation Information
Patent Citations
Underground garage self-service navigation parking method based on network control
CN111540234A
Parking guiding method
CN115540890A
Intelligent traffic management system and method based on big data
CN117198090A
Pre-hospital emergency dispatching method and pre-hospital emergency dispatching system
CN117593900A
Connection bus station and line layout method based on grid optimization
CN118839917A
