CN114997728A

CN114997728A - Vehicle scheduling method, device, equipment and storage medium

Info

Publication number: CN114997728A
Application number: CN202210771014.8A
Authority: CN
Inventors: 李康清; 贺刚; 王永亮
Original assignee: Beijing Wutong Chelian Technology Co Ltd
Current assignee: Beijing Wutong Chelian Technology Co Ltd
Priority date: 2022-06-30
Filing date: 2022-06-30
Publication date: 2022-09-02
Anticipated expiration: 2042-06-30
Also published as: CN114997728B

Abstract

The application discloses a vehicle scheduling method, a device, equipment and a storage medium, which belong to the technical field of vehicles, and the method comprises the following steps: determining an inbound station for a vehicle to be dispatched and an outbound station for the vehicle to be dispatched from the plurality of stations based on the vehicle operation information; acquiring scheduling time corresponding to any empty parking space from any vehicle in any outbound station to any inbound station, and determining multiple groups of station combinations and multiple groups of vehicles and empty parking spaces corresponding to any group of station combinations according to the scheduling time and vehicle using requirements; and dispatching the vehicle corresponding to each outbound station to the empty parking space corresponding to the corresponding inbound station. The scheduling result obtained by the method balances the relation among the vehicles, the empty parking spaces, the scheduling time and the vehicle utilization requirements, realizes automatic scheduling of the vehicles of each station, improves the scheduling efficiency of vehicle scheduling, further ensures quick response of vehicle utilization requests and improves vehicle utilization experience.

Description

Vehicle scheduling method, device, equipment and storage medium

Technical Field

The present application relates to the field of vehicle technologies, and in particular, to a method, an apparatus, a device, and a storage medium for vehicle scheduling.

Background

With the development of the automatic driving technology, vehicles such as shared taxis mainly comprise automatic driving vehicles. In the shared taxi mode, a plurality of stations may be set up in different areas of a city, each station including a plurality of parking spaces for storing autonomous vehicles. When a user sends a vehicle using request in a certain area, the automatic driving vehicle in the station corresponding to the area can automatically drive to the position of the user, and the automatic driving vehicle automatically drives to the destination indicated by the user after the user gets on the vehicle. After the user arrives at the destination and alights, the autonomous vehicle is automatically driven to a station in the vicinity.

Because the user is to the use of automatic driving vehicle, the quantity of automatic driving vehicle in each station can change, if the quantity of automatic driving vehicle in the station surpasses when using car demand quantity, can lead to the vehicle to be in the stagnant state for a long time, if the quantity of automatic driving vehicle in the station is less than when using car demand quantity, can lead to user's the request of using the car can't be by quick response, influence and use the car experience.

Therefore, a vehicle scheduling method is needed to schedule the autonomous vehicles in each station, so that the number of the autonomous vehicles in each station is adapted to the number of the vehicle demand, the vehicle demand is responded quickly, and the vehicle using experience is improved.

Disclosure of Invention

The application provides a vehicle scheduling method, a vehicle scheduling device, a vehicle scheduling apparatus and a storage medium, which can solve the problems in the related art.

In a first aspect, a vehicle scheduling method is provided, the method comprising:

acquiring vehicle operation information, wherein the vehicle operation information comprises information of a plurality of stations, a vehicle demand corresponding to each station, vehicle information and empty parking space information contained in each station;

determining an inbound station of a vehicle to be dispatched and an outbound station of the vehicle to be dispatched in the plurality of stations based on the vehicle using requirement corresponding to each station and the vehicle information included in each station;

according to the information of the stations, the vehicle information and the vacant parking space information included in each station, obtaining the corresponding scheduling time of any vehicle in any outbound station to schedule to any vacant parking space in any inbound station; determining a plurality of station combinations according to the scheduling time and the vehicle using requirements corresponding to the inbound stations, wherein any station combination comprises an outbound station and an inbound station;

for any group of station combinations, determining multiple groups of vehicles and empty parking spaces corresponding to any group of station combinations according to the scheduling time and the vehicle using requirements corresponding to the inbound stations in any group of station combinations;

and dispatching the vehicles to be dispatched corresponding to each outbound station to the empty parking spaces corresponding to the corresponding inbound stations according to the plurality of groups of vehicles and empty parking spaces corresponding to each group of station combination.

In one possible embodiment, the determining a plurality of station combinations according to the scheduled time and the corresponding vehicle demand of the inbound station includes:

acquiring a first scheduling probability corresponding to any inbound station and any outbound station according to the scheduling time and the vehicle using requirements corresponding to the inbound stations;

a plurality of sets of station combinations are determined based on the first scheduling probabilities corresponding to the any of the inbound stations and any of the outbound stations.

In one possible embodiment, each station comprises a corresponding upper and lower station point; the corresponding scheduling time of any empty parking stall in any vehicle dispatch in any departure station to any arbitrary inbound station includes: the first time when any vehicle is driven to the getting-on and getting-off station corresponding to any outbound station from any outbound station, the second time when any vehicle is driven to the getting-on and getting-off station corresponding to any inbound station from the getting-on and getting-off station corresponding to the outbound station, and the third time when any vehicle is driven to any inbound station from the getting-on and getting-off station corresponding to any inbound station.

In a possible embodiment, the obtaining a first scheduling probability corresponding to any inbound station and any outbound station according to the scheduling time and the vehicle demand corresponding to the inbound station includes: calculating the first scheduling probability corresponding to every arbitrary two stations according to the following formula,

wherein, P _u Is a first scheduling probability, I is the number of empty parking spaces, I is the total number of empty parking spaces in the inbound field station, j is the number of vehicles, O is the total number of vehicles in the outbound field station, l is the number of the outbound field station, M is the total number of the outbound field station, k is the number of the inbound field station, N is the total number of the inbound field station, X is the total number of the inbound field station _ik At a third time, Y _jl At a first time, C _kl At a second time, F _k Is the vehicle demand for inbound stations.

In one possible embodiment, the determining a plurality of sets of station combinations based on the first scheduling probabilities corresponding to the any inbound station and the any outbound station includes:

initializing a probability threshold;

sequentially circulating each first scheduling probability in the first scheduling probabilities corresponding to any inbound station and any outbound station, and replacing the probability threshold with the first scheduling probability when the first scheduling probability is smaller than the probability threshold; when the first scheduling probability is not smaller than the probability threshold, reserving the inbound station and the outbound station corresponding to the first scheduling probability;

and determining a plurality of station combinations according to the reserved inbound stations and outbound stations.

In a possible embodiment, the determining multiple sets of vehicles and empty slots corresponding to any one of the station combinations according to the scheduled time and the vehicle demand corresponding to the inbound station in any one of the station combinations includes:

acquiring a second scheduling probability corresponding to any vehicle and any empty parking space according to the scheduling time and the vehicle using requirements corresponding to the inbound stations in any group of station combinations;

and determining a plurality of groups of vehicles and empty spaces corresponding to any group of station combinations based on the second scheduling probability corresponding to any vehicle and any empty space.

In a possible implementation manner, the dispatching a vehicle to be dispatched corresponding to each outbound station to an empty slot corresponding to a corresponding inbound station according to a plurality of groups of vehicles and empty slots corresponding to each group of station combinations includes:

determining a plurality of outbound vehicles to be dispatched according to a plurality of groups of corresponding vehicles and empty parking spaces combined by each group of stations;

