Parking space searching method and device

Abstract

The invention discloses a parking space searching method and device, and the method comprises the steps: obtaining the current position of a user and pre-stored parking space information in response to a parking space searching instruction of the user, and enabling the parking space information to comprise a parking space identifier and a current parking position corresponding to the parking space identifier; generating a search route map according to the current position and the current parking position; searching the parking space according to the search route map; wherein the current parking position of the vehicle is determined by scanning first identification information adjacent to the parking space by a user when the vehicle is used each time; or the user determines the current parking position through Bluetooth positioning, and the position information corresponding to the first identification information is determined.

Description

Technical Field

[0001] The present invention relates to the field of navigation technology, and in particular to a parking space search method and device. Background Art

[0002] Existing navigation products are deficient in the parking and car-finding functions. For places such as hospitals, shopping malls, and government departments, the difficulty of parking and car-finding affects the user experience. At present, the parking and car-finding function requires hospitals to purchase parking record systems to transmit data back. The reverse car-finding entrance recorded by the system function is deep and difficult to use. Most patients enter the hospital without a navigation entrance. At the same time, medium and large parking lots do not have a license plate car-finding system, so users have difficulty finding parking spaces when they park randomly. These problems have led to low usage of navigation, a sparse customer base, and users feel that navigation is dispensable.

[0003] The above contents are only used to assist in understanding the technical solution of the present invention and do not constitute an admission that the above contents are prior art. Summary of the invention

[0004] The main purpose of the present invention is to provide a parking space search method and device, aiming to solve the above technical problems in the prior art.

[0005] To achieve the above object, the present invention provides a parking space search method, comprising:

[0006] In response to a parking space search instruction from a user, obtaining a current position of the user and pre-stored parking space information, the parking space information including a parking space identifier and a current parking position corresponding to the parking space identifier;

[0007] Generate a search route map according to the current position and the current parking position;

[0008] Searching for the parking space according to the search route map;

[0009] The current parking position of the vehicle is determined by the user scanning the first identification information adjacent to the parking space each time the vehicle is used; or the user determines the current parking position through Bluetooth positioning, and the position information corresponding to the first identification information is determined.

[0010] Preferably, in the parking space search method, the step of generating a search route map according to the current position and the current parking position includes:

[0011] Determine the possibility of going from the current position to the next position according to the current position and the current parking position;

[0012] Determine the next location according to the probability of the current location to the next location until the current parking location is reached;

[0013] Calculate the length of each possible route and take the path with the shortest length as the determined route;

[0014] Generating a route search map according to the determined route;

[0015] The calculation formula for the probability of the current position to the next position is as follows:

[0016]

[0017] in, The probability of selecting the next position j for position i in route k at time t;

[0018] allowed k represents all possible sets of route k in selecting the next position;

[0019] α and β represent selection weights;

[0020] i indicates the location;

[0021] j indicates the next position;

[0022] η ij (t) represents the reciprocal of the distance between position i and position j;

[0023] τ ij (t) represents the distance from the current position i to the next position j;

[0024] λ ij Select the passable safety factor for the next position j for the current position i.

[0025] Preferably, in the parking space search method, after calculating and determining the length of each possible route and taking the path with the shortest route length as the determined route, the method further comprises:

[0026] Take the four line segments in the determined route, which are spaced apart and are A1(p d , p d+1 )、A2(p e , p e+1 )、A3(p f , p f+1 )、A4(p h , p h+1 );

[0027] Determine whether the sum of the lengths of the four selected line segments A1, A2, A3, and A4 is greater than the sum of the lengths of the line segments A5, A6, A7, and A8 formed by other combinations of the endpoints of the four selected line segments, wherein A5, A6, A7, and A8 are set at intervals;

[0028] If the result of the judgment is yes, then add line segments A5, A6, A7, and A8 to the determined line, and delete line segments A1, A2, A3, and A4;

[0029] The determined route is updated.

