CN115705390A

CN115705390A - Vehicle scheduling processing method, device, electronic equipment and storage medium

Info

Publication number: CN115705390A
Application number: CN202110932997.4A
Authority: CN
Inventors: 刘坤; 蔡铭; 刘旭誉; 易扬
Original assignee: China Mobile Communications Group Co Ltd; China Mobile Shanghai ICT Co Ltd; CM Intelligent Mobility Network Co Ltd
Current assignee: China Mobile Communications Group Co Ltd; China Mobile Shanghai ICT Co Ltd; CM Intelligent Mobility Network Co Ltd
Priority date: 2021-08-13
Filing date: 2021-08-13
Publication date: 2023-02-17

Abstract

The invention provides a vehicle scheduling processing method, a vehicle scheduling processing device, electronic equipment and a computer-readable storage medium. The method comprises the following steps: acquiring vehicle shift scheduling plan information, vehicle running state information and distribution information of K vehicle scheduling tasks on a preset running route, wherein K is a positive integer; determining N vehicles on the preset running route in the vehicle scheduling plan and target route information of the N vehicles on the basis of the distribution information, the vehicle scheduling plan information and the vehicle running state information, wherein the target route information is route information related to the K vehicle scheduling tasks, and N is a positive integer; and determining the matching relation between the N vehicles and the K vehicle scheduling tasks based on the target route information and the distribution information. The invention can improve the dispatching effect of the vehicle.

Description

Vehicle scheduling processing method and device, electronic equipment and storage medium

Technical Field

The embodiment of the invention relates to the technical field of vehicle scheduling, in particular to a vehicle scheduling processing method, a vehicle scheduling processing device, electronic equipment and a computer-readable storage medium.

Background

With the continuous development of unmanned application, in order to meet the vehicle using requirements of users, unmanned vehicle intelligent connection service can be provided for the users, and convenient travel service is provided for the users.

To implement vehicle intelligent docking services, it is generally necessary to schedule an unmanned vehicle. At present, the vehicle to be assessed can be selected by using the position information of the vehicle to be deployed and the user request attribute, however, the scheduling method may have the problem that the vehicle which meets the scheduling cannot be matched and cannot be found, and the vehicle scheduling effect is poor.

Disclosure of Invention

The embodiment of the invention provides a vehicle scheduling processing method and device, electronic equipment and a computer readable storage medium, and aims to solve the problem that the vehicle scheduling effect is poor in the prior art.

In a first aspect, an embodiment of the present invention provides a vehicle scheduling processing method, where the method includes:

acquiring vehicle scheduling plan information, vehicle running state information and distribution information of K vehicle scheduling tasks on a preset running route, wherein K is a positive integer;

determining N vehicles on the preset running route in the vehicle scheduling plan and target route information of the N vehicles on the basis of the distribution information, the vehicle scheduling plan information and the vehicle running state information, wherein the target route information is route information related to the K vehicle scheduling tasks, and N is a positive integer;

and determining the matching relation between the N vehicles and the K vehicle scheduling tasks based on the target route information and the distribution information.

In a second aspect, an embodiment of the present invention provides a vehicle scheduling processing apparatus, including:

the system comprises an acquisition module, a scheduling module and a scheduling module, wherein the acquisition module is used for acquiring vehicle scheduling plan information, vehicle running state information and distribution information of K vehicle scheduling tasks on a preset running route, and K is a positive integer;

a first determining module, configured to determine, based on the distribution information, the vehicle shift schedule information, and the vehicle operating state information, N vehicles on the preset driving route in a vehicle shift schedule and target route information of the N vehicles, where the target route information is route information related to the K vehicle scheduling tasks, and N is a positive integer;

and the second determining module is used for determining the matching relation between the N vehicles and the K vehicle scheduling tasks based on the target route information and the distribution information.

In a third aspect, an embodiment of the present invention provides an electronic device, which includes a processor, a memory, and a computer program stored on the memory and operable on the processor, where the computer program, when executed by the processor, implements the steps of the vehicle scheduling processing method described above.

In a fourth aspect, an embodiment of the present invention provides a computer-readable storage medium, where a computer program is stored, and the computer program, when executed by a processor, implements the steps of the vehicle scheduling processing method.

In the embodiment of the invention, vehicle shift scheduling plan information, vehicle running state information and distribution information of K vehicle scheduling tasks on a preset running route are acquired; determining N vehicles on the preset running route in the vehicle scheduling plan and target route information of the N vehicles on the basis of the distribution information, the vehicle scheduling plan information and the vehicle running state information, wherein the target route information is route information related to the K vehicle scheduling tasks; and determining the matching relation between the N vehicles and the K vehicle scheduling tasks based on the target route information and the distribution information. Therefore, the scheduling plan and the running condition of the vehicle can be combined, the distribution condition of the tasks is matched with the vehicle scheduling tasks, the accuracy of vehicle scheduling can be improved, the condition that the vehicle cannot be found can be avoided, and the scheduling effect of the vehicle can be improved.

Drawings

In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required to be used in the description of the embodiments of the present invention will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without inventive exercise.

FIG. 1 is a schematic flow chart diagram of a vehicle scheduling processing method according to an embodiment of the present invention;

FIG. 2 is one of the schematic relationships of a first vehicle and a station;

FIG. 3 is a second schematic view of the relationship of the first vehicle to the station;

FIG. 4 is a schematic view of a scene of an unmanned bus;

fig. 5 is a schematic structural diagram of a vehicle scheduling processing apparatus according to an embodiment of the present invention;

fig. 6 is a schematic structural diagram of an electronic device according to an embodiment of the present invention.

Detailed Description

The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.

An application scenario of the vehicle scheduling processing method provided by the embodiment of the invention is described below.

The vehicle scheduling processing method provided by the embodiment of the invention relates to the technical field of vehicle scheduling, and can be widely applied to vehicle scheduling scenes such as unmanned driving and intelligent transportation. The method can be executed by the vehicle scheduling processing apparatus of the embodiment of the invention, and the vehicle scheduling processing apparatus can be configured in any electronic device to execute the vehicle scheduling processing method. The electronic device can be a server or a terminal device.

