Power allocation to transports
An example operation includes one or more of determining, by a station, a first group of transports in need of charge and a second group of transports capable of providing charge, prioritizing, by the station, at least one transport of the second group to come to the station at a time prior to when at least one transport of the first group comes to the station, receiving, at the station, a first amount of charge from the at least one transport of the second group, and providing, from the station, a second amount of charge to the at least one transport of the first group.
1. A method comprising:
receiving a request from a first transport for a first amount of energy from a charging station;
determining an assignment priority of a plurality of other transports to provide energy to the charging station based on respective destinations of the plurality of other transports and respective charge levels of the plurality of other transports;
assigning a charging time to at least one other transport among the plurality of other transports based on the assignment priority;
receiving a second amount of energy from the at least one other transport, wherein the second amount of energy enables the charging station to remain energy-positive when providing the first amount of energy to the first transport;
providing energy to the first transport; and
terminating the energy provided to the first transport before the charging station becomes energy-negative.
2. The method of claim 1 , wherein the first amount of energy is less than or equal to the second amount of energy.
3. The method of claim 1 , comprising:
determining a current amount of energy stored by the charging station at a current time; and
based on the current amount of energy, determining a future time that the at least one other transport will come to the charging station, the first amount of energy required by the first transport, and the second amount of energy available from the at least one other transport.
4. The method of claim 1 , comprising:
determining the first amount of energy charge required by the first transport; and
selecting the at least one other transport to come to the charging station based on a charge value required being less than a sum of a current amount of energy at the charging station and the second amount of energy.
5. The method of claim 1 , comprising:
determining an amount of energy available from the at least one other transport, and a time required to provide the amount of energy that is available to the charging station based on a location of the at least one other transport and a current amount of energy at the charging station; and
transmitting a request to the at least one other transport to come to the charging station at a time after the first transport arrives at the charging station.
6. The method of claim 1 , comprising:
receiving a validation of the first amount of energy from at least one component, wherein the validation comprises a blockchain consensus between a peer group comprising of the first transport and the at least one component.
7. The method of claim 6 , comprising:
executing a smart contract to record the validation and the at least one component on a blockchain based on the blockchain consensus.
8. The method of claim 1 , further comprising receiving a request for an additional amount of energy from the charging station, determining that the additional amount of energy will result in the charging station becoming energy-negative, and in response, preventing the request.
9. The method of claim 1 , further comprising receiving a request for an additional amount of energy from the charging station, determining that the additional amount of energy will result in the charging station becoming energy-negative by a particular amount, and in response, requesting at least one other transport provide the particular amount of charge to the charging station.
10. A charging station comprising:
a processor that, when executing instructions stored in a memory, is configured to:
receive a request from a first transport for a first amount of energy from the charging station;
determine an assignment priority of a plurality of other transports to provide energy to the charging station based on respective destinations of the plurality of other transports and respective charge levels of the plurality of other transports;
assign a charging time to at least one other transport among the plurality of other transports based on the assignment priority;
receive a second amount of energy from the at least one other transport, wherein the second amount of energy enables the charging station to remain energy-positive when providing the first amount of energy to the first transport;
provide energy to the first transport; and
terminate the energy provided to the first transport before the charging station becomes energy-negative.
11. A non-transitory computer-readable medium comprising instructions that, when executed by a processor, cause the processor to perform:
receiving a request from a first transport for a first amount of energy from a charging station;
determining an assignment priority of a plurality of other transports to provide energy to the charging station based on based on respective destinations of the plurality of other transports and respective charge levels of the plurality of other transports;
assigning a charging time to at least one other transport among the plurality of other transports based on the assignment priority;
receiving a second amount of energy from the at least one other transport, wherein the second amount of energy enables the charging station to remain energy-positive when providing the first amount of energy to the first transport;
providing energy to the first transport; and
terminating the energy provided to the first transport before the charging station becomes energy-negative.
12. The charging station of claim 10 , wherein the processor is further configured to:
determine a current amount of energy stored by the charging station at a current time; and
determine a future time that the at least one other transport will come to the charging station, the first amount of energy required by the first transport, and the second amount of energy available from the at least one other transport.
13. The charging station of claim 10 , wherein the processor is further configured to:
determine the first amount of energy required by the first transport, and
the second amount of energy available from the at least one other transport; and
select the at least one other transport to come to the charging station based on a charge value required being less than a sum of a current amount of energy at the charging station and the second amount of energy.
14. The charging station of claim 10 , wherein the processor is further configured to:
determine an amount of energy available from the at least one other transport, and a time required to provide the amount of energy that is available to the charging station based on a location of the at least one other transport and a current amount of energy at the charging station; and
transmit a request to the at least one other transport to come to the charging station at a time after the first transport arrives at the charging station.
15. The charging station of claim 10 , wherein the processor is configured to:
receive a validation of the first amount of energy from at least one component, wherein the validation comprises a blockchain consensus between a peer group comprising of the first transport and the at least one component.
16. The charging station of claim 10 , wherein the processor is configured to:
execute a smart contract to record the validation and the at least one component on a blockchain based on the blockchain consensus.
17. The non-transitory computer-readable storage medium of claim 11 , wherein the instructions further cause the processor to perform:
determining a current amount of energy stored by the charging station at a current time; and
based on the current amount of energy, determining a future time that the at least one other transport will come to the charging station, the first amount of energy required by the first transport, and the second amount of energy available from the at least one other transport.
18. The non-transitory computer-readable storage medium of claim 11 , wherein the instructions further cause the processor to perform:
determining the first amount of energy charge required by the first transport; and
selecting the at least one other transport to come to the charging station based on a charge value required being less than a sum of a current amount of energy at the charging station and the second amount of energy.
19. The non-transitory computer-readable storage medium of claim 11 , wherein the instructions further cause the processor to perform:
determining an amount of energy available from the at least one other transport, and a time required to provide the amount of energy that is available to the charging station based on a location of the at least one other transport and a current amount of energy at the charging station; and
transmitting a request to the second transport to come to the charging station at a time after the first transport arrives at the charging station.
20. The non-transitory computer-readable storage medium of claim 11 , wherein the instructions further cause the processor to perform:
by the charging station, receiving a validation of the first amount of energy from at least one component, wherein the validation comprises a blockchain consensus between a peer group comprising of the first transport and the at least one component.