[0030] Preferably, in the parking space search method, after the step of adding line segments A5, A6, A7, and A8 to the determined route and deleting line segments A1, A2, A3, and A4 when the judgment result is yes, and before updating the determined route, the method further includes:

[0031] Take five line segments in the determined route that are spaced apart and are A9(p l , p l+1 )、A10(p m , p m+1 )、A11(p n , p n+1 )、A12(p o , p o+1 )、A13(p q , p q+1 );

[0032] Determine whether the sum of the lengths of the five selected line segments A9, A10, A11, A12, and A13 is greater than the sum of the lengths of the line segments A14, A15, A16, A17, and A18 formed by other combinations of the endpoints of the four selected line segments, wherein A14, A15, A16, A17, and A18 are set at intervals;

[0033] When the judgment result is yes, the line segments A14, A15, A16, A17, and A18 are added to the determined line, and the line segments A14, A15, A16, A17, and A18 are deleted.

[0034] Preferably, in the parking space search method, before the step of obtaining the user's current location and pre-stored parking space information, the method further includes:

[0035] In response to a user's request to use a parking space, a reminder is sent to the user to scan the first identification information adjacent to the parking space and upload the parking position of the vehicle; or a reminder is sent to the user to obtain the current position using Bluetooth positioning technology and upload the parking position of the vehicle.

[0036] Preferably, in the parking space search method, the parking space is marked with a unique parking space identifier;

[0037] Accordingly, before the step of obtaining the user's current position and pre-stored parking space information in response to the user's parking space search instruction, the parking space search method further includes:

[0038] Establish a mapping relationship between the parking space identification corresponding to the parking space and its current parking position.

[0039] Preferably, in the parking space search method, the parking space information includes historical usage records;

[0040] The parking space search method further includes:

[0041] According to the parking space identification and historical usage records, the vehicle parked in the parking space is traced back.

[0042] In order to achieve the above object, the present invention also provides a parking space search device, comprising:

[0043] A response unit, configured to respond to a parking space search instruction from a user and obtain a current position of the user and pre-stored parking space information, wherein the parking space information includes a parking space identifier and a current parking position corresponding to the parking space identifier;

[0044] A generating unit, configured to generate a search route map according to the current position and the current parking position;

[0045] A search unit, used for searching the parking space according to the search route map;

[0046] The current parking position of the vehicle is determined by the user scanning the first identification information adjacent to the parking space each time the vehicle is used; or the user determines the current parking position through Bluetooth positioning, and the position information corresponding to the first identification information is determined.

[0047] In order to achieve the above object, the present invention further provides a computer device, the user comprising:

[0048] at least one processor; and,

[0049] a memory communicatively connected to the at least one processor; wherein,

[0050] The memory stores instructions that can be executed by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can execute the above-mentioned parking space search method.

[0051] In order to achieve the above object, the present invention further provides a computer-readable storage medium storing a computer program, wherein the computer program implements the above parking space search method when executed by a processor.

[0052] The present invention has at least the following beneficial effects:

[0053] The parking space search method provided by the present invention obtains the user's current position and pre-stored parking space information in response to the user's parking space search instruction, the parking space information including the parking space identification and the current parking position corresponding to the parking space identification; generates a search route map according to the current position and the current parking position; searches for the parking space according to the search route map; wherein the current parking position of the vehicle is determined by the user scanning the first identification information adjacent to the parking space each time the vehicle is used; or the user determines the current parking position through Bluetooth positioning, and the position information corresponding to the first identification information is determined, so that the parking space can be found quickly and accurately. BRIEF DESCRIPTION OF THE DRAWINGS

[0054] Figure 1 A schematic diagram of a first implementation of a parking space search method provided by the present invention;

[0055] Figure 2 A schematic diagram of a second implementation of the parking space search method provided by the present invention;

[0056] Figure 3 A schematic diagram of a third implementation of the parking space search method provided by the present invention;

[0057] Figure 4 A schematic diagram of an embodiment of a parking space search device provided by the present invention;

[0058] Figure 5 A schematic diagram of a computer device according to the present invention.