The actual scene may be: in the area where the driving route is divided in advance, such as in scenes of an automatic driving demonstration park, a closed park or a smart city, vehicle scheduling can be performed to meet the vehicle using requirements of users in the area, so that intelligent connection and disconnection of the vehicles are realized, and convenient travel service is provided for the users in the area. The vehicle may be any type of vehicle, for example, the vehicle may be a driver vehicle, or may be a vehicle without a driver, that is, an unmanned vehicle, or may be a transportation bus, or may be a vehicle for rescue, which is not limited herein.

The vehicle scheduling processing method can be applied to a vehicle scheduling system, the vehicle scheduling system can comprise a client, a vehicle scheduling processing device, a vehicle scheduling device and a vehicle, a user can perform vehicle calling service through the client, namely, the user sends a vehicle scheduling task to the vehicle scheduling processing device, the vehicle scheduling processing device can be used for determining the matching relationship between the vehicle and the vehicle scheduling task, and then the vehicle scheduling device can perform vehicle scheduling based on the matching relationship.

The vehicle scheduling processing device and the vehicle scheduling device may be the same device, and are configured to determine a matching relationship between the vehicle and the vehicle scheduling task, and perform vehicle scheduling based on the matching relationship. The vehicle scheduling device carries out vehicle scheduling, namely, the vehicle scheduling task is sent to the vehicle corresponding to the vehicle scheduling task in the matching relation, so that the vehicle executes the vehicle scheduling task, and intelligent connection of the vehicle is realized.

In an example scenario, in an automatic driving demonstration park or a closed park, a driving route is divided in advance in the park, a plurality of stations are deployed on the driving route, the park can provide unmanned bus service for users, and the users can call the bus through clients of a vehicle dispatching system. Correspondingly, the vehicle dispatching system can carry out vehicle dispatching aiming at the user so as to meet the vehicle using requirements of the user.

In another example scenario, in a smart city, a fixed-purpose travel route for an ambulance has been pre-divided within the city, i.e., the city may provide ambulance services to a user, who may make a call through a client of a vehicle dispatch system. Correspondingly, the vehicle dispatching system can carry out vehicle dispatching aiming at the user so as to meet the vehicle using requirements of the user.

The following describes a vehicle scheduling processing method according to an embodiment of the present invention.

Referring to fig. 1, a schematic flow chart of a vehicle dispatching processing method provided by the embodiment of the invention is shown. As shown in fig. 1, the method may include the steps of:

step 101, obtaining vehicle shift scheduling plan information, vehicle running state information and distribution information of K vehicle scheduling tasks on a preset running route.

Wherein K is a positive integer.

In this embodiment, in the area where the driving route is divided in advance, a plurality of position coordinates may be collected on the preset driving route to mark the preset driving route and determine the area route information. The area may include one preset driving route or a plurality of preset driving routes, which is not specifically limited herein. In the case where a plurality of preset travel routes are included in the area, each preset travel route may be marked separately to determine area route information.

The vehicle dispatching processing method can be applied to a vehicle dispatching processing device, and the vehicle dispatching processing device can acquire the regional line information and store the regional line information for use in subsequent vehicle dispatching processing. The obtaining mode may be that the positioning module is used to collect a plurality of position coordinates on a preset driving route to obtain the regional route information, and may also receive the regional route information sent by other electronic devices, where no specific limitation is made here.

The user can install the application program of the client in the vehicle dispatching system on the terminal device, and the user can call the vehicle through the application program. Namely, the client can send the vehicle scheduling task instruction to the vehicle scheduling processing device, and correspondingly, the vehicle scheduling processing device can receive the vehicle scheduling task instruction sent by the client.

The vehicle scheduling task instruction can comprise information related to a passenger getting-on position, a passenger getting-off position and the like, and the vehicle scheduling processing device can determine K vehicle scheduling tasks and distribution information of the K vehicle scheduling tasks on a preset driving route based on the received vehicle scheduling task instruction.

The vehicle scheduling task refers to scheduling vehicles to perform tasks of boarding and alighting passengers, i.e., sending commands to the corresponding vehicles to control where the vehicles stop to allow the passengers to board and alight passengers, wherein one vehicle scheduling task may be determined by one vehicle scheduling task instruction. And the distribution information of the K vehicle scheduling tasks on the preset driving route may include: the system comprises a preset driving route where each vehicle scheduling task is located, a passenger getting-on position and a passenger getting-off position corresponding to each vehicle scheduling task, and in an optional implementation mode, a scheduling strategy of each vehicle scheduling task can be further included.

Specifically, the vehicle scheduling processing device may place the received vehicle scheduling task instruction in the scheduling instruction resource pool, or may place the received vehicle scheduling task instruction in the scheduling instruction resource pool under the condition that it is determined that the passenger getting-on position and the passenger getting-off position in the vehicle scheduling task instruction are located in the preset driving route, that is, under the condition that it is determined that the passenger getting-on position and the passenger getting-off position in the vehicle scheduling task instruction are matched with the regional route information. The scheduling instruction resource pool is a logic concept, namely the received vehicle scheduling task instructions are arranged according to a time sequence to form the scheduling instruction resource pool.

In an optional implementation manner, the vehicle scheduling task instruction may further include two scheduling policies, one is a fixed scheduling policy, and the other is an itinerant scheduling policy, and correspondingly, according to different scheduling policies, the vehicle scheduling task instruction may also include two instruction scheduling types, one is a fixed scheduling task instruction, and the other is an itinerant scheduling task instruction, and all vehicle scheduling task instructions to be executed in the vehicle scheduling system may be carried in the scheduling instruction resource pool.

The fixed scheduling task instruction specifies the getting-on station and the getting-off station of the vehicle, and the getting-on station and the getting-off station are matched with the stopping stations in the preset driving route one by one. The tour scheduling task instruction does not specify an entering station and an exiting station in a preset driving route, but specifies any position in the preset driving route as the entering station and the exiting station, and the position can be calibrated through Global Positioning System (GPS) coordinates. The vehicle scheduling task instructions of the two instruction scheduling types can construct a group of scheduling instruction resource pools according to the instruction scheduling types and the time sequence in a queue mode. The scheduling instruction resource pool information table is shown in table 1 below.

TABLE 1 scheduling Command resource pool information Table

Instruction scheduling type	Task numbering	Vehicle scheduling task instruction
			Cruise scheduling	c ₁	{“...”}
Cruise scheduling	c ₁	{“...”}
			…		…
Cruise scheduling	c	{“...”}
			Fixed scheduling	d ₁	{“...”}
