Granted Patent B2

US 12,456,378 · App. 18/393,529 · Granted Oct 28, 2025

Inventors: Olga Gnilova (Reutov, RU); Aleksandr Tsarkov (Moscow, RU); Sergey Vorontsov (Kaliningrad, RU)

G08G1/202G08G1/207

Abstract

Claims (71)

1. A computer-implemented method of assigning vehicles to taxi orders, the method being executable by a processor, the processor being communicatively accessible by the vehicles, the method comprising:

during a given order assignment iteration of a plurality of order assignment iterations, executing:

receiving, by the processor, an indication of a plurality of taxi orders in a given area;

identifying, by the processor, a set of candidate vehicles for assigning among the plurality of taxi orders,

a given candidate vehicle of the set of candidate vehicles being associated with a respective estimated time of arrival (ETA) to arrive to a respective location associated with a respective taxi order of the plurality of taxi orders;

generating, by the processor, in the set of candidate vehicles, an indication of a model candidate vehicle,

the model candidate vehicle being associated with a threshold ETA for the given taxi order;

assigning, by the processor, the set of candidate vehicles among the plurality of taxi orders such that an aggregate ETA of respective ETAs associated with each one of the set of candidate vehicles, including the model candidate vehicle, to arrive to respective locations of the respective taxi orders of the plurality of taxi orders is minimized;

in response to a given taxi order of the plurality of taxi orders being assigned to the model candidate vehicle:

suspending, by the processor, the given taxi order from being assigned to any one of the set of candidate vehicles during the given order assignment iteration;

including, by the processor, the given taxi order in a following plurality of taxi orders to be received during a next order assignment iteration,

following the given order assignment iteration of the plurality of order assignment iterations; and

in response to the given taxi order being assigned to a respective candidate vehicle of the set of candidate vehicles, which is different from the model candidate vehicle, causing, by the processor, dispatching of the respective candidate vehicle to the given taxi order.

2. The method of claim 1 , wherein prior to the generating the indication of the model candidate vehicle, the method further comprises:

for the given candidate vehicle, determining, by the processor, a respective score indicative of vehicle features associated with the given candidate vehicle;

applying, by the processor, the respective score to the respective ETA to determine a respective modified ETA for the given candidate vehicle; and wherein:

the assigning the set of candidate vehicles among the plurality of taxi orders is based on respective modified ETAs associated with each one of the set of candidate vehicles.

3. The method of claim 2 , wherein the vehicle features of the given candidate vehicle comprise at least one of: (i) a safety parameter associated with the given candidate vehicle; (ii) a number of candidate vehicles in the set of candidate vehicles; and (iii) product features of the given candidate vehicle.

4. The method of claim 3 , the safety parameter is indicative of a likelihood value of an accident involving the given candidate vehicle on a route to the respective location associated with the respective taxi order.

5. The method of claim 4 , further comprising determining, by the processor, the safety parameter associated with the given candidate vehicle based on at least one of: (i) a driver security score of a driver of the given candidate vehicle; and (ii) route security score associated with the route to the respective location associated with the respective taxi order.

6. The method of claim 5 , further comprising determining the driver security score based at least on one of: (i) driver-specific features of the driver; (ii) a driving experience of the driver; (iii) a driving style of the driver; (iv) a number of past accidents of the driver; and (v) a traffic rule compliance rate associated with the driver.

7. The method of claim 3 , wherein the product features of the given candidate vehicle comprise at least one of: a brand and a model of the given candidate vehicle; an issue year of the given candidate vehicle; a volume of a trunk of the given candidate vehicle; and a presence of a child seat in the given candidate vehicle.

8. The method of claim 1 , wherein further to the including the given taxi order in the following plurality of taxi orders, the method comprises increasing, by the processor, the threshold ETA for the given taxi order for the next order assignment iteration.

9. The method of claim 8 , wherein the increasing the threshold ETA comprises increasing the threshold ETA such that the greater a buffer time period until the including the given taxi order in the following plurality of taxi orders is, the greater the threshold ETA for the given taxi order for the next order assignment iteration is.

10. The method of claim 9 , wherein the increasing the threshold ETA comprises increasing the threshold ETA exponentially with respect to the buffer time period.

11. The method of claim 10 , wherein the increasing the threshold ETA is executed in accordance with an equation:

thershold

⁢

ETA

=

d

+

a

·

e

b

+

c

·

buffer

⁢

period

⁢

time

,

where d is an initial value of the threshold ETA prior to the increasing;

buffer period time is the buffer period time until the including the given taxi order in the following plurality of taxi orders; and

a, b, and c are constant coefficients.

12. The method of claim 1 , further comprising determining, by the processor, the threshold ETA based on at least one of: environmental conditions in the given area; and respective ETAs of each one of the set of the candidate vehicles.

13. The method of claim 12 , wherein, prior to the increasing the threshold ETA for the given taxi order, the threshold ETA is the same for each one of the plurality of taxi orders in the given area.

14. The method of claim 13 , wherein the threshold ETA is different for taxi orders in an other area, geographically different from the given area.

15. The method of claim 13 , wherein the threshold ETA for geographically different areas is the same.

16. A server for assigning vehicles to taxi orders, the server including a processor and a non-transitory computer-readable memory storing instructions; and the processor, upon executing the instructions, being configured to:

during a given order assignment iteration of a plurality of order assignment iterations, execute:

receiving an indication of a plurality of taxi orders in a given area;

identifying a set of candidate vehicles for assigning among the plurality of taxi orders,

a given candidate vehicle of the set of candidate vehicles being associated with a respective estimated time of arrival (ETA) to arrive to a respective location associated with a respective taxi order of the plurality of taxi orders;

generating, in the set of candidate vehicles, an indication of a model candidate vehicle,

the model candidate vehicle being associated with a threshold ETA for the given taxi order;

assigning the set of candidate vehicles among the plurality of taxi orders such that an aggregate ETA of respective ETAs associated with each one of the set of candidate vehicles, including the model candidate vehicle, to arrive to respective locations of the respective taxi orders of the plurality of taxi orders is minimized;

in response to a given taxi order of the plurality of taxi orders being assigned to the model candidate vehicle:

suspending the given taxi order from being assigned to any one of the set of candidate vehicles during the given order assignment iteration;

including the given taxi order in a following plurality of taxi orders to be received during a next order assignment iteration, following the given order assignment iteration of the plurality of order assignment iterations; and

in response to the given taxi order being assigned to a respective candidate vehicle of the set of candidate vehicles, which is different from the model candidate vehicle, causing dispatching the respective candidate vehicle to the given taxi order.

17. The server of claim 16 , wherein the processor, prior to the generating the indication of the model candidate vehicle, is further configured to:

for the given candidate vehicle, determine a respective score indicative of vehicle features associated with the given candidate vehicle;

apply the respective score to the respective ETA to determine a respective modified ETA for the given candidate vehicle; and wherein:

the assigning the set of candidate vehicles among the plurality of taxi orders is based on respective modified ETAs associated with each one of the set of candidate vehicles.

18. The server of claim 16 , wherein further to the including the given taxi order in the following plurality of taxi orders, the processor is configured to increase the threshold ETA for the given taxi order for the next order assignment iteration.

19. The server of claim 18 , wherein the processor is configured to increase the threshold ETA such that the greater a buffer time period until the including the given taxi order in the following plurality of taxi orders is, the greater the threshold ETA for the given taxi order for the next order assignment iteration is.

20. The server of claim 19 , wherein the processor is configured to increase the threshold ETA exponentially with respect to the buffer time period.

Assignments (1)

Priority Claims (1)

Continuity (1)

References Cited (50)