CN117787669A

CN117787669A - Vehicle management method, device, computer equipment and storage medium

Info

Publication number: CN117787669A
Application number: CN202410207013.XA
Authority: CN
Inventors: 赵鹏; 刘永威
Original assignee: Beijing Apoco Blue Technology Co ltd
Current assignee: Beijing Apoco Blue Technology Co ltd
Priority date: 2024-02-26
Filing date: 2024-02-26
Publication date: 2024-03-29
Anticipated expiration: 2044-02-26
Also published as: CN117787669B

Abstract

The application relates to a vehicle management method, a vehicle management device, a computer device and a storage medium. The method comprises the following steps: determining a first target convex closure area according to a starting position communication diagram corresponding to the riding order data of each period in each historical period, and determining a hot spot area of each period in the current period according to the first target convex closure area; for each hot spot area, determining management level data of the hot spot area according to the distance between the real-time position of the dispatching terminal and the central point position of the hot spot area, the historical vehicle consumption duration of the hot spot area and the number of vehicles to be moved into in real time of the hot spot area; and generating a vehicle dispatching task for each hot spot area in the current period in real time according to the management level data of each hot spot area, the central point position of each hot spot area, the target time period corresponding to each hot spot area and the number of vehicles to be moved into each hot spot area. By adopting the method, the vehicle supply of the hot spot area in the hot spot time period can be ensured.

Description

Vehicle management method, device, computer equipment and storage medium

Technical Field

The present disclosure relates to the field of vehicle management technologies, and in particular, to a vehicle management method, device, computer device, and storage medium.

Background

In a city where a shared vehicle is operated, there are many hot spot areas where the demand for vehicles is high, and in order to ensure that the demand vehicles in the hot spot areas are sufficient, a manager of the shared vehicle needs to take an important care of the number of vehicles in the hot spot areas.

In the prior art, the number of vehicles in each vehicle using area is predicted, so that the number of estimated vehicles in each vehicle using area on the same day is obtained, and then the shared vehicles with the number of estimated vehicles are thrown into the corresponding vehicle using area according to the number of estimated vehicles in the vehicle using area on the same day.

Then, in the existing method for predicting the number of vehicles in the vehicle-using area, the number of the predicted vehicles in the vehicle-using area in the whole day is considered, so that only the shared vehicles of the number of the predicted vehicles in the whole day are put into the corresponding vehicle-using area, the vehicle-using requirements of the hot spot area, which are dynamically changed in different time periods, are ignored, and the sufficient vehicle supply of the hot spot area in the hot spot time period cannot be ensured.

Disclosure of Invention

In view of the foregoing, it is desirable to provide a vehicle management method, apparatus, computer device, computer readable storage medium, and computer program product that can ensure adequate vehicle supply for a hotspot region over a hotspot time period.

In a first aspect, the present application provides a vehicle management method, including:

determining a first target convex closure area according to a starting position communication diagram corresponding to the riding order data of each period in each historical period, and determining a hot spot area of each period in the current period according to the first target convex closure area;

for each hot spot area, determining management grade data of the hot spot area according to the distance between the real-time position of a dispatching terminal and the central point position of the hot spot area, the historical vehicle consumption duration of the hot spot area and the real-time vehicle number to be moved into of the hot spot area, wherein the management grade data is used for determining the management priority of the hot spot area;

and generating a vehicle dispatching task for each hot spot area in the current period in real time according to the management level data of each hot spot area, the central point position of each hot spot area, the target time period corresponding to each hot spot area and the number of vehicles to be moved into each hot spot area, wherein the vehicle dispatching task is used for managing the vehicles of each hot spot area.

In one embodiment, the method further comprises:

According to the riding order data of the target area in a plurality of history periods, determining the riding order data of each period in each history period;

for any period of any historical period, determining at least one starting position communication diagram corresponding to the period in the historical period according to the riding order data of the period in the historical period, wherein a plurality of starting positions of the riding order data are recorded in the starting position communication diagram, and the distance between the starting positions of any two riding order data meets a preset distance condition.

In one embodiment, the determining the first target convex closure area according to the starting position communication diagram corresponding to the riding order data of each period in each history period includes:

taking the initial position communication map as a target initial position communication map when the number of vertexes in the initial position communication map is larger than a preset vertex threshold value according to any initial position communication map corresponding to each period in each history period; or,

deleting the initial position communication diagram when the number of vertexes in the initial position communication diagram is smaller than or equal to the preset vertex threshold value;

And determining a first target convex closure area corresponding to each target initial position communication diagram according to the coordinates of the vertexes in each target initial position communication diagram.

In one embodiment, the determining, according to coordinates of vertices in each target starting position communication graph, a first target convex closure area corresponding to each target starting position communication graph includes:

determining a plurality of convex closure areas corresponding to the target initial position communication map according to the coordinates of each vertex in the target initial position communication map;

and taking the convex closure area with the smallest area as a first target convex closure area corresponding to the target initial position communication diagram in the convex closure areas.

In one embodiment, the determining, according to the first target convex closure area, a hot spot area of each period in the current period includes:

and determining a hot spot area of each period in the current period according to the area of each first target convex closure area and each first target convex closure area.

In one embodiment, the determining, according to the area of each first target convex closure area and each first target convex closure area, the hot spot area of each period in the current period includes:

For any period in any period number of the current period, determining a second target convex closure area corresponding to the period number and the period in each first target convex closure area according to the period number and the period;

when any two second target convex closure regions meet preset merging conditions, merging the two second target convex closure regions to obtain merged second target convex closure regions until any two second target convex closure regions do not meet the preset merging conditions, and taking each second target convex closure region as a hot spot region;