and forming the plurality of outbound vehicles into a queue based on the path plans of the plurality of outbound vehicles from the corresponding outbound stations to the inbound stations respectively, and controlling the plurality of outbound vehicles to form the queue to drive to the empty parking spaces corresponding to the corresponding inbound stations according to a formation result.

In a second aspect, a vehicle dispatching device is provided, the device comprising:

the system comprises a first acquisition module, a second acquisition module and a control module, wherein the first acquisition module is used for acquiring vehicle operation information, and the vehicle operation information comprises information of a plurality of stations, a vehicle demand corresponding to each station, vehicle information and empty parking space information contained in each station;

the first determining module is used for determining an inbound station of a vehicle to be called in and an outbound station of the vehicle to be called out in the stations based on the vehicle using requirement corresponding to each station and the vehicle information included in each station;

the second acquisition module is used for acquiring scheduling time corresponding to any empty parking space scheduled to any inbound station by any vehicle in any outbound station according to the information of the stations, the vehicle information and the empty parking space information included in each station;

the second determining module is used for determining a plurality of station combinations according to the scheduling time and the vehicle using requirements corresponding to the inbound stations, wherein any station combination comprises an outbound station and an inbound station;

the third determining module is used for determining a plurality of groups of vehicles and empty parking spaces corresponding to any group of station combinations according to the scheduling time and the vehicle using requirements corresponding to the inbound stations in any group of station combinations;

and the scheduling module is used for scheduling the vehicles to be scheduled corresponding to each outbound station to the empty parking spaces corresponding to the corresponding inbound stations according to the plurality of groups of vehicles and empty parking spaces corresponding to each group of station combination.

In a possible implementation manner, the second determining module is configured to obtain a first scheduling probability corresponding to any inbound station and any outbound station according to the scheduling time and the vehicle utilization requirement corresponding to the inbound station; a plurality of sets of station combinations are determined based on the first scheduling probabilities corresponding to the any of the inbound stations and any of the outbound stations.

In a possible implementation, the second determining module is configured to calculate the first scheduling probability for every two stations according to the following formula,

In a possible embodiment, the second determining module is configured to initialize a probability threshold; sequentially circulating each first scheduling probability in first scheduling probabilities corresponding to any inbound station and any outbound station, and replacing the probability threshold with the first scheduling probability when the first scheduling probability is smaller than the probability threshold; when the first scheduling probability is not smaller than the probability threshold, reserving the inbound station and the outbound station corresponding to the first scheduling probability; a plurality of sets of station combinations are determined based on the reserved inbound stations and outbound stations.

In a possible implementation manner, the third determining module is configured to obtain a second scheduling probability corresponding to any vehicle and any empty parking space according to the scheduling time and the vehicle using demand corresponding to the inbound station in any group of station combinations; and determining a plurality of groups of vehicles and empty spaces corresponding to any group of station combinations based on the second scheduling probability corresponding to any vehicle and any empty space.

In a possible implementation manner, the scheduling module is configured to determine a plurality of outbound vehicles to be dispatched according to a plurality of groups of vehicles and empty parking spaces corresponding to each group of station combination; and forming the plurality of outbound vehicles into a queue based on the path plans of the plurality of outbound vehicles from the corresponding outbound stations to the inbound stations respectively, and controlling the plurality of outbound vehicles to form the queue to drive to the empty parking spaces corresponding to the corresponding inbound stations according to a formation result.

In a third aspect, a computer device is further provided, where the computer device includes a processor and a memory, where at least one program code is stored in the memory, and the at least one program code is loaded and executed by the processor, so as to enable the computer device to implement any one of the vehicle scheduling methods described above.

In a fourth aspect, a computer-readable storage medium is provided, in which at least one program code is stored, and the at least one program code is loaded and executed by a processor to make a computer implement any of the vehicle scheduling methods described above.

In a fifth aspect, there is also provided a computer program product or computer program comprising computer instructions stored in a computer readable storage medium. The processor of the computer device reads the computer instructions from the computer readable storage medium, and the processor executes the computer instructions to cause the computer device to execute any one of the vehicle scheduling methods described above.

The technical scheme provided by the application can at least bring the following beneficial effects:

the technical scheme that this application provided has realized the automation of the vehicle to each station and has transferred, compares in artifical vehicle scheduling, has improved the scheduling efficiency of vehicle scheduling. The scheduling result is determined according to the scheduling time and the vehicle using requirements, and the scheduling time is obtained according to the vehicle information and the empty parking space information included in each station, so that the obtained scheduling result balances the relationship among the vehicles, the empty parking spaces, the scheduling time and the vehicle using requirements, the number of the vehicles in each station is adapted to the number of the vehicle using requirements, the quick response of the vehicle using requests is further ensured, and the vehicle using experience is improved.

Drawings

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

FIG. 1 is a schematic diagram of an implementation environment of a vehicle scheduling method according to an embodiment of the present disclosure;

FIG. 2 is a flow chart of a vehicle scheduling method according to an embodiment of the present disclosure;

fig. 3 is a flowchart of a method for scheduling formation according to an embodiment of the present application;

fig. 4 is a schematic diagram of a formation scheduling process provided in an embodiment of the present application;

FIG. 5 is a schematic diagram of a vehicle dispatching method provided by an embodiment of the present application;

FIG. 6 is a schematic diagram of a vehicle dispatching device provided in an embodiment of the present application;

FIG. 7 is a schematic structural diagram of a computer device according to an embodiment of the present disclosure;

fig. 8 is a schematic structural diagram of a server according to an embodiment of the present application.

Detailed Description

To make the objects, technical solutions and advantages of the present application more clear, embodiments of the present application will be described in further detail below with reference to the accompanying drawings.

With the development of the autonomous driving technology, in the shared taxi mode, the shared taxi is generally an autonomous driving vehicle. Therefore, it is necessary to provide a vehicle scheduling method for automatically scheduling the automatically driven vehicles in each station, so that the number of the automatically driven vehicles in each station is adapted to the required number of the vehicles, the vehicle using request is quickly responded, and the vehicle using experience is improved.

Fig. 1 is a schematic diagram illustrating an implementation environment of a vehicle scheduling method provided by an embodiment of the present application. The implementation environment includes: a computer device 101 and a plurality of stations 102, each station 102 comprising a plurality of vehicles 103.

In one possible implementation, a vehicle scheduling application is installed in the computer device 101 for scheduling the vehicle 103 in the station 102 according to the vehicle operation information, for example, the vehicle 103 is an autonomous vehicle. The vehicle operation information comprises information of a plurality of stations, vehicle requirements corresponding to each station, vehicle information and empty space information included by each station.

In this embodiment, the station 102 is a parking lot for storing the vehicle 103, when the vehicle 103 is in an idle state, the vehicle 103 is parked in a parking space in the station to wait for a user to call the vehicle, and when there is no vehicle 103 in the parking space, the parking space is an empty parking space. It is understood that the station 102 in the operating state is referred to as an operating station, and the vehicle 103 in the operating state is referred to as an operating vehicle. The station 102 and the vehicle 103 in the embodiment of the present application are referred to as an operating station and an operating vehicle.

