CN109658733B

CN109658733B - Parking area acquisition method, server and vehicle system

Info

Publication number: CN109658733B
Application number: CN201811628069.3A
Authority: CN
Inventors: 崔世祥; 张毅倜
Original assignee: Beijing Mobike Technology Co Ltd
Current assignee: Hanhai Information Technology Shanghai Co Ltd; Mobai Beijing Information Technology Co Ltd
Priority date: 2018-12-28
Filing date: 2018-12-28
Publication date: 2020-06-23
Anticipated expiration: 2038-12-28
Also published as: CN109658733A

Abstract

The invention discloses a parking area acquisition method, a service system and a vehicle system. The method comprises the following steps: acquiring a candidate parking point set comprising a plurality of candidate parking points; acquiring at least one candidate parking area from the candidate parking point set; and for each candidate parking area, acquiring at least one target parking area for parking vehicles from the candidate parking areas according to the acquired associated road network information associated with the candidate parking areas.

Description

Parking area acquisition method, server and vehicle system

Technical Field

The invention relates to the technical field of vehicles, in particular to a parking area acquisition method, a server and a vehicle system.

Background

With the rapid development of vehicle manufacturing technology and internet technology, traveling through a shared vehicle (such as a shared bicycle, a shared automobile, a shared electric vehicle, etc.) has gradually become an emerging traveling mode, and the diversified traveling demands of users can be met. As the size of the users of the shared vehicles becomes larger and the demand for vehicles increases explosively, the number of shared vehicles put into operation for the users increases, and the problems of traffic obstruction, environmental influence and the like caused by the careless parking of the users when the users use the shared vehicles are increasingly prominent, so that the parking of the shared vehicles needs to be managed.

At present, generally depending on the work experience of vehicle operators for performing vehicle operation, it is considered that a parking area having a fixed geographical position, in which vehicles are allowed to park, is divided in an area where vehicles are put into operation for users to park the vehicles, and information of the parking area is notified through a client used by the users so as to guide the users using the vehicles to park the vehicles in a normative manner, and meanwhile, a fixed parking management device for collecting vehicle parking information to facilitate vehicle management is generally required to be provided in the parking area.

However, in practical applications, the user's vehicle demand has characteristics such as diversity and mobility, and it is difficult for the parking area, which is fixedly installed in advance, to satisfy the user's demand for diversity and mobility, resulting in low management efficiency of parking, and it is necessary to install a parking management device in the parking area, which consumes much time and labor, and incurs high management cost of parking.

Disclosure of Invention

It is an object of the present invention to provide a new solution for obtaining parking areas.

According to a first aspect of the present invention, there is provided a method for acquiring a parking area, including:

acquiring a candidate parking point set comprising a plurality of candidate parking points;

wherein each candidate parking spot has a geographic location and a time period corresponding thereto;

acquiring at least one candidate parking area from the candidate parking point set;

and for each candidate parking area, acquiring at least one target parking area for parking vehicles from the candidate parking areas according to the acquired associated road network information associated with the candidate parking areas.

Optionally, the step of obtaining at least one candidate parking area from the set of candidate parking spots includes:

acquiring at least one parking point cluster from the candidate parking point set;

wherein each parking point cluster comprises one candidate parking point as a cluster starting point and other candidate parking points which have the same time period as the cluster starting point and are less than a preset distance threshold from the cluster starting point, and the number of the candidate parking points which have the same time period as the cluster starting point and are less than the preset distance threshold from the cluster starting point is greater than a preset density threshold;

dividing to obtain candidate parking areas corresponding to the parking point clusters by taking the center point of each parking point cluster as the center point of the parking area according to the determined radius of the parking area;

the center point of the parking point cluster is the cluster starting point of the parking point cluster or a mean point obtained according to the geographic positions of all the candidate parking points included in the parking point cluster;

each of the candidate parking areas has a set of area boundary points corresponding thereto, the set of area boundary points including all of the area boundary points, each of the area boundary points having geographic coordinates corresponding thereto.

Further optionally, the method further comprises:

determining the radius of the parking area according to the preset density threshold, the aggregation mean and a preset radius coefficient;

and/or the presence of a gas in the gas,

the number of the candidate parking points included in the parking point cluster is greater than the aggregation average value;

and the aggregation mean value is the mean value of the number of the vehicle use end points in the geographic area and the time period corresponding to the parking point cluster, which is acquired according to the vehicle use data in the historical statistical time length.

Optionally, each of the candidate parking areas has a set of area boundary points corresponding thereto, the set of area boundary points including all area boundary points, each of the area boundary points having geographic coordinates corresponding thereto;

the associated road network information at least comprises the region boundary point set of the geographic objects which can not be parked in the geographic region where the candidate parking region is located and cannot be parked;

the step of acquiring at least one target parking area available for parking vehicles from the candidate parking areas according to the acquired associated road network information associated with the candidate parking areas for each candidate parking area comprises:

determining at least one associated no-parking area associated with the candidate parking area according to the associated road network information of the candidate parking area;

wherein each of the associated no-parking regions has the set of region boundary points corresponding thereto;

determining an intersection area between the candidate parking area and each associated no-parking area according to the boundary area point set of the candidate parking area and the boundary area point set of each associated no-parking area;

wherein the intersection region has the set of region boundary points corresponding thereto;

and acquiring at least one target parking area from the candidate parking areas according to the intersection area.

Further optionally, the step of determining at least one associated no-parking area associated with the candidate parking area according to the associated road network information of the candidate parking area includes:

acquiring the regional spatial relationship between the candidate parking region and each forbidden geographic object according to the regional boundary point set of the candidate parking region and the regional boundary point set of each forbidden geographic object included in the associated road network information;

the region space relationship at least comprises a region intersection relationship and a non-region intersection relationship;

and determining each forbidden geographic object with the regional spatial relationship being a regional intersection relationship as one associated forbidden region.

Still further optionally, the step of obtaining a spatial relative relationship of the candidate parking area to each of the forbidden geographic objects comprises:

determining a region space range of the candidate parking region according to the region boundary point set of the candidate parking region, and determining a region space range of the forbidden geographic object according to the region boundary point set of each forbidden geographic object respectively;

wherein the regional spatial extent includes a regional exterior, a regional interior, and a regional boundary;

for each stopping geographic object, respectively carrying out intersection operation processing on any one of the outside area, the inside area and the boundary area of the stopping geographic object and any one of the outside area, the inside area and the boundary area of the candidate stopping area to obtain the area space relationship;

the regional spatial relationship comprises any one of the region outside, the region inside and the region boundary of the candidate parking region and a spatial relative relationship between any one of the region outside, the region inside and the region boundary of the stop-forbidden geographic object;

the spatial relative relationship comprises an intersection relationship or a disjointed relationship;

the area intersecting relationship is that an inside of the candidate parking area is an intersecting relationship with an inside of the forbidden geographic object, and an inside of the candidate parking area is an intersecting relationship with an area boundary of the forbidden geographic object.