the preset merging condition is that the area overlapping rate of the two second target convex closure areas is larger than a preset overlapping rate threshold value, and the distance between the center point positions of the second target convex closure areas is smaller than a preset distance threshold value.

In one embodiment, the determining the management level data of the hot spot area according to the distance between the real-time position of the scheduling terminal and the center point position of the hot spot area, the historical vehicle consumption duration of the hot spot area, and the real-time vehicle number to be moved into the hot spot area includes:

Acquiring a real-time position of a dispatching terminal, and determining a distance between the real-time position of the dispatching terminal and the central point position of the hot spot area in real time according to the real-time position of the dispatching terminal and the central point position of the hot spot area;

determining a grade data calculation parameter according to the distance and the historical vehicle consumption time length of the hot spot area, wherein the grade data calculation parameter is positively related to the distance and the historical vehicle consumption time length of the hot spot area;

and determining management grade data of the hot spot area according to the grade data calculation parameters and the real-time vehicle number to be moved into the hot spot area, wherein the management grade data of the hot spot area is positively correlated with the real-time vehicle number to be moved into the hot spot area, and the management grade data of the hot spot area is negatively correlated with the grade data calculation parameters.

In one embodiment, the method further comprises:

receiving a vehicle reservation message of a user terminal, and determining a vehicle starting position of the user terminal and a vehicle adding requirement;

according to riding order data of the user terminal in each period in the history period, determining historical vehicle starting position information of the user terminal, and according to the historical vehicle starting position information, determining reservation demand data of the vehicle starting position;

And determining the target number of vehicles to be moved in the hot spot area corresponding to the vehicle starting position according to the reservation demand data of the user terminal and the number of vehicles to be moved in the hot spot area corresponding to the vehicle starting position.

In a second aspect, the present application further provides a vehicle management apparatus, including:

the first determining module is used for determining a first target convex closure area according to a starting position communication diagram corresponding to the riding order data of each period in each historical period, and determining a hot spot area of each period in the current period according to the first target convex closure area;

the second determining module is used for determining management grade data of each hot spot area according to the distance between the real-time position of the dispatching terminal and the central point position of the hot spot area, the historical vehicle consumption duration of the hot spot area and the real-time vehicle number to be moved into of the hot spot area, wherein the management grade data is used for determining the management priority of the hot spot area;

the generation module is used for generating vehicle dispatching tasks aiming at the hot spot areas in the current period in real time according to the management level data of the hot spot areas, the central point positions of the hot spot areas, the target time periods corresponding to the hot spot areas and the number of vehicles to be moved into the hot spot areas, wherein the vehicle dispatching tasks are used for carrying out vehicle management of the hot spot areas.

In one embodiment, the apparatus further comprises:

the third determining module is used for determining the riding order data of each period in each history period according to the riding order data of the target area in a plurality of history periods;

a fourth determining module, configured to determine, for any period of any historical period, at least one starting position communication diagram corresponding to the period in the historical period according to the riding order data of the period in the historical period, where a plurality of starting positions of the riding order data are recorded in the starting position communication diagram, and a distance between the starting positions of any two riding order data meets a preset distance condition.

In one embodiment, the first determining module is specifically configured to:

In one embodiment, the second determining module is specifically configured to:

In one embodiment, the apparatus further comprises:

a fifth determining module, configured to receive a vehicle reservation message of the user terminal, and determine a starting position of the user terminal and a vehicle adding requirement;

a sixth determining module, configured to determine historical vehicle starting position information of the user terminal according to riding order data of the user terminal in each period in the historical period, and determine reservation demand data of the vehicle starting position according to the historical vehicle starting position information;

and a seventh determining module, configured to determine, according to the reservation requirement data of the user terminal and the number of vehicles to be moved into the hot spot area corresponding to the vehicle start position, the target number of vehicles to be moved into the hot spot area corresponding to the vehicle start position.

In a third aspect, the present application further provides a computer device, including a memory storing a computer program and a processor implementing the steps of the above-mentioned vehicle management methods when the processor executes the computer program.

In a fourth aspect, the present application also provides a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the steps of the vehicle management methods described above.

In a fifth aspect, the present application also provides a computer program product comprising a computer program which, when executed by a processor, implements the steps of the vehicle management methods described above.

The vehicle management method, the vehicle management device, the computer equipment, the storage medium and the computer program product are used for determining a first target convex closure area according to a starting position communication diagram corresponding to the riding order data of each period in each historical period and determining a hot spot area of each period in the current period according to the first target convex closure area; for each hot spot area, determining management grade data of the hot spot area according to the distance between the real-time position of a dispatching terminal and the central point position of the hot spot area, the historical vehicle consumption duration of the hot spot area and the real-time vehicle number to be moved into of the hot spot area, wherein the management grade data is used for determining the management priority of the hot spot area; and generating a vehicle dispatching task for each hot spot area in the current period in real time according to the management level data of each hot spot area, the central point position of each hot spot area, the target time period corresponding to each hot spot area and the number of vehicles to be moved into each hot spot area, wherein the vehicle dispatching task is used for managing the vehicles of each hot spot area. By adopting the method, the vehicle requirements of the hot spot area for dynamic change in different time periods are fully considered, and sufficient vehicle supply of the hot spot area in each time period can be ensured.

Drawings

In order to more clearly illustrate the embodiments of the present application or the technical solutions in the related art, the drawings that are required to be used in the embodiments or the related technical descriptions will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and other drawings may be obtained according to the drawings without inventive effort for a person having ordinary skill in the art.