Optionally, the computer device 101 communicates with the stations 102 and the vehicles 103 in a wireless manner, and the computer device 101 can receive vehicle operation information sent by each station 102; the computer apparatus 101 can receive the position information and the vehicle-use status of each vehicle 103, and likewise, the computer apparatus 101 can transmit a scheduling instruction to each vehicle 103 to cause the vehicle 103 to implement vehicle scheduling in accordance with the scheduling instruction.

In one possible implementation manner, the computer device 101 may refer to a terminal or a server, and is illustrated in fig. 1 by taking the server as an example. Illustratively, the terminal may be any electronic product capable of interacting with a user through one or more manners, such as a Personal Computer (PC), a smart phone, a Personal Digital Assistant (PDA), a wearable device, a Pocket PC (PPC), a tablet Computer, a smart car machine, and the like. The server may be an independent physical server, a server cluster or a distributed system formed by a plurality of physical servers, or a cloud server providing basic cloud computing services such as a cloud service, a cloud database, cloud computing, a cloud function, cloud storage, a Network service, cloud communication, middleware service, a domain name service, a security service, a Content Delivery Network (CDN), a big data and artificial intelligence platform, and the like.

Those skilled in the art will appreciate that the computer apparatus 101 described above is by way of example only, and that other existing or future computer apparatus that may be used in the present application are also contemplated as falling within the scope of the present application and are hereby incorporated by reference.

The embodiment of the present application provides a vehicle scheduling method, which may be applied to the implementation environment shown in fig. 1, for example, the method is applied to a computer device 101, and the computer device 101 may be a terminal or a server, which is not limited in this embodiment of the present application. As shown in fig. 2, an embodiment of the present application provides a vehicle dispatching method, which includes the following steps 201 to 206.

Step 201, obtaining vehicle operation information, where the vehicle operation information includes information of a plurality of stations, a vehicle demand corresponding to each station, vehicle information included in each station, and empty space information.

In the embodiment of the present application, the vehicle scheduling refers to vehicle scheduling between stations, for example, scheduling a vehicle a in station a to an empty space B in station B. The parking lot comprises a plurality of parking lots, wherein the parking lots are positioned at different places, each parking lot comprises a plurality of parking spaces for storing vehicles, and the vehicles which are not parked are empty parking spaces.

For example, the vehicle is an autonomous vehicle, and the autonomous vehicle operation process may be: when the automatic driving vehicle is in an idle state, parking at any parking space in any station; when a user sends a vehicle using request in a certain area, an automatic driving vehicle responds to the vehicle using request in a station corresponding to the area and automatically drives to the position of the user, and the automatic driving vehicle automatically drives to a destination indicated by the user after the user gets on the vehicle; after the user arrives at the destination and gets off the vehicle, the automatic driving vehicle automatically drives to a station with an available parking space nearby.

Optionally, the information of the station includes position information of the station, position information of a boarding and alighting point corresponding to the station, or parking space information in the station; the corresponding vehicle using demand of each station refers to the number of vehicle using requests which may need to be responded by the station, and the number of the vehicle using requests which may need to be responded is the number of the vehicles which may need to be used by the station; the vehicle information included in each station may be the number of the vehicle currently stored in the station, and the empty space information included in each station may be the space position where the vehicle is not parked in the station, and the like.

The embodiment of the application does not limit the manner of obtaining the vehicle operation information, for example, the computer device communicates with all vehicles, and obtains the vehicle operation information through the operation information transmitted by each vehicle, or the computer device obtains vehicle operation information stored in advance from a database, or a dispatcher inputs the vehicle operation information to the computer device.

And step 202, determining an inbound station of the vehicles to be dispatched and an outbound station of the vehicles to be dispatched in a plurality of stations based on the vehicle using demand corresponding to each station and the vehicle information included in each station.

Optionally, determining an inbound station to be called in a vehicle and an outbound station to be called out of the plurality of stations based on the vehicle demand corresponding to each station and the vehicle information included in each station, including: for any station, acquiring a first number of vehicles required by the station based on the vehicle demand corresponding to the station, and acquiring a second number of vehicles included by the station based on vehicle information included by the station; acquiring the difference quantity between the first quantity and the second quantity; and when the difference quantity is a negative number, determining that any station is an outbound station of the vehicle to be dispatched.

Illustratively, the number of demanded cars for station a and station B is 20, station a currently includes 21 vehicles, and station B currently includes 15 vehicles. Station a is the inbound station for the vehicle to be dispatched and station B is the outbound station for the vehicle to be dispatched.

Step 203, obtaining the scheduling time corresponding to any empty parking space scheduled to any one inbound station by any one vehicle in any outbound station according to the information of the stations, the vehicle information and the empty parking space information included in each station.

In the embodiment of the application, the position information of each station can be acquired according to the information of a plurality of stations, and the position information of each vehicle and the position information of each empty parking space can be acquired according to the vehicle information and the empty parking space information included in each station. Optionally, a scheduling path of any vehicle driven to any empty space can be acquired through a path planning algorithm, and according to road condition information on the scheduling path and the driving speed of the vehicle, scheduling time corresponding to any empty space of any vehicle scheduled to any inbound space in any outbound site can be predicted and acquired.

In one possible embodiment, each station comprises a corresponding boarding and disembarking station point; then the scheduling time corresponding to any empty slot scheduled by any vehicle in any outbound station to any inbound station includes: the system comprises a first time when any vehicle is driven to an upper station and a lower station corresponding to any outbound station from any outbound station, a second time when any vehicle is driven to an upper station and a lower station corresponding to any inbound station from the upper station and the lower station corresponding to the outbound station, and a third time when any vehicle is driven to any inbound station from the upper station and the lower station corresponding to any inbound station.

And 204, determining a plurality of station combinations according to the dispatching time and the vehicle using requirements corresponding to the inbound stations, wherein any station combination comprises an outbound station and an inbound station.

In the embodiment of the application, after the scheduling time corresponding to any empty space in any vehicle scheduled to any one inbound field station in any outbound field station and the vehicle demand corresponding to the inbound field station are obtained, the vehicle scheduling of the vehicle scheduled to the empty space in a certain inbound field station in any outbound field station can be simulated. Therefore, for all outbound stations and all inbound stations, multiple groups of corresponding relations can be obtained in a permutation and combination mode, for each group of station combinations, vehicle scheduling results of vehicles in the outbound stations of the station combination and empty parking spaces in the inbound stations of the station combination can be obtained, and multiple groups of station combinations with scheduling results meeting scheduling requirements can be selected from all the groups of station combinations through the relation between the vehicle scheduling results corresponding to each group of station combinations and the vehicle scheduling results corresponding to all the groups of station combinations. The scheduling requirement can be flexibly adjusted according to the application scenario, for example, the scheduling requirement may be that the number of vehicles at each station is adapted to the vehicle usage requirement.

The embodiment of the application does not limit the acquisition mode of the vehicle scheduling result, and the acquired vehicle scheduling result can reflect the scheduling time and the vehicle using requirements corresponding to the inbound station. For example, the vehicle scheduling result is obtained by multiplying the scheduling time by the vehicle demand, or the vehicle scheduling result is obtained by comparing the scheduling time with the vehicle demand.

In one possible embodiment, determining a plurality of station combinations based on the scheduled time and the corresponding demand for the vehicle at the inbound station comprises: acquiring a first scheduling probability corresponding to any inbound station and any outbound station according to scheduling time and a vehicle using demand corresponding to the inbound station; a plurality of sets of station combinations are determined based on the first scheduling probabilities corresponding to any of the inbound stations and any of the outbound stations.

