USER FRIENDLY METHOD OF COMPUTER GENERATING MAPS FOR REGIONAL DELIVERY SERVICES

• US 20070265773A1
• Filed: 05/09/2006
• Published: 11/15/2007
• Est. Priority Date: 05/09/2006
• Status: Abandoned Application

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Sterling, Merle, HATELY, ANDREW
• Application Number:
  US11/382,282
• Publication Number:
  US 20070265773A1
• Time in Patent Office: Days
• US Class Current: 701/211
• CPC Class Codes: G01C 21/3476 using point of interest [POI] information, e.g. a route passing visible POIs

Abstract

The manager or host of the computer generating mapping method compiles and stores a list of most of the landmarks within the geographic area within which the deliveries are to be made. The new user is prompted to choose from the stored list all of the landmarks with which he is familiar and knows how to reach. This set of user known landmarks is stored in association with the particular user. When a delivery by the user is to be made within the region, a determination is made of the optimum landmark from which the user may proceed to the destination, and a map is generated only from the landmark to the destination. The basic assumption is that the user knows the starting landmark and how to reach it.

Claims

1. A computer controlled method for generating maps for the guidance of users to destinations within a geographical area comprising:

storing the locations of a plurality of landmarks within the geographical area;

prompting the user to select, from said plurality of landmarks, a set of landmarks of known location to the user;

selecting a destination within the geographical area;

determining the optimum landmark in said set of landmarks from which the user may proceed to the selected destination; and

generating a map from said optimum landmark to said selected destination.

2. The method of claim 1 wherein said optimum landmark is determined by the minimum route distance from the landmark to the destination.

3. The method of claim 1 wherein said optimum landmark is determined by the steps of:

selecting a departure point; and

determining the minimum route distance from the departure point to the destination via the landmark.

4. The method of claim 2 wherein said optimum landmark is determined by a combination of the minimum route distance and the complexity of the routing from the landmark to the destination.

5. The method of claim 3 wherein said optimum landmark is determined by a combination of the minimum route distance and the complexity of the routing from the departure point to the destination via the landmark.

6. The method of claim 1 further including the step of enabling the user to dynamically select additional landmarks for said set.

7. The method of claim 1 wherein said user generates maps to guide a plurality of deliveries of goods to destinations within said geographical area.

8. The method of claim 7 further including the step of generating a bill for delivered goods including said generated map.

9. The method of claim 1 wherein said generated map is displayed to the user.

10. The method of claim 1 wherein said generated map is printed for the user.

11. A computer program having code recorded on a computer readable medium for generating maps for the guidance of users to destinations within a geographical area comprising:

means for storing the locations of a plurality of landmarks within the geographical area;

means for prompting the user to select, from said plurality of landmarks, a set of landmarks of known location to the user;

means for selecting a destination within the geographical area;

means for determining the optimum landmark in said set of landmarks from which the user may proceed to the selected destination; and

generating a map from said optimum landmark to said selected destination.

12. The computer program of claim 11 wherein said optimum landmark is determined by the minimum route distance from the landmark to the destination.

13. The computer program of claim 11 wherein said means for determining the optimum landmark includes:

means for selecting a departure point; and

means for determining the minimum route distance from the departure point to the destination via the landmark.

14. The computer program of claim 12 wherein said means for determining the optimum landmark includes means for correlating the minimum route distance and the complexity of the routing from the landmark to the destination.

15. The computer program of claim 13 wherein said means for determining the optimum landmark includes means for correlating the minimum route distance and the complexity of the route from the landmark to the destination.

16. The computer program of claim 11 further including means for enabling the user to dynamically select additional landmarks for said set.

17. The computer program of claim 11 wherein said user generates maps to guide a plurality of deliveries to destinations within said geographical area.

18. The computer program of claim 17 further including means for generating a bill for delivered goods including said generated map.

19. The computer program of claim 11 wherein said generated map is displayed to the user.

20. The computer program of claim 11 wherein said generated map is printed for the user.