Further optionally, the step of determining, according to the boundary area point set of the candidate parking area and the boundary area point set of each associated no-parking area, an intersection area where the candidate parking area and the associated no-parking area have a spatial intersection relationship includes:

determining the area space range of the candidate parking area according to the area boundary point set of the candidate parking area, and determining the area space range of the associated no-parking area according to the area boundary point set of each associated no-parking area;

and acquiring the region boundary point set of the intersection region according to the result of intersection operation processing between the region inside the candidate parking region and the region boundary of each associated no-parking region so as to determine the intersection region.

Further optionally, the step of obtaining at least one target parking area from the candidate parking areas according to the intersection area includes:

determining a region area of the candidate parking region from the set of region boundary points for the candidate parking region, and determining a region area of an intersection region from the set of region boundary points for the intersection region;

when the ratio of the area of the intersection area to the area of the candidate parking area is smaller than a preset parking coefficient, taking the candidate parking area as the target parking area;

and when the ratio of the area of the intersection area to the area of the candidate parking area is greater than a preset parking coefficient, dividing the candidate parking area according to the area boundary point set of the intersection area to obtain at least one target parking area.

Still further optionally, the step of segmenting the candidate parking regions according to the set of region boundary points of the intersection region comprises:

determining a plurality of candidate parking sub-regions obtained by dividing other regions outside the intersection region in the candidate parking regions by region boundary lines of the intersection region according to the region boundary point set of the intersection region and the region boundary point set of the candidate parking regions;

wherein each candidate parking sub-region has the set of region boundary points corresponding thereto;

determining the area of each candidate parking sub-region according to the region boundary point set of each candidate parking sub-region;

and selecting the candidate parking subarea with the area larger than the preset minimum parking subarea as the target parking area.

Alternatively,

the step of acquiring a candidate parking spot set including a plurality of candidate parking spots includes:

obtaining a candidate parking point corresponding to each vehicle use ending place according to each vehicle use ending place and corresponding vehicle use ending time obtained in a preset statistical time period so as to construct and obtain the candidate parking point set;

and/or the presence of a gas in the gas,

and responding to the received external configuration request, and setting the geographic position with the corresponding time period indicated in the external configuration request as the candidate parking points to construct and acquire the candidate parking point set.

According to a second aspect of the present invention, there is provided a server, comprising:

a memory for storing executable instructions;

and the processor is used for operating the server to execute the parking area acquisition method according to the first aspect of the invention according to the executable instruction.

According to a third aspect of the present invention, there is provided a vehicle system comprising:

a server according to the second aspect of the invention;

a client;

and a vehicle;

wherein,

the client comprises a memory and a processor, wherein the memory is used for storing executable instructions, and the processor is used for operating the client to execute the following steps according to the control of the executable instructions, and comprises the following steps:

generating an external configuration request to be sent to the server in response to an operation of a user to indicate a geographical position with a corresponding time period as a candidate parking spot to the server;

the vehicle includes a memory for storing executable instructions and a processor for operating the vehicle to perform steps, including:

and after the use of the vehicle is finished, providing the corresponding vehicle use finishing point and the corresponding vehicle use finishing time to the server.

According to one embodiment of the disclosure, a candidate parking point set is formed by obtaining a plurality of candidate parking points with corresponding time periods and geographic positions, a candidate parking area is obtained based on the candidate parking point set, at least one target parking area for parking vehicles is obtained according to the candidate parking area and associated road network information associated with the candidate parking area, a parking area which can accurately meet parking requirements is obtained in real time in a self-adaptive manner according to user diversity and mobility vehicle requirements and actual parking limits, the defects of high vehicle management cost and low vehicle management efficiency caused by fixedly setting the parking area are avoided, the vehicle management cost is reduced, and the vehicle management efficiency is improved.

Other features of the present invention and advantages thereof will become apparent from the following detailed description of exemplary embodiments thereof, which proceeds with reference to the accompanying drawings.

Drawings

The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments of the invention and together with the description, serve to explain the principles of the invention.

Fig. 1 is a block diagram showing an example of a hardware configuration of a vehicle system 100 that can be used to implement an embodiment of the invention.

Fig. 2 shows a flowchart of a parking area acquisition method of an embodiment of the present invention.

Fig. 3 is a schematic diagram of an example of acquiring a parking spot cluster according to an embodiment of the present invention.

Fig. 4 is a schematic diagram of an example of a parking candidate area according to an embodiment of the present invention.

FIG. 5 is a schematic diagram of an example of an intersection region of an embodiment of the present invention.

Fig. 6 is a schematic diagram of an example of a candidate parking sub-area of an embodiment of the present invention.

Fig. 7 shows a block diagram of a server 200 of an embodiment of the invention.

FIG. 8 shows a block diagram of a vehicle system 500 of an embodiment of the invention.

Detailed Description

Various exemplary embodiments of the present invention will now be described in detail with reference to the accompanying drawings. It should be noted that: the relative arrangement of the components and steps, the numerical expressions and numerical values set forth in these embodiments do not limit the scope of the present invention unless specifically stated otherwise.

The following description of at least one exemplary embodiment is merely illustrative in nature and is in no way intended to limit the invention, its application, or uses.

Techniques, methods, and apparatus known to those of ordinary skill in the relevant art may not be discussed in detail but are intended to be part of the specification where appropriate.

In all examples shown and discussed herein, any particular value should be construed as merely illustrative, and not limiting. Thus, other examples of the exemplary embodiments may have different values.

It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus, once an item is defined in one figure, further discussion thereof is not required in subsequent figures.

< hardware configuration >

As shown in fig. 1, the vehicle system 100 includes a server 1000, a client 2000, a vehicle 3000, and a network 4000.

The server 1000 provides a service point for processes, databases, and communications facilities. The server 1000 may be a unitary server or a distributed server across multiple computers or computer data centers. The server may be of various types, such as, but not limited to, a web server, a news server, a mail server, a message server, an advertisement server, a file server, an application server, an interaction server, a database server, or a proxy server. In some embodiments, each server may include hardware, software, or embedded logic components or a combination of two or more such components for performing the appropriate functions supported or implemented by the server. For example, a server, such as a blade server, a cloud server, etc., or may be a server group consisting of a plurality of servers, which may include one or more of the above types of servers, etc.

In one example, the server 1000 may be as shown in fig. 1, including a processor 1100, a memory 1200, an interface device 1300, a communication device 1400, a display device 1500, an input device 1600. Although the server may also include speakers, microphones, etc., these components are not relevant to the present invention and are omitted here.

