CPC B60L 53/35 (2019.02) [B60L 53/305 (2019.02); B60L 53/53 (2019.02); B60L 53/62 (2019.02); B60L 53/63 (2019.02); B60L 53/66 (2019.02); B60L 53/665 (2019.02); B60L 53/68 (2019.02); B60L 58/12 (2019.02); B60L 58/18 (2019.02); G05D 1/0088 (2013.01); G05D 1/028 (2013.01); G05D 1/0278 (2013.01); G06Q 10/047 (2013.01); G06Q 10/06316 (2013.01); G08G 1/096838 (2013.01); G08G 1/096844 (2013.01); G08G 1/096883 (2013.01); G08G 1/137 (2013.01); B60K 6/28 (2013.01); B60Y 2200/91 (2013.01); B60Y 2200/92 (2013.01); B60Y 2300/91 (2013.01); G06Q 50/06 (2013.01)] | 14 Claims |
1. A computer-implemented method, the method being implemented via one or more processors associated with an autonomous recharging vehicle (ARV), the method comprising:
forming, by the one or more associated processors, a list comprising a plurality of electric vehicles waiting in queue for charging by the ARV based upon a plurality of electronic requests that are wirelessly received from the electric vehicles;
performing, by the one or more associated processors, an optimization algorithm to:
rearrange an order of the electric vehicles on the list based upon a state of charge (SOC) remaining in the each of the electric vehicles and current route and location of the electric vehicles and the ARV, and
determine whether the ARV needs to be recharged between charging the electric vehicles on the list and an amount of time needed to finish recharging the ARV for the ARV to reach a sufficient SOC to resume charging the electric vehicles on the list;
scheduling, via the one or more associated processors, a plurality of rendezvous points for the ARV to recharge the electric vehicles based upon the rearranged order of the electric vehicles on the list, the determining of whether the ARV needs to be recharged, and the amount of time needed to finish recharging the ARV; and
automatically routing the ARV to the rendezvous points based upon the scheduling.
|