Peer to Peer Delivery System

• US 20160104112A1
• Filed: 10/13/2014
• Published: 04/14/2016
• Est. Priority Date: 10/13/2014
• Status: Abandoned Application

• Current Assignee: Marc Gorlin
• Original Assignee: Marc Gorlin
• Inventors: Gorlin, Marc
• Application Number:
  US14/512,953
• Publication Number:
  US 20160104112A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/29 Geographical information databases
• CPC Class Codes: G06F 16/9537 Spatial or temporal dependent retrieval, e.g. spatiotemporal queries
• CPC Class Codes: G06Q 10/06311 Scheduling, planning or task assignment for a person or group
• CPC Class Codes: G06Q 10/08355 Routing methods

Abstract

A method, apparatus, and computer readable storage to implement an N-tier application package delivery service. Drivers can register for the system and then be presented with automatic alerts when pick up points (for delivery tasks) are nearby or along their current route so that drivers can make extra money by picking packages that are available on or near their current route and then deliver them. Driving patterns of each driver are detected, stored, and analyzed so that their destinations can automatically be predicted.

Claims

1. A method, comprising:

causing one or more electronic processing units to perform;

displaying a navigation map on an electronic output device in a vehicle driven by a driver;

predicting a destination of the driver;

identifying a delivery task which is geographically compatible with the destination; and

prompting the delivery task to the driver enabling the driver to accept or decline the delivery task.

2. The method as recited in claim 1, wherein whether the delivery task is geographically compatible with the destination is satisfied when completion of the delivery task does not require an excessive amount of additional time.

3. The method as recited in claim 2, wherein an excessive amount of time is satisfied by exceeding a predefined time threshold.

4. The method as recited in claim 1, wherein whether the delivery task is geographically compatible with the destination is satisfied when completion of the delivery task does not require an excessive amount of additional miles.

5. The method as recited in claim 4, wherein an excessive amount of additional miles is satisfied by exceeding a predefined mileage threshold.

6. The method as recited in claim 1, wherein the prediction uses past destinations of the driver.

7. The method as recited in claim 1, wherein the prediction uses a time of day and past destinations of the driver along with respective times of day those past destinations were visited.

8. The method as recited in claim 1, wherein the prediction uses a day of week and past destinations of the driver along with respective days of week those past destinations were visited.

9. The method as recited in claim 1, wherein the prediction uses a past frequency that the driver has visited past destinations.

10. The method as recited in claim 1, wherein the prompting is a message that appears on the driver'"'"'s navigation map with details of the delivery task comprising a pickup location, drop-off location, and additional time the delivery task would require.

20. The apparatus as recited in claim 1, wherein the instructions are further programmed such that the prompt displays a message that appears on the driver'"'"'s navigation map with details of the delivery task comprising a pickup location, drop-off location, and additional time the delivery task would require.

11. An apparatus, comprising:

one or more electronic processing units that connected to a computer readable storage medium which stores computer readable instructions which are programmed to cause the one or more electronic processing units to;

display a navigation map on an electronic output device in a vehicle driven by a driver;

predict a destination of the driver;

identify a delivery task which is geographically compatible with the destination; and

prompt the delivery task to the driver enabling the driver to accept or decline the delivery task.

12. The apparatus as recited in claim 11, wherein the instructions are further programmed such that whether the delivery task is geographically compatible with the destination is satisfied when completion of the delivery task does not require an excessive amount of additional time.

13. The apparatus as recited in claim 12, wherein the instructions are further programmed such that an excessive amount of time is satisfied by exceeding a predefined time threshold.

14. The apparatus as recited in claim 11, wherein the instructions are further programmed such that whether the delivery task is geographically compatible with the destination is satisfied when completion of the delivery task does not require an excessive amount of additional miles.

15. The apparatus as recited in claim 14, wherein the instructions are further programmed such that an excessive amount of additional miles is satisfied by exceeding a predefined mileage threshold.

16. The apparatus as recited in claim 11, wherein the instructions are further programmed such that the prediction uses past destinations of the driver.

17. The apparatus as recited in claim 11, wherein the instructions are further programmed such that the prediction uses a time of day and past destinations of the driver along with respective times of day those past destinations were visited.

18. The apparatus as recited in claim 11, wherein the instructions are further programmed such that the prediction uses a day of week and past destinations of the driver along with respective days of week those past destinations were visits.

19. The apparatus as recited in claim 11, wherein the instructions are further programmed such that the prediction uses a past frequency that the driver has visited past destinations.