Optionally, the obtaining manner of the first scheduling probability is not limited in this embodiment, for example, the first scheduling probability may be a ratio of a vehicle scheduling result of any group of station combinations to a vehicle scheduling result corresponding to all group of station combinations, or the first scheduling probability may be a weighted ratio of a vehicle scheduling result of any group of station combinations to a vehicle scheduling result corresponding to all group of station combinations.

In one possible embodiment, obtaining a first scheduling probability corresponding to any inbound site and any outbound site according to a plurality of scheduling times and a vehicle demand corresponding to the inbound site includes: calculating a first scheduling probability corresponding to every arbitrary two stations by the following formula (1),

wherein, P _u Is a first scheduling probability, I is the number of empty parking spaces, I is the total number of empty parking spaces in the inbound field station, j is the number of vehicles, O is the total number of vehicles in the outbound field station, l is the number of the outbound field station, M is the total number of the outbound field station, k is the number of the inbound field station, N is the total number of the inbound field station, X is the total number of the inbound field station _ik At a third time, Y _jl At a first time, C _kl At a second time, F _k Is a demand for a car to be put into the station.

In the embodiment of the application, after the inbound field station where the vehicle is to be called and the outbound field station where the vehicle is to be called are obtained, the total number of the inbound field stations and the total number of the outbound field stations can be obtained according to a summation mode, and further, the total number of the empty parking spaces in the inbound field station and the total number of the vehicles in the outbound field station can be obtained according to the vehicle information and the empty parking space information included in the inbound field station and the vehicle information and the empty parking space information included in the outbound field station. The number of the empty space, the number of the vehicle, the number of the outbound station, the number of the inbound station, and the like are not limited in the embodiment of the present application, and the number is, for example, 1, 2, 3 …, or A, B, C ….

In one possible embodiment, determining a plurality of sets of station combinations based on the first scheduling probabilities corresponding to any inbound station and any outbound station comprises: initializing a first probability threshold; sequentially circulating each first scheduling probability in the first scheduling probabilities corresponding to any inbound station and any outbound station, and replacing the first probability threshold with the first scheduling probability when the first scheduling probability is smaller than the first probability threshold; when the first scheduling probability is not smaller than the first probability threshold, reserving the inbound stations and the outbound stations corresponding to the first scheduling probability; and acquiring a plurality of groups of station combinations according to the reserved inbound stations and outbound stations.

Step 205, for any group of station combinations, determining multiple groups of vehicles and empty parking spaces corresponding to any group of station combinations according to the scheduling time and the vehicle using requirements corresponding to the inbound stations in any group of station combinations.

In the embodiment of the present application, the principle of determining the multiple sets of vehicles and empty slots corresponding to any one set of station combination is similar to the principle of determining the multiple sets of station combinations in step 204. After the dispatching time corresponding to any empty parking space in any one outbound station and the vehicle demand corresponding to any one inbound station are obtained, the vehicle dispatching method can simulate the vehicle dispatching of any one vehicle in any one outbound station to a certain empty parking space in a certain inbound station. Therefore, for all vehicles of the outbound station and all empty parking spaces of the inbound station in any group of station combination, the multiple groups of corresponding relations can be obtained in a permutation and combination mode, the vehicle scheduling result of the vehicle scheduled to the empty parking space can be obtained for each group of vehicles and empty parking spaces, and the multiple groups of vehicles and empty parking spaces of which the scheduling results meet the scheduling requirements can be selected from all the groups of vehicles and empty parking spaces through the relation between the vehicle scheduling result corresponding to each group of vehicles and empty parking spaces and the vehicle scheduling results corresponding to all the groups of vehicles and empty parking spaces.

In one possible embodiment, determining multiple groups of vehicles and empty parking spaces corresponding to any group of station combinations according to the scheduling time and the vehicle demand corresponding to the inbound station includes: acquiring a second scheduling probability corresponding to any vehicle and any vacant parking space according to the scheduling time and the vehicle using requirements corresponding to the inbound station; and determining a plurality of groups of vehicles and empty parking spaces corresponding to any group of station combinations based on the second scheduling probability corresponding to any vehicle and any empty parking space.

The manner of obtaining the second scheduling probability corresponding to any vehicle and any empty space is not limited in the embodiment of the present application, for example, the second scheduling probability corresponding to any vehicle and any empty space may be obtained according to formula (1) of obtaining the first scheduling probability in step 204, in this case, P in formula (1) _u The meaning of the other symbols in equation (1) is unchanged for the second scheduling probability.

In a possible implementation manner, determining, based on the second scheduling probability corresponding to any vehicle and any empty space, a plurality of sets of vehicles and empty spaces corresponding to any set of station combinations includes: initializing a second probability threshold for any one group of station combinations; sequentially circulating each second scheduling probability in second scheduling probabilities corresponding to any vehicle and any empty parking space corresponding to any group of station combinations, and replacing the second probability threshold value with the second scheduling probability when the second scheduling probability is smaller than a second probability threshold value; when the second scheduling probability is not smaller than a second probability threshold, reserving the vehicle and the empty parking space corresponding to the second scheduling probability; and acquiring and determining a plurality of groups of vehicles and empty parking spaces corresponding to any group of station combination according to the reserved vehicles and empty parking spaces.

And step 206, according to the plurality of groups of vehicles and empty parking spaces corresponding to each group of station combination, dispatching the vehicles to be dispatched corresponding to each outbound station to the empty parking spaces corresponding to the corresponding inbound stations.

In the embodiment of the application, according to the multiple groups of vehicles and empty parking spaces corresponding to each group of station combination in the multiple groups of station combinations, which vehicle of which outbound station is scheduled to which empty parking space of which inbound station is determined. Therefore, each vehicle can automatically cruise and drive to the destination according to the received scheduling instruction by sending the scheduling instruction to each vehicle needing to be scheduled, wherein the scheduling instruction comprises the destination, and the destination is a certain empty parking space of a corresponding certain inbound station.

In a possible implementation manner, according to each group of station combination corresponding to a plurality of groups of vehicles and empty slots, dispatching the vehicle to be dispatched corresponding to each outbound station to the corresponding empty slot of the corresponding inbound station includes: combining a plurality of groups of corresponding vehicles and empty parking spaces according to each group of stations; and forming a plurality of outbound vehicles based on path planning of the outbound vehicles from the corresponding outbound stations to the inbound stations respectively, and controlling the plurality of outbound vehicles to form a plurality of empty parking spaces corresponding to the corresponding inbound stations according to a forming result. The method of the formation scheduling can improve the planning performance of the scheduling path.

For example, when all vehicles needing to be dispatched receive the dispatching command, each vehicle starts to follow the dispatching command, then the vehicle closest to the starting point of the dispatching path is formed into a head vehicle, and the vehicles at other stations or the local station automatically join the dispatching queue on the dispatching path of the head vehicle from the head vehicle. Wherein the distance between adjacent vehicles in the dispatching queue is kept to be 5m (unit: meter) if the speed of the formation vehicles is less than 15km/h (unit: kilometer/h), the distance between adjacent vehicles in the dispatching queue is kept to be 30m if the speed of the formation vehicles is more than 15km/h and less than 30km/h, and the distance between adjacent vehicles in the dispatching queue is kept to be 45m if the speed of the formation vehicles is more than 30km/h and less than 60 km/h.

