CN113793506A - Method, system, device and storage medium for setting vehicle no-parking area - Google Patents
Method, system, device and storage medium for setting vehicle no-parking area Download PDFInfo
- Publication number
- CN113793506A CN113793506A CN202111222037.5A CN202111222037A CN113793506A CN 113793506 A CN113793506 A CN 113793506A CN 202111222037 A CN202111222037 A CN 202111222037A CN 113793506 A CN113793506 A CN 113793506A
- Authority
- CN
- China
- Prior art keywords
- vehicle
- area
- historical
- determining
- candidate area
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 47
- 238000003860 storage Methods 0.000 title claims abstract description 17
- 230000011218 segmentation Effects 0.000 claims description 17
- 230000004044 response Effects 0.000 claims description 8
- 238000012545 processing Methods 0.000 description 25
- 238000012986 modification Methods 0.000 description 11
- 230000004048 modification Effects 0.000 description 11
- 230000008569 process Effects 0.000 description 9
- 230000008901 benefit Effects 0.000 description 8
- 238000010586 diagram Methods 0.000 description 8
- 230000006870 function Effects 0.000 description 5
- 238000012423 maintenance Methods 0.000 description 5
- 230000014509 gene expression Effects 0.000 description 4
- 238000000547 structure data Methods 0.000 description 4
- 230000004913 activation Effects 0.000 description 3
- 238000004891 communication Methods 0.000 description 3
- 230000000694 effects Effects 0.000 description 3
- 230000006872 improvement Effects 0.000 description 3
- 239000000463 material Substances 0.000 description 3
- 230000000644 propagated effect Effects 0.000 description 3
- 101100134058 Caenorhabditis elegans nth-1 gene Proteins 0.000 description 2
- 230000006978 adaptation Effects 0.000 description 2
- 238000003491 array Methods 0.000 description 2
- 238000004590 computer program Methods 0.000 description 2
- 238000011161 development Methods 0.000 description 2
- 230000018109 developmental process Effects 0.000 description 2
- 238000004519 manufacturing process Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 241001465754 Metazoa Species 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 230000000712 assembly Effects 0.000 description 1
- 238000000429 assembly Methods 0.000 description 1
- 238000012790 confirmation Methods 0.000 description 1
- 230000007717 exclusion Effects 0.000 description 1
- 230000002349 favourable effect Effects 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 239000010977 jade Substances 0.000 description 1
- 239000003607 modifier Substances 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 230000001172 regenerating effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 241000894007 species Species 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/01—Detecting movement of traffic to be counted or controlled
- G08G1/0104—Measuring and analyzing of parameters relative to traffic conditions
- G08G1/0125—Traffic data processing
- G08G1/0129—Traffic data processing for creating historical data or processing based on historical data
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/20—Monitoring the location of vehicles belonging to a group, e.g. fleet of vehicles, countable or determined number of vehicles
- G08G1/207—Monitoring the location of vehicles belonging to a group, e.g. fleet of vehicles, countable or determined number of vehicles with respect to certain areas, e.g. forbidden or allowed areas with possible alerting when inside or outside boundaries
Landscapes
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Chemical & Material Sciences (AREA)
- Analytical Chemistry (AREA)
- Traffic Control Systems (AREA)
Abstract
The embodiment of the application discloses a method, a system, a device and a storage medium for setting a vehicle no-parking area. The method may include: obtaining historical vehicle loss data, wherein the historical vehicle loss data at least comprises vehicle loss place information; determining at least one candidate area within an operating area based at least on the vehicle loss location information; acquiring historical order quantity related to the candidate area; and determining a vehicle no-stop area according to the historical order quantity related to the candidate area and the historical vehicle loss quantity in the candidate area.
Description
Description of the cases
The application is a divisional application of Chinese patent application CN 201811640369.3, which is filed in 2018, 12, 29 and is entitled "a method, a system, a device and a storage medium for setting a vehicle no-parking area".
Technical Field
The application relates to the field of intelligent vehicle management, in particular to a method and a system for setting a vehicle no-parking area.
Background
With the development of society, the number and the application range of vehicles become wider, and people pay more attention to parking problems, especially for vehicles which share travel and are established in recent years. Currently, for the management of shared vehicles, there are methods for determining parking areas by using solid-line, or for managing vehicles by setting electronic fences. However, when the shared bicycle is parked in an area where loss is high or overhead is not allowed, it is difficult to efficiently manage the shared bicycle, while increasing the management cost of the operator. Meanwhile, when the shared vehicle is parked in an area with a small order occurrence amount, it cannot be effectively used. Therefore, it is necessary to provide a method of setting a vehicle no-parking area.
Disclosure of Invention
In order to achieve the above purpose, the technical solutions provided in the present application are as follows.
One embodiment of the application provides a method for setting a vehicle no-parking area. The method may include at least one of the following operations. Historical vehicle loss data may be obtained that includes at least vehicle loss location information. At least one candidate region within the operation region may be determined based at least on the vehicle loss location information, and a target region may be determined based at least on the one candidate region. A vehicle no-parking zone may be determined based on the target zone.
In some embodiments, the vehicle loss location information may include a latitude and longitude of a vehicle loss location, and the determining at least one candidate area within the operation area based at least on the vehicle loss location information may include at least one of the following. Road network data of the operating area can be acquired. A plurality of closed regions may be determined based on the road network data. A mesh region in which the latitude and longitude of the vehicle loss point falls may be determined as the candidate region.
In some embodiments, said determining a plurality of closed regions based on said road network data may comprise at least one of the following operations. The road network data may be scribed along links in the road network data to obtain a plurality of dividing lines. At least one closed region consisting of the plurality of dividing lines may be determined.
In some embodiments, said determining a plurality of closed regions based on said road network data may comprise at least one of the following operations. Dotting can be performed along links in the road network data to obtain a plurality of segmentation points. The plurality of segmentation points may be connected to obtain a plurality of line segments. At least one occlusion region consisting of the plurality of line segments may be determined.
In some embodiments, the vehicle loss location information may include a latitude and longitude of a vehicle loss location, and the determining at least one candidate area within the operation area based at least on the vehicle loss location information may include at least one of the following. The electronic map corresponding to the operation area can be gridded to obtain a plurality of grid areas. A mesh region in which the latitude and longitude of the vehicle loss point falls may be determined as the candidate region.
In some embodiments, the historical vehicle loss data includes an amount of historical vehicle loss, and the determining the target zone based at least on the one candidate zone may include at least one of the following. For each candidate region, a historical number of orders associated with the candidate region may be obtained. It may be determined whether the historical amount of vehicle lost in the candidate area is greater than a first threshold and/or whether the historical amount of orders is less than a second threshold. The candidate area may be determined to be the target area in response to the historical vehicle loss amount being greater than the first threshold and/or the historical order amount being less than the second threshold.
In some embodiments, the historical vehicle loss data includes an amount of historical vehicle loss, and the determining the target zone based at least on the one candidate zone may include at least one of the following. For each candidate region, a historical number of orders associated with the candidate region may be obtained. A ratio between a historical vehicle loss amount and the historical order amount may be determined. It may be determined whether the ratio is greater than a third threshold. In response to the ratio being greater than the third threshold, the occlusion region may be determined to be the target region.
In some embodiments, the method may further include the following operations. Parking attributes of the vehicle no-parking area may be determined, the parking attributes including allowing the vehicle to be locked for a first preset time period.
In some embodiments, the method may further comprise at least one of the following. Vehicle loss data and/or the number of orders newly generated in the operation area within a second preset time period can be acquired. At least one target area may be re-determined in the operating area based at least on the newly generated vehicle loss data and/or the order quantity. A new no-stop zone for the vehicle may be generated based at least on the newly determined target zone.
In some embodiments, the determining a vehicle no-parking zone based on the target zone comprises at least one of the following. The boundary of the target region may be determined. The boundary may be extended outward by a preset distance. The expanded target area may be determined as the vehicle no-parking area.
One of the embodiments of the present application provides a system for setting a vehicle no-parking area. The system comprises an acquisition module and a determination module. The acquisition module may be configured to acquire historical vehicle loss data that includes at least vehicle loss location information. The determination module may be configured to determine at least one candidate area within an operating area based at least on the vehicle loss location information, determine a target area based at least on one candidate area, and determine a vehicle no-parking area based on the target area.
In some embodiments, the vehicle loss location information includes longitude and latitude of the vehicle loss location, and the obtaining module may be further configured to obtain road network data of the operation area. The determining module is further used for determining a plurality of closed areas based on the road network data, and determining a grid area into which the longitude and latitude of the vehicle loss position fall as the candidate area.
In some embodiments, the determining module may be further configured to scribe lines along links in the road network data to obtain a plurality of dividing lines. At least one closed region consisting of the plurality of dividing lines may be determined.
In some embodiments, the determining module may be further configured to perform dotting along links in the road network data to obtain a plurality of segmentation points. The plurality of segmentation points may be connected to obtain a plurality of line segments. At least one occlusion region consisting of the plurality of line segments may be determined.
In some embodiments, the vehicle loss location information may include a latitude and longitude of the vehicle loss location. The determining module may be further configured to grid the electronic map corresponding to the operation area to obtain a plurality of grid areas. A mesh region in which the latitude and longitude of the vehicle loss point falls may be determined as the candidate region.
In some embodiments, the vehicle loss location information includes a latitude and longitude of the vehicle loss location, and the determining module may be further configured to perform at least one of the following. For each candidate region, a historical number of orders associated with the candidate region may be obtained. It may be determined whether the historical amount of vehicle lost in the candidate area is greater than a first threshold and/or whether the historical amount of orders is less than a second threshold. The candidate area may be determined to be the target area in response to the historical vehicle loss amount being greater than the first threshold and/or the historical order amount being less than the second threshold.
In some embodiments, the vehicle loss location information includes a latitude and longitude of the vehicle loss location, and the determining module may be further configured to perform at least one of the following. For each candidate region, a historical number of orders associated with the candidate region may be obtained. A ratio between a historical vehicle loss amount and the historical order amount may be determined. It may be determined whether the ratio is greater than a third threshold. In response to the ratio being greater than the third threshold, the occlusion region may be determined to be the target region.
In some embodiments, the determining module may be further configured to perform the following operations. Parking attributes of the vehicle no-parking area may be determined, the parking attributes including allowing the vehicle to be locked for a first preset time period.
In some embodiments, the obtaining module may be further configured to obtain newly generated vehicle loss data and/or order quantity in the operation area within a second preset time period. The determination module may be further configured to re-determine at least one target zone in the operating area based at least on the newly generated vehicle loss data and/or the order quantity, and may be configured to generate a no-parking zone for a new vehicle based at least on the newly determined target zone.
In some embodiments, the determining module may be further configured to perform the following operations. The boundary of the target region may be determined. The boundary may be extended outward by a preset distance. The expanded target area may be determined as the vehicle no-parking area.
One of the embodiments of the present application provides an apparatus for setting a vehicle no-parking area, the apparatus includes a processor and a memory; the memory is used for storing instructions which, when executed by the processor, cause the device to implement the corresponding operations of the method for setting the vehicle no-parking area.
One of the embodiments of the present application provides a computer-readable storage medium, where the storage medium stores computer instructions, and after the computer reads the computer instructions in the storage medium, the computer executes operations corresponding to the method for setting a vehicle no-parking area as described above.
Additional features will be set forth in part in the description which follows and in part will become apparent to those having ordinary skill in the art upon examination of the following and the accompanying drawings or may be learned by production or operation of the examples. The features of the present invention may be realized and obtained by means of the instruments and methods set forth in the detailed description below.
Drawings
The present application will be further explained by way of exemplary embodiments, which will be described in detail by way of the accompanying drawings. These embodiments are not intended to be limiting, and in these embodiments like numerals are used to indicate like structures, wherein:
FIG. 1 is an exemplary flow chart illustrating the setting of a no-parking area according to some embodiments of the present application;
FIG. 2 is an exemplary flow diagram illustrating the determination of candidate regions according to some embodiments of the present application;
FIG. 3 is another exemplary flow chart illustrating the determination of candidate regions according to some embodiments of the present application;
FIG. 4 is an exemplary flow chart illustrating the determination of a target area according to some embodiments of the present application;
FIG. 5 is another exemplary flow chart illustrating the determination of a target area according to some embodiments of the present application;
FIG. 6 is an exemplary flow chart illustrating the determination of a vehicle no-parking area according to some embodiments of the present application;
FIG. 7 is a block diagram of an exemplary processing device shown in accordance with some embodiments of the present application;
FIG. 8A is a schematic illustration of a partial electronic map of an operating area shown in accordance with some embodiments of the present application;
fig. 8B is a schematic diagram of a road network map corresponding to the operational area in fig. 8A, according to some embodiments of the present application.
Detailed Description
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings used in the description of the embodiments will be briefly introduced below. It is obvious that the drawings in the following description are only examples or embodiments of the application, from which the application can also be applied to other similar scenarios without inventive effort for a person skilled in the art. Unless otherwise apparent from the context, or otherwise indicated, like reference numbers in the figures refer to the same structure or operation.
It should be understood that "system", "device", "unit" and/or "module" as used herein is a method for distinguishing different components, elements, parts, portions or assemblies at different levels. However, other words may be substituted by other expressions if they accomplish the same purpose.
As used in this application and the appended claims, the terms "a," "an," "the," and/or "the" are not intended to be inclusive in the singular, but rather are intended to be inclusive in the plural unless the context clearly dictates otherwise. In general, the terms "comprises" and "comprising" merely indicate that steps and elements are included which are explicitly identified, that the steps and elements do not form an exclusive list, and that a method or apparatus may include other steps or elements.
Flow charts are used herein to illustrate operations performed by systems according to embodiments of the present application. It should be understood that the preceding or following operations are not necessarily performed in the exact order in which they are performed. Rather, the various steps may be processed in reverse order or simultaneously. Meanwhile, other operations may be added to the processes, or a certain step or several steps of operations may be removed from the processes.
FIG. 1 is an exemplary flow chart illustrating the setting of a vehicle no-parking area according to some embodiments of the present application. One or more operations of the process 100 for setting a vehicle no-parking area illustrated in fig. 1 may be performed by a processing device 700. As shown in fig. 1, the process 100 may include the following operations.
At step 110, historical vehicle loss data is obtained. In some embodiments, step 110 may be performed by acquisition module 710. The historical vehicle data may refer to a loss of vehicles in an operational area (e.g., an entire urban area, a municipality under a city, etc.) over a past period of time (e.g., 6 hours, 12 hours, 1 day, 7 days, 30 days, 1 quarter, half a year, etc.). The vehicle may be an automobile or a non-automobile including, but not limited to, an automobile, a bus, a bicycle, an electric bicycle, a motorcycle, an electric vehicle, a tractor, a passenger car, a van bicycle, a tricycle, a cart, a wheelchair, an animal drawn vehicle, and the like, or any combination thereof. In some embodiments, the vehicle may be a vehicle for a shared trip, for example, a shared bicycle, a shared electric bicycle, a shared automobile, a shared electric vehicle, and the like, and the user may use the vehicle after determining a vehicle order through online rental (for example, through code scanning rental) using a terminal (for example, a smartphone and the like). The vehicle may further include a device with a positioning function, for example, the vehicle may have a positioning system signal receiver built therein to communicate with a satellite positioning system to obtain a positioning position of the vehicle. The device may include an on-board computer, an on-board television, an on-board navigation, an on-board tachograph, and the like, or any combination thereof. The vehicle may also have a communication module, for example, a wireless communication module. The vehicle may communicate with other devices through the communication module. For example, the vehicle may communicate with the processing device 700 to send its own position location to the processing device 700. After receiving the location of the vehicle, the processing device 700 may store the location in its own memory, or may store the location in a storage device other than the memory, for example, a cloud-based distributed storage device. In some embodiments, the historical vehicle loss data may include, but is not limited to, vehicle loss location information, vehicle loss time information, vehicle loss quantity information, and the like, or any combination thereof. In some embodiments, the vehicle loss may include vehicle loss (e.g., theft, etc.), vehicle damage (e.g., human damage, wear of the vehicle itself, etc.), or the like, or a combination thereof. In some embodiments, the vehicle loss location information may include a location position uploaded to the processing device 700 last by the vehicle, and where the vehicle is not located. For example, a shared electric bicycle for a shared trip may send its own location position to the server side at intervals (e.g., 30 seconds, 1 minute, etc.). When the shared electric bicycle does not send a new positioning position to the server after the positioning position is uploaded for a certain time, and the operation and maintenance personnel of the shared vehicle cannot find the shared electric bicycle in the place corresponding to the last uploaded positioning position, the shared electric bicycle can be considered to be lost in the place corresponding to the last uploaded positioning position. The vehicle loss location information also includes the location of the damaged vehicle recorded by the vehicle operation and maintenance personnel while performing vehicle maintenance. For example, after discovering that the wheels of a certain vehicle are damaged and can not move, the operation and maintenance personnel can record the position of the vehicle as the vehicle loss place information. The vehicle loss location information may include a longitude and latitude of the vehicle loss location. The vehicle loss time information may refer to a time point of the last location uploaded to the processing device 700 by the vehicle and/or a time point when the operation and maintenance personnel performed the recording. The vehicle loss amount information may refer to a total number of vehicles lost in the operation area during the period of time. In some embodiments, the obtaining module 710 may access a device storing data through a network, for example, a cloud server, to obtain the data.
And 120, determining at least one candidate area in the operation area at least based on the vehicle loss position information, and determining at least one target area at least based on the at least one candidate area. In some embodiments, step 120 may be performed by determination module 720. The service area may refer to an active area of the vehicle, including a drivable and/or parked area. For a vehicle for a shared trip, the operation area may refer to an activity area of a shared vehicle providing a shared trip service. The operational area may include an administrative area (e.g., an entire city, a metropolitan jurisdiction under the city, etc.), a geographic area (e.g., an area within a certain radius centered at a specified location), etc., or any combination thereof. The candidate region may refer to a region having a vehicle loss. For example, a location corresponding to the last uploaded positioning location of a certain vehicle with a lost confirmation is located in a certain area, and the certain area may be designated as the candidate area. The target region may refer to a candidate region that satisfies a certain condition or conditions. For example, if the number of vehicles confirmed to be lost in a certain candidate area exceeds a threshold, the candidate area may be designated as the target area. In some embodiments, the determination module 720 may divide the operation area into a plurality of small sub-areas, and determine a sub-area into which a location corresponding to the location position of the lost vehicle falls as the candidate area. For example, the determination module 720 divides the operating region into four sub-regions, A, B, C and D. There are two vehicles, a and b, that have been lost in the operating area over the past period of time. If the location corresponding to the last positioning position of the vehicle a is located in the sub-area a, and the location corresponding to the last positioning position of the vehicle B is located in the sub-area B, the determining module 720 may determine the sub-areas a and B as candidate areas. In some embodiments, the operation area may be divided by gridding an electronic map of the operation area, or based on road network data of the operation area. For the operation area division and the target area determination, reference may be made to the descriptions of other parts in this application (for example, fig. 2 to 4), which are not described herein again.
And step 130, determining a vehicle no-parking area based on the target area. In some embodiments, step 130 may be performed by determination module 720. The vehicle no-parking region may refer to a region where parking of a vehicle is impossible. The vehicle parking may refer to the vehicle remaining stationary at a certain location for more than a period of time and/or the vehicle being stationary and the locking device (e.g., door lock, engine lock, mechanical lock, electronic lock, activation lock) of the vehicle being locked. For example, a vehicle may be considered parked after remaining stationary at a location for more than 2 minutes. For another example, the user may consider the vehicle as being parked after locking the vehicle. For the field of shared travel service, parking may refer to a user issuing a lock-closing instruction to a vehicle rented by the user through a network to control locking of the vehicle. In some embodiments, the determination module 720 may determine the target zone as a vehicle no-parking zone. No parking is permitted within the target area determined after the above-described operations (e.g., steps 110 to 120). In some embodiments, the determination module 720 may perform redundancy optimization on the target region, for example, expand the area of the target region, and determine the expanded target region as a vehicle no-parking region. Reference may be made to other portions of this application (e.g., fig. 6) for a description of determining a vehicle no-parking area, which will not be described herein.
In some embodiments, the determination module 720 may also determine a parking attribute of the vehicle no-parking area. The parking attributes may include an amount of penalty, an allowance for parking contingencies, a management fee for parking contingencies, and the like, or any combination thereof. The penalty fee amount may be a penalty-type fee charged to a vehicle user when the user parks the vehicle within the vehicle no-parking area. For example, for a vehicle sharing a trip, if the user places the vehicle in the restricted parking area for more than a period of time, for example, 10 minutes, the user will be charged a certain amount of money as a penalty for the violation, because the vehicle cannot be locked in the restricted parking area. The allowing of the temporary stop may refer to allowing of locking the vehicle for a preset time period (also referred to as a first preset time period in this application). The first preset time period may be a preset value of the device 700, and may also be adjusted according to different application scenarios, which is not specifically limited in this application. The first preset time period may be 10 minutes, 20 minutes, 50 minutes, 1 hour, 2 hours, etc. The temporary parking management fee may refer to an amount of money charged to the user when the user temporarily parks the vehicle in the vehicle no-parking area. The punishment fee is collected for the user who forbids parking in the vehicle forbidden parking area, so that the user can be warned and guided not to park in the forbidden parking area, and the user can be allowed to solve the parking problem under the condition that the temporary parking is allowed, so that the vehicle using experience of the user is improved.
In some embodiments, the vehicle no-parking area may be determined again after a preset time period (also referred to herein as a second preset time period). For example, the processing device 700 (e.g., the obtaining module 710) may obtain vehicle loss data newly generated within a second preset time period to re-determine the vehicle no-parking area. The second preset time period may be, for example, 6 hours, 12 hours, 1 day, 7 days, 30 days, 1 quarter, half a year, one year, etc. In some embodiments, the processing device 700 (e.g., the determination module 720) may re-determine at least one target area in the operation area based on information generated within a second preset time period, e.g., the newly generated vehicle loss data and/or the order quantity, and then generate a no-parking area for a new vehicle based on the newly determined target area. The description of regenerating the vehicle no-parking area may be based on the disclosure elsewhere in this application (refer to fig. 2 to 6).
It should be noted that the above description is merely for convenience and should not be taken as limiting the scope of the present application. It will be understood by those skilled in the art that, having the benefit of the teachings of this system, various modifications and changes in form and detail may be made to the field of application for which the method and system described above may be practiced without departing from this teachings.
Fig. 2 is an exemplary flow diagram illustrating the determination of candidate regions according to some embodiments of the present application. One or more operations of flow 200 for determining candidate regions illustrated in fig. 2 may be performed by processing device 700 (e.g., determining module 720). As shown in fig. 2, the process 200 may include the following operations.
In some embodiments, the determining module 720 may perform dotting along the total link of the road network data to obtain a plurality of segmentation points. The dividing points may be points that meet a predetermined rule, for example, the adjacent dividing points are equally spaced. Each split point is located on a link and may be represented in the form of geographic coordinates, e.g., latitude and longitude. The determination module 720 may also take points as segmentation points according to the geographic identification in the road network data. For example, the determining module 720 may determine the segmentation point by taking a point on the contour line of a river, a lake, or a mountain. After determining the plurality of segmentation points, the determining module 720 may directly connect adjacent segmentation points, or obtain a plurality of line segments by fitting the adjacent segmentation points. The line segments may be straight lines, curved lines, or a combination thereof. The acquired line segment may coincide or partially coincide with a link. In some embodiments, the determining module 720 may determine at least one closed region based on the acquired plurality of line segments according to the method for determining a closed region based on the dividing line described above.
Referring to fig. 8A to 8B, fig. 8A is a schematic view of a partial electronic map of an operating area according to some embodiments of the present application, and fig. 8B is a schematic view of a road network map corresponding to the operating area in fig. 8A according to some embodiments of the present application. As shown in fig. 8A and 8B, the links in the road network data in the operation area may be scribed or dotted to obtain a dividing line overlapping or partially overlapping the links or a line segment obtained from the dividing points. A closed region obtained based on the obtained dividing line or line segment can be identified as a candidate region.
It should be noted that the above description is merely for convenience and should not be taken as limiting the scope of the present application. It will be understood by those skilled in the art that, having the benefit of the teachings of this system, various modifications and changes in form and detail may be made to the field of application for which the method and system described above may be practiced without departing from this teachings.
Fig. 3 is another exemplary flow diagram illustrating the determination of candidate regions according to some embodiments of the present application. One or more operations of flow 300 for determining candidate regions illustrated in fig. 3 may be performed by processing device 700 (e.g., determining module 720). As shown in fig. 3, the process 300 may include the following operations.
And 310, gridding the electronic map corresponding to the operation area to obtain a plurality of grid areas. In some embodiments, the service area may refer to an active area of the vehicle, including a drivable and/or parked area. For a vehicle for a shared trip, the operation area may refer to an activity area of a shared vehicle providing a shared trip service. The operational area may include an administrative area (e.g., an entire city, a metropolitan jurisdiction under the city, etc.), a geographic area (e.g., an area within a certain radius centered at a specified location), etc., or any combination thereof. In some embodiments, the determining module 720 may utilize related tools of a Map Information System (GIS), including a Developer Kernel, a Map Suite GIS, a Geomedia, maps, a geonecept Development kit, ArcGIS, MapInfo, geonecept, MGE, Internet Server (IS), a Map Suite Web Edition, a MapInfo pro Server, a Geomedia Web Map, a geonecept Internet Server (GCIS), etc., to grid an electronic Map corresponding to the operation area to obtain a plurality of grid areas. Operations related to gridding can be found in the prior art and will not be described herein. The plurality of grid regions may be enclosed regions having the same shape and/or size, e.g., square regions of the same size. Meanwhile, when a plurality of grid regions are acquired by using the GIS tool, the determining module 720 may further acquire a latitude and longitude range of each grid region.
And step 320, determining the grid area into which the longitude and latitude of the vehicle loss place falls as the candidate area. Step 320 may be the same as or similar to step 230 and will not be described further herein.
In some embodiments, the determination of the candidate area may also be performed in connection with meshing of the road network data of the operating area with the corresponding electronic map. For example, a partial region is determined based on road network data, and a partial region is determined based on map meshing. The determination of the candidate area may also be determined based on a thermodynamic diagram of the location of the vehicle damage. For example, a region having a center at a position point where the thermal value exceeds a certain threshold value and a certain fixed distance as a radius is used as a candidate region.
It should be noted that the above description is merely for convenience and should not be taken as limiting the scope of the present application. It will be understood by those skilled in the art that, having the benefit of the teachings of this system, various modifications and changes in form and detail may be made to the field of application for which the method and system described above may be practiced without departing from this teachings.
FIG. 4 is an exemplary flow diagram illustrating the determination of a target area according to some embodiments of the present application. One or more operations of flow 400 for determining candidate regions illustrated in fig. 4 may be performed by processing device 700 (e.g., determining module 720). It will be appreciated that the flow described in fig. 4 may be consistent for each candidate region. The following description will take an example of processing one candidate region. As shown in fig. 4, the flow 400 may include the following operations.
It should be noted that the above description is merely for convenience and should not be taken as limiting the scope of the present application. It will be understood by those skilled in the art that, having the benefit of the teachings of this system, various modifications and changes in form and detail may be made to the field of application for which the method and system described above may be practiced without departing from this teachings.
FIG. 5 is another exemplary flow chart illustrating the determination of a target area according to some embodiments of the present application. One or more operations of flow 500 for determining candidate regions illustrated in fig. 5 may be performed by processing device 700 (e.g., determining module 720). It will be appreciated that the flow described in fig. 8 may be consistent for each candidate region. The following description will take an example of processing one candidate region. As shown in fig. 5, the flow 500 may include the following operations.
At step 520, a ratio between the historical vehicle loss amount and the historical order amount is determined. The ratio may be a value obtained by dividing the historical vehicle loss amount by the historical order amount. It will be appreciated that the ratio may refer to the cost of losing a car to complete an order in the candidate area over the past period of time. For example, assuming that the historical vehicle loss amount is 10 and the historical order amount is 400 in the candidate area, the ratio may be determined to be 1/40. It can be considered that the cost of loss incurred to complete an order (e.g., used once, or the user rents a vehicle once) is forty-one trolleys within the candidate area. The larger the ratio, the higher the lost cost of completing an order, and vice versa.
At step 530, it is determined whether the ratio is greater than a third threshold. In some embodiments, the third threshold may be a preset value of the processing device 700, or may be adjusted according to different application scenarios/times, which is not specifically limited in this application. In some embodiments, the third threshold may be an integer multiple of a ratio of all historical loss quantities to all historical order quantities generated by the entire operating area. For example, assuming that all the historical lost quantities generated by the whole operation area are 100 and all the historical order quantities generated are 10000, the third threshold value may be N × 1/100, where N is a positive integer greater than 1. It will be appreciated that the ratio of all historical quantities of lost to all historical quantities of orders generated throughout the operating area can be viewed as the cost of lost to complete an order for a single vehicle within the operating area. 1/100, as described above, the cost of the loss paid to complete an order (e.g., used once, or the user rents a vehicle once) can be considered to be one-hundredth of a trolley. It represents the average of a loss cost over the entire operating area. Said third threshold value is an integer multiple of this mean value and can be understood as a high loss cost value. When the ratio of a candidate region is greater than the third threshold, the loss cost of the candidate region may be considered to be too high. For example, the number of orders in a certain area is on the same level as the number of orders in other areas, but the number of lost vehicles in that area is high, resulting in a higher cost of loss to complete an order. For another example, the number of vehicles lost in a certain area is equal to the number of vehicles lost in other areas, but the number of orders in the area is small, which also results in higher cost for the loss of one order. Also for example, the number of vehicles lost in a certain area is high, and the number of orders is small, so that the loss cost in the area is higher.
It should be noted that the above description is merely for convenience and should not be taken as limiting the scope of the present application. It will be understood by those skilled in the art that, having the benefit of the teachings of this system, various modifications and changes in form and detail may be made to the field of application for which the method and system described above may be practiced without departing from this teachings.
FIG. 6 is an exemplary flow chart illustrating the determination of a vehicle no-parking area according to some embodiments of the present application. One or more operations of the flow 600 for determining a vehicle no-parking area illustrated in fig. 6 may be performed by the processing device 700 (e.g., the determination module 720). It will be appreciated that the flow described in fig. 8 may be consistent for each target region. The following description will take an example of processing one target region. As shown in fig. 6, the flow 600 may include the following operations.
And step 620, expanding the boundary outwards by a preset distance. In some embodiments, the expanding may be moving the boundaries outward by the predetermined distance and maintaining the interconnection between the boundaries. For example, after the rectangular target area is expanded, the distance from the new boundary to the original boundary is the preset distance, and meanwhile, the expanded shape is still rectangular, which is equivalent to the target area being expanded proportionally. The expanding may also be to move the boundary outward by the preset distance while maintaining original attributes, such as length, shape, and the like, and connect end points between the expanded boundaries to form an expanded target region. For example, after a rectangular target area is expanded, an octagon obtained by connecting end points between four boundaries is used as the expanded target area. In some embodiments, the preset distance may be a preset value of the processing device 700, for example, 2m, 5m, 10m, or the like, and may also be adjusted according to different scenarios, which is not specifically limited in this application.
And step 630, determining the expanded target area as the vehicle no-parking area. In conjunction with the description of the rest of the application, the target area is an area where the loss cost of the vehicle is high, and the vehicle needs to be prevented from entering the area. The target area can be regarded as a vehicle no-stop area. The vehicle no-parking region may refer to a region where parking of a vehicle is impossible. The vehicle parking may refer to the vehicle remaining stationary at a certain location for more than a period of time and/or the vehicle being stationary and the locking device (e.g., door lock, engine lock, mechanical lock, electronic lock, activation lock) of the vehicle being locked. For example, a vehicle may be considered parked after remaining stationary at a location for more than 2 minutes. For another example, the user may consider the vehicle as being parked after locking the vehicle. For the field of shared travel service, parking may refer to a user issuing a lock-closing instruction to a vehicle rented by the user through a network to control locking of the vehicle. Since the position of the vehicle is determined by reporting the own positioning position, but the current positioning systems (e.g., GNSS, Wi-Fi positioning system, base station positioning system, etc.) have errors in a certain range, there is a certain degree of position drift in the positioning of the vehicle, for example, the actual position of the vehicle is at point a and within the target area, but the uploaded positioning position indicates that the vehicle is at point B and outside the target area. In this way, setting the target area as the vehicle no-stop area does not play a practical role due to the drift of the positioning position. Therefore, the target area is expanded (based on step 620), and the expanded target area is determined as a vehicle no-parking area, so that the influence caused by the deviation of the positioning position can be effectively reduced.
It should be noted that the above description is merely for convenience and should not be taken as limiting the scope of the present application. It will be understood by those skilled in the art that, having the benefit of the teachings of this system, various modifications and changes in form and detail may be made to the field of application for which the method and system described above may be practiced without departing from this teachings.
FIG. 7 is a block diagram of an exemplary processing device shown in accordance with some embodiments of the present application. The processing device 700 may be used to implement the functions and/or operations disclosed herein in the above sections. As shown in fig. 7, the processing device 700 may include an acquisition module 710 and a determination module 720.
The acquisition module 710 may acquire data. In some embodiments, the acquisition module 710 may acquire historical vehicle loss data. The historical vehicle data may refer to a loss situation of vehicles in a certain operation area (e.g., an entire urban area, a city district under the city, etc.) within a certain past period of time (e.g., 6 hours, 12 hours, 1 day, 7 days, 30 days, 1 quarter, half year, one year, etc.), including vehicle loss location information, vehicle loss time information, vehicle loss amount information, etc., or any combination thereof. The obtaining module 710 may further obtain road network data of the operation area. The service area may refer to an active area of the vehicle, including a drivable and/or parked area. The road network data may be road network structure data composed of roads with different functions, levels and locations in the operation area. The road network structure data may include nodes, links, etc. The node may be used to represent an intersection of two or more roads, including latitude and longitude coordinates of the node. The link may be used to represent a section of a road between two nodes, including a mathematical expression of the link in a geographic coordinate system. The obtaining module 710 may further obtain vehicle loss data and/or an order quantity newly generated in the operation area within a second preset time period. The second preset time period may be, for example, 6 hours, 12 hours, 1 day, 7 days, 30 days, 1 quarter, half a year, one year, etc. The newly generated vehicle loss data and/or order quantity is similar to the historical vehicle loss data and/or historical order quantity.
The determination module 720 may be used to determine a vehicle no-parking area. In some embodiments, the determination module 720 may determine at least one candidate area within the operating area based at least on the vehicle loss location information. The determining module 720 may scribe lines along the links and/or geographic identifiers in the road network data, obtain a plurality of dividing lines, and determine at least one closed region composed of the plurality of dividing lines. For example, the determining module 720 may first select one dividing line (e.g., a first dividing line), then determine another dividing line (e.g., a second dividing line) having an intersection with the dividing line, then determine a third dividing line having an intersection with the second dividing line, …, until an nth dividing line having an intersection with both the nth-1 th dividing line and the first dividing line is determined, and determine the closed region from the closed region consisting of the N dividing lines. The determining module 720 may further perform dotting along the total link of the road network data to obtain a plurality of segmentation points, and directly connect adjacent segmentation points, or obtain a plurality of line segments by fitting the adjacent segmentation points, and then determine at least one closed region based on the obtained plurality of line segments. The determining module 720 may further perform meshing on the electronic map corresponding to the operating area by using a related tool of a Geographic Information System (GIS) to obtain a plurality of mesh areas. After acquiring the closed area and/or the grid area, the determining module 720 may further determine the closed area and/or the grid area into which the latitude and longitude of the vehicle loss location falls as the candidate area.
In some embodiments, the determination module 720 may determine at least one target region based at least on the at least one candidate region. The determination module 720 may communicate with the acquisition module 710 within the processing device 700 to acquire historical order quantities associated with the candidate areas. The determination module 720 may also communicate with an external storage device (e.g., a cloud processor) via a network to obtain the historical order quantity. Thereafter, the determination module 720 may compare the historical vehicle loss amount and/or the historical order amount to a first threshold and/or a second threshold, respectively, and determine whether the historical vehicle loss amount in the candidate area is greater than the first threshold and/or the historical order amount is less than the second threshold. If the historical loss amount is greater than the first threshold and/or the historical order amount is less than the second threshold, the determining module 720 may determine the candidate area as a target area. In some embodiments, the determination module 720 may determine a ratio between the historical vehicle loss amount and the historical order amount and determine whether the ratio is greater than a third threshold. If the ratio is greater than the third threshold, the determining module 720 may determine the candidate area as the target area.
In some embodiments, the determining module 720 may determine the boundary of the target area and extend the boundary outward by a preset distance. The expanded target zone will be determined by the determination module 720 to be the vehicle no-parking zone. The vehicle no-parking region may refer to a region where parking of a vehicle is impossible. The vehicle parking may refer to the vehicle remaining stationary at a certain location for more than a period of time and/or the vehicle being stationary and the locking device (e.g., door lock, engine lock, mechanical lock, electronic lock, activation lock) of the vehicle being locked. For example, a vehicle may be considered parked after remaining stationary at a location for more than 2 minutes. For another example, the user may consider the vehicle as being parked after locking the vehicle. The determination module 720 may also re-determine at least one target area in the operating area based on information generated within a second preset time period (e.g., acquired by the acquisition module 710), such as the newly generated vehicle loss data and/or the order quantity, and then generate a no-parking area for a new vehicle based on the newly determined target area.
In some embodiments, the determination module 720 may also determine a parking attribute of the vehicle no-parking area. The parking attributes may include an amount of penalty, an allowance for parking contingencies, a management fee for parking contingencies, and the like, or any combination thereof.
It should be understood that the system and its modules shown in FIG. 7 may be implemented in a variety of ways. For example, in some embodiments, the system and its modules may be implemented in hardware, software, or a combination of software and hardware. Wherein the hardware portion may be implemented using dedicated logic; the software portions may be stored in a memory for execution by a suitable instruction execution system, such as a microprocessor or specially designed hardware. Those skilled in the art will appreciate that the methods and systems described above may be implemented using computer executable instructions and/or embodied in processor control code, such code being provided, for example, on a carrier medium such as a diskette, CD-or DVD-ROM, a programmable memory such as read-only memory (firmware), or a data carrier such as an optical or electronic signal carrier. The system and its modules of the present application may be implemented not only by hardware circuits such as very large scale integrated circuits or gate arrays, semiconductors such as logic chips, transistors, or programmable hardware devices such as field programmable gate arrays, programmable logic devices, etc., but also by software executed by various types of processors, for example, or by a combination of the above hardware circuits and software (e.g., firmware).
It should be noted that the above description is merely for convenience and should not be taken as limiting the scope of the present application. It will be understood by those skilled in the art that, having the benefit of the teachings of this system, various modifications and changes in form and detail may be made to the field of application for which the method and system described above may be practiced without departing from this teachings. However, such changes and modifications do not depart from the scope of the present application. For example, the determination module 720 may be broken down into several separate modules for performing the determination of the candidate area, the determination of the target area, and the updating of the vehicle no-parking area, respectively.
Having thus described the basic concept, it will be apparent to those skilled in the art that the foregoing detailed disclosure is to be considered merely illustrative and not restrictive of the broad application. Various modifications, improvements and adaptations to the present application may occur to those skilled in the art, although not explicitly described herein. Such modifications, improvements and adaptations are proposed in the present application and thus fall within the spirit and scope of the exemplary embodiments of the present application.
Also, this application uses specific language to describe embodiments of the application. Reference throughout this specification to "one embodiment," "an embodiment," and/or "some embodiments" means that a particular feature, structure, or characteristic described in connection with at least one embodiment of the present application is included in at least one embodiment of the present application. Therefore, it is emphasized and should be appreciated that two or more references to "an embodiment" or "one embodiment" or "an alternative embodiment" in various places throughout this specification are not necessarily all referring to the same embodiment. Furthermore, some features, structures, or characteristics of one or more embodiments of the present application may be combined as appropriate.
Moreover, those skilled in the art will appreciate that aspects of the present application may be illustrated and described in terms of several patentable species or situations, including any new and useful combination of processes, machines, manufacture, or materials, or any new and useful improvement thereon. Accordingly, various aspects of the present application may be embodied entirely in hardware, entirely in software (including firmware, resident software, micro-code, etc.) or in a combination of hardware and software. The above hardware or software may be referred to as "data block," module, "" engine, "" unit, "" component, "or" system. Furthermore, aspects of the present application may be represented as a computer product, including computer readable program code, embodied in one or more computer readable media.
The computer storage medium may comprise a propagated data signal with the computer program code embodied therewith, for example, on baseband or as part of a carrier wave. The propagated signal may take any of a variety of forms, including electromagnetic, optical, etc., or any suitable combination. A computer storage medium may be any computer-readable medium that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code located on a computer storage medium may be propagated over any suitable medium, including radio, cable, fiber optic cable, RF, or the like, or any combination of the preceding.
Computer program code required for the operation of various portions of the present application may be written in any one or more programming languages, including an object oriented programming language such as Java, Scala, Smalltalk, Eiffel, JADE, Emerald, C + +, C #, VB.NET, Python, and the like, a conventional programming language such as C, Visual Basic, Fortran 2003, Perl, COBOL 2002, PHP, ABAP, a dynamic programming language such as Python, Ruby, and Groovy, or other programming languages, and the like. The program code 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 latter scenario, the remote computer may be connected to the user's computer through any network format, such as 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), or in a cloud computing environment, or as a service, such as a software as a service (SaaS).
Additionally, the order in which elements and sequences of the processes described herein are processed, the use of alphanumeric characters, or the use of other designations, is not intended to limit the order of the processes and methods described herein, unless explicitly claimed. While various presently contemplated embodiments of the invention have been discussed in the foregoing disclosure by way of example, it is to be understood that such detail is solely for that purpose and that the appended claims are not limited to the disclosed embodiments, but, on the contrary, are intended to cover all modifications and equivalent arrangements that are within the spirit and scope of the embodiments herein. For example, although the system components described above may be implemented by hardware devices, they may also be implemented by software-only solutions, such as installing the described system on an existing server or mobile device.
Similarly, it should be noted that in the preceding description of embodiments of the application, various features are sometimes grouped together in a single embodiment, figure, or description thereof for the purpose of streamlining the disclosure aiding in the understanding of one or more of the embodiments. This method of disclosure, however, is not intended to require more features than are expressly recited in the claims. Indeed, the embodiments may be characterized as having less than all of the features of a single embodiment disclosed above.
Numerals describing the number of components, attributes, etc. are used in some embodiments, it being understood that such numerals used in the description of the embodiments are modified in some instances by the use of the modifier "about", "approximately" or "substantially". Unless otherwise indicated, "about", "approximately" or "substantially" indicates that the number allows a variation of ± 20%. Accordingly, in some embodiments, the numerical parameters used in the specification and claims are approximations that may vary depending upon the desired properties of the individual embodiments. In some embodiments, the numerical parameter should take into account the specified significant digits and employ a general digit preserving approach. Notwithstanding that the numerical ranges and parameters setting forth the broad scope of the range are approximations, in the specific examples, such numerical values are set forth as precisely as possible within the scope of the application.
The entire contents of each patent, patent application publication, and other material cited in this application, such as articles, books, specifications, publications, documents, and the like, are hereby incorporated by reference into this application. Except where the application is filed in a manner inconsistent or contrary to the present disclosure, and except where the claim is filed in its broadest scope (whether present or later appended to the application) as well. It is noted that the descriptions, definitions and/or use of terms in this application shall control if they are inconsistent or contrary to the statements and/or uses of the present application in the material attached to this application.
Finally, it should be understood that the embodiments described herein are merely illustrative of the principles of the embodiments of the present application. Other variations are also possible within the scope of the present application. Thus, by way of example, and not limitation, alternative configurations of the embodiments of the present application can be viewed as being consistent with the teachings of the present application. Accordingly, the embodiments of the present application are not limited to only those embodiments explicitly described and depicted herein.
Claims (10)
1. A method of setting a vehicle no-parking area, the method comprising:
obtaining historical vehicle loss data, wherein the historical vehicle loss data at least comprises vehicle loss place information;
determining at least one candidate area within an operating area based at least on the vehicle loss location information;
acquiring historical order quantity related to the candidate area;
and determining a vehicle no-stop area according to the historical order quantity related to the candidate area and the historical vehicle loss quantity in the candidate area.
2. The method of claim 1, wherein the vehicle loss location information includes latitude and longitude of a vehicle loss location, the determining at least one candidate area within a operations area based at least on the vehicle loss location information comprising:
acquiring road network data of the operation area;
determining a plurality of closed regions based on the road network data;
and determining the grid area into which the longitude and latitude of the vehicle loss place falls as the candidate area.
3. The method of claim 2, wherein said determining a plurality of closed regions based on said road network data comprises:
scribing along links in the road network data to obtain a plurality of dividing lines, and determining at least one closed region formed by the plurality of dividing lines; or,
dotting along links in the road network data to obtain a plurality of segmentation points, connecting the segmentation points to obtain a plurality of line segments, and determining at least one closed region composed of the line segments.
4. The method of claim 1, wherein the vehicle loss location information includes latitude and longitude of a vehicle loss location, the determining at least one candidate area within a operations area based at least on the vehicle loss location information comprising:
gridding the electronic map corresponding to the operation area to obtain a plurality of grid areas;
and determining the grid area into which the longitude and latitude of the vehicle loss place falls as the candidate area.
5. The method of claim 1, wherein determining a vehicle no-parking area based on the historical number of orders associated with the candidate area and the historical number of vehicle losses within the candidate area comprises:
judging whether the historical vehicle loss quantity in the candidate area is larger than a first threshold value or not and whether the historical order quantity is smaller than a second threshold value or not;
determining the candidate area as the vehicle no-stop area in response to the historical vehicle loss amount being greater than the first threshold and the historical order amount being less than the second threshold.
6. The method of claim 1, wherein determining a vehicle no-parking area based on the historical number of orders associated with the candidate area and the historical number of vehicle losses within the candidate area comprises:
determining a ratio between the historical vehicle loss quantity and the historical order quantity;
determining whether the ratio is greater than a third threshold;
determining the candidate area as the vehicle no-stop area in response to the ratio being greater than the third threshold.
7. The method of claim 1, wherein determining a vehicle no-parking area based on the historical number of orders associated with the candidate area and the historical number of vehicle losses within the candidate area comprises:
determining a target area according to the historical order quantity related to the candidate area and the historical vehicle loss quantity in the candidate area;
determining a boundary of the target area;
expanding the boundary outwards by a preset distance;
and determining the expanded target area as the vehicle no-parking area.
8. A system for setting a vehicle no-parking area is characterized by comprising an acquisition module and a determination module;
the acquisition module is used for acquiring historical vehicle loss data, and the historical vehicle loss data at least comprises vehicle loss place information;
the determination module is to:
determining at least one candidate area within an operating area based at least on the vehicle loss location information;
acquiring historical order quantity related to the candidate area;
and determining a vehicle no-stop area according to the historical order quantity related to the candidate area and the historical vehicle loss quantity in the candidate area.
9. An apparatus for setting a vehicle no-parking area, the apparatus comprising a processor and a memory; the memory is used for storing instructions, and when the instructions are executed by the processor, the device realizes the corresponding operation of the method for setting the vehicle forbidden zone according to any one of claims 1 to 7.
10. A computer-readable storage medium, wherein the storage medium stores computer instructions, and when the computer instructions in the storage medium are read by a computer, the computer executes the method for setting the vehicle no-parking area according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111222037.5A CN113793506A (en) | 2018-12-29 | 2018-12-29 | Method, system, device and storage medium for setting vehicle no-parking area |
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811640369.3A CN111383447B (en) | 2018-12-29 | 2018-12-29 | Method, system, device and storage medium for setting vehicle no-parking area |
| CN202111222037.5A CN113793506A (en) | 2018-12-29 | 2018-12-29 | Method, system, device and storage medium for setting vehicle no-parking area |
Related Parent Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811640369.3A Division CN111383447B (en) | 2018-12-29 | 2018-12-29 | Method, system, device and storage medium for setting vehicle no-parking area |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113793506A true CN113793506A (en) | 2021-12-14 |
Family
ID=71221023
Family Applications (3)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111222098.1A Pending CN113781782A (en) | 2018-12-29 | 2018-12-29 | Method, system, device and storage medium for setting vehicle no-parking area |
| CN201811640369.3A Active CN111383447B (en) | 2018-12-29 | 2018-12-29 | Method, system, device and storage medium for setting vehicle no-parking area |
| CN202111222037.5A Pending CN113793506A (en) | 2018-12-29 | 2018-12-29 | Method, system, device and storage medium for setting vehicle no-parking area |
Family Applications Before (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111222098.1A Pending CN113781782A (en) | 2018-12-29 | 2018-12-29 | Method, system, device and storage medium for setting vehicle no-parking area |
| CN201811640369.3A Active CN111383447B (en) | 2018-12-29 | 2018-12-29 | Method, system, device and storage medium for setting vehicle no-parking area |
Country Status (1)
| Country | Link |
|---|---|
| CN (3) | CN113781782A (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112652192A (en) * | 2021-01-04 | 2021-04-13 | 北京嘀嘀无限科技发展有限公司 | Method, apparatus, device, medium and program product for determining a restricted parking position |
| CN113115222A (en) * | 2021-03-18 | 2021-07-13 | 摩拜(北京)信息技术有限公司 | Parking area processing method and device and electronic equipment |
| CN114202908A (en) * | 2021-12-13 | 2022-03-18 | 中国平安财产保险股份有限公司 | Vehicle early warning method, device, equipment and storage medium based on disaster weather |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106157625A (en) * | 2016-08-04 | 2016-11-23 | 蔚来汽车有限公司 | Fixing parking stall recognition methods |
| CN107730322A (en) * | 2017-11-03 | 2018-02-23 | 吴伟峰 | A kind of method and its system of the charging of shared bicycle subregion |
| CN108198411A (en) * | 2018-02-13 | 2018-06-22 | 永安行科技股份有限公司 | A kind of method for building up in vehicle parking area and establish system |
| CN109063957A (en) * | 2018-06-22 | 2018-12-21 | 南京师范大学 | A kind of shared bicycle dynamic dispatching method and system |
Family Cites Families (20)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2005059838A (en) * | 2003-03-26 | 2005-03-10 | Fujitsu Ten Ltd | Vehicle antitheft system, vehicle antitheft method, and vehicle antitheft program |
| JP2004318237A (en) * | 2003-04-11 | 2004-11-11 | Honda Motor Co Ltd | System for sharing vehicle |
| JP2009269434A (en) * | 2008-05-02 | 2009-11-19 | Sony Corp | In-vehicle device, and vehicle status detecting method |
| JP4909979B2 (en) * | 2008-12-25 | 2012-04-04 | 三洋電機株式会社 | Automotive electronics |
| JP5232634B2 (en) * | 2008-12-26 | 2013-07-10 | 三洋電機株式会社 | Car navigation system |
| CN104276133B (en) * | 2013-07-01 | 2019-08-20 | 迪尔公司 | Long-range starting is forbidden and remotely starting forbids bypass to prevent |
| CN103325259B (en) * | 2013-07-09 | 2015-12-09 | 西安电子科技大学 | A kind of parking offense detection method based on multi-core parallel concurrent |
| CN104851315A (en) * | 2014-02-18 | 2015-08-19 | 厦门歌乐电子企业有限公司 | Parking management method and system, vehicle device and server |
| CN104952255A (en) * | 2015-06-25 | 2015-09-30 | 上海卓易科技股份有限公司 | Intelligent terminal as well as traffic violation monitoring method and system thereof |
| CN105023463A (en) * | 2015-07-15 | 2015-11-04 | 任文峰 | Intelligent parking stall management system and management method thereof |
| JP2017065547A (en) * | 2015-09-30 | 2017-04-06 | 富士通テン株式会社 | Authentication device, authentication system, and authentication method |
| CN105551297B (en) * | 2016-02-03 | 2016-09-14 | 崔勇 | A kind of information processing method and system |
| CN107393326A (en) * | 2016-05-16 | 2017-11-24 | 观致汽车有限公司 | A kind of traffic offence place based reminding method and system |
| CN106570917A (en) * | 2016-10-25 | 2017-04-19 | 先锋智道（北京）科技有限公司 | Vehicle demand thermodynamic diagram generation method and device thereof |
| CN107123028A (en) * | 2017-04-28 | 2017-09-01 | 泰华智慧产业集团股份有限公司 | Park control method and control system in a kind of intelligent bicycle region |
| CN107274256A (en) * | 2017-05-17 | 2017-10-20 | 南京昱立信息科技有限公司 | Shared bicycle user identification system and stage division |
| CN108055301B (en) * | 2017-12-05 | 2019-06-21 | 北京摩拜科技有限公司 | Vehicle dispatching method, server, client and system |
| CN108280987A (en) * | 2018-02-09 | 2018-07-13 | 东峡大通（北京）管理咨询有限公司 | Vehicle monitoring method and device |
| CN108269312A (en) * | 2018-03-21 | 2018-07-10 | 厦门华方软件科技有限公司 | A kind of illegal parking monitoring system and method |
| CN108597126A (en) * | 2018-04-28 | 2018-09-28 | 刘家栋 | It is a kind of solve to share bicycle park chaotic method and shared bicycle plateform system |
-
2018
- 2018-12-29 CN CN202111222098.1A patent/CN113781782A/en active Pending
- 2018-12-29 CN CN201811640369.3A patent/CN111383447B/en active Active
- 2018-12-29 CN CN202111222037.5A patent/CN113793506A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106157625A (en) * | 2016-08-04 | 2016-11-23 | 蔚来汽车有限公司 | Fixing parking stall recognition methods |
| CN107730322A (en) * | 2017-11-03 | 2018-02-23 | 吴伟峰 | A kind of method and its system of the charging of shared bicycle subregion |
| CN108198411A (en) * | 2018-02-13 | 2018-06-22 | 永安行科技股份有限公司 | A kind of method for building up in vehicle parking area and establish system |
| CN109063957A (en) * | 2018-06-22 | 2018-12-21 | 南京师范大学 | A kind of shared bicycle dynamic dispatching method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113781782A (en) | 2021-12-10 |
| CN111383447B (en) | 2021-11-09 |
| CN111383447A (en) | 2020-07-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11067404B2 (en) | Vehicle usage-based pricing alerts | |
| CN111383447B (en) | Method, system, device and storage medium for setting vehicle no-parking area | |
| US10699564B1 (en) | Method for defining intersections using machine learning | |
| US11710074B2 (en) | System for providing corridor metrics for a corridor of a road network | |
| Chang et al. | Estimating real-time traffic carbon dioxide emissions based on intelligent transportation system technologies | |
| US20180053415A1 (en) | Glare Detection Systems and Methods for Automated Vehicular Control | |
| CN111951554A (en) | Illegal parking road information acquisition method and system | |
| CN111325986B (en) | Abnormal parking monitoring method and device, electronic equipment and storage medium | |
| WO2021056303A1 (en) | Systems and methods for determining a pick-up location | |
| US20230066476A1 (en) | System and method for monitoring a vehicle | |
| JP6914323B2 (en) | Parking lot information management system, parking lot guidance system, parking lot information management program and parking lot guidance program | |
| CN111862588A (en) | Method and device for controlling information release, electronic equipment and storage medium | |
| CN112200504A (en) | Tourism passenger car cooperative management and service system based on multi-source data monitoring and analysis | |
| CN111866722B (en) | Method, system, device and storage medium for generating electronic fence | |
| CN108171605A (en) | A kind of vehicle secondary mortgage alarm method, device, server and storage medium | |
| Novikov et al. | ITS control of highways capacity | |
| CN113379162B (en) | Method for estimating running quantity of motor vehicle on rural highway | |
| CN113869715A (en) | Site grouping method, home site determining method, device and computer equipment | |
| CN111881226A (en) | Method and system for judging passing attribute of planar area | |
| Kim et al. | GIS for Transportation | |
| CN110954115A (en) | Route key information generation method and device | |
| CN113313620B (en) | Method, device and equipment for detecting vehicle and storage medium | |
| JP2023087861A (en) | Information providing device, information providing method, and program | |
| CN111220166A (en) | Information processing method and device | |
| CN116246361A (en) | Road vehicle charging system, method, device, equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20220129 Address after: Room 203, 2 / F, building 34, yard 8, Dongbei Wangxi Road, Haidian District, Beijing 100193 Applicant after: Beijing Qisheng Technology Co.,Ltd. Address before: 100193 No. 34 Building, No. 8 Courtyard, West Road, Dongbei Wanglu, Haidian District, Beijing Applicant before: BEIJING DIDI INFINITY TECHNOLOGY AND DEVELOPMENT Co.,Ltd. |
|
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20211214 |