Fixed scheduling	d ₂	{“...”}
			…	…	…
Fixed scheduling	d	{“...”}

Let the scheduling instruction resource pool set be O, then it exists

And the tour schedules the task order and fixedAnd the scheduled task instructions are arranged according to the sequence of the scheduling time.

The K vehicle scheduling tasks that need to be scheduled by the vehicle scheduling processing apparatus may be determined based on the scheduling instruction resource pool, and the K vehicle scheduling tasks may only include the fixed scheduling task, may also only include the cruise scheduling task, or both, where the fixed scheduling task is a vehicle scheduling task corresponding to the fixed scheduling task instruction, and the cruise scheduling task may be a vehicle scheduling task corresponding to the cruise scheduling task instruction.

The number of the vehicle scheduling task instruction, the passenger getting-on position and the passenger getting-off position in the scheduling instruction resource pool can be obtained, the preset driving route where the passenger is located is determined based on the passenger getting-on position and/or the passenger getting-off position, and the K vehicle scheduling tasks, which can be called as the scheduling operation required to be executed by the vehicle at present, and the distribution information of the K vehicle scheduling tasks on the preset driving route are determined through the obtained information, and the definition of the K vehicle scheduling tasks is shown in the following formula (1).

Wherein A is a set of K vehicle scheduling tasks and distribution information of the K vehicle scheduling tasks on a preset driving route, and the set comprises the number orderId of the vehicle scheduling tasks _i Preset driving route lineId corresponding to vehicle scheduling task _i The getting-on position begin corresponding to the vehicle scheduling task _i And the taking in and off positions end _i And an execution state of the vehicle scheduling task, the execution state including pending execution, executing, and end of execution, wherein i ∈ 1, 2.

For a preset driving route in the area, vehicle operation can be arranged for the preset driving route so as to perform connection service on the preset driving route. Specifically, a vehicle shift schedule may be made, i.e., which vehicles are scheduled to run on the preset driving route. The vehicle shift schedule information P is defined as shown in the following equation (2).

Wherein id _i Numbering the vehicles in shifts, beginTime _i End time for the start time of a shift arrangement for a vehicle _i For vehicle shift completion time, vins _i A set of vehicles scheduled at a vehicle scheduling start time and a vehicle scheduling end time, and method _i For the vehicle dispatch mode, i ∈ 1, 2.

The vehicle dispatching modes can be divided into three modes, namely vehicle fixed dispatching, vehicle tour dispatching and vehicle mixed dispatching. The vehicle stationary schedule means that the vehicle can only respond to the stationary schedule task, the vehicle cruise schedule means that the vehicle can only respond to the cruise schedule task, and the vehicle hybrid schedule means that the vehicle can respond to both the stationary schedule task and the cruise schedule task.

For example, two preset driving routes, namely a route 1 and a route 2, are included in the closed park, and in the vehicle shift schedule, in a certain month, the route 1 is taken charge of by the vehicle a and the vehicle B, and the route 2 is taken charge of by the vehicle C and the vehicle D. The dispatching mode of the vehicle A is vehicle fixed dispatching, the dispatching mode of the vehicle B is vehicle hybrid dispatching, the dispatching mode of the vehicle C is vehicle tour dispatching, and the dispatching mode of the vehicle D is vehicle hybrid dispatching.

The vehicle scheduling plan information may be acquired in various manners, for example, the vehicle scheduling plan information stored in advance may be acquired, the vehicle scheduling plan information may be generated according to a traffic situation in the area, and the vehicle scheduling plan information sent by other electronic devices may be received.

The vehicle running state information refers to information on the vehicle currently running in the area, and the vehicle running state information Q is defined as shown in the following equation (3).

Wherein, lineId _i For transporting vehiclesUnique identification of a preset driving route of a line, vin _i Is a vehicle identification code, lat _i For the latitude, lon, of vehicle operation _i For the longitude of vehicle operation, (lat) _i ，lon _i ) Characterizing vehicle position information, prev _i For a station, next, at which the vehicle is located in the preset driving route _i And i belongs to 1,2, T for the next station of the position of the vehicle in the preset driving route.

For example, vehicle a is currently traveling on route 1 with vehicle identification code a, vehicle location information (22, 114), its previous stop being stop a on route 1, and its next stop being stop b on route 1.

The vehicle running state information may be obtained in various manners, for example, vehicle real-time reported data may be obtained, the vehicle running state information may be determined based on the vehicle real-time reported data, and the vehicle running state information sent by other electronic devices may also be received.

And 102, determining N vehicles on the preset running route in the vehicle scheduling plan and target route information of the N vehicles on the basis of the distribution information, the vehicle scheduling plan information and the vehicle running state information, wherein the target route information is route information related to the K vehicle scheduling tasks.

Wherein N is a positive integer.

In this step, in an optional implementation manner, if some vehicles that report data only run on a preset running route in an area, the target route information of the N vehicles and the N vehicles on the preset running route in the vehicle scheduling plan may be determined directly based on the distribution information, the vehicle scheduling plan information, and the vehicle running state information.

In another optional embodiment, if some vehicles in which data is reported run on a preset running route in an area, and another part of vehicles run on another route in the area or in another area, in order to avoid a scheduling error, a situation that a vehicle scheduling task on the preset running route in the area is allocated to another route or another route running in the area occurs, N vehicles on the preset running route in a vehicle scheduling plan and target route information of the N vehicles may be determined based on distribution information, vehicle scheduling plan information, vehicle running state information, and vehicle route information of the preset running route.

Taking the example of determining N vehicles on the preset driving route and the target route information of the N vehicles in the vehicle scheduling plan based on the distribution information, the vehicle scheduling plan information, the vehicle operation state information, and the vehicle route information of the preset driving route. Specifically, first, vehicle route information on a preset travel route may be acquired, which is defined as shown in the following equation (4).

Wherein, lineId _i Unique identification of a predetermined driving route for the operation of a vehicle, lat _i For the latitude, lon, of vehicle operation _i For the longitude of vehicle operation, (lat) _i ，lon _i ) Characterizing vehicle position information, dist _i I belongs to 1, 2.. H, which is the space distance between the current position of the vehicle and the starting point of the preset driving route.

Thereafter, it may be based on the function y ₁ = f (P, Q, a) determines the second set of vehicles and the route information of the second set of vehicles within the vehicle shift schedule, and determines the N vehicles and the target route information of the N vehicles based on the vehicle route information of the preset travel route, the route information of the second set of vehicles and the second set of vehicles. Specifically, it can be represented by the following formula (5).