FIG. 1 is a flow chart of a method of vehicle management in one embodiment;

FIG. 2 is a flow chart of determining a starting position communication diagram according to one embodiment;

FIG. 3 is a flowchart of determining a first target convex closure region corresponding to a target starting position communication diagram in an embodiment;

FIG. 4 is a flow diagram of determining a hot spot area within a current period in one embodiment;

FIG. 5 is a flowchart illustrating a method for determining a hot spot area in a current period according to another embodiment;

FIG. 6 is a flow diagram of determining management level data for a hot spot area in one embodiment;

FIG. 7 is a schematic flow chart of determining the number of vehicles to be moved to the target in the hot spot area corresponding to the starting position of the vehicle in one embodiment;

FIG. 8 is a block diagram of a vehicle management apparatus in one embodiment;

fig. 9 is an internal structural diagram of a computer device in one embodiment.

Detailed Description

In order to make the objects, technical solutions and advantages of the present application more apparent, the present application will be further described in detail with reference to the accompanying drawings and examples. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the present application.

In one embodiment, as shown in fig. 1, a vehicle management method is provided, where the method is applied to a terminal to illustrate, it is understood that the method may also be applied to a server, and may also be applied to a system including the terminal and the server, and implemented through interaction between the terminal and the server. In this embodiment, the method includes the following steps 102 to 106. Wherein:

step 102, determining a first target convex closure area according to a starting position communication diagram corresponding to the riding order data of each period in each history period, and determining a hot spot area of each period in the current period according to the first target convex closure area.

Wherein, the history period may be a history week, for example, the history period may be a week before the current period (i.e., the current week); the riding order data is riding order data generated when the user uses the shared vehicle, and the riding order data is recorded with riding starting time, riding ending time, riding starting position (longitude and latitude coordinate points), vehicle consumption time (namely, the time interval between the current use of the shared vehicle and the last riding ending time) and the like. The shared vehicle may be a shared bicycle or a shared electric bicycle.

In the embodiment of the application, the terminal acquires the riding order data in a plurality of history periods and determines the riding order data of each period in each history period.

The terminal determines a starting position communication diagram corresponding to each time period in the history period according to the riding order data of the time period in the history period according to each time period in each history period. Specifically, in each piece of riding order data of the period in the history period, the terminal connects the coordinates of the riding initial positions of the two pieces of riding order data to construct a starting position communication diagram with a certain geographic range for any two pieces of riding order data under the condition that the distance between the riding initial positions of the two pieces of riding order data is smaller than a preset distance threshold. Finally, the terminal can determine a plurality of start position connectivity graphs for the period within each history period.

The specific value of the preset distance threshold may be set by a technician in practical application, for example, the preset distance threshold may be set to 25 meters, and the preset distance threshold is not specifically limited in the embodiment of the present application.

Then, the terminal determines a first target convex closure area corresponding to each starting position communication diagram according to the vertex in the starting position communication diagram (namely the starting position of riding of the riding order data). Because of the multiple start position connectivity graphs corresponding to each period of each cycle of each history period, the terminal is able to determine multiple target convex closure regions corresponding to each period of each cycle of each history period.

And the terminal determines the hot spot areas of the periods in the current period according to the first target convex closure area corresponding to each period in each period number in each history period.

Step 104, determining management level data of the hot spot areas according to the distance between the real-time position of the dispatching terminal and the central point position of the hot spot areas, the historical vehicle consumption time length of the hot spot areas and the real-time vehicle number to be moved into the hot spot areas for each hot spot area.

The management level data is used for determining the management priority of the hot spot area, and the higher the numerical value of the management level data is, the higher the management priority of the hot spot area is represented.

In this embodiment of the present application, the terminal determines the center point position of each hot spot area according to the vertex coordinates in each hot spot area. For each hot spot area, the terminal takes the average value of the vertex coordinates in the hot spot area as the central point position coordinates in the hot spot area.

And then, the terminal determines management level data of the hot spot area according to the distance between the real-time position of the dispatching terminal and the central point position of the hot spot area, the historical vehicle consumption time length of the hot spot area and the real-time number of vehicles to be moved into the hot spot area.

And 106, generating a vehicle dispatching task for each hot spot area in the current period in real time according to the management level data of each hot spot area, the central point position of each hot spot area, the target time period corresponding to each hot spot area and the number of vehicles to be moved into each hot spot area.

The vehicle dispatching task is used for managing the vehicles in each hot spot area.

In the embodiment of the application, the terminal generates the vehicle scheduling task for each hot spot area in the current period in real time according to the management level data of each hot spot area, the central point position of each hot spot area, the target time period corresponding to each hot spot area and the number of vehicles to be moved into each hot spot area.

The terminal may determine the management priority of each hotspot region based on the value of the management level data of each hotspot region, where the higher the value of the management level data, the higher the management priority of the hotspot region is represented.

The method for determining the higher management priority according to the numerical value of the management level data is not particularly limited in the embodiment of the present application.

Illustratively, a six-tuple list is obtained from the management priority of each hotspot region, the center point position of each hotspot region, the target period corresponding to each hotspot region, and the number of vehicles to be moved into each hotspot region: [ (cycle number, hot spot area number, center point position, management priority, target period, number of vehicles to be moved in), … ]. The cycle number refers to 7 cycles in Monday to Sunday, and the target period refers to 24 periods of one to twenty four. For example (monday, hot spot area 1, center point position x, S, period seven, 20) indicates that the management priority of hot spot area 1 between 8 hours and 9 hours on monday is S, and the number of vehicles to be moved is 20.