The processor 1100 may be, for example, a central processing unit CPU, a microprocessor MCU, or the like. The memory 1200 includes, for example, a ROM (read only memory), a RAM (random access memory), a nonvolatile memory such as a hard disk, and the like. The interface device 1300 includes, for example, a USB interface, a serial interface, an infrared interface, and the like. Communication device 1400 is capable of wired or wireless communication, for example. The display device 1500 is, for example, a liquid crystal display, an LED display touch panel, or the like. The input device 1600 may include, for example, a touch screen, a keyboard, and the like.

In the present embodiment, the client 2000 is an electronic device having a communication function and a service processing function. The client 2000 may be a mobile terminal, such as a mobile phone, a laptop, a tablet, a palmtop, etc. In one example, the client 2000 is a device that performs management operations on the vehicle 3000, such as a mobile phone installed with an Application (APP) that supports operation and management of the vehicle.

As shown in fig. 1, the client 2000 may include a processor 2100, a memory 2200, an interface device 2300, a communication device 2400, a display device 2500, an input device 2600, an output device 2700, a camera device 2800, and the like. The processor 2100 may be a central processing unit CPU, a microprocessor MCU, or the like. The memory 2200 includes, for example, a ROM (read only memory), a RAM (random access memory), a nonvolatile memory such as a hard disk, and the like. The interface device 2300 includes, for example, a USB interface, a headphone interface, and the like. Communication device 2400 is capable of wired or wireless communication, for example. The display device 2500 is, for example, a liquid crystal display panel, a touch panel, or the like. The input device 2600 may include, for example, a touch screen, a keyboard, or a microphone. The output device 2700 is for outputting information, and may be, for example, a speaker for outputting voice information to a user. The image pickup device 2800 is used for image pickup of acquisition information, and is, for example, a camera or the like. .

The vehicle 3000 is any vehicle that can give the right to share the use by different users in time or separately, for example, a shared bicycle, a shared moped, a shared electric vehicle, a shared vehicle, and the like. The vehicle 3000 may be a bicycle, a tricycle, an electric scooter, a motorcycle, a four-wheeled passenger vehicle, or the like.

As shown in fig. 1, vehicle 3000 may include a processor 3100, a memory 3200, an interface device 3300, a communication device 3400, an output device 3500, an input device 3600, a positioning device 3700, sensors 3800, and so forth. The processor 3100 may be a central processing unit CPU, a microprocessor MCU, or the like. The memory 3200 includes, for example, a ROM (read only memory), a RAM (random access memory), a nonvolatile memory such as a hard disk, and the like. The interface 3300 includes, for example, a USB interface, a headphone interface, and the like. The communication device 3400 can perform wired or wireless communication, for example. The output device 3500 may be, for example, a device that outputs a signal, may be a display device such as a liquid crystal display panel or a touch panel, or may be a speaker or the like that outputs voice information or the like. The input device 3600 may include, for example, a touch panel, a keyboard, or the like, and may input voice information through a microphone. The positioning device 3700 is used to provide positioning function, and may be, for example, a GPS positioning module, a beidou positioning module, etc. The sensor 3800 is used for acquiring vehicle attitude information, and may be, for example, an accelerometer, a gyroscope, or a three-axis, six-axis, nine-axis micro-electro-mechanical system (MEMS), or the like.

The network 4000 may be a wireless communication network or a wired communication network, and may be a local area network or a wide area network. In the article management system shown in fig. 1, a vehicle 3000 and a server 1000, and a client 2000 and the server 1000 can communicate with each other via a network 4000. The vehicle 3000 may be the same as the server 1000, and the network 4000 through which the client 2000 communicates with the server 1000 may be different from each other.

It should be understood that although fig. 1 shows only one server 1000, client 2000, vehicle 3000, it is not meant to limit the corresponding number, and multiple servers 1000, clients 2000, vehicles 3000 may be included in the vehicle system 100.

Taking the vehicle 3000 as an example of a shared bicycle, the vehicle system 100 is a shared bicycle system. The server 1000 is used to provide all the functionality necessary to support shared bicycle use. The client 2000 may be a mobile phone on which a shared bicycle application is installed, which may help a user to obtain a corresponding function using the vehicle 3000, and the like.

The vehicle system 100 shown in FIG. 1 is illustrative only and is not intended to limit the invention, its application, or uses in any way.

In an embodiment of the present invention, the memory 1200 of the server 1000 is configured to store instructions for controlling the processor 1100 to operate to execute the method for acquiring a parking area according to the embodiment of the present invention.

< first embodiment >

In the present embodiment, a method for acquiring a parking area is provided. The parking area is an area where parking of vehicles is allowed, having a geographic location corresponding thereto and an area boundary.

The method for acquiring the parking area, as shown in fig. 2, includes: steps S2100-S2300.

In step S2100, a candidate parking spot set including a plurality of candidate parking spots is acquired.

The candidate parking spot is a place that can be selected as a parking spot. Each candidate parking spot has a geographic location and a time period corresponding thereto. The time period is based on the specific application requirements or the time granularity of application scene division, for example, 24 time periods are divided in 24 hours a day: 0 point-1 point, 1 point-2 point, … … 23 point-24 point, etc. The geographic position may be expressed in the form of geographic coordinates and the like, and the geographic coordinates may be based on a coordinate system selected according to a specific application requirement or application scenario, for example, a geographic coordinate system based on longitude and latitude.

The method comprises the steps of obtaining a plurality of candidate parking points with corresponding time periods and geographic positions to form a candidate parking point set, combining subsequent steps, obtaining candidate parking areas based on the candidate parking point set, obtaining at least one target parking area for parking vehicles according to the candidate parking areas and associated road network information associated with the candidate parking areas, obtaining the parking areas meeting parking requirements in real time in a self-adaptive mode according to user diversity and mobility vehicle requirements and actual parking limits, avoiding the defects of high vehicle management cost and low vehicle management efficiency caused by fixedly setting the parking areas, reducing vehicle management cost and improving vehicle management efficiency.

In one example, the step of obtaining a candidate parking spot set including a plurality of candidate parking spots may include:

and obtaining a candidate parking point corresponding to each vehicle use ending place according to each vehicle use ending place and the corresponding vehicle use ending time obtained in a preset statistical time period so as to construct and obtain a candidate parking point set.

The vehicle use ending place is a place where a vehicle is parked after the vehicle use process is ended. The vehicle use end time is the time after a vehicle finishes a vehicle use process. For example, the vehicle is a shared bicycle provided with an intelligent lock, the vehicle use end point is a lock vehicle point, and the corresponding vehicle use end time is the corresponding lock vehicle time.

In this example, the method for acquiring the parking area may be implemented by a server, which may be any device providing data management services, such as a cloud server or a blade server. Specifically, the server may be the server 1000 in the vehicle system 100 shown in fig. 1. The server can establish communication with each vehicle which is put into the vehicle use service for interaction, so that when each vehicle is used by a user, the vehicle use ending place and the corresponding vehicle use ending time when the vehicle is used by the user are obtained.