It can be understood that, in the case of formation scheduling, when any vehicle reaches the inbound station corresponding to the destination in the process that the vehicle travels along the formation path in the formation queue following the head car, the vehicle will automatically leave the formation and cruise to drive to the empty space corresponding to the inbound station.

Referring to fig. 3, fig. 3 is a flowchart of a method for scheduling a formation according to an embodiment of the present disclosure. As shown in fig. 3, in this embodiment, each station includes a corresponding boarding and disembarking point, taking as an example the formation scheduling process of vehicles 1 of the outbound station 1. The formation scheduling method comprises the following steps: starting formation scheduling; 301, the vehicle 1 of the outbound station 1 automatically cruises to the upper and lower station points 1 corresponding to the outbound station 1 according to the path plan; 302, the vehicle 1 automatically cruises from an upper station point 1 and a lower station point 1 according to a formation instruction and joins in a formation queue 1; 303, the vehicle 1 follows the formation path of the formation queue 1; 304, the vehicle 1 automatically cruises from the formation queue 1 to an upper station point 2 and a lower station point 2 corresponding to the entrance station 2 according to the dequeue instruction; 305, the vehicle 1 automatically cruises to an empty parking space 2 corresponding to the appointed entrance station 2 from the upper station point 2 and the lower station point 2 according to the path planning; and finishing the formation scheduling.

Referring to fig. 4, fig. 4 is a schematic diagram of a queuing scheduling process according to an embodiment of the present application. As shown in FIG. 4, the outbound site includes l ₀ 、l ₁ 、l ₂ The docking station includes k ₀ 、k ₁ 、k ₂ 、k ₃ Wherein the outbound station l ₀ Comprising a vehicle j ₀ 、j ₁ 、j ₂ 、j ₃ 、j ₄ Outbound site l ₁ Comprising a vehicle j ₀ 、j ₁ 、j ₂ 、j ₃ Outbound site l ₂ Comprising a vehicle j ₀ 、j ₁ 、j ₂ Inbound site k ₀ Including empty parking space i ₀ 、i ₁ 、i ₂ 、i ₃ Inbound station k ₁ Including empty parking space i ₀ 、i ₁ Inbound site k ₂ Including empty parking space i ₀ 、i ₁ 、i ₂ Inbound site k ₃ Including empty parking space i ₀ 、i ₁ 、i ₂ . In this embodiment, the number of vehicles NP requiring formation scheduling is 3, i.e., the outbound site l ₀ Vehicle j in ₀ 、j ₂ 、j ₄ Formation scheduling to inbound site k ₃ Empty parking space i ₀ 、i ₁ 、i ₂ Wherein the head vehicle is a vehicle j ₄ 。

The vehicle scheduling method provided by the embodiment of the application realizes automatic scheduling of vehicles of all stations, and improves scheduling efficiency of vehicle scheduling compared with manual vehicle scheduling. The scheduling result is determined according to the scheduling time and the vehicle using requirements, and the scheduling time is obtained according to the vehicle information and the empty parking space information included in each station, so that the obtained scheduling result balances the relationship among the vehicles, the empty parking spaces, the scheduling time and the vehicle using requirements, the number of the vehicles in each station is adapted to the number of the vehicle using requirements, the quick response of the vehicle using requests is further ensured, and the vehicle using experience is improved.

Referring to fig. 5, fig. 5 is a schematic view of a vehicle dispatching method according to an embodiment of the present application. As shown in fig. 5, the vehicle scheduling method includes the following steps.

501, vehicle operation data is acquired.

Optionally, referring to the content in step 201, the vehicle operation information includes information of a plurality of stations, a vehicle demand corresponding to each station, vehicle information included in each station, and empty space information.

502, according to the vehicle operation data, firstly defining symbols of all operation stations and operation vehicles: l: numbering outbound stations; k: an inbound site number; j: vehicle numbers in the outbound yard; i: numbering empty parking spaces in the station; m: total number of outbound sites; n: total number of inbound sites; o: total number of vehicles in the outbound yard; i: the total number of empty slots in the inbound yard.

And 503, acquiring related parameter information according to the vehicle operation data and the defined symbols.

Wherein, Y _jl The time for driving the vehicle j in the outbound station l to the loading and unloading station corresponding to the outbound station l is given; c _kl The time for driving the station corresponding to the station l to get on or off the bus to the station corresponding to the station k is taken as the time for driving the station corresponding to the station l to get on or off the bus; x _ik The time for driving to an empty parking space i of the inbound station k from an upper station point and a lower station point corresponding to the inbound station k is shown; p _k Is a demand for a car to be put into the station.

And 504, acquiring a first scheduling probability according to the vehicle operation data and the related parameter information through a formula (1), and circulating the following steps until the circulation is finished.

After the relevant parameter information is obtained, a plurality of groups of relevant parameter information can be determined according to the following cycleStation combination: initialization k is 0, l is 0, i is 0, j is 0, n is 0, P _u ＝0、P _t 0, wherein P _u Is a probability threshold, P _t A first probability threshold calculated according to the formula (1) in the step 204 under the parameters of the current cycle; for each cycle, according to the vehicle operation data and the related parameter information, a first scheduling probability P is obtained through a formula (1) _t Judging whether l is less than 1, if l is less than 1, indicating that said circulation is first circulation, making P _u ＝P _t If l is not less than 1, judging P _u Whether or not P is greater than or equal to _t If P is _u Less than P _t Then let P _u ＝P _t And reserving corresponding k and l values, wherein the reserved k and l values are a group of acquired station combinations; if P _u Greater than or equal to P _t If k is less than or equal to N, further determining if l is less than or equal to M, and if l is less than or equal to M, making l +1 obtain the first scheduling probability P again through the formula (1) _t And looping, if l is greater than M, making l equal to 0, k equal to k +1 to obtain the first scheduling probability P again through the formula (1) _t Circulating; if k is greater than N, the current cycle is ended. Through the circulation process, multiple reserved groups of k and l values can be obtained, and the multiple groups of k and l values correspond to multiple groups of station combinations.

And 505, acquiring a second scheduling probability through a formula (1) according to the vehicle operation data and the related parameter information, and circulating the following steps until the circulation is finished.

Next, for any set of reserved k and l values, the corresponding sets of vehicles and empty slots for the set of station combinations may be determined according to the following cycle: let i equal i +1, in which case P _t The second probability threshold is calculated according to the formula (1) under the parameters of the current cycle; for each cycle, according to the vehicle running data and the related parameter information, a second scheduling probability P is obtained through a formula (1) _t Judgment of P _u Whether or not P is greater than or equal to _t If P is _u Is less than P _t Then let P _u ＝P _t And reserving corresponding i and j values, wherein the reserved i and j values are a group of acquired vehicles and empty parking spaces(ii) a If P _u Greater than or equal to P _t If j is less than or equal to O, making j equal to j +1 to obtain the second scheduling probability P again through the formula (1) _t And looping, if j is larger than O, enabling j to be 0, and i to be i +1 to obtain the second scheduling probability P again through the formula (1) _t Circulating; if I is larger than I, the current cycle is ended. Through the circulation process, multiple groups of reserved i and j values can be obtained, and the multiple groups of i and j values are multiple groups of vehicles and empty parking spaces corresponding to the group of station combinations. It can be understood that through the above-mentioned cyclic process, a plurality of sets of vehicles and empty parking spaces corresponding to any one set of station combination can be obtained.