And the terminal sends the vehicle dispatching tasks aiming at the hot spot areas to each dispatching terminal. Each dispatcher can schedule the vehicles in each hot spot area based on the vehicle scheduling tasks in each dispatching terminal, so that the vehicle management in the hot spot area is realized.

According to the vehicle management method, a first target convex closure area is determined according to a starting position communication diagram corresponding to riding order data of each period in each historical period, and a hot spot area of each period in the current period is determined according to the first target convex closure area; for each hot spot area, determining management grade data of the hot spot area according to the distance between the real-time position of the dispatching terminal and the central point position of the hot spot area, the historical vehicle consumption time length of the hot spot area and the real-time vehicle number to be moved into of the hot spot area, wherein the management grade data is used for determining the management priority of the hot spot area; and generating a vehicle dispatching task for each hot spot area in the current period in real time according to the management level data of each hot spot area, the central point position of each hot spot area, the corresponding target time period of each hot spot area and the number of vehicles to be moved into the hot spot area, wherein the vehicle dispatching task is used for managing the vehicles of each hot spot area. By adopting the method, the vehicle requirements of the hot spot area for dynamic change in different time periods are fully considered, and sufficient vehicle supply of the hot spot area in each time period can be ensured. And, based on the management level data of each hot spot area and the real-time position of the distance dispatching terminal, the vehicle management of the hot spot area is performed, and the vehicle dispatching efficiency can be improved.

In an exemplary embodiment, as shown in fig. 2, the above method further includes the following steps 202 to 204. Wherein:

step 202, determining the riding order data of each period in each history period according to the riding order data of the target area in a plurality of history periods.

The target area may be a geographical area divided by an administrative area, such as a city.

In this embodiment of the present application, the terminal may store the riding order data in the order database when the riding order is generated. The terminal obtains riding order data of the target area in a plurality of historical periods based on the order database, divides the riding order data according to the cycle number and the time period number of the riding starting time of the riding order data, and determines the riding order data of each time period in each cycle number in each historical period.

Each time interval obtained by dividing corresponds to the period number recorded with the time interval. For example, the number of periods corresponding to the riding order data a is ten, and the number of periods is monday.

Illustratively, the terminal obtains riding order data for each historical week for the first three months of the current cycle, and the terminal divides each day into 24 time periods, namely time period one through time period twenty-four. The terminal divides the riding order data according to the number of time periods to which the riding starting time of the riding order data belongs, and obtains the riding order data of each time period in each historical week.

Step 204, for any period of any history period, determining at least one initial position communication diagram corresponding to the period of the history period according to the riding order data of the period of the history period.

The starting position communication diagram is recorded with a plurality of starting positions of riding order data, and each vertex in the starting position communication diagram represents a riding starting position corresponding to the riding order. The distance between the starting positions of any two riding order data meets the preset distance condition.

In this embodiment, the terminal determines, for any period of any period number in any history period, a starting position communication map corresponding to the period in the period number in the history period according to each riding order data of the period in the period number in the history period.

Specifically, the terminal connects the coordinates of the riding starting positions of any two riding order data when the distance between the riding starting positions of the two riding order data meets a preset distance condition in each riding order data of the period in the history period. And the terminal constructs a starting position communication diagram of the riding starting positions containing a plurality of riding order data according to the interconnected riding starting position coordinates. Finally, the terminal can determine a plurality of starting position connectivity graphs for the period of the number of periods within the history period.

The distance between the riding initial positions of the two riding order data meets the preset distance condition may be: the distance between the riding starting positions of the two riding order data is smaller than a preset distance threshold value. For a specific value of the preset distance threshold, the preset distance threshold may be set in practical application according to a technician, for example, the preset distance threshold may be set to 25 meters, and the value of the preset distance threshold is not specifically limited in the embodiment of the present application.

In this embodiment, a plurality of initial position communication graphs can be constructed by using the riding order data of each period in each cycle number in each history cycle, and each initial position communication graph can reflect the geographical area in which the sharing bicycle is used in a centralized manner because the distance between the pairs of riding initial positions in the initial position communication graphs is smaller than the preset distance threshold. And the subsequent terminal can determine the hot spot area in the current period based on the initial position communication diagram of each period in each period number in each history period.

In an exemplary embodiment, as shown in FIG. 3, step 102 includes steps 302 through 306. Wherein:

step 302, regarding any initial position communication diagram corresponding to each period in each history period, when the number of vertices in the initial position communication diagram is greater than a preset vertex threshold, the initial position communication diagram is used as a target initial position communication diagram.

In this embodiment of the present application, the terminal obtains, for any starting position communication graph corresponding to each period in each period number in each history period, the number of vertices in the starting position communication graph. And when the number of the vertexes in the initial position communication diagram is larger than a preset vertex threshold value, the terminal takes the initial position communication diagram as a target initial position communication diagram.

The specific value of the preset vertex threshold may be set in practical application according to a technician, for example, the preset vertex threshold may be set to 10, which is not specifically limited in the embodiment of the present application.

And 304, deleting the initial position communication diagram when the number of the vertexes in the initial position communication diagram is smaller than or equal to a preset vertex threshold value.

In this embodiment, when the number of vertices in the initial position communication graph is less than or equal to a preset vertex threshold, the terminal deletes the initial position communication graph.

Step 306, determining a first target convex closure area corresponding to each target initial position communication diagram according to the coordinates of the vertexes in each target initial position communication diagram.

The convex closure area is a convex polygon formed by connecting a plurality of vertexes clockwise.

In the embodiment of the present application, the terminal may obtain a plurality of target starting position communication graphs by performing a reservation or deletion process on each starting position communication graph. And the terminal determines a first target convex closure area corresponding to each target starting position communication diagram according to the coordinates of the vertexes in each target starting position communication diagram.

