Pedestrian mapping system

• US 8,000,892 B2
• Filed: 06/12/2007
• Issued: 08/16/2011
• Est. Priority Date: 06/12/2007
• Status: Expired due to Fees

• Current Assignee: Campus Destinations, Inc.
• Original Assignee: Campus Destinations, Inc.
• Inventors: Banerjee, Arup
• Primary Examiner(s): Nguyen; John Q
• Assistant Examiner(s): Nguyen; Chuong P
• Application Number:
  US11/811,808
• Publication Number:
  US 20080312819A1
• Time in Patent Office: 1,526 Days
• Field of Search: 701200-215, 340988-99527
• US Class Current: 701/202
• CPC Class Codes: G01C 21/20 Instruments for performing navigational calculations G01C21/24, G01C21/26 take precedence
• CPC Class Codes: G06Q 10/047 Optimisation of routes or paths, e.g. travelling salesman problem
• CPC Class Codes: G06Q 30/0241 Advertisements

Abstract

The present invention is directed toward a system and method for a web-based mapping and routing service for pedestrians, which may include wheeled transportation (e.g. buses). More specifically, the present invention is directed toward use on a college campus. The present invention provides customized pedestrian routes highlighting campus and community locations while providing navigation options concerning walking distance and safety factors. This provides custom routes to each user that are designed to be optimized for safety or speed depending on user input.

Claims

1. A method of identifying a representation of at least one route for guiding a user comprising the following steps:

providing a computer readable medium having instructions for causing a computer to execute the method;

generating a start and end point;

generating a safety factor;

providing route data comprising segments, safety ratings, and lengths wherein each segment has an associated safety rating and length;

determining at least one route between the start and end point from the route data and the safety factor;

wherein the at least one route is determined by selecting a series of at least one segment that has a lowest weight compared to the weight of at least one other series of at least one other segment wherein the weight of each segment is calculated by an equation that uses a non-linear relationship between the route data and the safety factor;

wherein the equation comprises;

weight=(length)/((safety rating)^(safety factor));

and

identifying a representation of the at least one route.

2. The method of claim 1 wherein the at least one route includes a safer route and a faster route.

3. The method of claim 1 wherein each segment represents a linear geographic line between two nodes.

4. The method of claim 1 wherein the route data is at least partially pedestrian route data.

5. The method of claim 4 wherein the route data is further at least partially wheeled transportation route data.

6. The method of claim 1 wherein the at least one route has both pedestrian and wheeled transportation portions.

7. The method of claim 1 wherein the step of identifying further includes identifying the representation of the at least one route on an electronic display.

8. The method of claim 1 wherein the step of identifying further includes identifying the representation of the at least one route on a printed medium.

9. The method of claim 1 wherein the at least one route passes through at least one building.

10. The method of claim 1 wherein the at least one route has at least one interim point.

11. The method of claim 1 wherein each segment comprises a line between two points wherein the two points exist in a 3-dimensional space.

12. The method of claim 1, further including a graphical safety slider that permits changing the safety factor on a continuous range between safest and fastest route.