[0059] The purpose, features and advantages of the present invention will be further described with reference to the accompanying drawings in conjunction with the embodiments. DETAILED DESCRIPTION

[0060] The technical solution of the present invention will be clearly and completely described below in conjunction with the accompanying drawings. Obviously, the described embodiments are part of the embodiments of the present invention, rather than all of the embodiments. The present invention will be described in detail below with reference to the accompanying drawings and in conjunction with the embodiments. It should be noted that the embodiments of the present invention and the features in the embodiments can be combined with each other without conflict.

[0061] In the embodiments of the present invention, the term "and / or" describes the association relationship of associated objects, indicating that three relationships may exist. For example, A and / or B may represent three situations: A exists alone, A and B exist at the same time, and B exists alone. The character " / " generally indicates that the associated objects before and after are in an "or" relationship.

[0062] It should be noted that the terms "first", "second", etc. in the specification and claims of the present invention and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence.

[0063] In the embodiments of the present invention, the term "plurality" refers to two or more than two, and other quantifiers are similar.

[0064] In the present invention, unless otherwise specified, the directional words used, such as "up, down, top, bottom", usually refer to the directions shown in the drawings, or to the components themselves in the vertical, perpendicular or gravity directions; similarly, for ease of understanding and description, "inside and outside" refer to the inside and outside relative to the outline of each component itself, but the above-mentioned directional words are not used to limit the present invention.

[0065] In order to make the purpose, technical scheme and advantages of the embodiments of the present invention clearer, the embodiments of the present invention will be described in detail below in conjunction with the accompanying drawings. However, it can be understood by those skilled in the art that in the embodiments of the present invention, many technical details are proposed in order to enable the reader to better understand the present invention. However, even without these technical details and various changes and modifications based on the following embodiments, the technical scheme claimed in the present invention can also be implemented. The division of the following embodiments is for the convenience of description and should not constitute any limitation on the specific implementation of the present invention. The various embodiments can be combined and referenced with each other under the premise of no contradiction.

[0066] In order to solve the above problems, the present embodiment relates to a parking space search method, which can be applied to a computer device. The computer device can be an electronic device with data processing capabilities, such as a desktop computer, a tablet computer, a notebook, etc. In other embodiments, it can also be other electronic devices with data processing capabilities, and no specific restrictions are made here.

[0067] The following is an explanation of the implementation details of the parking space search method according to the first embodiment of the present invention. The following content is only provided for the convenience of understanding and is not necessary for the implementation of this solution.

[0068] The specific process of this implementation is as follows: Figure 1 As shown, specifically including:

[0069] Step S100, in response to a parking space search instruction from a user, obtaining a current position of the user and pre-stored parking space information, wherein the parking space information includes a parking space identifier and a current parking position corresponding to the parking space identifier;

[0070] It should be understood that each parking space has a unique parking space identifier, which can be a QR code on the parking space or a unique code on the parking space. The specific setting form can be set as needed.

[0071] When a user needs to use a parking space, he can scan the QR code and report the current location of the parking space where the vehicle is parked. The user can report the current location of the parking space through the mobile terminal carried by the user through Bluetooth positioning technology; it can also be reported by setting a QR code representing a unique address near the corresponding area. In this case, each parking area needs to have a QR code. The location reported in this way may only be an approximate location. For example, several parking spaces share a QR code, but the amount of data will be relatively small. The specific setting can be set according to needs. Each parking space identifier can correspond to a unique parking location, or several parking space identifiers can correspond to an approximate parking location.

[0072] Specifically, the current parking position of the vehicle is determined by the user scanning the first identification information adjacent to the parking space each time the vehicle is used; or the current parking position is sent by the user through Bluetooth positioning when the user uses the vehicle, and the position information corresponding to the first identification information is determined; or the user scans the first identification information on the parking space to directly report the parking position. More specifically, in response to the user's request to use the parking space, a reminder is sent to the user to scan the first identification information adjacent to the parking space and upload the parking position of the vehicle; or a reminder is sent to the user to obtain the current position using Bluetooth positioning technology and upload the parking position of the vehicle.