{(P _θ ∩Q)∪A},lineId∈[Q|lineId＝L|lineId] (5)

The target route information of the N vehicles is expressed by the following equation (6).

The vehicle running state information Q and the target route information V of the N vehicles are different in that the target route information V of the N vehicles is route information of all vehicles running on a preset running route, which is screened from the vehicle running state information Q.

The specific operation process is as follows:

a first vehicle set capable of executing scheduling at the current time can be determined based on the vehicle scheduling plan information, and a formula P is adopted _θ The = filter (currentTime) determination, currentTime representing the current time, represents the first set of vehicles that are executable within the vehicle shift schedule by filtering the current time from the vehicle shift schedule information P based on the current time.

And determining a second vehicle set which is currently driven on the route based on the first vehicle set and the vehicle running state information, namely performing intersection operation on the first vehicle set and vehicles corresponding to the vehicle running state information to obtain the second vehicle set, wherein the second vehicle set comprises vehicles driven on the route in the vehicle scheduling plan.

The second set of vehicles performing the K vehicle scheduling tasks and the route information when the second set of vehicles performs the K vehicle scheduling tasks may be determined based on the second set of vehicles and the distribution information. Specifically, the second vehicle set and the distribution information may be subjected to union operation, so that the second vehicle set is associated with the K vehicle scheduling tasks.

Further, N vehicles traveling on the preset travel route within the vehicle shift schedule may be determined based on the vehicle route information of the preset travel route, the second set of vehicles, and the route information when the K vehicle scheduling tasks are performed by the second set of vehicles, and the target route information of the N vehicles may be determined from the route information when the K vehicle scheduling tasks are performed by the second set of vehicles. Specifically, route information when the second vehicle set executes the K vehicle scheduling tasks may be matched with vehicle route information of a preset driving route to determine N vehicles running on the preset driving route and target route information of the N vehicles, where the target route information is route information related to the K vehicle scheduling tasks and is route information of the preset driving route.

In addition, the scheduling manner of the N vehicles may include at least one of a vehicle fixed schedule, a vehicle cruise schedule, and a vehicle hybrid schedule.

And 103, determining the matching relation between the N vehicles and the K vehicle scheduling tasks based on the target route information and the distribution information.

In this step, the distribution information of the K vehicle scheduling tasks on the preset driving route may be divided into three cases, one is that the K vehicle scheduling tasks are distributed on the same preset driving route, the other is that the K vehicle scheduling tasks are distributed on different preset driving routes, the other is that one vehicle scheduling task is distributed on a part of the preset driving routes, and the other part of the preset driving routes is distributed with a plurality of vehicle scheduling tasks.

The target route information may be divided into three cases, one in which N vehicles travel on different preset travel routes, another in which N vehicles travel on the same preset travel route, and yet another in which one vehicle travels on a part of the preset travel routes and a plurality of vehicles travel on another part of the preset travel routes.

For example, the system comprises 3 vehicle scheduling tasks, namely task 1, task 2 and task 3, two preset driving routes, namely route 1 and route 2, and two vehicles, namely vehicle 1 and vehicle 2.

If vehicle 1 is traveling on route 1 and vehicle 2 is traveling on route 2, in one example, tasks 1,2, and 3 are all located on route 1, then vehicle 1 may all be associated with tasks 1,2, and 3. In another example, task 1, task 2, and task 3 are all located on route 2, at which time vehicle 2 may be associated with task 1, task 2, and the tasks. In yet another example, tasks 1 and 2 are located on route 1 and task 3 is located on route 2, at which time vehicle 1 may be associated with tasks 1 and 2 and vehicle 2 may be associated with task 3.

That is, if only one vehicle is driven on the preset driving route, the driving route of the vehicle on the preset driving route may be associated with the vehicle, and the matching relationship between the vehicle and the vehicle scheduling task may be determined.

For another example, the system includes 3 vehicle scheduling tasks, which are task 1, task 2 and task 3, respectively, one preset driving route, which is route 1, including two vehicles, which are vehicle 1 and vehicle 2, respectively. In this case, the matching relationship between the vehicle and the vehicle scheduling task may be determined by calculating the capacity of the vehicle 1 and the vehicle 2, that is, calculating the spatial distance between the position of the vehicle 1 and the position of the vehicle 2, respectively, with respect to the boarding position in the vehicle scheduling task. For example, vehicle 1 is associated with tasks 1 and 2 when vehicle 1 is relatively close to tasks 1 and 2, and vehicle 2 is associated with task 3 when vehicle 2 is relatively close to task 3.

Further, because only the fixed scheduled tasks can be responded to the fixedly scheduled vehicles due to the influence of the vehicle scheduling method, even if the capacity of the vehicle and the cruise scheduling task is small, the vehicle and the cruise scheduling task cannot be associated with each other, and the cruise scheduling task can be associated with only the cruise scheduled vehicle or the hybrid scheduled vehicle.

In addition, in the case of considering the transportation capacity, it is necessary to consider the actual situation of the vehicle, and even if the transportation capacity of the vehicle and the vehicle scheduling task is small, the vehicle does not have a vacant seat or other reasons so that the vehicle cannot respond to the vehicle scheduling task, and the vehicle cannot be associated with the vehicle scheduling task at this time.

Further, the vehicle scheduling task can be sent to the corresponding vehicle according to the matching relation, so that the vehicle can carry out intelligent connection service. Different scheduling algorithms can be respectively adopted to respond to vehicle scheduling tasks of different scheduling types, for example, a fixed scheduling algorithm can be adopted to respond to a fixed scheduling task, and a tour scheduling algorithm can be adopted to respond to a tour scheduling task.

If the vehicle scheduling mode is vehicle hybrid scheduling, the scheduling priority of the vehicle for vehicle scheduling tasks of different scheduling types may be set, for example, the fixed scheduling task may be responded first, and then the cruise scheduling task may be responded.

In the vehicle operation process, the vehicle scheduling system may also monitor the operation condition of the vehicle scheduling task, for example, monitor the position of the vehicle in real time, monitor whether the vehicle scheduling task located behind the position in the driving direction is executed, and update the execution state of the vehicle scheduling task according to the task response condition reported by the vehicle.