In this embodiment, the terminal can screen the starting position communication graphs to obtain the target starting position communication graph with the number of vertices greater than the preset threshold, so that a region with a large shared vehicle usage amount is obtained through screening, and the subsequent determination of the hot spot region in the current period based on the target starting position communication graph is facilitated.

In an exemplary embodiment, as shown in FIG. 4, step 306 includes steps 402 through 404. Wherein:

step 402, for each target starting position communication graph, determining a plurality of convex closure areas corresponding to the target starting position communication graph according to coordinates of each vertex in the target starting position communication graph.

In this embodiment of the present application, for each target starting position communication graph, the terminal determines, according to coordinates of each vertex in the target starting position communication graph, a plurality of convex closure areas corresponding to the target starting position communication graph, and determines an area of each convex closure area.

And step 404, taking the convex closure region with the smallest area as a first target convex closure region corresponding to the target initial position communication diagram in the plurality of convex closure regions.

In this embodiment of the present application, the terminal uses, among the plurality of convex closure areas, the convex closure area with the smallest area as the first target convex closure area corresponding to the target starting position communication map according to the area of each convex closure area.

Preferably, the terminal may call a ConvexHull (function for calculating convex hulls of a given point set) function of a Scipy (a library for performing mathematical, scientific and engineering calculations) library in Python (a computer programming language), and input coordinates of each vertex in the target starting position connected graph to the ConvexHull function, to obtain vertex coordinates of the minimum convex closure region. And the terminal determines a first target convex closure area corresponding to the target starting position communication diagram based on the vertex coordinates of the minimum convex closure area.

In this embodiment, the terminal may determine the first target convex closure area with the smallest area corresponding to the target starting position communication diagram, so as to obtain the first target convex closure area with a reasonable area size, where the starting point of each riding order is included in the target starting position communication diagram. And the subsequent terminal is convenient to determine the hot spot area in the current period based on each first target convex closure area.

In one exemplary embodiment, step 102 includes:

and determining the hot spot areas of each period in the current period according to the areas of each first target convex closure area and each first target convex closure area.

In the embodiment of the present application, a terminal determines, for each first target convex closure area corresponding to each period in each history period, a hot spot area of each period in the current period according to the area of each first target convex closure area and the central point position information of each first target convex closure area.

In this embodiment, the terminal may determine the hot spot area of each period in the current period according to the area of each first target convex closure area and each first target convex closure area. The method is convenient for the subsequent terminals to be capable of managing vehicles in the hot spot areas based on determining the scheduling tasks for the hot spot areas.

In an exemplary embodiment, as shown in fig. 5, determining the hot spot area of each period in the current period according to the area of each first target convex closure area and each first target convex closure area includes steps 502 to 504. Wherein:

step 502, for any period in any period number of the current period, determining a second target convex closure area corresponding to the period number and the period in each first target convex closure area according to the period number and the period.

In this embodiment of the present application, the terminal determines, for any period of any period number of the current period, a second target convex closure area identical to the period number and the period number in each first target convex closure area corresponding to each period in each history period according to the period number and the period number.

For example, for the first time period of monday (i.e. 0 time to 1 time) in the current monday, the terminal determines a plurality of first time periods of the historical monday in each historical monday, and takes the first target convex closure area corresponding to the first time period of each historical monday as the second target convex closure area; for the period two of monday (i.e. 1 time to 2 time) in the current week, the terminal determines, in each historical week, a plurality of period two of historical monday, and a first target convex closure region corresponding to the period two of each historical monday as a second target convex closure region. And so on, the terminal can determine a second target convex closure region that is the same as the number of cycles and the number of time periods in the current cycle.

And step 504, when any two second target convex closure regions meet preset merging conditions, merging the two second target convex closure regions to obtain merged second target convex closure regions until any two second target convex closure regions do not meet preset merging conditions, and taking each second target convex closure region as a hot spot region.

The preset merging condition is that the area overlapping rate of the two second target convex closure areas is larger than a preset overlapping rate threshold value, and the distance between the center point positions of the second target convex closure areas is smaller than a preset distance threshold value. The preset overlap rate threshold may be 60%, which is not limited in the embodiment of the present application.

In the embodiment of the application, the terminal determines, for any period in any period number of the current period, whether any two second target convex closure areas exist in the second target convex closure areas corresponding to the period of the period number, and meets a preset merging condition.

Specifically, the terminal can calculate and obtain the distance between the center point positions of any two second target convex closure areas and the area overlapping rate of any two second target convex closure areas.

For example, for a method of determining a distance between the center point positions of any two second target convex closure regions, the terminal may determine a distance between the center point positions of the two second target convex closure regions based on the center point position coordinates of the two second target convex closure regions.

For example, for the method of determining the area overlapping ratio of any two second target convex closure regions, the terminal may call a Polygon (), area (polygonal area calculating function) function of a shape (a type of a Python library operated and analyzed based on a geometric object of cartesian coordinates) library in Python to calculate the area of each second target convex closure region. Then, the terminal calculates the intersection area of each two second target convex closure regions using a Polygon (). Intersection (a function for acquiring the intersection of a given Polygon and a given geometric entity), and finally divides the intersection area by the total area of the two second target convex closure regions to obtain the area overlapping ratio of the two second target convex closure regions.

And under the condition that the area overlapping rate of any two second target convex closure areas is larger than a preset threshold value and the center point position is smaller than the preset threshold value, the terminal determines that the two second target convex closure areas meet the preset merging condition.