[0073] In addition, in other embodiments, the parking space identification may also be associated with the historical parking position of the parking space, so that the use record of the parking space can be traced, and the accident can be easily traced by tracing the historical use record of the parking space. More specifically, the parking space information includes the historical use record; and the parking space search method further includes: tracing the vehicle parked in the parking space according to the parking space identification and the historical use record.

[0074] The parking space is marked with a unique parking space identifier; accordingly, before the step of responding to the user's parking space search instruction and obtaining the user's current position and pre-stored parking space information, the parking space search method also includes: establishing a mapping relationship between the parking space identifier corresponding to the parking space and its current parking position.

[0075] Step S200, generating a search route map according to the current position and the current parking position;

[0076] It should be noted that the user's current location and the vehicle's current parking location can be located on the same floor, the same area, or on different floors. When the user's current location and the vehicle's current parking location are on different floors, the route generation can be divided into multiple sections, for example, the section where the user reaches the stairs can be divided into one section, and the section where the user comes out of the stairs and reaches the current parking location can be divided into one section for path planning.

[0077] Step S300, searching for the parking space according to the search route map.

[0078] The parking space search method provided by the present invention obtains the user's current position and pre-stored parking space information in response to the user's parking space search instruction, the parking space information including the parking space identification and the current parking position corresponding to the parking space identification; generates a search route map according to the current position and the current parking position; searches for the parking space according to the search route map; wherein the current parking position of the vehicle is determined by the user scanning the first identification information adjacent to the parking space each time the vehicle is used; or the user determines the current parking position through Bluetooth positioning, and the position information corresponding to the first identification information is determined, so that the parking space can be found quickly and accurately.

[0079] like Figure 2 As shown, Figure 2 The second implementation of the parking space search method of the present invention is shown. The step S200 includes:

[0080] Step S210, determining the probability of going from the current position to the next position according to the current position and the current parking position; wherein the calculation formula of the probability of going from the current position to the next position is as follows:

[0081]

[0082] in, The probability of selecting the next position j for position i in route k at time t;

[0083] allowed k represents all possible sets of route k in selecting the next position;

[0084] α and β represent selection weights;

[0085] i indicates the location;

[0086] j indicates the next position;

[0087] η ij (t) represents the reciprocal of the distance between position i and position j;

[0088] τ ij (t) represents the distance from the current position i to the next position j;

[0089] λ ij Select the passable safety factor for the next position j for the current position i.

[0090] It should be understood that considering the current position i to select the passable safety factor of the next position j can effectively reduce the risk of passing. The passable safety factor can be determined according to a preset rule. For example, if the road section is prone to accidents within the preset distance range, the passable safety factor is low. The passable safety factor can also be determined in more detail according to the risk level. The passable safety factor can also be directly defined by 0 and 1.

[0091] Step S220, determining the next position according to the probability of the current position to the next position, until the current parking position is reached;

[0092] It should be noted that when selecting the next location, the next location with a probability greater than a preset value can be selected as an optional point. For example, when the user is at location 1, the next locations with a probability greater than 80% include location 2 and location 3, so there are two optional routes, from location 1 to location 2, or from location 1 to location 3.

[0093] Step S230, calculating the length of each possible route determined, and taking the path with the shortest route length as the determined route;

[0094] Step S240: generating a route search map according to the determined route.

[0095] like Figure 3 As shown, Figure 3 The third embodiment of the parking space search method of the present invention is illustrated. Based on the second embodiment or the first embodiment, the method further includes:

[0096] Step S231, taking four line segments in the determined route that are spaced apart from each other and are A1(p d , p d+1 )、A2(p e , p e+1 )、A3(p f , p f+1 )、A4(p h , p h+1 );

[0097] It should be understood that the four line segments A1, A2, A3, and A4 are arranged at intervals, and can be considered as the four line segments being unconnected.