Therefore, according to the corresponding k, l, j, i values obtained in the process, a plurality of groups of corresponding outbound stations, vehicles, inbound stations and empty parking spaces are obtained.

And 506, according to the reserved corresponding k, l, j, i values, arranging the formation scheduling instructions according to the path planning.

507, dispatching instructions are issued to corresponding vehicles according to the formation dispatching instruction arrangement, so that the vehicles of the appointed outbound station can drive to the empty parking spaces of the corresponding inbound station according to the cruising of the dispatching instructions.

Optionally, the queuing scheduling process can refer to the content of step 206, which is not described herein.

According to the vehicle scheduling method provided by the embodiment of the application, the scheduling probabilities under different parameters are continuously acquired through the two circulation processes, and the probability threshold value is continuously corrected according to the scheduling probabilities acquired in the circulation processes, so that the circulation result balances the relation among the vehicles, the empty parking spaces, the scheduling time and the vehicle using requirements, the number of the vehicles in each station is matched with the number of the vehicle using requirements, the quick response of the vehicle using requirements is further ensured, and the vehicle using experience is improved. Because the automatic dispatching of the vehicles of all stations is realized, compared with manual vehicle dispatching, the dispatching efficiency of the vehicle dispatching is improved. In addition, by the vehicle scheduling method, the vehicles in each station can be scheduled in real time according to the changed vehicle operation data along with the change of the vehicle operation data.

Referring to fig. 6, an embodiment of the present application provides a vehicle dispatching device, including:

the first obtaining module 601 is configured to obtain vehicle operation information, where the vehicle operation information includes information of multiple stations, a vehicle demand corresponding to each station, and vehicle information and empty space information included in each station;

the first determining module 602 is configured to determine an inbound station where a vehicle is to be called in and an outbound station where the vehicle is to be called out from a plurality of stations based on a vehicle demand corresponding to each station and vehicle information included in each station;

a second obtaining module 603, configured to obtain, according to information of the multiple stations, vehicle information and empty space information included in each station, a scheduling time for any vehicle in any outbound station to schedule to any empty space in any inbound station;

a second determining module 604, configured to determine multiple sets of station combinations according to the scheduling time and the vehicle demand corresponding to the inbound station, where any one set of station combination includes an outbound station and an inbound station;

a third determining module 605, configured to determine, for any one group of station combinations, multiple groups of vehicles and empty slots corresponding to any one group of station combinations according to the scheduling time and the vehicle usage demand corresponding to the inbound station in any one group of station combinations;

and the scheduling module 606 is configured to schedule the vehicle to be dispatched corresponding to each outbound station to an empty parking space corresponding to the corresponding inbound station according to the plurality of groups of vehicles and empty parking spaces corresponding to each group of station combination.

In a possible implementation manner, the second determining module 604 is configured to obtain a first scheduling probability corresponding to any inbound station and any outbound station according to the scheduling time and the vehicle utilization requirement corresponding to the inbound station; a plurality of sets of station combinations are determined based on the first scheduling probabilities corresponding to any of the inbound stations and any of the outbound stations.

In one possible embodiment, each station comprises a corresponding boarding and disembarking station point; the scheduling time corresponding to any empty parking space scheduled to any inbound station by any vehicle in any outbound station comprises: the system comprises a first time when any vehicle is driven to an upper station and a lower station corresponding to any outbound station from any outbound station, a second time when any vehicle is driven to an upper station and a lower station corresponding to any inbound station from the upper station and the lower station corresponding to the outbound station, and a third time when any vehicle is driven to any inbound station from the upper station and the lower station corresponding to any inbound station.

In one possible embodiment, the second determining module 604 is configured to calculate the first scheduling probability for every two stations according to the following formula,

In a possible implementation, the second determining module 604 is configured to initialize a probability threshold; sequentially circulating each first scheduling probability in the first scheduling probabilities corresponding to any inbound station and any outbound station, and replacing the probability threshold with the first scheduling probability when the first scheduling probability is smaller than the probability threshold; when the first scheduling probability is not smaller than the probability threshold, reserving the inbound station and the outbound station corresponding to the first scheduling probability; and acquiring a plurality of sets of station combinations according to the reserved inbound stations and outbound stations.

In a possible implementation manner, the third determining module 605 is configured to obtain a second scheduling probability corresponding to any vehicle and any empty space according to the scheduling time and the vehicle demand corresponding to the inbound station in any group of station combinations; and determining a plurality of groups of vehicles and empty parking spaces corresponding to any group of station combinations based on the second scheduling probability corresponding to any vehicle and any empty parking space.

In a possible implementation manner, the scheduling module 606 is configured to determine a plurality of outbound vehicles to be dispatched according to a plurality of sets of vehicles and empty parking spaces corresponding to each set of station combination; and forming a plurality of outbound vehicles based on path planning of the outbound vehicles from the corresponding outbound stations to the inbound stations respectively, and controlling the plurality of outbound vehicles to form a plurality of empty parking spaces corresponding to the corresponding inbound stations according to a forming result.

It should be understood that, when the apparatus provided in the foregoing embodiment implements the functions thereof, the foregoing division of the functional modules is merely illustrated, and in practical applications, the above functions may be distributed by different functional modules according to needs, that is, the internal structure of the apparatus is divided into different functional modules to implement all or part of the functions described above. In addition, the apparatus and method embodiments provided by the above embodiments belong to the same concept, and specific implementation processes thereof are described in the method embodiments for details, which are not described herein again.

The vehicle scheduling device provided by the embodiment of the application realizes automatic scheduling of vehicles of all stations, and improves scheduling efficiency of vehicle scheduling compared with manual vehicle scheduling. The scheduling result is determined according to the scheduling time and the vehicle using requirements, and the scheduling time is obtained according to the vehicle information and the empty parking space information included in each station, so that the obtained scheduling result balances the relationship among the vehicles, the empty parking spaces, the scheduling time and the vehicle using requirements, the number of the vehicles in each station is adapted to the number of the vehicle using requirements, the quick response of the vehicle using requests is further ensured, and the vehicle using experience is improved.

Referring to fig. 7, a schematic structural diagram of a computer device according to an embodiment of the present application is shown. The computer device may be a terminal, and may be, for example: smart phones, tablet computers, vehicle-mounted terminals, notebook computers or desktop computers. A terminal may also be referred to by other names such as user equipment, portable terminal, laptop terminal, desktop terminal, etc.

Generally, a terminal includes: a processor 701 and a memory 702.

The processor 701 may include one or more processing cores, such as a 4-core processor, an 8-core processor, and so on. The processor 701 may be implemented in at least one hardware form of a DSP (Digital Signal Processing), an FPGA (Field-Programmable Gate Array), and a PLA (Programmable Logic Array). The processor 701 may also include a main processor and a coprocessor, where the main processor is a processor for Processing data in an awake state, and is also called a Central Processing Unit (CPU); a coprocessor is a low power processor for processing data in a standby state. In some embodiments, the processor 701 may be integrated with a GPU (Graphics Processing Unit) which is responsible for rendering and drawing the content required to be displayed by the display screen. In some embodiments, the processor 701 may further include an AI (Artificial Intelligence) processor for processing computing operations related to machine learning.

