System and Method for Distributed Utility Service Execution

A method for using a network of system collectors, the network of system collectors including at least one utility vehicle, each of the network of system collectors including at least one processor, the network of system collectors for moving goods from a commercial establishment to a consumer location, the method comprising:

• (a) receiving, by at least one receiving processor of the at least one processors, a request from the commercial establishment to deliver the goods from a location associated with the commercial establishment to the consumer location;
• (b) determining, by the at least one receiving processor, selection criteria for choosing at least one optimum utility vehicle of the at least one utility vehicle based at least on the status of the at least one utility vehicle;
• (c) directing, by the at least one receiving processor, at least one delivery processor associated with the at least one optimum utility vehicle to command the at least one optimum utility vehicle to the commercial establishment to receive the goods;
• (d) associating, by the at least one delivery processor, at least one security means with the goods as the goods are stored in the at least one optimum utility vehicle, the at least one security means requiring security information to release the goods;
• (e) determining, by the at least one delivery processor, a proposed path between the commercial establishment and the consumer location based at least on historic information received from the network of system collectors;
• (f) updating, by the at least one delivery processor, the proposed path based at least on information received in real time from the network of system collectors;
• (g) commanding, by the at least one delivery processor, the at least one optimum utility vehicle to proceed along the updated proposed path;
• (h) repeating (f) and (g) until the at least one optimum utility vehicle reaches the consumer location;
• (i) verifying, by the at least one delivery processor, the security information;
• and
• (j) releasing, by the at least one delivery processor, the goods at the consumer location if the security information is verified.

A utility execution system for moving goods from at least one first location to at least one second location comprising:

• a network of system collectors including at least one utility vehicle;
• at least one processor associated with each of the system collectors, the at least one processor including at least one receiving processor and at least one delivery processor, the at least one receiving processor executing:
• receiving at least one request from the at least one first location to deliver the goods to the at least one second location;
• choosing at least one optimum utility vehicle of the at least one utility vehicles based at least on the status of the at least one utility vehicle;
• and
• directing the at least one delivery processor associated with the at least one optimum utility vehicle to command the at least one optimum utility vehicle to the at least one first location to receive the goods, the at least one delivery processor executing:
• associating at least one security means with the goods as the goods are stored in the at least one optimum utility vehicle, the at least one security means requiring security information to release the goods;
• determining a proposed path between the at least one first location and the at least one second location based at least on historic information received from the network of system collectors;
• commanding the at least one optimum utility vehicle to proceed along the proposed path until the at least one optimum utility vehicle reaches the at least one second location;
• verifying received of the security information;
• and
• releasing the goods at the consumer location.

A method for delivering goods from at least one first location to at least one second location comprising:

• (a) coupling, by at least one of a plurality of utility vehicles, at least one of the plurality of utility vehicles with an other of the plurality of utility vehicles through a communications network;
• (b) receiving, by at least one of a plurality of utility vehicles, the goods from the at least one first location into at least one of the plurality of utility vehicles;
• (c) determining, by at least one of a plurality of utility vehicles, a proposed path between the at least one first location and the at least one second location;
• (d) enabling, by at least one of a plurality of utility vehicles, the at least one of the plurality of utility vehicles to follow the other of the at plurality of utility vehicles along the proposed path until the one at least one utility vehicle reaches the at least one second location;
• and
• (h) enabling, by at least one of a plurality of utility vehicles, the other of the plurality of utility vehicles to deliver the goods at the second location.

A method for executing a proposed route to deliver goods, by at least one member of a utility execution system, from at least one first location to at least one second location comprising:

• accessing, by the at least one member, a map including at least one static obstacle;
• updating, by the at least one member, the map with the proposed route forming a route map;
• updating, by the at least one member, the proposed route based at least upon the at least one static obstacle;
• continuously gathering, by the at least one member, real time data associated with the updated proposed route as the utility execution system navigates the updated proposed route;
• continuously updating, by the at least one member, the proposed route based at least upon the real time data;
• continuously updating, when there are changes, by the at least one member, the route map with the real time data and the updated proposed route as the utility execution system navigates the updated proposed route;
• deducing, by the at least one member, at least one characteristic of at least one dynamic object based at least on the updated route map;
• and
• providing, by the at least one member, the updated route map and the deduced at least one characteristic to the utility execution system.