[0098] Step S232, determining whether the sum of the lengths of the four selected line segments A1, A2, A3, and A4 is greater than the sum of the lengths of the line segments A5, A6, A7, and A8 formed by other combinations of the endpoints of the four selected line segments, wherein A5, A6, A7, and A8 are arranged at intervals;

[0099] It should be understood that when the sum of the lengths of the four unconnected line segments is greater than p d、p d+1 、p e 、p e+1 、p f 、p f+1、 p h 、p h+1 When the sum of the lengths of other methods is calculated, delete A1, A2, A3, and A4, and add A5, A6, A7, and A8.

[0100] Step S233, when the judgment result is yes, then add line segments A5, A6, A7, A8 to the determined line, and delete line segments A1, A2, A3, A4;

[0101] Step S237, updating the determined route.

[0102] In other embodiments, after step S233 and before step S237, steps S234 to S236 are also included.

[0103] Step S234, take five line segments in the determined route that are spaced apart and are A9 (p l , p l+1 )、A10(p m , p m+1 )、A11(p n , p n+1 )、A12(p o , p o+1 )、A13(p q , p q+1 );

[0104] Step S235, determining whether the sum of the lengths of the five selected line segments A9, A10, A11, A12, and A13 is greater than the sum of the lengths of the line segments A14, A15, A16, A17, and A18 formed by other combinations of the endpoints of the four selected line segments, wherein A14, A15, A16, A17, and A18 are arranged at intervals;

[0105] Step S236, when the judgment result is yes, add line segments A14, A15, A16, A17, A18 to the determined line, and delete line segments A14, A15, A16, A17, A18.

[0106] The present invention provides a parking space search device, such as Figure 4 As shown, the parking space searching device includes a responding unit 401 , a generating unit 402 and a searching unit 403 .

[0107] The response unit 401 is used to respond to the user's parking space search instruction and obtain the user's current position and pre-stored parking space information, wherein the parking space information includes a parking space identifier and a current parking position corresponding to the parking space identifier. It should be understood that each parking space has a unique parking space identifier, which can be a QR code on the parking space or a unique code on the parking space, and the specific setting form can be set as needed.

[0108] It should be understood that each parking space has a unique parking space identifier, which can be a QR code on the parking space or a unique code on the parking space. The specific setting form can be set as needed.

[0109] When a user needs to use a parking space, he can scan the QR code and report the current location of the parking space where the vehicle is parked. The user can report the current location of the parking space through the mobile terminal carried by the user through Bluetooth positioning technology; it can also be reported by setting a QR code representing a unique address near the corresponding area. In this case, each parking area needs to have a QR code. The location reported in this way may only be an approximate location. For example, several parking spaces share a QR code, but the amount of data will be relatively small. The specific setting can be set according to needs. Each parking space identifier can correspond to a unique parking location, or several parking space identifiers can correspond to an approximate parking location.

[0110] Specifically, the current parking position of the vehicle is determined by the user scanning the first identification information adjacent to the parking space each time the vehicle is used; or the current parking position is sent by the user through Bluetooth positioning when the user uses the vehicle, and the position information corresponding to the first identification information is determined; or the user scans the first identification information on the parking space to directly report the parking position. More specifically, in response to the user's request to use the parking space, a reminder is sent to the user to scan the first identification information adjacent to the parking space and upload the parking position of the vehicle; or a reminder is sent to the user to obtain the current position using Bluetooth positioning technology and upload the parking position of the vehicle.

[0111] In addition, in other embodiments, the parking space identification may also be associated with the historical parking position of the parking space, so that the use record of the parking space can be traced, and the accident can be easily traced by tracing the historical use record of the parking space. More specifically, the parking space information includes the historical use record; and the parking space search method further includes: tracing the vehicle parked in the parking space according to the parking space identification and the historical use record.

[0112] The parking space is marked with a unique parking space identifier; accordingly, before the step of responding to the user's parking space search instruction and obtaining the user's current position and pre-stored parking space information, the parking space search method also includes: establishing a mapping relationship between the parking space identifier corresponding to the parking space and its current parking position.