And under the condition that any two second target convex closure areas meet preset merging conditions, the terminal merges the two second target convex closure areas to obtain merged second target convex closure areas. Specifically, the terminal may take the union of the areas of the two second target convex closure regions as the merged second target convex closure region.

Illustratively, the terminal may call a Polygon (). Union (a Polygon merge function) function in Python to compute a union of two second target convex closure regions. Then, the terminal extracts coordinates of each vertex of the union of the two second target convex closure regions through a unit_polygon.

For each merged second target convex closure region, the terminal redetermines the center point location coordinates of the merged second target convex closure region based on the vertices in the merged second target convex closure region.

And the terminal merges every two second target convex closure areas meeting the preset merging condition until any two second target convex closure areas do not meet the preset merging condition, and takes each second target convex closure area as a hot spot area.

In this embodiment, the terminal is capable of avoiding the problem that a plurality of hot spot areas exist in a relatively short distance due to different vehicle parking positions by merging the second target convex closure areas meeting the preset merging conditions. The efficiency of the following vehicle dispatching is improved.

In an exemplary embodiment, as shown in FIG. 6, step 104 includes steps 602 through 606. Wherein:

step 602, acquiring a real-time position of the scheduling terminal, and determining a distance between the real-time position of the scheduling terminal and a center point position of the hot spot area in real time according to the real-time position of the scheduling terminal and the center point position of the hot spot area.

In the embodiment of the application, the terminal determines the real-time position of each scheduling terminal based on the position information (longitude and latitude coordinate point) of each scheduling terminal. And then, the terminal determines the distance between the real-time position of each scheduling terminal and the central point position of the hot spot area in real time according to the real-time position of each scheduling terminal and the central point position of the hot spot area.

Step 604, determining a grade data calculation parameter according to the distance and the historical vehicle consumption time length of the hot spot area.

Wherein the grade data calculation parameter is positively correlated with distance and historical vehicle consumption time of the hot spot area.

In the embodiment of the application, the terminal determines the historical vehicle consumption duration of the hot spot area according to the riding order data corresponding to each vertex in the hot spot area. For a method for determining the historical vehicle consumption time of the hot spot area, reference may be made to formula (one), which is specifically described as follows:

formula 1

Wherein i characterizes an i-th history period; t represents historical vehicle consumption duration of the cycle number corresponding to the hot spot area; average value calculation is performed on avg () representation; t_i represents the historical vehicle consumption duration of the period number corresponding to the hot spot area in the ith historical period.

The terminal determines the grade data calculation parameters according to the distance between the real-time position of each scheduling terminal and the central point position of the hot spot area and the historical vehicle consumption time length of the hot spot area. For the method for determining the calculation parameters of the level data, reference may be made to the formula (two), which is as follows:

formula II

Wherein, Q represents the grade data calculation parameter of the corresponding cycle number of the hot spot area; l represents the real-time position of each scheduling terminal and the distance between the real-time position and the central point position of the hot spot area; t represents the historical vehicle consumption time length corresponding to the hot spot area.

Step 606, determining management grade data of the hot spot area according to the grade data calculation parameters and the real-time vehicle number to be moved into the hot spot area.

The management grade data of the hot spot area is positively correlated with the number of vehicles to be moved in real time in the hot spot area, and the management grade data of the hot spot area is negatively correlated with the grade data calculation parameters.

In the embodiment of the application, the terminal acquires the maximum value of the number of the riding orders of the same cycle number and the same time period number in the history cycle, and takes the maximum value of the number of the riding orders as the number of nursing vehicles in the hot spot area.

And then, the terminal acquires the number of the sharing vehicles parked in the hot spot area in real time based on the positioning device on the sharing vehicle, and determines the number of the vehicles to be moved in the hot spot area in real time according to the number of the sharing vehicles parked in the hot spot area and the number of the nursing vehicles in the hot spot area. For the method for determining the number of vehicles to be moved in real time in the hot spot area, the following specific contents may be referred to as formula (iii):

n=n1-N2 formula (iii)

N represents the number of vehicles to be moved in real time in the hot spot area; n1 represents the number of nursing vehicles in the hot spot area; n2 characterizes the number of shared vehicles parked in the hot spot area.

And the terminal determines management grade data of the hot spot area according to the grade data calculation parameters and the real-time vehicle number to be moved into the hot spot area. For the method for determining the management level data of the hot spot area, reference may be made to formula (four), which is specifically as follows:

formula (IV)

Wherein score characterizes management level data of the hotspot region; n represents the number of vehicles to be moved in real time in the hot spot area; q represents the grade data calculation parameter of the corresponding cycle number of the hot spot area.

In this embodiment, the terminal can obtain management level data of each scheduling terminal for each hotspot region based on a distance between a real-time position of the scheduling terminal and a center point position of the hotspot region, a historical vehicle consumption duration of the hotspot region, and a real-time number of vehicles to be moved into the hotspot region. The more the number of vehicles to be moved in real time, the shorter the historical vehicle consumption time length, the closer the distance between the historical vehicle consumption time length and the central point position of the hot spot area, and the higher the scheduling priority. The scheduling order of each hot spot area is determined. The terminal can determine the scheduling emergency degree for each hot spot area according to the numerical value of the management level data. Therefore, each dispatching terminal can respectively dispatch different hot spot areas, and the vehicle management efficiency is improved.

In an exemplary embodiment, as shown in fig. 7, the method further includes steps 702 to 706. Wherein:

step 702, a vehicle reservation message of a user terminal is received, and a vehicle start position of the user terminal and a vehicle addition requirement are determined.