And counting the acquired use ending points of each vehicle within a preset counting time period, determining a corresponding geographic position according to the acquired use ending points of each vehicle, and determining a corresponding time period based on the corresponding use ending time of the vehicle, so as to determine a candidate parking point with the geographic position and the time period corresponding to the candidate parking point.

The preset statistical time period may be set according to a specific application scenario or application scenario. For example, the preset statistical period may be the last week, each hour is a time period within 24 hours of the day, and the corresponding candidate parking points may be obtained according to the vehicle use end point and the corresponding vehicle use end time obtained in the last week, for example, a vehicle use end point is a point a, a corresponding vehicle use end time is 10 points 24 points of the monday, a corresponding obtained candidate parking point has a time period of 10 points-11 points and a geographic position is a point, a vehicle use end point is a point a, a corresponding vehicle use end time is 10 points 52 points of the tuesday, and a corresponding obtained candidate parking point also has a time period of 10 points-11 points and a geographic position is a point.

The candidate parking point set is constructed through the candidate parking points acquired according to the vehicle use ending positions and the corresponding vehicle use ending time acquired through statistics, the candidate parking points are determined according to the actual vehicle use conditions of the users, and the candidate parking point set which is adaptive to the vehicle demands of the diversity and mobility of the users can be formed, so that the subsequent steps are combined, the vehicle demands of the users are accurately adapted, the target parking area of the vehicle which is finally supplied for parking is acquired, the vehicle management cost is reduced, and the vehicle management efficiency is improved.

In another example, the step of obtaining a candidate parking spot set including a plurality of candidate parking spots may include:

and in response to the received external configuration request, setting the geographic position with the corresponding time period indicated in the external configuration request as the candidate parking points to construct an acquisition candidate parking point set.

In this example, the external configuration request may be generated by a user operating a client (the client may be a mobile phone installed with an APP providing a vehicle use service) providing a vehicle use service according to a parking request of the user, the client sends the external configuration request to a server implementing the method for acquiring a parking area in this example, and the server sets a candidate parking point according to a geographic position indicated in the external configuration request and having a corresponding time period, so as to acquire a plurality of candidate parking points to construct a candidate parking point set, thereby implementing construction of a corresponding candidate parking point set according to a user personalized and multi-sample vehicle use requirement, so as to combine subsequent steps, precisely adapt to a vehicle use requirement of the user, acquire a target parking area of a vehicle finally provided for parking, reduce vehicle management cost, and improve vehicle management efficiency.

It should be understood that, in practical applications, the candidate parking points may be jointly acquired through the steps of acquiring the candidate parking point sets in the above two examples to construct the candidate parking point set, so as to meet the requirements of practical applications.

After step S2100, the flow proceeds to:

step S2200 is to acquire at least one candidate parking area from the set of candidate parking spots.

The candidate parking areas are candidate areas for a user to park the vehicle. Each candidate parking area has a geographic location corresponding thereto and an area boundary.

The candidate parking areas are obtained from the candidate parking point set, and the subsequent steps can be combined to obtain at least one target parking area for the parked vehicles according to the candidate parking areas and the associated road network information associated with the candidate parking areas, so that the corresponding parking areas can be obtained in real time in a self-adaptive manner according to the vehicle using requirements of user diversity and mobility, the defects of high vehicle management cost and low vehicle management efficiency caused by fixedly setting the parking areas are overcome, the vehicle management cost is reduced, and the vehicle management efficiency is improved.

In one example, step S2200 may include steps S2210-S2220.

Step S2210, obtaining at least one parking spot cluster from the candidate parking spot set.

The candidate parking point set comprises a plurality of candidate parking points, and each candidate parking point has a corresponding time period and a corresponding geographic position. Each parking point cluster acquired from the candidate parking point set comprises a candidate parking point serving as a cluster starting point and other candidate parking points which have the same time period as the cluster starting point and are less than a preset distance threshold from the cluster starting point, and in each parking point cluster, the number of the candidate parking points which have the same time period as the cluster starting point and are less than the preset distance threshold from the cluster starting point is greater than a preset density threshold.

The preset distance threshold is a threshold used for judging whether two candidate parking spots are adjacent or not according to the distance between the two candidate parking spots, and can be set according to a specific application scene or application requirements. For example, set at 10 meters.

The preset density threshold is a threshold used for judging whether a candidate parking point can be used as a cluster starting point according to the number of adjacent candidate parking points of the candidate parking point, and may be set according to a specific application scenario or an application requirement. For example, the preset density threshold may be set to 5. For example, the cluster starting point is the number of other candidate parking spots within 10 meters of the surrounding radius, which is greater than 5 candidate parking spots.

The cluster starting point and other candidate parking points which have the same time period with the cluster starting point, are less than the preset distance threshold range from the cluster starting point and are greater than the preset density threshold are used as a parking point cluster, the candidate parking points with the same time period and concentrated region distribution can be aggregated into a parking point cluster, and the corresponding candidate parking area is obtained by combining the subsequent steps, so that the obtained corresponding candidate parking area is an area with frequent parking demands of users, the target parking area obtained from the candidate parking area in the subsequent steps can be more accurately adapted to the diversified and mobile vehicle demands of the users, and the vehicle management efficiency is further improved.

In practical implementation, any one candidate parking point in the candidate parking point set can be selected, when the number of other candidate parking points which have the same time period as the candidate parking point and have a distance to the candidate parking point smaller than a preset distance threshold is larger than a preset density threshold, the candidate parking point can be used as a cluster starting point, the candidate parking point and other candidate parking points which have the same time period as the candidate parking point and have a distance to the candidate parking point smaller than the preset distance threshold are aggregated to obtain a parking point cluster, all candidate parking points included in the parking point cluster are marked as processed, otherwise, after the candidate parking point is marked as processed, the next cluster starting point is continuously searched in the candidate parking point in a traversal manner until all candidate parking points in the candidate parking point set are marked as processed and then end, thereby obtaining at least one parking point cluster from the candidate parking point set.

In practical applications, since a plurality of candidate parking points included in the candidate parking point set may be distributed in the same time period within different statistical dates (for example, distributed in 1-2 points on monday, tuesday, wednesday, etc.), and the different statistical dates may cause sudden change of filling the obtained candidate parking points due to objective factors such as weather change, traffic control, etc. (for example, the number of candidate parking points in a certain area in a certain time period on a certain day is increased due to traffic control on a certain day), which may affect the accuracy of finally obtaining the parking point cluster from the candidate parking point set, it is necessary to remove the sudden change, so as to avoid affecting the accuracy of finally obtaining the parking point cluster from the candidate parking point set. In this example, the method may further include: the number of candidate parking points included in the parking point cluster is greater than the aggregate mean.

The aggregate average is the average of the number of vehicle use end points in the geographic area and the time period corresponding to the parking point cluster, which is obtained according to the vehicle use data in the historical statistical time length.

The historical statistical duration may be set according to specific application requirements or application scenarios, as long as the duration is long enough to ignore objective factors causing sudden and even changes, for example, the historical statistical duration may be set to be one week or one month, where the sudden and even changes may occur in a certain period of the day.