In the embodiment, vehicle shift scheduling plan information, vehicle running state information and distribution information of K vehicle scheduling tasks on a preset running route are acquired; determining N vehicles on the preset running route in the vehicle scheduling plan and target route information of the N vehicles on the basis of the distribution information, the vehicle scheduling plan information and the vehicle running state information, wherein the target route information is route information related to the K vehicle scheduling tasks; and determining the matching relation between the N vehicles and the K vehicle scheduling tasks based on the target route information and the distribution information. Therefore, the vehicle scheduling task can be matched with the vehicle according to the scheduling plan and the running condition of the vehicle and the distribution condition of the task, the accuracy of vehicle scheduling can be improved, the condition that the vehicle cannot be found can be avoided, and the scheduling effect of the vehicle can be improved.

In addition, in the vehicle dispatching process, the vehicle dispatching can be realized without the support of big data, machine learning and deep learning, the requirement on the performance configuration of the server is low, the deployment is simple, and the running speed is high.

Optionally, when there are P first vehicles in the N vehicles that run on the same preset running route, P and N are both integers greater than 1, and P is less than or equal to N, and the matching relationship between the N vehicles and the K vehicle scheduling tasks includes: matching relationships between the P first vehicles and the K vehicle scheduling tasks; the determining a matching relationship between the N vehicles and the K vehicle scheduling tasks based on the target route information and the distribution information includes:

acquiring station information on the preset driving route;

determining the spatial distance between each first vehicle and a target station corresponding to the first vehicle based on the target route information and the station information to obtain P spatial distances corresponding to the P first vehicles, wherein the target station is a station closest to the position of the first vehicle in the driving route of the first vehicle;

and determining the matching relation between the P first vehicles and the K vehicle scheduling tasks based on the P spatial distances and the distribution information.

In this embodiment, when there are a plurality of first vehicles in the N vehicles, and the plurality of first vehicles travel on the same preset travel route, for matching of the vehicle scheduling task, it is necessary to calculate the capacity of the plurality of first vehicles with respect to the vehicle scheduling task, so as to match the vehicle scheduling task to the first vehicle with the minimum capacity, thereby improving the resource utilization rate.

Specifically, the station information on the preset travel route may be acquired, and the station information may be represented by the following equation (7).

Wherein, markNo _i And representing a sequence of stations on the preset driving route, which is a sequence arranged in order according to the station numbers on the preset driving route.

The spatial distance between each first vehicle and a target station corresponding to the first vehicle can be determined based on the station information and the target route information, the target station is a station closest to the first vehicle on the driving route of the first vehicle, the spatial distance can represent the transport capacity of the first vehicle relative to a vehicle scheduling task corresponding to the target station, the larger the spatial distance is, the larger the transport capacity is, and the smaller the spatial distance is, the smaller the transport capacity is. The vehicle scheduling task corresponding to the target station refers to a vehicle scheduling task with a boarding position at or near the target station.

May employ the function y ₂ = f (V, S), determining the spatial distance of each first vehicle from the target station corresponding to the first vehicleIn one example, the spatial distance of each first vehicle from the target station corresponding to the first vehicle may be determined using a spatial distance calculation formula with the target route information V and the station information S as parameters.

Then, a matching relationship between the P first vehicles and the K vehicle scheduling tasks may be determined based on the P spatial distances and the distribution information.

In an alternative embodiment, referring to fig. 2, fig. 2 is one of the relationship schematic diagrams of the first vehicle and the station, as shown in fig. 2, the first vehicle 201 and the first vehicle 202 both travel on the preset travel route 203, the preset travel route 203 includes a station 204, a station 205, a station 206, and a station 207 in a counterclockwise order, the first vehicle 201 is located between the station 204 and the station 205, and the second vehicle 202 is located between the station 206 and the station 207.

Receiving two vehicle scheduling task instructions, corresponding to task 1 and task 2, wherein task 1 is from station 205 to station 207, and task 2 is from station 207 to station 204, and since the spatial distance between the first vehicle 201 and the station 205 is short, the first vehicle 201 is associated with task 1, and the spatial distance between the second vehicle 202 and the station 207 is short, the first vehicle 202 is associated with task 2.

In addition, if another vehicle scheduling task instruction is received, a vehicle scheduling task (the on-board position is located after the first vehicle 202) in which the on-board position is located between the first vehicle 201 and the first vehicle 202 in the traveling direction of the first vehicle 201 may be associated with the first vehicle 201, for example, the first vehicle 201 is associated with task 3, and a vehicle scheduling task (the on-board position is located after the first vehicle 201) in which the on-board position is located between the first vehicle 202 and the first vehicle 201 in the traveling direction of the first vehicle 202 may be associated with the first vehicle 202, for example, the first vehicle 202 is associated with task 4.

In another alternative embodiment, referring to fig. 3, fig. 3 is a second schematic diagram of the relationship between the first vehicle and the station, as shown in fig. 3, the first vehicle 201 and the first vehicle 202 are both located between the station 204 and the station 205, and the first vehicle 201 travels before the first vehicle 202. At this time, a vehicle scheduling task instruction is received, corresponding to task 5, task 5 is from station 205 to station 207, the spatial distances of the first vehicle 201 and the second vehicle 202 with respect to station 205 can be determined, and the spatial distances can be ranked, and the vehicle corresponding to the minimum spatial distance can be determined to be the first vehicle 201, so that when the condition of the first vehicle 201 allows, the first vehicle 201 can be associated with task 5.

In this embodiment, when there are multiple first vehicles in the N vehicles, and the multiple first vehicles travel on the same preset travel route, for matching of the vehicle scheduling task, it is necessary to calculate the transportation capacity of the multiple first vehicles with respect to the vehicle scheduling task, so as to match the vehicle scheduling task to the first vehicle with the minimum transportation capacity, and improve the resource utilization rate.

Optionally, the distribution information includes a boarding position of each vehicle scheduling task, and the determining a matching relationship between the P first vehicles and the K vehicle scheduling tasks based on the P spatial distances and the distribution information includes:

determining a first spatial distance and a second spatial distance from the P spatial distances, wherein the first spatial distance is a spatial distance which is smaller than or equal to a preset threshold value in the P spatial distances, and the second spatial distance is a spatial distance which is larger than the preset threshold value in the P spatial distances;