Wherein the vehicle add demand characterizes a demand to increase the number of shared vehicles at the vehicle start location.

In the embodiment of the application, the user can determine the starting position of the vehicle and the additional requirement of the vehicle based on the vehicle requirement in the preset time before the vehicle is used. The user then sends a vehicle reservation message to the terminal based on the user terminal, including the vehicle start position, and the vehicle add demand.

The specific value of the preset duration is not specifically limited in the embodiment of the present application.

The terminal determines a start position of the user terminal for use of the vehicle and a vehicle add-on demand based on the vehicle reservation message. Illustratively, the terminal determines that the start position of the vehicle is a hot spot area 01 and that the vehicle adds a demand to increase the shared vehicle based on the vehicle reservation message.

Step 704, determining historical vehicle starting position information of the user terminal according to riding order data of the user terminal in each period in a historical period, and determining reservation demand data of the vehicle starting position according to the historical vehicle starting position information.

In the embodiment of the application, the terminal determines the user account information according to the vehicle reservation message sent by the user terminal. The terminal determines riding order data of the user terminal in each period in a historical period based on the user account information, and further determines the starting position information of the user terminal in the historical vehicle. The terminal matches the historical vehicle starting position of the user terminal with the vehicle starting position, and under the condition that the historical vehicle starting position is matched with the vehicle starting position, reservation demand data of the vehicle starting position are determined.

Illustratively, the terminal determines, based on the user account information 101, riding order data for each period of the user terminal in the historical period, and further determines that the user terminal includes a plurality of hot spot areas 01 in the historical vehicle starting position information. The terminal determines that the historical vehicle starting position of the user terminal is matched with the vehicle starting position (namely a hot spot area 01), and further based on the hot spot area: 01. vehicle add demand: and adding a shared vehicle, and determining reservation demand data.

Step 706, determining the target number of vehicles to be moved into the hot spot area corresponding to the vehicle starting position according to the reservation demand data of the user terminal and the number of vehicles to be moved into the hot spot area corresponding to the vehicle starting position.

In the embodiment of the application, the terminal determines the target number of vehicles to be moved into the hot spot area corresponding to the vehicle starting position according to the reservation demand data of the user terminal and the number of vehicles to be moved into the hot spot area corresponding to the vehicle starting position. Specifically, for each hot spot area, the terminal counts reservation demand data, and according to the number of the reservation demand data, up-regulates the number of vehicles to be moved in the hot spot area corresponding to the vehicle starting position, so as to obtain the target number of vehicles to be moved in the hot spot area corresponding to the vehicle starting position.

In this embodiment, the terminal may be capable of receiving reservation demand data corresponding to the user terminal, and determining whether the number of vehicles to be moved in the hotspot area needs to be added based on the user demand. When the number of vehicles used in the hot spot area is too large, the number of vehicles put in is increased based on reservation demand data of the user terminal, and convenience in vehicle use is improved.

It should be understood that, although the steps in the flowcharts related to the embodiments described above are sequentially shown as indicated by arrows, these steps are not necessarily sequentially performed in the order indicated by the arrows. The steps are not strictly limited to the order of execution unless explicitly recited herein, and the steps may be executed in other orders. Moreover, at least some of the steps in the flowcharts described in the above embodiments may include a plurality of steps or a plurality of stages, which are not necessarily performed at the same time, but may be performed at different times, and the order of the steps or stages is not necessarily performed sequentially, but may be performed alternately or alternately with at least some of the other steps or stages.

Based on the same inventive concept, the embodiment of the application also provides a vehicle management device for realizing the vehicle management method. The implementation of the solution provided by the device is similar to the implementation described in the above method, so the specific limitation in one or more embodiments of the vehicle management device provided below may refer to the limitation of the vehicle management method hereinabove, and will not be repeated herein.

In one exemplary embodiment, as shown in fig. 8, there is provided a vehicle management apparatus 800 including: a first determining module 801, a second determining module 802, and a generating module 803, wherein:

the first determining module 801 is configured to determine a first target convex closure area according to a starting position connection chart corresponding to the riding order data of each period in each history period, and determine a hot spot area of each period in the current period according to the first target convex closure area.

A second determining module 802, configured to determine, for each of the hot spot areas, management level data of the hot spot area according to a distance between a real-time position of a scheduling terminal and a center point position of the hot spot area, a historical vehicle consumption duration of the hot spot area, and a number of vehicles to be moved into in real time of the hot spot area, where the management level data is used to determine a management priority of the hot spot area.

The generating module 803 is configured to generate, in real time, a vehicle scheduling task for each of the hot spot areas in the current period according to management level data of each of the hot spot areas, a center point position of each of the hot spot areas, a target period corresponding to each of the hot spot areas, and a number of vehicles to be moved into each of the hot spot areas, where the vehicle scheduling task is used to perform vehicle management for each of the hot spot areas.

By adopting the vehicle management device provided by the embodiment of the application, the vehicle requirements of the hot spot areas for dynamic change in different time periods are fully considered, and sufficient vehicle supply of the hot spot areas in each time period can be ensured. And, based on the management level data of each hot spot area and the real-time position of the distance dispatching terminal, the vehicle management of the hot spot area is performed, and the vehicle dispatching efficiency can be improved.

In one embodiment, the apparatus further comprises:

In one embodiment, the first determining module 801 is specifically configured to:

In one embodiment, the second determining module 802 is specifically configured to:

In one embodiment, the apparatus further comprises:

Each of the modules in the above-described vehicle management apparatus may be implemented in whole or in part by software, hardware, and a combination thereof. The above modules may be embedded in hardware or may be independent of a processor in the computer device, or may be stored in software in a memory in the computer device, so that the processor may call and execute operations corresponding to the above modules.