The vehicle usage data is related data generated by the vehicles being used within the historical statistical time period, and may include a vehicle usage end point and a vehicle usage end time generated during each use of each vehicle.

The time period corresponding to the parking point cluster is the same time period that all candidate parking points included in the parking point cluster have, and the geographic area corresponding to the parking point cluster may be a geographic area that is centered at a cluster start point of the parking point cluster or an average point obtained according to geographic positions of all candidate parking points of the parking point cluster, and is obtained by a preset area radius set according to an application scene or an application requirement.

According to the time period corresponding to the parking point cluster and the aggregation average value obtained by the vehicle use end points in the geographic area, which are obtained according to the vehicle use data in the historical statistics time length, the obtained parking point cluster can ignore objective factors causing sudden and even changes, the actual use scene of the vehicle can be more accurately adapted, and the accuracy of obtaining the parking point cluster from the candidate parking point set is ensured.

For example, as shown in fig. 3, the geographical distribution of the candidate parking points included in the candidate parking point set is shown in the left diagram in fig. 3, and the parking point clusters shown in the diagram in fig. 3 can be obtained according to step S2100, wherein each of the small circles represents one parking point cluster.

Step S2220, according to the determined radius of the parking area, the center point of each parking point cluster is used as the center point of the parking area, and candidate parking areas corresponding to each parking point cluster are obtained through division.

In this example, the parking area radius is an area radius of the candidate parking area, and may be determined according to a specific application scenario or application requirements.

For example, the method for acquiring a parking area in this example further includes:

and determining the radius of the parking area according to a preset density threshold, an aggregation average value and a preset radius coefficient.

The preset density threshold and the aggregation average have been described in detail above, and are not described herein again.

The preset radius coefficient is a reference coefficient used for determining the radius of the parking area, and the unit of the preset radius coefficient is the same as that of the radius of the parking area, and can be set according to a specific application scene or application requirements.

Taking λ as a preset density threshold, μ as an aggregation average value, and ρ as a preset radius coefficient, the radius x of the corresponding parking area is:

the center point of each parking spot cluster may be a cluster start point of the parking spot cluster or a mean point obtained from the geographical positions of all candidate parking spots included in the parking spot cluster.

With the center point of the parking spot cluster as the center point of the parking area, the resulting candidate parking area divided according to the determined radius of the parking area may be a circular area, for example, a circular area as shown in fig. 4.

In this example, each candidate parking area has a set of area boundary points corresponding thereto, the set of area boundary points including all of the area boundary points, each area boundary point having geographic coordinates corresponding thereto.

For example, taking the candidate parking area as a circular area shown in fig. 4 as an example, the center point of the candidate parking area is the center point of the corresponding parking point cluster, and the center point (whether the cluster start point or the center point) has a geographic location corresponding thereto, according to the determined radius of the parking area, the corresponding area boundary may be determined to be the boundary of the circular area shown in fig. 4, the geographic locations of all area boundary points on the area boundary are correspondingly obtained, and according to a preset coordinate system (e.g., a geographic coordinate system based on longitude and latitude), the geographic coordinate corresponding to each area boundary point may be correspondingly determined.

After step S2200, the process proceeds to:

step S2300, for each candidate parking area, obtaining at least one target parking area available for parking vehicles from the candidate parking areas according to the obtained associated road network information associated with the candidate parking area.

Candidate parking areas are candidate areas that may be used to park a vehicle. Each candidate parking area has a geographic location corresponding thereto and an area boundary. For example, the zone boundaries of the candidate parking zones may be represented by a set of zone boundary points that the candidate parking zones have, i.e., each candidate parking zone has a set of zone boundary points corresponding thereto. The set of zone boundary points for the candidate parking zones includes all of the zone boundary points in the candidate parking zones. Each region boundary point has geographic coordinates corresponding thereto. The geographic coordinate system may be represented based on a preset coordinate system, and the preset coordinate system may be set according to a specific application scenario or application requirements, for example, the geographic coordinate system may be based on longitude and latitude, and the like. For example, when the parking candidate area is a circular area as shown in fig. 4, the set of area boundary points includes at least all spatial points on the boundary line of the circular area as the area boundary point.

The related road network information is road network information related to the parking candidate areas. For example, the related road network information may be road network information of a geographical area where the candidate parking area is located. The geographic area in which the candidate parking area is located may coincide with the candidate parking area or may include the candidate parking area. The road network information generally includes distribution information of all geographic objects such as roads, buildings, residential areas, rivers, and mountains in a geographic area. The related road network information may be acquired from a map database constructed in advance or map information acquired in advance.

For example, the associated road network information at least includes a set of regional boundary points of the geographic object forbidden to park vehicles in the geographic region where the candidate parking region is located. The set of region boundary points includes all region boundary points of the forbidden geographic object. Each region boundary point has geographic coordinates corresponding thereto. The parking-prohibited geographic object is any geographic object that does not allow a vehicle to be parked, and may be, for example, a road, a building, a residential area, a river, a mountain, or the like. Taking the candidate parking area shown in fig. 4 as an example, the parking-prohibited geographic object may be a road involved in a circular area of the candidate parking area.

According to the obtained associated road network information associated with the candidate parking areas, at least one target parking area for parking vehicles is obtained from the candidate parking areas, the change of parking requirements and related limitations can be integrated, the target parking area accurately meeting the vehicle using requirements can be obtained adaptively according to the vehicle using requirements of user diversity and mobility, the vehicle management cost is reduced, and the vehicle management efficiency is improved.

In one example, each candidate parking area has a set of area boundary points corresponding thereto. The set of zone boundary points includes all zone boundary points in the candidate parking zone. Each region boundary point has geographic coordinates corresponding thereto. The associated road network information at least comprises a regional boundary point set of the geographic objects which can not park vehicles in the geographic region where the candidate parking region is located. Step S2300 may include: steps S2310-S2330.

Step S2310, determining at least one associated no-parking area associated with the candidate parking area according to the associated road network information of the candidate parking area.

Each associated no-parking zone has a set of zone boundary points corresponding thereto. The region boundary point set of the associated no-parking region comprises all region boundary points of the associated no-parking region.

In this example, the associated no-parking area may be an area where parking of the vehicle is prohibited, which is included in the area covered by the candidate parking area.

The candidate parking areas are provided with area boundary point sets corresponding to the candidate parking areas, the associated road network information of the candidate parking areas comprises the area boundary point sets of the geographic objects which cannot be used for parking vehicles in the geographic area where the candidate parking areas are located, and the associated no-parking areas of the candidate parking areas can be correspondingly obtained according to the associated road network information.

For example, step S2310 may include: steps S2311-S2312.

