Claims
- 1. A method for scheduling and delivery of an ordered product to a buyer along the buyer's commuting route, comprising:
receiving route information from a buyer; generating a route from the route information; selecting from a plurality of pickup points a pickup point based on the route; and dispatching a portable locker station to the pickup point, the portable locker station enclosing the ordered product.
- 2. The method of claim 1, wherein the route information includes at least two landmarks and generating a route further includes finding a route of shortest distance between the two landmarks.
- 3. The method of claim 1, wherein the route information includes at least two sub-routes and generating a route further includes finding a route of shortest distance between the two sub-routes.
- 4. The method of claim 1, wherein the portable locker station includes a plurality of lockers for enclosing products, each of the plurality of lockers having a unique access code, the method further comprising transmitting to the buyer an access code for a locker enclosing the buyer's product, the locker selected from the plurality of lockers.
- 5. A data processing system adapted to schedule and deliver an ordered product to a buyer along the buyer's commuting route, comprising:
a processor; and a memory operably coupled to the processor and having program instructions stored therein, the processor being operable to execute the program instructions, the program instructions including:
receiving route information from a buyer; generating a route from the route information; selecting from a plurality of pickup points a pickup point based on the route; and dispatching a portable locker station to the pickup point, the portable locker station enclosing the ordered product.
- 6. The data processing apparatus of claim 5, wherein the route information includes at least two landmarks, the program instructions for generating a route further including finding a route of shortest distance between the two landmarks.
- 7. The data processing apparatus of claim 5, wherein the route information includes at least two sub-routes, the program instructions for generating a route further including finding a route of shortest distance between the two sub-routes.
- 8. The data processing apparatus of claim 5, wherein the portable locker station includes a plurality of lockers for enclosing products, each of the plurality of lockers having a unique access code, the program instructions further including transmitting to the buyer an access code for a locker enclosing the buyer's product, the locker selected from the plurality of lockers.
- 9. A portable locker station, comprising:
a plurality of lockers, each of the plurality of lockers having an electronically actuated lock; a controller electrically coupled to each of the electronically actuated locks, the controller having means for storing a plurality of access codes associated with the lockers; and a keypad electrically coupled to the controller whereby a buyer enters an access code to unlock an associated locker.
- 10. The portable locker station of claim 9, further comprising a removable divider between adjoining lockers whereby a single locker is created from two or more lockers by removing the divider.
- 11. The portable locker station of claim 9 further comprising a plurality of keypads, each keypad corresponding to a single locker from the plurality of lockers.
CROSS-REFERENCE TO RELATED APPLICATIONS
[0001] This application is a continuation-in-part of U.S. patent application Ser. No. 09/733,873 filed Dec. 8, 2000 and claims the benefit of U.S. Provisional Application No. 60/263,530 filed on Jan. 22, 2001 and U.S. Provisional Patent Application 60/301,761 filed Jun. 28, 2001 which are hereby incorporated by reference as if set forth in full herein.
Provisional Applications (2)
|
Number |
Date |
Country |
|
60263530 |
Jan 2001 |
US |
|
60301761 |
Jun 2001 |
US |
Continuation in Parts (1)
|
Number |
Date |
Country |
Parent |
09733873 |
Dec 2000 |
US |
Child |
10055144 |
Jan 2002 |
US |