[0113] The generation unit 402 is used to generate a search route map according to the current position and the current parking position. It should be noted that the current position of the user and the current parking position of the vehicle may be located on the same floor, the same area, or on different floors. When the current position of the user and the current parking position of the vehicle are on different floors, the generation of the route may be divided into multiple sections, for example, the section where the user reaches the stairs may be divided into one section, and the section where the user reaches the current parking position after coming out of the stairs may be divided into one section for path planning.

[0114] The searching unit 403 is used to search for the parking space according to the search route map.

[0115] The present invention responds to a user's parking space search instruction, obtains the user's current position and pre-stored parking space information, the parking space information including a parking space identification and a current parking position corresponding to the parking space identification; generates a search route map according to the user's current position and the current parking position; searches for the parking space according to the search route map; wherein the current parking position of the vehicle is determined by the user scanning the first identification information adjacent to the parking space each time the vehicle is used; or the user determines the current parking position through Bluetooth positioning, and the position information corresponding to the first identification information is determined, so that the parking space can be found quickly and accurately.

[0116] In order to achieve the above object, the present invention also provides a computer device, such as Figure 5 As shown, the cleaning base station includes at least one processor 501; and a memory 502 that is communicatively connected to the at least one processor 501; wherein the memory 502 stores instructions that can be executed by the at least one processor 501, and the instructions are executed by the at least one processor 501 so that the at least one processor 501 can execute the above-mentioned parking space search method.

[0117] The memory 502 and the processor 501 are connected in a bus manner, and the bus may include any number of interconnected buses and bridges, and the bus connects various circuits of one or more processors 501 and the memory 502 together. The bus can also connect various other circuits such as peripheral devices, voltage regulators, and power management circuits, which are well known in the art and are therefore not further described herein. The bus interface provides an interface between the bus and the transceiver. The transceiver can be one element or multiple elements, such as multiple receivers and transmitters, providing a unit for communicating with various other devices on a transmission medium. The data processed by the processor 501 is transmitted on a wireless medium via an antenna, and further, the antenna also receives data and transmits the data to the processor 501.

[0118] The processor 501 is responsible for managing the bus and general processing, and can also provide various functions, including timing, peripheral interfaces, voltage regulation, power management and other control functions. The memory 502 can be used to store data used by the processor 501 when performing operations.

[0119] In order to achieve the above object, the present invention provides a computer-readable storage medium storing a computer program, wherein the computer program implements the above parking space search method when executed by a processor.

[0120] That is, those skilled in the art can understand that all or part of the steps in the above-mentioned implementation method can be completed by instructing the relevant hardware through a program, and the program is stored in a storage medium, including a number of instructions to enable a device (which can be a single-chip microcomputer, chip, etc.) or a processor to execute all or part of the steps of the method described in each implementation of the present application. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), disk or optical disk and other media that can store program codes.

[0121] Obviously, the embodiments described above are only some embodiments of the present invention, rather than all embodiments. Based on the embodiments of the present invention, ordinary technicians in this field can make other different forms of changes or modifications without creative work, which should fall within the scope of protection of the present invention.

Claims

1. A parking space search method, characterized in that: include: In response to a parking space search instruction from a user, obtaining a current position of the user and pre-stored parking space information, the parking space information including a parking space identifier and a current parking position corresponding to the parking space identifier; Generate a search route map according to the current position and the current parking position; Searching for the parking space according to the search route map; Among them, the current parking position of the vehicle is determined by the user scanning the first identification information adjacent to the parking space each time it is used; or the user determines the current parking position through Bluetooth positioning, and the position information corresponding to the first identification information is determined.