Step S2311, obtaining a regional spatial relationship between the candidate parking area and each of the forbidden geographic objects according to the regional boundary point set of the candidate parking area and the regional boundary point set of each of the forbidden geographic objects included in the associated road network information, respectively.

The regional spatial relationship is the relative relationship of two geographic regions in space. In this example, the regional spatial relationships include at least regional intersecting relationships and non-regional intersecting relationships. The region intersecting relationship means that the spatial regions occupied by the two geographic regions at least partially overlap. A non-regional intersection relationship refers to a relationship where two geographic regions do not have any overlap in the occupied spatial region.

In a more specific example, step S2311 may include steps S23111-S23112.

Step S23111, determining a region space range of the candidate parking region according to the region boundary point set of the candidate parking region, and determining a region space range of the forbidden geographic object according to the region boundary point set of each forbidden geographic object, respectively.

The regional spatial extent includes the region outside, the region inside, and the region boundary.

The set of zone boundary points for the candidate parking zones includes all zone boundary points on the zone boundary of the candidate parking zones. According to the region boundary point set of the parking candidate region, the region boundary composed of all the region boundary points can be determined, after the region boundary is determined, the space outside the region boundary can be determined to be outside the region, and the space outside the region boundary can be determined to be inside the region. Taking the parking candidate area of the circular area shown in fig. 4 as an example, the area space range of the parking candidate area includes a circular boundary line of the circular area as an area boundary, an area inside configured by the inside of the circular area, and an area outside configured by a space outside the circular area.

Similarly, the set of region boundary points of the forbidden geographic object includes all the region boundary points on the region boundary of the forbidden geographic object, and the region boundary, the region outside, and the region inside of the forbidden geographic object can be correspondingly determined.

Step S23112, for each of the no-parking geographic objects, performing intersection operation on any one of the outside of the area, the inside of the area, and the boundary of the no-parking geographic object and any one of the outside of the area, the inside of the area, and the boundary of the area of the candidate parking area, to obtain an area-space relationship.

Correspondingly, the area space relationship comprises any one of the area outside, the area inside and the area boundary of the candidate parking area, and the space relative relationship between any one of the area outside, the area inside and the area boundary of the forbidden geographic object.

The regional spatial relationship between the candidate parking regions and each of the parking-prohibited geographic objects may be as shown in table 1.

TABLE 1 regional spatial relationship between candidate parking regions and each of the parking-prohibited geographic objects

The intersection operation processing is to perform intersection comparison on the space point sets respectively forming the two space objects, and determine whether the same space point exists in the two space point sets, so as to obtain an intersection operation result. Wherein the set of spatial points includes all spatial points that constitute the corresponding spatial object, each spatial point having geographic coordinates corresponding thereto.

For example, in this example, the intersection operation processing is performed on the outside of the area where the geographic object is prohibited and the outside of the candidate parking area, and all spatial points outside the area where the geographic object is prohibited and all spatial points outside the area where the candidate parking area are configured may be intersected and compared to obtain the intersection operation processing result of whether the same spatial points exist, so as to correspondingly obtain the spatial relative relationship between the outside of the area where the geographic object is prohibited and the outside of the candidate parking area.

The spatial relative relationship includes an intersecting relationship or a non-intersecting relationship. When the intersection operation processing result is that the same space point does not exist, the space relative relation is a non-intersection relation; when the intersection operation processing result indicates that the same spatial point exists, the spatial relative relationship is an intersection relationship.

In this example, the area intersection relationship is that the inside of the candidate parking area is in an intersection relationship with the inside of the area where the geographic object is prohibited, and the inside of the candidate parking area is in an intersection relationship with the area boundary where the geographic object is prohibited. It should be understood that the above definition regarding the area intersection relationship does not define the spatial relative relationship of one of the area boundaries, the area outside of the parking candidate area, the area inside of the parking candidate area, and the area boundary outside of the parking forbidden geographic object, and the spatial relative relationship of the area inside of the parking candidate area and the area outside of the parking forbidden geographic object, as shown in table 2 below.

TABLE 2 regional intersection relations

Step S2312, each forbidden geographic object whose regional spatial relationship is a regional intersection relationship is determined as a related forbidden zone.

The area space relationship with the candidate parking area is a stop-stopping geographic object in an area intersection relationship, the stop-stopping geographic object conflicts with the area coverage of the candidate parking area, a space area occupied by the stop-stopping geographic object can be determined as a related stop-stopping area, and correspondingly, a boundary area point set of the stop-stopping geographic object is an area boundary point set of the related stop-stopping area.

After step S2310, the process proceeds to:

step S2320, determining an intersection area between the candidate parking area and the associated no-parking area according to the boundary area point set of the candidate parking area and the boundary area point set of each associated no-parking area.

The intersection area is an area where the candidate parking area and the associated no-parking area overlap in space. The intersection region has a set of region boundary points corresponding thereto. The set of region boundary points for the intersection region includes all of the region boundary points on the region boundary of the intersection region. Each region boundary point has geographic coordinates corresponding thereto.

In a specific example, step S2320 may include steps S2321-S2322.

Step S2321, the area space range of the candidate parking area is determined according to the area boundary point set of the candidate parking area, and the area space range of the associated no-parking area is determined according to the area boundary point set of each associated no-parking area.

The specific implementation method for determining the candidate parking area or the area space range associated with the no-parking area may be similar to step S23111, and is not described herein again.

Step S2322, according to the result of the intersection operation processing performed by the interior of the candidate parking area and the area boundary of each associated no-parking area, an area boundary point set of the intersection area is obtained to determine the intersection area.

The intersection operation processing is to perform intersection comparison on the space point sets respectively forming the two space objects, and determine whether the same space point exists in the two space point sets, so as to obtain the result of the intersection operation processing. Wherein the set of spatial points includes all spatial points that constitute the corresponding spatial object, each spatial point having geographic coordinates corresponding thereto.

In this example, a space point set formed by all space points included in an area of the candidate parking area may be intersected and compared with a space point set formed by all space points included in an area boundary of one associated no-parking area, a result of the intersection operation processing may include the same space points in two space point sets, an area formed by the same space points is an intersection area of the candidate parking area and the associated no-parking area, and so on, the space points in the candidate parking area and each associated no-parking area may be obtained, an area obtained by collecting all the same space points is an intersection area of the candidate parking area and all the associated no-parking areas, and an area boundary point set is obtained by area boundary points included in the area boundary of the area to determine the intersection area.

For example, taking the parking candidate areas and the associated road network information shown in fig. 4 as an example, the finally determined intersection areas are shown in fig. 5.

Step S2330, obtaining at least one target parking area from the candidate parking areas according to the intersection area.

The intersection area is an area where there is overlapping coverage in space between the candidate parking area and all associated no-parking areas.

In this example, the intersection area in the candidate parking area can be directly cut down to obtain the corresponding target parking area.