determining a first matching relation between the P first vehicles and first vehicle scheduling tasks based on the first spatial distance, wherein the first vehicle scheduling tasks are vehicle scheduling tasks corresponding to the first spatial distance and the getting-on positions in the K vehicle scheduling tasks;

and determining a second matching relationship between the P first vehicles and a second vehicle scheduling task based on the second spatial distance, wherein the second vehicle scheduling task is a vehicle scheduling task of which the getting-on position corresponds to the second spatial distance in the K vehicle scheduling tasks.

In this embodiment, the function y may be used ₂ = f (V, S), determining the spatial distance of each first vehicle from the target station corresponding to the first vehicle, and determining the first spatial distance and the second spatial distance from the P spatial distancesDistance, P spatial distances can be represented as G = [ d = [ d ] ₁ ,d ₂ ,...,d _P ]Such as G = [21, -29,44,35, -10 =]The first spatial distance may be a spatial distance smaller than or equal to a preset threshold among the P spatial distances, and the second spatial distance is a spatial distance greater than the preset threshold among the P spatial distances.

The preset threshold may be set according to practical situations, and is greater than or equal to 0, and when the preset threshold is set to 0, if P spatial distances are G = [21, -29,44,35, -10], the first spatial distance is R = [21,35,44], and the second spatial distance is T = [ -29, -10]. The first spatial distance indicates that the target station is ahead of the first vehicle direction of travel, and the second spatial distance indicates that the target station is behind the first vehicle direction of travel.

If the target station is in front of the first vehicle driving direction and the getting-on position in the vehicle scheduling task is located at the target station, a first matching relationship between the P first vehicles and the first vehicle scheduling task can be determined, and if the target station is behind the first vehicle driving direction and the getting-on position in the vehicle scheduling task is located at the target station, a second matching relationship between the P first vehicles and the second vehicle scheduling task can be determined.

In an optional implementation manner, the first matching relationship and the second matching relationship may be matching relationships in different scheduling periods, and a scheduling period corresponding to the first matching relationship is earlier than a scheduling period corresponding to the second matching relationship. For example, as shown in fig. 3, two vehicle scheduling tasks are included, task 5 and task 6, where the getting-on position in task 5 is located before P first vehicles, and the getting-on position in task 6 is located after P first vehicles, a first matching relationship between P first vehicles and the first vehicle scheduling task, that is, task 5, may be determined, and a second matching relationship between P first vehicles and the second vehicle scheduling task, that is, task 6, may be determined.

In this scenario, task 5 is located in front of P first vehicles, and the capacity is small, and the task can be scheduled in the current scheduling period, and task 6 is located behind P first vehicles, and the capacity is large, and the task can be scheduled in the next scheduling period. Therefore, the dispatching of all vehicle dispatching tasks can be realized on the premise of optimal capacity, and the user requirements of users are met.

In another alternative embodiment, the first matching relationship may be that a first vehicle dispatching task to be located forward of vehicle a and rearward of vehicle B is associated with vehicle a, and the second matching relationship may be that a second vehicle dispatching task to be located rearward of vehicle a and forward of vehicle B is associated with vehicle B.

In the embodiment, the first matching relationship and the second matching relationship are determined based on the first spatial distance and the second spatial distance, respectively, so that the transportation capacity of the vehicle scheduling task can be optimized.

Optionally, the determining a first matching relationship between the P first vehicles and a first vehicle scheduling task based on the first spatial distance includes:

under the condition that target stations corresponding to at least two first vehicles in the P first vehicles are at the same platform, matching a first target vehicle scheduling task with a first vehicle corresponding to a first target space distance, wherein the first target vehicle scheduling task is a vehicle scheduling task corresponding to a boarding position and the target platform in the first vehicle scheduling task, and the first target space distance is the smallest space distance in the first space distances corresponding to the at least two first vehicles;

and matching a second target vehicle scheduling task with the first vehicles aiming at each first vehicle under the condition that the target stations corresponding to the P first vehicles are different stations, wherein the second target vehicle scheduling task is a vehicle scheduling task in the first vehicle scheduling task, wherein the vehicle-entering position corresponds to a second target space distance, and the second target space distance is a space distance corresponding to the first vehicle in the first space distance.

In the present embodiment, as shown in fig. 3, both the first vehicle 201 and the first vehicle 202 correspond to the station 205, and in this case, the first vehicle corresponding to the smallest spatial distance in the first spatial distances may be associated with the vehicle scheduling task corresponding to the station 205 at the boarding position in the first vehicle scheduling task, which is the first target vehicle scheduling task, the vehicle scheduling task corresponding to the station 205 at the boarding position in the first spatial distances, the spatial distance in the first spatial distances may be the spatial distance of the position of the first vehicle 201 relative to the station 205, and the vehicle scheduling task corresponding to the station 205 at the boarding position in the first vehicle scheduling task may be task 5, and then the first vehicle 201 may be associated with task 5.

As shown in fig. 2, first vehicle 201 corresponds to station 205 and first vehicle 202 corresponds to station 207, in which case task 1 is matched to first vehicle 201 for first vehicle 201 and task 2 is matched to first vehicle 202 for first vehicle 202.

In this embodiment, when the target stations corresponding to at least two first vehicles in the P first vehicles are at the same station, the first target vehicle scheduling task is matched with the first vehicle corresponding to the first target spatial distance; and matching a second target vehicle scheduling task with the first vehicle aiming at each first vehicle under the condition that the target stations corresponding to the P first vehicles are different stations. In this way, the matching relationship between the P first vehicles and the K vehicle scheduling tasks is determined by combining the distribution situation of the first vehicles and the distribution situation of the vehicle scheduling tasks, so that the transportation capacity optimization of the vehicle scheduling tasks can be achieved.

In practical applications, it may be based on the function y ₃ = f (R, T, O) by function y ₂ And finally obtaining the optimal matching mapping between the N vehicles and the K vehicle scheduling tasks through a series of operations on the calculation results R and T and the scheduling instruction resource pool O, wherein the optimal matching mapping can be represented by the following formula (8).

For any vehicle, a plurality of vehicle scheduling task instructions of the same scheduling strategy can be sent to the vehicle control unit in sequence according to the sequence of the vehicle scheduling task instructions.

Optionally, the N vehicles include a second vehicle, the second vehicle is matched with a third vehicle scheduling task of the K vehicle scheduling tasks, and after determining a matching relationship between the N vehicles and the K vehicle scheduling tasks based on the target route information and the distribution information, the method further includes:

splitting the third vehicle scheduling task according to the station sequence of the second vehicle in the driving direction on the preset driving route to obtain M scheduling subtasks, wherein M is an integer greater than 1;

and sending target scheduling subtasks to the second vehicle, wherein the M scheduling subtasks comprise the target scheduling subtasks.

In the present embodiment, referring to fig. 4, fig. 4 is a schematic view of a scene of the unmanned bus, and as shown in fig. 4, the vehicle traveling direction is counterclockwise, and the vehicle scheduling task for the vehicle received by the vehicle scheduling processing device is shown in table 2 below.

TABLE 2 vehicle scheduling task Table

Vehicle scheduling task 1	Vehicle scheduling task 2	Vehicle scheduling task 3
			D→A	D→C	B→D

The vehicle scheduling task may be split according to the station sequence D → a → B → C of the second vehicle driving direction on the preset driving route, and the splitting table is shown in table 3 below.

TABLE 3 vehicle scheduling task splitting Table

In practical application, whether the execution state of the vehicle scheduling task is to be executed or not can be verified, the vehicle scheduling task to be executed is input to the vehicle control unit according to the scheduling type of the vehicle scheduling task and the vehicle receiving vehicle scheduling task judges whether the execution condition is met or not according to the current vehicle state, the execution result is fed back to the operation monitoring module, and the vehicle scheduling processing is repeatedly carried out so as to continuously optimize the matching relation between the vehicle scheduling task and the vehicle.

The following describes a vehicle scheduling processing apparatus according to an embodiment of the present invention.

Referring to fig. 5, a schematic structural diagram of a vehicle dispatching processing device according to an embodiment of the invention is shown. As shown in fig. 5, the vehicle scheduling processing device 500 includes:

the acquiring module 501 is configured to acquire vehicle shift schedule information, vehicle running state information, and distribution information of K vehicle scheduling tasks on a preset running route, where K is a positive integer;

a first determining module 502, configured to determine, based on the distribution information, the vehicle shift schedule information, and the vehicle operating state information, N vehicles on the preset driving route in the vehicle shift schedule and target route information of the N vehicles, where the target route information is route information related to the K vehicle scheduling tasks, and N is a positive integer;

a second determining module 503, configured to determine, based on the target route information and the distribution information, matching relationships between the N vehicles and the K vehicle scheduling tasks.

Optionally, when there are P first vehicles in the N vehicles that run on the same preset running route, P and N are both integers greater than 1, and P is less than or equal to N, and the matching relationship between the N vehicles and the K vehicle scheduling tasks includes: the matching relationships between the P first vehicles and the K vehicle scheduling tasks, the second determining module 503 includes:

the acquisition sub-module is used for acquiring the station information on the preset driving route;

the first determining submodule is used for determining the spatial distance between each first vehicle and a target station corresponding to the first vehicle based on the target line information and the station information to obtain P spatial distances corresponding to the P first vehicles, wherein the target station is a station which is closest to the position where the first vehicle is located in the driving route of the first vehicle;

and the second determining submodule is used for determining the matching relation between the P first vehicles and the K vehicle scheduling tasks based on the P spatial distances and the distribution information.

Optionally, the distribution information includes a boarding position of each vehicle scheduling task, and the second determining sub-module includes:

a first determining unit, configured to determine a first spatial distance and a second spatial distance from the P spatial distances, where the first spatial distance is a spatial distance smaller than or equal to a preset threshold value from the P spatial distances, and the second spatial distance is a spatial distance greater than the preset threshold value from the P spatial distances;

a second determining unit, configured to determine, based on the first spatial distance, a first matching relationship between the P first vehicles and a first vehicle scheduling task, where the first vehicle scheduling task is a vehicle scheduling task corresponding to the first spatial distance and a boarding position in the K vehicle scheduling tasks;

a third determining unit, configured to determine, based on the second spatial distance, a second matching relationship between the P first vehicles and a second vehicle scheduling task, where the second vehicle scheduling task is a vehicle scheduling task of which a vehicle-getting position corresponds to the second spatial distance in the K vehicle scheduling tasks.

Optionally, the second determining unit is specifically configured to:

and matching a second target vehicle scheduling task with each first vehicle under the condition that target stations corresponding to the P first vehicles are different stations, wherein the second target vehicle scheduling task is a vehicle scheduling task in the first vehicle scheduling task, the getting-on position of which corresponds to a second target space distance, and the second target space distance is a space distance in the first space distance corresponding to the first vehicle.

Optionally, the first matching relationship and the second matching relationship are matching relationships in different scheduling periods, and the scheduling period corresponding to the first matching relationship is earlier than the scheduling period corresponding to the second matching relationship.

Optionally, the N vehicles include a second vehicle, and the second vehicle is matched with a third vehicle scheduling task of the K vehicle scheduling tasks, and the apparatus further includes:

the splitting module is used for splitting the third vehicle scheduling task according to the station sequence of the second vehicle in the driving direction on the preset driving route to obtain M scheduling subtasks, wherein M is an integer greater than 1;

and the sending module is used for sending the target scheduling subtasks to the second vehicle, and the M scheduling subtasks comprise the target scheduling subtasks.

The vehicle scheduling processing apparatus 500 can implement each process implemented in the foregoing method embodiments, and is not described here again to avoid repetition.

The following describes an electronic device provided in an embodiment of the present invention.

Referring to fig. 6, a schematic structural diagram of an electronic device provided in an embodiment of the present invention is shown. As shown in fig. 6, the electronic device 600 includes: a processor 601, a memory 602, a user interface 603, and a bus interface 604.

The processor 601, which is used to read the program in the memory 602, executes the following processes:

determining N vehicles on the preset running route in a vehicle scheduling plan and target route information of the N vehicles on the basis of the distribution information, the vehicle scheduling plan information and the vehicle running state information, wherein the target route information is route information related to the K vehicle scheduling tasks, and N is a positive integer;

In fig. 6, the bus architecture may include any number of interconnected buses and bridges, with one or more processors represented by processor 601 and various circuits of memory represented by memory 602 being linked together. The bus architecture may also link together various other circuits such as peripherals, voltage regulators, power management circuits, and the like, which are well known in the art, and therefore, will not be described any further herein. The bus interface 604 provides an interface. For different user devices, the user interface 603 may also be an interface capable of interfacing with a desired device externally, including but not limited to a keypad, display, speaker, microphone, joystick, etc.