Memory 702 may include one or more computer-readable storage media, which may be non-transitory. Memory 702 may also include high-speed random access memory, as well as non-volatile memory, such as one or more magnetic disk storage devices, flash memory storage devices. In some embodiments, a non-transitory computer readable storage medium in memory 702 is used to store at least one instruction for execution by processor 701 to implement a vehicle dispatch method provided by method embodiments herein.

In some embodiments, the terminal may further include: a peripheral interface 703 and at least one peripheral. The processor 701, the memory 702, and the peripheral interface 703 may be connected by buses or signal lines. Various peripheral devices may be connected to peripheral interface 703 via a bus, signal line, or circuit board. Specifically, the peripheral device includes: at least one of a radio frequency circuit 704, a display screen 705, a camera assembly 706, an audio circuit 707, a positioning assembly 708, and a power source 709.

The peripheral interface 703 may be used to connect at least one peripheral device related to I/O (Input/Output) to the processor 701 and the memory 702. In some embodiments, processor 701, memory 702, and peripheral interface 703 are integrated on the same chip or circuit board; in some other embodiments, any one or two of the processor 701, the memory 702, and the peripheral interface 703 may be implemented on a separate chip or circuit board, which is not limited in this embodiment.

The Radio Frequency circuit 704 is used for receiving and transmitting RF (Radio Frequency) signals, also called electromagnetic signals. The radio frequency circuitry 704 communicates with communication networks and other communication devices via electromagnetic signals. The rf circuit 704 converts an electrical signal into an electromagnetic signal to transmit, or converts a received electromagnetic signal into an electrical signal. Optionally, the radio frequency circuit 704 includes: an antenna system, an RF transceiver, one or more amplifiers, a tuner, an oscillator, a digital signal processor, a codec chipset, a subscriber identity module card, and so forth. The radio frequency circuitry 704 may communicate with other terminals via at least one wireless communication protocol. The wireless communication protocols include, but are not limited to: metropolitan area networks, various generation mobile communication networks (2G, 3G, 4G, and 5G), Wireless local area networks, and/or Wireless Fidelity (WiFi) networks. In some embodiments, the radio frequency circuit 704 may further include NFC (Near Field Communication) related circuits, which are not limited in this application.

The display screen 705 is used to display a UI (User Interface). The UI may include graphics, text, icons, video, and any combination thereof. When the display screen 705 is a touch display screen, the display screen 705 also has the ability to capture touch signals on or over the surface of the display screen 705. The touch signal may be input to the processor 701 as a control signal for processing. At this point, the display 705 may also be used to provide virtual buttons and/or a virtual keyboard, also referred to as soft buttons and/or a soft keyboard. In some embodiments, the display 705 may be one, disposed on a front panel of the terminal; in other embodiments, the display 705 may be at least two, respectively disposed on different surfaces of the terminal or in a folded design; in still other embodiments, the display 705 may be a flexible display disposed on a curved surface or a folded surface of the terminal. Even more, the display 705 may be arranged in a non-rectangular irregular pattern, i.e., a shaped screen. The Display 705 may be made of LCD (Liquid Crystal Display), OLED (Organic Light-Emitting Diode), or other materials.

The camera assembly 706 is used to capture images or video. Optionally, camera assembly 706 includes a front camera and a rear camera. Generally, a front camera is disposed at a front panel of the terminal, and a rear camera is disposed at a rear surface of the terminal. In some embodiments, the number of the rear cameras is at least two, and each rear camera is any one of a main camera, a depth-of-field camera, a wide-angle camera and a telephoto camera, so that the main camera and the depth-of-field camera are fused to realize a background blurring function, and the main camera and the wide-angle camera are fused to realize panoramic shooting and VR (Virtual Reality) shooting functions or other fusion shooting functions. In some embodiments, camera assembly 706 may also include a flash. The flash lamp can be a monochrome temperature flash lamp or a bicolor temperature flash lamp. The double-color-temperature flash lamp is a combination of a warm-light flash lamp and a cold-light flash lamp, and can be used for light compensation at different color temperatures.

The audio circuitry 707 may include a microphone and a speaker. The microphone is used for collecting sound waves of a user and the environment, converting the sound waves into electric signals, and inputting the electric signals to the processor 701 for processing or inputting the electric signals to the radio frequency circuit 704 to realize voice communication. For the purpose of stereo sound collection or noise reduction, a plurality of microphones may be respectively disposed at different portions of the terminal. The microphone may also be an array microphone or an omni-directional pick-up microphone. The speaker is used to convert electrical signals from the processor 701 or the radio frequency circuit 704 into sound waves. The loudspeaker can be a traditional film loudspeaker and can also be a piezoelectric ceramic loudspeaker. When the speaker is a piezoelectric ceramic speaker, the speaker can be used for purposes such as converting an electric signal into a sound wave audible to a human being, or converting an electric signal into a sound wave inaudible to a human being to measure a distance. In some embodiments, the audio circuitry 707 can also include a headphone jack.

The positioning component 708 is used to locate the current geographic Location of the terminal to implement navigation or LBS (Location Based Service). The Positioning component 708 can be a Positioning component based on the GPS (Global Positioning System) in the united states, the beidou System in china, the graves System in russia, or the galileo System in the european union.

The power supply 709 is used to supply power to various components in the terminal. The power source 709 may be alternating current, direct current, disposable batteries, or rechargeable batteries. When power source 709 includes a rechargeable battery, the rechargeable battery may support wired or wireless charging. The rechargeable battery may also be used to support fast charge technology.

In some embodiments, the terminal also includes one or more sensors 710. The one or more sensors 710 include, but are not limited to: acceleration sensor 711, gyro sensor 712, pressure sensor 713, fingerprint sensor 714, optical sensor 715, and proximity sensor 716.

The acceleration sensor 711 can detect the magnitude of acceleration on three coordinate axes of a coordinate system established with the terminal. For example, the acceleration sensor 711 may be used to detect components of the gravitational acceleration in three coordinate axes. The processor 701 may control the display screen 705 to display the user interface in a landscape view or a portrait view according to the gravitational acceleration signal collected by the acceleration sensor 711. The acceleration sensor 711 may also be used for acquisition of motion data of a game or a user.

