MAP PROCESSING FOR INDOOR NAVIGATION GUIDANCE
First Claim
1. A computer-implemented method comprising:
- accessing, by one or more processors, a preliminary map associated with an indoor space;
converting, by the one or more processors, the preliminary map into a segmented map, wherein the segmented map distinguishes a navigable area of the indoor space from a non-navigable area of the indoor space;
generating, by the one or more processors, a directed graph corresponding to the indoor space based on the segmented map, the directed graph comprising a plurality of nodes connected by a plurality of paths, the plurality of nodes corresponding to points of a set of points in the navigable area of the indoor space and the plurality of paths corresponding to routes between the points, wherein the directed graph is generated by;
executing a distance transform on the segmented map to generate a distance map, wherein the distance map identifies, for each point of the set of points in the navigable area, a distance between that point to a nearest point in the non-navigable area;
for each point of the set of points in the navigable area, identifying a value that indicates the likelihood that a route would pass through that point, the value based on a position of that point in the indoor space; and
generating the plurality of nodes for the directed graph based on the values, wherein the plurality of nodes correspond to points of the set of points of the navigable area;
generating the plurality of paths for the directed graph based on the plurality of nodes, the plurality of paths corresponding to routes between the plurality of nodes;
storing, by the one or more processors, the directed graph for subsequent access to identify a route between two locations in the indoor space;
receiving, by the one or more processors, a request for directions to a location in the indoor space; and
displaying, by the one or more processors, a route to the location based on the directed graph.
2 Assignments
0 Petitions
Accused Products
Abstract
Directions are provided to a location in an indoor space in response to receiving a request from a mobile device. First, a map of the indoor space is processed to identify navigable areas in the indoor space. A distance transform is then executed on the map as part of a process to generate a directed graph. The directed graph includes nodes that correspond to points in the indoor space and paths that correspond to routes between the nodes. Next, a navigation table is generated based on the directed graph to identify a shortest route from each node to at least one other node. In response to a request for directions to a location in the indoor space, the navigation table is accessed to identify a route to the requested location. The identified route is then provided to a mobile device such that an end user may navigate to the location.
29 Citations
23 Claims
-
1. A computer-implemented method comprising:
-
accessing, by one or more processors, a preliminary map associated with an indoor space; converting, by the one or more processors, the preliminary map into a segmented map, wherein the segmented map distinguishes a navigable area of the indoor space from a non-navigable area of the indoor space; generating, by the one or more processors, a directed graph corresponding to the indoor space based on the segmented map, the directed graph comprising a plurality of nodes connected by a plurality of paths, the plurality of nodes corresponding to points of a set of points in the navigable area of the indoor space and the plurality of paths corresponding to routes between the points, wherein the directed graph is generated by; executing a distance transform on the segmented map to generate a distance map, wherein the distance map identifies, for each point of the set of points in the navigable area, a distance between that point to a nearest point in the non-navigable area; for each point of the set of points in the navigable area, identifying a value that indicates the likelihood that a route would pass through that point, the value based on a position of that point in the indoor space; and generating the plurality of nodes for the directed graph based on the values, wherein the plurality of nodes correspond to points of the set of points of the navigable area; generating the plurality of paths for the directed graph based on the plurality of nodes, the plurality of paths corresponding to routes between the plurality of nodes; storing, by the one or more processors, the directed graph for subsequent access to identify a route between two locations in the indoor space; receiving, by the one or more processors, a request for directions to a location in the indoor space; and displaying, by the one or more processors, a route to the location based on the directed graph. - View Dependent Claims (3, 4, 5, 6, 7, 8, 9)
-
-
2. (canceled)
-
10. A computer-implemented method for processing a map to provide guidance for navigating an indoor space, the method comprising:
-
for each point of a set of points in a navigable area, identifying, by one or more processors, a distance between that point to a nearest point in a non-navigable area of the indoor space; for each point of the set of points in the navigable area, identifying, by the one or more processors, a value that indicates a likelihood that a route would pass through that point based on a position of that point in the indoor space; generating, by the one or more processors, a directed graph corresponding to the indoor space based on the values, the directed graph comprising a plurality of nodes connected by a plurality of paths, the plurality of nodes corresponding to points of the set of points in the navigable area, and wherein the plurality of paths are generated based on the plurality of nodes, corresponding to routes between the plurality of nodes; generating, by the one or more processors, a navigation table based on the graph, the navigation table including navigation information that identifies a route between two locations in the indoor space; receiving, by the one or more processors, a request for directions to a location in the indoor space; and displaying, by the one or more processors, a route to the location based on the directed graph. - View Dependent Claims (11, 12, 13, 14, 15, 16, 17, 18, 19)
-
-
20. (canceled)
-
21. (canceled)
-
22. (canceled)
-
23. A system comprising one or more computing devises configured to:
-
for each point of a set of points in a navigable area, identify a distance between that point to a nearest point in a non-navigable area of the indoor space; for each point of the set of points in the navigable area, identify a value that indicates a likelihood that a route would pass through that point, the value based on a position of that point in the indoor space; generate a directed graph corresponding to the indoor space based on the values, the directed graph comprising a plurality of nodes connected by a plurality of paths, the plurality of nodes corresponding to points of the set of points in the navigable area, and wherein the plurality of paths are based on the plurality of nodes, corresponding to routes between the plurality of nodes; generate a navigation table based on the graph, the navigation table including navigation information that identifies a route between two locations in the indoor space; receive a request for directions to a location in the indoor space; and display a route to the location based on the directed graph.
-
Specification