The processor 601 is responsible for managing the bus architecture and general processing, and the memory 602 may store data used by the processor 601 in performing operations.

Optionally, when there are P first vehicles in the N vehicles traveling on the same preset traveling route, P and N are both integers greater than 1, and P is less than or equal to N, and the matching relationship between the N vehicles and the K vehicle scheduling tasks includes: the processor 601 is further configured to:

acquiring station information on the preset driving route;

Optionally, the distribution information includes a boarding position of each vehicle scheduling task, and the processor 601 is further configured to:

Optionally, the processor 601 is further configured to:

Optionally, the N vehicles include a second vehicle, the second vehicle is matched with a third vehicle scheduling task of the K vehicle scheduling tasks, and the processor 601 is further configured to:

and sending a target scheduling subtask to the second vehicle, wherein the M scheduling subtasks comprise the target scheduling subtask.

Preferably, an embodiment of the present invention further provides an electronic device, which includes a processor 601, a memory 602, and a computer program stored in the memory 602 and capable of running on the processor 601, where the computer program is executed by the processor 601 to implement each process of the foregoing vehicle scheduling processing method embodiment, and can achieve the same technical effect, and in order to avoid repetition, details are not repeated here.

The embodiment of the present invention further provides a computer-readable storage medium, where a computer program is stored on the computer-readable storage medium, and when the computer program is executed by a processor, the computer program implements each process of the vehicle scheduling processing method embodiment, and can achieve the same technical effect, and in order to avoid repetition, details are not repeated here. The computer-readable storage medium may be a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk.

Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.

It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.

In the embodiments provided in the present application, it should be understood that the disclosed system and method may be implemented in other ways. For example, the above-described system embodiments are merely illustrative, and for example, the division of the units is only one logical functional division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.

The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one position, or may be distributed on multiple network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiments of the present invention.

In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit.

The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention or a part thereof which substantially contributes to the prior art may be embodied in the form of a software product, which is stored in a storage medium and includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: various media capable of storing program codes, such as a U disk, a removable hard disk, a ROM, a RAM, a magnetic disk, or an optical disk.

The above description is only for the specific embodiments of the present invention, but the scope of the present invention is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present invention, and all the changes or substitutions should be covered within the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.

Claims

1. A vehicle dispatch processing method, the method comprising:

acquiring vehicle shift scheduling plan information, vehicle running state information and distribution information of K vehicle scheduling tasks on a preset running route, wherein K is a positive integer;

2. The method according to claim 1, wherein in a case that there are P first vehicles among the N vehicles traveling on the same preset traveling route, P and N are both integers greater than 1, and P is less than or equal to N, and the matching relationship between the N vehicles and the K vehicle scheduling tasks includes: matching relationships between the P first vehicles and the K vehicle scheduling tasks; the determining a matching relationship between the N vehicles and the K vehicle scheduling tasks based on the target route information and the distribution information includes:

acquiring station information on the preset driving route;

3. The method of claim 2, wherein the distribution information includes a boarding location for each of the vehicle dispatch tasks, and wherein determining the matching relationships between the P first vehicles and the K vehicle dispatch tasks based on the P spatial distances and the distribution information includes:

4. The method of claim 3, wherein said determining a first matching relationship between the P first vehicles and a first vehicle dispatch task based on the first spatial distance comprises:

5. The method of claim 3, wherein the first matching relationship and the second matching relationship are matching relationships in different scheduling periods, and a scheduling period corresponding to the first matching relationship is earlier than a scheduling period corresponding to the second matching relationship.

6. The method of claim 1, wherein the N vehicles comprise a second vehicle that matches a third vehicle dispatch task of the K vehicle dispatch tasks, the method further comprising, after determining the matching relationship between the N vehicles and the K vehicle dispatch tasks based on the target route information and the distribution information:

7. A vehicle scheduling processing apparatus, characterized in that the apparatus comprises:

8. The apparatus according to claim 7, wherein in a case that there are P first vehicles among the N vehicles traveling on the same preset traveling route, P and N are both integers greater than 1, and P is less than or equal to N, and the matching relationship between the N vehicles and the K vehicle scheduling tasks includes: the second determining module comprises a matching relationship between the P first vehicles and the K vehicle scheduling tasks:

9. The apparatus of claim 8, wherein the distribution information includes a boarding location for each of the vehicle dispatch tasks, the second determination submodule comprising:

a second determining unit, configured to determine, based on the first spatial distance, a first matching relationship between the P first vehicles and a first vehicle scheduling task, where the first vehicle scheduling task is a vehicle scheduling task corresponding to the first spatial distance and an upper vehicle position in the K vehicle scheduling tasks;

a third determining unit, configured to determine, based on the second spatial distance, a second matching relationship between the P first vehicles and a second vehicle scheduling task, where the second vehicle scheduling task is a vehicle scheduling task corresponding to the second spatial distance and a boarding position in the K vehicle scheduling tasks.

10. The apparatus according to claim 9, wherein the second determining unit is specifically configured to:

under the condition that target stations corresponding to at least two first vehicles in the P first vehicles are at the same platform, matching a first target vehicle scheduling task with a first vehicle corresponding to a first target space distance, wherein the first target vehicle scheduling task is a vehicle scheduling task corresponding to an upper vehicle position and the target platform in the first vehicle scheduling task, and the first target space distance is the minimum space distance in the first space distances corresponding to the at least two first vehicles;

11. The apparatus of claim 9, wherein the first matching relationship and the second matching relationship are matching relationships in different scheduling periods, and a scheduling period corresponding to the first matching relationship is earlier than a scheduling period corresponding to the second matching relationship.

12. The apparatus of claim 7, wherein the N vehicles comprise a second vehicle that matches a third vehicle dispatch task of the K vehicle dispatch tasks, the apparatus further comprising:

13. An electronic device, characterized in that the electronic device comprises: comprising a processor, a memory, a computer program stored on the memory and executable on the processor, the computer program, when executed by the processor, implementing the steps of the vehicle scheduling processing method according to any one of claims 1 to 6.

14. A computer-readable storage medium, characterized in that a computer program is stored thereon, which computer program, when being executed by a processor, carries out the steps of the vehicle scheduling processing method according to any one of claims 1 to 6.