METHODS AND SYSTEMS FOR GENERATING ROUTES USING ELECTRONIC MAP DATA
First Claim
1. A method of generating a route through a navigable network in a geographic area, the navigable network being represented by an electronic map comprising a plurality of segments representing navigable elements of the navigable network, the plurality of segments being connected by nodes, and each segment having a traversal direction associated therewith, the method comprising using at least one processor to:
- receive location data identifying a location represented by the electronic map;
define an area represented by the electronic map based on the received location data;
determine at least some of the outgoing segments from the defined area;
determine, for each of the determined outgoing segments from the defined area, a first optimum cost route from an origin to the respective outgoing segment using a route planning algorithm, each first optimum cost route having an associated cost;
select at least one of the first optimum cost routes based on the associated cost;
determine a second optimum cost route to a destination from the outgoing segment from the area of the at least one selected first optimum cost route; and
output for provision to a user at least one of;
data indicative of the generated route; and
a set of navigation instructions for guiding the user along at least a portion of the generated route, wherein the generated route from the origin to the destination comprises the selected first optimum cost route and the second optimum cost route.
4 Assignments
0 Petitions
Accused Products
Abstract
A method and system for generating a route through a navigable network in a geographic area is disclosed, the navigable network being represented by an electronic map comprising a plurality of segments each having a traversal direction associated therewith. An area is defined around a location represented by the electronic map, and at least some of the outgoing segments from the area are determined. A first optimum cost route from an origin is determined to each of the determined outgoing segments, and these routes are ranked according to their cost. At least one of the first optimum cost routes is selected based on the ranking, and a second optimum cost route is determined from the outgoing segment from the area of the selected route to a destination. The generated route from the origin to the destination comprises the selected first optimum cost route and the second optimum cost route.
-
Citations
20 Claims
-
1. A method of generating a route through a navigable network in a geographic area, the navigable network being represented by an electronic map comprising a plurality of segments representing navigable elements of the navigable network, the plurality of segments being connected by nodes, and each segment having a traversal direction associated therewith, the method comprising using at least one processor to:
-
receive location data identifying a location represented by the electronic map; define an area represented by the electronic map based on the received location data; determine at least some of the outgoing segments from the defined area; determine, for each of the determined outgoing segments from the defined area, a first optimum cost route from an origin to the respective outgoing segment using a route planning algorithm, each first optimum cost route having an associated cost; select at least one of the first optimum cost routes based on the associated cost; determine a second optimum cost route to a destination from the outgoing segment from the area of the at least one selected first optimum cost route; and output for provision to a user at least one of;
data indicative of the generated route; and
a set of navigation instructions for guiding the user along at least a portion of the generated route, wherein the generated route from the origin to the destination comprises the selected first optimum cost route and the second optimum cost route. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 20)
-
-
12. A computing device for generating a route through a navigable network in a geographic area, the navigable network being represented by an electronic map comprising a plurality of segments representing navigable elements of the navigable network, the plurality of segments being connected by nodes, and each segment having a traversal direction associated therewith, the computing device comprising at least one processor and a memory, wherein the at least one processor is arranged to:
-
receive location data identifying a location represented by the electronic map; define an area represented by the electronic map based on the received location data; determine at least some of the outgoing segments from the defined area; determine, for each of the determined outgoing segments from the defined area, a first optimum cost route from an origin to the respective outgoing segment using a route planning algorithm, each first optimum cost route having an associated cost; select at least one of the first optimum cost routes based on the associated cost; determine a second optimum cost route to a destination from the outgoing segment from the area of the at least one selected first optimum cost route; and output for provision to a user at least one of;
data indicative of the generated route; and
a set of navigation instructions for guiding the user along at least a portion of the generated route, wherein the generated route from the origin to the destination comprises the selected first optimum cost route and the second optimum cost route. - View Dependent Claims (13, 14, 15, 16, 17, 18, 19)
-
Specification