In an exemplary embodiment, a computer device, which may be a terminal, is provided, and an internal structure thereof may be as shown in fig. 9. The computer device includes a processor, a memory, an input/output interface, a communication interface, a display unit, and an input means. The processor, the memory and the input/output interface are connected through a system bus, and the communication interface, the display unit and the input device are connected to the system bus through the input/output interface. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of the operating system and computer programs in the non-volatile storage media. The input/output interface of the computer device is used to exchange information between the processor and the external device. The communication interface of the computer device is used for carrying out wired or wireless communication with an external terminal, and the wireless mode can be realized through WIFI, a mobile cellular network, NFC (near field communication) or other technologies. The computer program is executed by a processor to implement a vehicle management method. The display unit of the computer device is used for forming a visual picture, and can be a display screen, a projection device or a virtual reality imaging device. The display screen can be a liquid crystal display screen or an electronic ink display screen, and the input device of the computer equipment can be a touch layer covered on the display screen, can also be a key, a track ball or a touch pad arranged on the shell of the computer equipment, and can also be an external keyboard, a touch pad or a mouse and the like.

It will be appreciated by those skilled in the art that the structure shown in fig. 9 is merely a block diagram of a portion of the structure associated with the present application and is not limiting of the computer device to which the present application applies, and that a particular computer device may include more or fewer components than shown, or may combine some of the components, or have a different arrangement of components.

In an exemplary embodiment, a computer device is provided, comprising a memory and a processor, the memory having stored therein a computer program, the processor performing the steps of the method embodiments described above when the computer program is executed.

In one embodiment, a computer-readable storage medium is provided, on which a computer program is stored which, when executed by a processor, implements the steps of the method embodiments described above.

In an embodiment, a computer program product is provided, comprising a computer program which, when executed by a processor, implements the steps of the method embodiments described above.

It should be noted that, the user information (including, but not limited to, user equipment information, user personal information, etc.) and the data (including, but not limited to, data for analysis, stored data, presented data, etc.) referred to in the present application are information and data authorized by the user or sufficiently authorized by each party, and the collection, use, and processing of the related data are required to meet the related regulations.

Those skilled in the art will appreciate that implementing all or part of the above described methods may be accomplished by way of a computer program stored on a non-transitory computer readable storage medium, which when executed, may comprise the steps of the embodiments of the methods described above. Any reference to memory, database, or other medium used in the various embodiments provided herein may include at least one of non-volatile and volatile memory. The nonvolatile Memory may include Read-Only Memory (ROM), magnetic tape, floppy disk, flash Memory, optical Memory, high density embedded nonvolatile Memory, resistive random access Memory (ReRAM), magnetic random access Memory (Magnetoresistive Random Access Memory, MRAM), ferroelectric Memory (Ferroelectric Random Access Memory, FRAM), phase change Memory (Phase Change Memory, PCM), graphene Memory, and the like. Volatile memory can include random access memory (Random Access Memory, RAM) or external cache memory, and the like. By way of illustration, and not limitation, RAM can be in the form of a variety of forms, such as static random access memory (Static Random Access Memory, SRAM) or dynamic random access memory (Dynamic Random Access Memory, DRAM), and the like. The databases referred to in the various embodiments provided herein may include at least one of relational databases and non-relational databases. The non-relational database may include, but is not limited to, a blockchain-based distributed database, and the like. The processors referred to in the embodiments provided herein may be general purpose processors, central processing units, graphics processors, digital signal processors, programmable logic units, quantum computing-based data processing logic units, etc., without being limited thereto.

The technical features of the above embodiments may be arbitrarily combined, and all possible combinations of the technical features in the above embodiments are not described for brevity of description, however, as long as there is no contradiction between the combinations of the technical features, they should be considered as the scope of the description.

The above examples only represent a few embodiments of the present application, which are described in more detail and are not to be construed as limiting the scope of the present application. It should be noted that it would be apparent to those skilled in the art that various modifications and improvements could be made without departing from the spirit of the present application, which would be within the scope of the present application. Accordingly, the scope of protection of the present application shall be subject to the appended claims.

Claims

1. A vehicle management method, the method comprising:

2. The method according to claim 1, wherein the method further comprises:

3. The method of claim 1, wherein determining the first target convex closure area based on the starting position connectivity map corresponding to the riding order data for each time period in each historical period comprises:

4. The method of claim 3, wherein determining a first target convex closure region corresponding to each of the target starting position connectivity graphs according to coordinates of vertices in each of the target starting position connectivity graphs comprises:

5. The method according to claim 3 or 4, wherein determining hot spot areas for each period in the current period according to the first target convex closure area comprises:

6. The method of claim 5, wherein determining the hot spot areas for each period of the current cycle based on the area of each of the first target convex closure areas and each of the first target convex closure areas comprises:

7. The method of claim 1, wherein the determining the management level data of the hot spot area according to a distance between a real-time location of the scheduling terminal and a center point location of the hot spot area, a historical vehicle consumption duration of the hot spot area, and a real-time number of vehicles to be moved into the hot spot area includes:

8. The method according to claim 1, wherein the method further comprises:

9. A vehicle management apparatus, characterized in that the apparatus comprises:

10. A computer device comprising a memory and a processor, the memory storing a computer program, characterized in that the processor implements the steps of the method of any one of claims 1 to 8 when the computer program is executed.

11. A computer readable storage medium, on which a computer program is stored, characterized in that the computer program, when being executed by a processor, implements the steps of the method of any of claims 1 to 8.