However, in practical applications, the intersection region may be a region without a regular shape, and the regions obtained by directly cutting off the intersection region in the parking candidate region are scattered, or the intersection region may occupy a larger region, the region obtained by directly cutting off the intersection region in the parking candidate region is too small, and the like, so that the region obtained by directly cutting off the intersection region in the parking candidate region is not enough to meet the actual parking requirement.

Thus, in one specific example, step S2330 may comprise: steps S2331-S2333.

Step S2331, determine the area of the parking candidate area from the set of area boundary points of the parking candidate area, and determine the area of the intersection area from the set of area boundary points of the intersection area.

In this example, the set of region boundary points of the parking candidate region includes all the region boundary points of the region boundary of the parking candidate region, and the region occupied by the parking candidate region in the space can be determined according to these region boundary points, and the region area can be obtained by corresponding calculation.

In step S2332, when the ratio of the area of the intersection area to the area of the parking candidate area is smaller than a preset parking coefficient, the parking candidate area is taken as the target parking area.

The preset parking coefficient is a coefficient value for judging whether the candidate parking area can be used as the target parking area according to the area of the intersection area and the area of the candidate parking area, and can be set according to a specific application scene or application requirements.

When the ratio of the area of the intersection region to the area of the candidate parking region is smaller than the preset parking coefficient, the area of the intersection region is considered to be small enough or negligible relative to the area of the candidate parking region, and the candidate parking region can be directly used as a target parking region, so that the processing efficiency is improved.

Step S2333, when the ratio of the area of the intersection area to the area of the candidate parking area is greater than a preset parking coefficient, dividing the candidate parking area according to the area boundary point set of the intersection area to obtain at least one target parking area.

When the ratio of the area of the intersection region to the area of the candidate parking region is greater than the preset parking coefficient, it may be considered that the area of the intersection region is larger than the area of the candidate parking region, and it may be difficult to satisfy the actual parking demand by directly using the candidate parking region as a target parking region, so that the candidate parking region needs to be segmented according to the set of region boundary points of the intersection region, and at least one target parking region satisfying the actual parking demand is obtained.

In a specific example, step S2333 may include the steps 23331-S23333.

In step S23331, a plurality of parking candidate sub-regions, which are obtained by dividing a region other than the intersection region among the parking candidate regions by the region boundary line of the intersection region, are determined based on the region boundary point set of the intersection region and the region boundary point set of the parking candidate regions.

Each candidate parking sub-region has a set of region boundary points corresponding thereto, the set of region boundary points for the candidate parking sub-region including region boundary points on a region boundary of the candidate parking sub-region, each region boundary point having geographic coordinates corresponding thereto.

The set of zone boundary points of the intersection zone includes zone boundary points on the zone boundary of the intersection zone, each zone boundary point having geographic coordinates corresponding thereto that may correspond to a zone boundary line of the intersection zone. The set of zone boundary points for the candidate parking zone includes zone boundary points on the zone boundary of the candidate parking zone, each zone boundary point having geographic coordinates corresponding thereto that may correspond to a zone boundary line for the candidate parking zone.

According to the determined zone boundary line of the intersection zone and the zone boundary line of the candidate parking zone, the zone boundary of each candidate sub-zone obtained by dividing the zone boundary line of the intersection zone as a dividing line can be determined, a zone boundary point set of each candidate sub-zone is correspondingly obtained, and each candidate parking sub-zone is determined.

For example, taking the parking candidate area shown in fig. 4 and the intersection area shown in fig. 5 as an example, the divided parking candidate sub-areas such as the area A, B, C, D, E shown in fig. 6 can be obtained.

Step S23332, determine the area of each parking candidate sub-area according to the set of area boundary points of each parking candidate sub-area.

In this example, the region boundary point set of the candidate parking sub-region includes all the region boundary points of the region boundary of the candidate parking sub-region, and the region occupied by the candidate parking sub-region in the space can be determined according to the region boundary points, and the region area is correspondingly calculated and obtained.

In step S23333, a candidate parking sub-area having an area larger than a preset minimum parking area is selected as a target parking area.

The preset minimum parking area is the minimum area which meets the minimum parking requirement and can be used for parking vehicles, and can be set according to a specific application scene or application requirement.

And selecting the candidate parking subarea with the area larger than the preset minimum parking subarea as the target parking area, so that the acquired area of the target parking area can meet the minimum parking requirement.

Taking the candidate parking sub-regions shown in fig. 6 as regions A, B, C, D, E as an example, assuming that the region area of the region A, B is smaller than the preset minimum parking region area, the target parking regions can be obtained as regions C, D, E, respectively.

< Server >

In this embodiment, there is also provided a server 200, as shown in fig. 7, including:

a memory 210 for storing executable instructions;

and a processor 220, configured to execute the server to perform the method for acquiring a parking area according to the executable instruction.

In this embodiment, the server 200 may be embodied in various forms of entities. For example, the server 200 may be a cloud server. The server 200 may also be the server 1000 as shown in fig. 1.

Those skilled in the art will appreciate that server 200 may be implemented in a variety of ways. For example, server 200 may be implemented by an instruction configuration processor. For example, the server 200 may be implemented by storing instructions in ROM and reading the instructions from ROM into a programmable device when the device is started. For example, the server 200 may be consolidated into a dedicated device (e.g., ASIC). The server 200 may be divided into separate units or may be implemented by combining them together. The server 200 may be implemented in one of the various implementations described above, or may be implemented in a combination of two or more of the various implementations described above.

The method for acquiring a parking area and the server provided in this embodiment have been described above with reference to the accompanying drawings and examples, and may be configured to acquire a candidate parking point set including a plurality of candidate parking points with corresponding time periods and geographic positions, acquire a candidate parking area based on the candidate parking point set, acquire at least one target parking area available for parking vehicles according to the candidate parking area and associated road network information associated with the candidate parking area, and adaptively acquire a parking area accurately meeting parking requirements in real time according to user diversity and mobility vehicle demands and actual parking restrictions, so as to avoid the defects of high vehicle management cost and low vehicle management efficiency caused by fixedly setting a parking area, reduce vehicle management cost, and improve vehicle management efficiency.

< second embodiment >

In the present embodiment, there is also provided a vehicle system 500, as shown in fig. 8, including:

the server 200 provided in the first embodiment;

a client 300;

and a vehicle 400.

The client 300 may include a memory 310 and a processor 320. The memory 310 is used for storing executable instructions, and the processor 320 is used for operating the client 300 to execute the following steps according to the control of the executable instructions, including:

in response to a user's operation, an external configuration request is generated to be sent to the server to indicate a geographic location with a corresponding time period as a candidate parking spot to the server.

The client 300 may be a mobile phone, a tablet computer, a palm computer, a notebook computer, etc. In one example, the client 300 may be a mobile terminal that acquires a service to use the vehicle 400, for example, a mobile phone installed with an Application (APP) to acquire a vehicle use service. Client 300 may also include other devices, such as client 2000 as shown in FIG. 1.