The gyro sensor 712 may detect a body direction and a rotation angle of the terminal, and the gyro sensor 712 may cooperate with the acceleration sensor 711 to acquire a 3D motion of the user with respect to the terminal. From the data collected by the gyro sensor 712, the processor 701 may implement the following functions: motion sensing (such as changing the UI according to a user's tilting operation), image stabilization at the time of photographing, game control, and inertial navigation.

Pressure sensors 713 may be disposed on the side frames of the terminal and/or underneath the display 705. When the pressure sensor 713 is arranged on the side frame of the terminal, a holding signal of a user to the terminal can be detected, and the processor 701 performs left-right hand identification or shortcut operation according to the holding signal collected by the pressure sensor 713. When the pressure sensor 713 is disposed at a lower layer of the display screen 705, the processor 701 controls the operability control on the UI interface according to the pressure operation of the user on the display screen 705. The operability control comprises at least one of a button control, a scroll bar control, an icon control, and a menu control.

The fingerprint sensor 714 is used for collecting a fingerprint of a user, and the processor 701 identifies the identity of the user according to the fingerprint collected by the fingerprint sensor 714, or the fingerprint sensor 714 identifies the identity of the user according to the collected fingerprint. When the user identity is identified as a trusted identity, the processor 701 authorizes the user to perform relevant sensitive operations, including unlocking a screen, viewing encrypted information, downloading software, paying, changing settings, and the like. The fingerprint sensor 714 may be disposed on the front, back, or side of the terminal. When a physical button or vendor Logo is provided on the terminal, the fingerprint sensor 714 may be integrated with the physical button or vendor Logo.

The optical sensor 715 is used to collect the ambient light intensity. In one embodiment, the processor 701 may control the display brightness of the display screen 705 based on the ambient light intensity collected by the optical sensor 715. Specifically, when the ambient light intensity is high, the display brightness of the display screen 705 is increased; when the ambient light intensity is low, the display brightness of the display screen 705 is adjusted down. In another embodiment, processor 701 may also dynamically adjust the shooting parameters of camera assembly 706 based on the ambient light intensity collected by optical sensor 715.

A proximity sensor 716, also known as a distance sensor, is typically provided on the front panel of the terminal. The proximity sensor 716 is used to collect the distance between the user and the front face of the terminal. In one embodiment, when the proximity sensor 716 detects that the distance between the user and the front surface of the terminal gradually decreases, the processor 701 controls the display screen 705 to switch from the bright screen state to the dark screen state; when the proximity sensor 716 detects that the distance between the user and the front face of the terminal is gradually increased, the processor 701 controls the display 705 to switch from the rest state to the bright state.

Those skilled in the art will appreciate that the architecture shown in FIG. 7 is not intended to be limiting of computer devices, and may include more or fewer components than those shown, or some components may be combined, or a different arrangement of components may be used.

Referring to fig. 8, fig. 8 is a schematic structural diagram of a server according to an embodiment of the present application, where the server 800 may have a relatively large difference due to different configurations or performances, and may include one or more processors 801 and one or more memories 802, where at least one program instruction is stored in the one or more memories 802, and is loaded and executed by the one or more processors 801 to implement the vehicle scheduling method provided by the foregoing method embodiments. Of course, the server 800 may also have components such as a wired or wireless network interface, a keyboard, and an input/output interface, so as to perform input and output, and the server 800 may also include other components for implementing the functions of the device, which are not described herein again.

In an exemplary embodiment, a computer device is also provided that includes a processor and a memory having at least one program code stored therein. The at least one program code is loaded into and executed by one or more processors to cause a computer device to implement any of the vehicle scheduling methods described above.

In an exemplary embodiment, a computer readable storage medium is also provided, in which at least one program code is stored, the at least one program code being loaded and executed by a processor of a computer device to cause the computer to implement any one of the vehicle scheduling methods described above.

Alternatively, the computer-readable storage medium may be a Read-Only Memory (ROM), a Random Access Memory (RAM), a Compact Disc Read-Only Memory (CD-ROM), a magnetic tape, a floppy disk, an optical data storage device, and the like.

In an exemplary embodiment, a computer program product or computer program is also provided, the computer program product or computer program comprising computer instructions stored in a computer readable storage medium. The computer instructions are read by a processor of the computer device from a computer-readable storage medium, and the computer instructions are executed by the processor to cause the computer device to perform any of the vehicle scheduling methods described above.

The terms "first," "second," "third," and "fourth," etc. in the description and claims of this application and in the accompanying drawings are used for distinguishing between different objects and not for describing a particular order. Furthermore, the terms "comprising" and "having," as well as any variations thereof, are intended to cover non-exclusive inclusions. For example, a process, method, system, article, or apparatus that comprises a list of steps or elements is not limited to only those steps or elements listed, but may alternatively include other steps or elements not listed, or inherent to such process, method, article, or apparatus.

The above description is only an example of the present application and should not be taken as limiting the present application, and any modifications, equivalents, improvements and the like that are made within the principles of the present application should be included in the scope of the present application.

Claims

1. A vehicle scheduling method, the method comprising:

according to the information of the stations, the vehicle information and the empty space information of each station, obtaining the corresponding scheduling time of any vehicle in any outbound station to schedule to any empty space in any inbound station; determining a plurality of station combinations according to the scheduling time and the vehicle using requirements corresponding to the inbound stations, wherein any station combination comprises an outbound station and an inbound station;

for any group of station combinations, determining a plurality of groups of vehicles and empty parking spaces corresponding to the any group of station combinations according to the scheduling time and the vehicle using requirements corresponding to the inbound stations in the any group of station combinations;

2. The method of claim 1, wherein determining a plurality of set of yard combinations based on the scheduled time and the corresponding demand for cars at the inbound yard comprises:

determining a plurality of sets of station combinations based on the first scheduling probabilities corresponding to the any inbound station and the any outbound station.

3. The method of claim 2, wherein each station includes a corresponding upper and lower stop point; the scheduling time corresponding to any empty parking space scheduled to any one inbound station by any one vehicle in any one outbound station comprises: the first time when any vehicle is driven to the getting-on and getting-off station corresponding to any outbound station from any outbound station, the second time when any vehicle is driven to the getting-on and getting-off station corresponding to any inbound station from the getting-on and getting-off station corresponding to the outbound station, and the third time when any vehicle is driven to any inbound station from the getting-on and getting-off station corresponding to any inbound station.

4. The method of claim 3, wherein obtaining a first scheduling probability for any inbound station and any outbound station based on the scheduled time and the demand for the vehicle corresponding to the inbound station comprises: calculating the first scheduling probability corresponding to every arbitrary two stations according to the following formula,

5. The method of claim 2, wherein determining a plurality of sets of station combinations based on the first scheduling probabilities corresponding to the any inbound station and any outbound station comprises:

initializing a probability threshold;

sequentially circulating each first scheduling probability in first scheduling probabilities corresponding to any inbound station and any outbound station, and replacing the probability threshold with the first scheduling probability when the first scheduling probability is smaller than the probability threshold; when the first scheduling probability is not smaller than the probability threshold, reserving the inbound station and the outbound station corresponding to the first scheduling probability;

6. The method of claim 1, wherein determining the plurality of sets of vehicles and empty spaces for the any one of the plurality of station combinations based on the scheduled time and the demand for vehicles for inbound stations of the any one of the plurality of station combinations comprises:

and determining a plurality of groups of vehicles and empty parking spaces corresponding to any group of station combinations based on the second scheduling probability corresponding to any vehicle and any empty parking space.

7. The method of claim 1, wherein the dispatching the vehicle to be dispatched corresponding to each outbound station to the empty slot corresponding to the corresponding inbound station according to the plurality of sets of vehicles and empty slots corresponding to each set of station combination comprises:

8. A vehicle dispatching device, comprising:

and the scheduling module is used for scheduling the vehicles to be dispatched corresponding to each outbound station to the empty parking spaces corresponding to the corresponding inbound stations according to the plurality of groups of vehicles and empty parking spaces corresponding to each group of station combination.

9. A computer device, characterized in that the computer device comprises a processor and a memory, wherein at least one computer program or instruction is stored in the memory, and the at least one computer program or instruction is loaded and executed by the processor to cause the computer device to implement the vehicle scheduling method according to any one of claims 1 to 7.

10. A computer-readable storage medium having at least one program code stored therein, the at least one program code being loaded and executed by a processor to cause a computer to implement the vehicle scheduling method according to any one of claims 1 to 7.