Platform for vehicle cooperation and coordination of services

1. A method for coordinating between a plurality of vehicles connected to one or more networks, the method comprising:

obtaining, for each of the plurality of vehicles over the one or more networks, respective sets of state parameters describing respective states of the plurality of vehicles;

maintaining, for controllers of each of the plurality of vehicles, respective karma scores indicating measures of historical compliance with respective coordination policies for controlling sharing of network resources of the one or more networks between the plurality of vehicles, wherein the respective coordination policies include a policy for planning a route of a vehicle based on availabilities of the network resources in different geographic areas;

identifying a plurality of cells associated with the different geographic areas;

updating, based on the respective sets of state parameters and the respective karma scores for controllers of the plurality of vehicles that are within a same cell of the plurality of cells, the respective coordination policies for the plurality of vehicles;

dispatching the respective coordination policies to the controllers of the plurality of vehicles;

obtaining feedback from the plurality of vehicles indicating respective current compliances with their respective coordination policies; and

updating the respective karma scores based on the feedback.

2. The method of claim 1 , wherein updating the respective coordination policies comprises solving a game-theoretical problem to allocate the network resources in a manner that maximizes an optimization criterion.

3. The method of claim 1 , wherein the respective coordination policies include a policy for a first vehicle to forward communications between a second vehicle and a network device.

4. A method for coordinating between a plurality of vehicles connected to one or more networks, the method comprising:

obtaining, for each of the plurality of vehicles over the one or more networks, respective sets of state parameters describing respective states of the plurality of vehicles;

maintaining, for controllers of each of the plurality of vehicles, respective karma scores indicating measures of historical compliance with respective coordination policies for controlling sharing of network resources of the one or more networks between the plurality of vehicles;

updating, based on the respective sets of state parameters and the respective karma scores, the respective coordination policies for the plurality of vehicles, wherein updating the respective coordination policies comprises:

determining, based on the state parameters, respective availabilities of the network resources by the plurality of vehicles;

distributing resource availability messages to the controllers of the plurality of vehicles indicating the respective availabilities of the network resources;

obtaining in response to the resource availability messages, bids from the controllers of the plurality of vehicles for the network resources; and

updating the coordination policies based on the bids;

dispatching the respective coordination policies to the controllers of the plurality of vehicles;

obtaining feedback from the plurality of vehicles indicating respective current compliances with their respective coordination policies; and

updating the respective karma scores based on the feedback.

5. The method of claim 4 , wherein the respective coordination policies include a policy for planning a route of a vehicle based on availabilities of the network resources in different geographic areas.

6. The method of claim 4 , wherein the respective coordination policies include a policy for a first vehicle to forward communications between a second vehicle and a network device.

7. A method for coordinating between a plurality of vehicles connected to one or more networks, the method comprising:

obtaining, for each of the plurality of vehicles over the one or more networks, respective sets of state parameters describing respective states of the plurality of vehicles;

maintaining, for controllers of each of the plurality of vehicles, respective karma scores indicating measures of historical compliance with respective coordination policies for controlling sharing of network resources of the one or more networks between the plurality of vehicles;

dividing a geographic area into a plurality of cells;

updating the respective coordination policies based on the respective sets of state parameters and the karma scores for controllers of the plurality of vehicles that are within a same cell of the plurality of cells;

dispatching the respective coordination policies to the controllers of the plurality of vehicles;

obtaining feedback from the plurality of vehicles indicating respective current compliances with their respective coordination policies; and

updating the respective karma scores based on the feedback.

8. The method of claim 7 , wherein dividing the geographic area into the plurality of cells comprises:

dynamically updating sizes of the plurality of cells based on monitored activity of the plurality of vehicles within the geographic area.

9. The method of claim 7 , wherein updating the respective coordination policies comprises solving a game-theoretical problem to allocate the network resources in a manner that maximizes an optimization criterion.

10. The method of claim 7 , wherein the respective coordination policies include a policy for a first vehicle to forward communications between a second vehicle and a network device.

11. A non-transitory computer-readable storage medium storing instructions for coordinating between a plurality of vehicles connected to one or more networks, the instructions when executed by a processor causing the processor to perform steps including:

obtaining, for each of the plurality of vehicles over the one or more networks, respective sets of state parameters describing respective states of the plurality of vehicles;

maintaining, for controllers of each of the plurality of vehicles, respective karma scores indicating measures of historical compliance with respective coordination policies for controlling sharing of network resources of the one or more networks between the plurality of vehicles, wherein the respective coordination policies include a policy for planning a route of a vehicle based on availabilities of the network resources in different geographic areas;

identifying a plurality of cells associated with the different geographic areas;

updating, based on the respective sets of state parameters and the respective karma scores for controllers of the plurality of vehicles that are within a same cell of the plurality of cells, the respective coordination policies for the plurality of vehicles;

dispatching the respective coordination policies to the controllers of the plurality of vehicles;

obtaining feedback from the plurality of vehicles indicating respective current compliances with their respective coordination policies; and

updating the respective karma scores based on the feedback.

12. The non-transitory computer-readable storage medium of claim 11 , wherein updating the respective coordination policies comprises solving a game-theoretical problem to allocate the network resources in a manner that maximizes an optimization criterion.

13. The non-transitory computer-readable storage medium of claim 11 , wherein the respective coordination policies include a policy for a first vehicle to forward communications between a second vehicle and a network device.

14. A non-transitory computer-readable storage medium storing instructions for coordinating between a plurality of vehicles connected to one or more networks, the instructions when executed by a processor causing the processor to perform steps including:

obtaining, for each of the plurality of vehicles over the one or more networks, respective sets of state parameters describing respective states of the plurality of vehicles;

maintaining, for controllers of each of the plurality of vehicles, respective karma scores indicating measures of historical compliance with respective coordination policies for controlling sharing of network resources of the one or more networks between the plurality of vehicles';

updating, based on the respective sets of state parameters and the respective karma scores, the respective coordination policies for the plurality of vehicles, wherein updating the respective coordination policies comprises:

determining, based on the state parameters, respective availabilities of the network resources by the plurality of vehicles;

distributing resource availability messages to the controllers of the plurality of vehicles indicating the respective availabilities of the network resources;

obtaining in response to the resource availability messages, bids from the controllers of the plurality of vehicles for the network resources; and

updating the coordination policies based on the bids;

dispatching the respective coordination policies to the controllers of the plurality of vehicles;

obtaining feedback from the plurality of vehicles indicating respective current compliances with their respective coordination policies; and

updating the respective karma scores based on the feedback.

15. The non-transitory computer-readable storage medium of claim 14 , wherein the respective coordination policies include a policy for planning a route of a vehicle based on availabilities of the network resources in different geographic areas.

16. The non-transitory computer-readable storage medium of claim 14 , wherein the respective coordination policies include a policy for a first vehicle to forward communications between a second vehicle and a network device.

17. A non-transitory computer-readable storage medium storing instructions for coordinating between a plurality of vehicles connected to one or more networks, the instructions when executed by a processor causing the processor to perform steps including:

obtaining, for each of the plurality of vehicles over the one or more networks, respective sets of state parameters describing respective states of the plurality of vehicles;

maintaining, for controllers of each of the plurality of vehicles, respective karma scores indicating measures of historical compliance with respective coordination policies for controlling sharing of network resources of the one or more networks between the plurality of vehicles;

dividing a geographic area into a plurality of cells;

updating the respective coordination policies based on the respective sets of state parameters and the karma scores for controllers of the plurality of vehicles that are within a same cell of the plurality of cells;

dispatching the respective coordination policies to the controllers of the plurality of vehicles;

obtaining feedback from the plurality of vehicles indicating respective current compliances with their respective coordination policies; and

updating the respective karma scores based on the feedback.

18. The non-transitory computer-readable storage medium of claim 17 , wherein dividing the geographic area into the plurality of cells comprises:

dynamically updating sizes of the plurality of cells based on monitored activity of the plurality of vehicles within the geographic area.

19. The non-transitory computer-readable storage medium of claim 17 , wherein updating the respective coordination policies comprises solving a game-theoretical problem to allocate the network resources in a manner that maximizes an optimization criterion.

20. The non-transitory computer-readable storage medium of claim 17 , wherein the respective coordination policies include a policy for a first vehicle to forward communications between a second vehicle and a network device.