The vehicle 400 includes a memory 410 and a processor 420, the memory 410 being configured to store executable instructions, the processor 420 being configured to operate the vehicle 400 to perform the following steps, under control of the executable instructions, including:

after the use of the vehicle is completed, the corresponding vehicle use completion point and the corresponding vehicle use completion time are provided to the server 200.

The vehicle 400 is any vehicle that can be shared by different users, such as a shared bicycle, a shared moped, a shared electric vehicle, a shared vehicle, and so on. The vehicle 400 may be of various forms such as a bicycle, a tricycle, an electric scooter, a motorcycle, and a four-wheeled passenger vehicle. For example, the vehicle 400 may be the vehicle 3000 as shown in fig. 1.

In the present embodiment, the vehicle system 500 may be the vehicle system 1000 shown in fig. 1. In the vehicle system 500, the server 200 establishes communication connections with the client 300 and the vehicle 400 respectively for interaction; the server 200 may receive an external configuration request sent by the client 300, and set a geographical position indicated by the external configuration request and having a corresponding time period as a candidate parking spot; the server 200 may also receive a vehicle use end point and a vehicle use end time provided by the vehicle 400 after the vehicle 400 is used, and obtain a candidate parking point corresponding to each vehicle use end point according to each vehicle use end point and the corresponding vehicle use end time obtained within a preset statistical time period; the server 200 acquires a candidate parking point set including a plurality of candidate parking points by acquiring the plurality of candidate parking points, acquires a candidate parking area based on the candidate parking point set according to the method for acquiring a parking area provided in the first embodiment, acquires at least one target parking area available for parking vehicles according to the candidate parking area and associated road network information associated with the candidate parking area, adaptively acquires a parking area accurately meeting parking requirements according to user diversity and mobility vehicle demands and actual parking restrictions, avoids the defects of high vehicle management cost and low vehicle management efficiency caused by fixedly setting the parking area, reduces vehicle management cost, and improves vehicle management efficiency.

The present invention may be a system, method and/or computer program product. The computer program product may include a computer-readable storage medium having computer-readable program instructions embodied therewith for causing a processor to implement various aspects of the present invention.

The computer readable storage medium may be a tangible device that can hold and store the instructions for use by the instruction execution device. The computer readable storage medium may be, for example, but not limited to, an electronic memory device, a magnetic memory device, an optical memory device, an electromagnetic memory device, a semiconductor memory device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a Static Random Access Memory (SRAM), a portable compact disc read-only memory (CD-ROM), a Digital Versatile Disc (DVD), a memory stick, a floppy disk, a mechanical coding device, such as punch cards or in-groove projection structures having instructions stored thereon, and any suitable combination of the foregoing. Computer-readable storage media as used herein is not to be construed as transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission medium (e.g., optical pulses through a fiber optic cable), or electrical signals transmitted through electrical wires.

The computer-readable program instructions described herein may be downloaded from a computer-readable storage medium to a respective computing/processing device, or to an external computer or external storage device via a network, such as the internet, a local area network, a wide area network, and/or a wireless network. The network may include copper transmission cables, fiber optic transmission, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers. The network adapter card or network interface in each computing/processing device receives computer-readable program instructions from the network and forwards the computer-readable program instructions for storage in a computer-readable storage medium in the respective computing/processing device.

The computer program instructions for carrying out operations of the present invention may be assembler instructions, Instruction Set Architecture (ISA) instructions, machine-related instructions, microcode, firmware instructions, state setting data, or source or object code written in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The computer-readable program instructions may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider). In some embodiments, aspects of the present invention are implemented by personalizing an electronic circuit, such as a programmable logic circuit, a Field Programmable Gate Array (FPGA), or a Programmable Logic Array (PLA), with state information of computer-readable program instructions, which can execute the computer-readable program instructions.

Aspects of the present invention are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer-readable program instructions.

These computer-readable program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks. These computer-readable program instructions may also be stored in a computer-readable storage medium that can direct a computer, programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer-readable medium storing the instructions comprises an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.

The computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer, other programmable apparatus or other devices implement the functions/acts specified in the flowchart and/or block diagram block or blocks.

The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s). In some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions. It is well known to those skilled in the art that implementation by hardware, by software, and by a combination of software and hardware are equivalent.

Having described embodiments of the present invention, the foregoing description is intended to be exemplary, not exhaustive, and not limited to the embodiments disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the described embodiments. The terminology used herein is chosen in order to best explain the principles of the embodiments, the practical application, or improvements made to the technology in the marketplace, or to enable others of ordinary skill in the art to understand the embodiments disclosed herein. The scope of the invention is defined by the appended claims.

Claims

1. A method for acquiring a parking area comprises the following steps:

for each candidate parking area, acquiring at least one target parking area for parking vehicles from the candidate parking areas according to the acquired associated road network information associated with the candidate parking areas;

each of the candidate parking areas has a set of area boundary points corresponding thereto, the set of area boundary points including all of the area boundary points, each of the area boundary points having geographic coordinates corresponding thereto;

2. The method of claim 1, wherein the step of obtaining at least one candidate parking area from the set of candidate parking spots comprises:

the center point of the parking point cluster is the cluster starting point of the parking point cluster, or is a mean point obtained according to the geographic positions of all the candidate parking points included in the parking point cluster;

3. The method of claim 2, wherein the method further comprises:

and/or the presence of a gas in the gas,

4. The method of claim 1, wherein,

the step of determining at least one associated no-parking area associated with the candidate parking area according to the associated road network information of the candidate parking area comprises:

5. The method of claim 4, wherein the step of obtaining the regional spatial relationship of the candidate parking region to each of the forbidden geographic objects comprises:

6. The method of claim 1, wherein the step of determining an intersection area between the candidate parking area and the associated no-parking area from the set of boundary area points of the candidate parking area and the set of boundary area points of each of the associated no-parking areas comprises:

wherein the regional spatial extent includes a regional exterior, a regional interior, and a regional boundary; and acquiring the region boundary point set of the intersection region according to the result of intersection operation processing between the region inside the candidate parking region and the region boundary of each associated no-parking region so as to determine the intersection region.

7. The method of claim 1, wherein the step of obtaining at least one target parking area from the candidate parking areas according to the intersection area comprises:

8. The method of claim 7, wherein the step of segmenting the candidate parking regions according to the set of region boundary points for the intersection region comprises:

9. The method of claim 1, wherein,

obtaining a candidate parking point corresponding to each vehicle use ending point according to each vehicle use ending point and corresponding vehicle use ending time obtained in a preset statistical time period so as to construct and obtain the candidate parking point set;

and/or the presence of a gas in the gas,

10. A server, comprising:

a memory for storing executable instructions;

a processor for operating the server to perform the parking area acquisition method according to any one of claims 1 to 9, according to the executable instructions.

11. A vehicle system, comprising:

the server of claim 10;

a client;

and a vehicle;

wherein,