2. The parking space search method according to claim 1, characterized in that: The step of generating a route search map according to the current position and the current parking position comprises: Determine the possibility of going from the current position to the next position according to the current position and the current parking position; Determine the next location according to the probability of the current location to the next location until the current parking location is reached; Calculate the length of each possible route and take the path with the shortest length as the determined route; Generating a route search map according to the determined route; The calculation formula for the probability of the current position to the next position is as follows: in, The probability of selecting the next position j for position i in route k at time t; allowed k represents all possible sets of route k in selecting the next position; α and β represent selection weights; i indicates the location; j indicates the next position; η ij (t) represents the reciprocal of the distance between position i and position j; τ ij (t) represents the distance from the current position i to the next position j; λ ij Select the passable safety factor for the next position j for the current position i.

3. The parking space search method according to claim 2, characterized in that: After calculating the length of each possible route and taking the path with the shortest route length as the determined route, the method further includes: Take the four line segments in the determined route, which are spaced apart and are A1(p d , p d+1 )、A2(p e , p e+1 )、A3(p f , p f+1 )、A4(p h , p h+1 ); Determine whether the sum of the lengths of the four selected line segments A1, A2, A3, and A4 is greater than the sum of the lengths of the line segments A5, A6, A7, and A8 formed by other combinations of the endpoints of the four selected line segments, wherein A5, A6, A7, and A8 are set at intervals; If the result of the judgment is yes, then add line segments A5, A6, A7, and A8 to the determined line, and delete line segments A1, A2, A3, and A4; The determined route is updated.

4. The parking space search method according to claim 3, characterized in that: When the judgment result is yes, after the step of adding line segments A5, A6, A7, and A8 to the determined route and deleting line segments A1, A2, A3, and A4, and before updating the determined route, the method further includes: Take five line segments in the determined route that are spaced apart and are A9(p l , p l+1 )、A10(p m , p m+1 )、A11(p n , p n+1 )、A12(p o , p o+1 )、A13(p q , p q+1 ); Determine whether the sum of the lengths of the five selected line segments A9, A10, A11, A12, and A13 is greater than the sum of the lengths of the line segments A14, A15, A16, A17, and A18 formed by other combinations of the endpoints of the four selected line segments, wherein A14, A15, A16, A17, and A18 are set at intervals; When the judgment result is yes, the line segments A14, A15, A16, A17, and A18 are added to the determined line, and the line segments A14, A15, A16, A17, and A18 are deleted.

5. The parking space search method according to claim 1, characterized in that: Before the step of obtaining the user's current location and pre-stored parking space information, the method further includes: In response to a user's request to use a parking space, a reminder is sent to the user to scan the first identification information adjacent to the parking space and upload the parking position of the vehicle; or a reminder is sent to the user to obtain the current position using Bluetooth positioning technology and upload the parking position of the vehicle.

6. The parking space search method according to claim 1, characterized in that: The parking space is marked with a unique parking space identification; Accordingly, before the step of obtaining the user's current position and pre-stored parking space information in response to the user's parking space search instruction, the parking space search method further includes: Establish a mapping relationship between the parking space identification corresponding to the parking space and its current parking position.

7. The parking space search method according to claim 1, characterized in that: The parking space information includes historical usage records; The parking space search method further includes: According to the parking space identification and historical usage records, the vehicle parked in the parking space is traced back.

8. A parking space search device, characterized in that: include: A response unit, configured to respond to a parking space search instruction from a user and obtain a current position of the user and pre-stored parking space information, wherein the parking space information includes a parking space identifier and a current parking position corresponding to the parking space identifier; A generating unit, configured to generate a search route map according to the current position and the current parking position; A search unit, used for searching the parking space according to the search route map; The current parking position of the vehicle is determined by the user scanning the first identification information adjacent to the parking space each time the vehicle is used; or the user determines the current parking position through Bluetooth positioning, and the position information corresponding to the first identification information is determined.

9. A computer device, characterized in that: include: at least one processor; as well as, a memory communicatively connected to the at least one processor; wherein, The memory stores instructions that can be executed by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can execute the parking space search method according to any one of claims 1 to 7.

10. A computer-readable storage medium storing a computer program, characterized in that: When the computer program is executed by a processor, the parking space search method according to any one of claims 1 to 7 is implemented.

Images