Determining a likelihood of a directional transition at a junction in an encoded routability graph description
AssigneeQUALCOMM Incorporated
InventorRajarshi Gupta
Life of this patent
Estimating the term…
Abstract
Techniques are provided, which may be implemented in various methods, apparatuses, and/or articles of manufacture, to obtain an encoded routability graph representative of feasible paths in an indoor environment represented by an encoded map, and assign likelihoods of transition from an ingress edge in the encoded routability graph to individual egress edges through a junction connecting the ingress edge to a plurality of egress edges based, at least in part, on one or more features of the encoded map.
Claims56
A method comprising, with a computing platform:
- obtaining an encoded routability graph representative of feasible paths in an indoor environment represented by an encoded map;
- and
- assigning likelihoods of transition from an ingress edge in said encoded routability graph to individual egress edges through a junction connecting said ingress edge to a plurality of egress edges based, at least in part, on one or more features of said encoded map.
An apparatus for use in a computing platform, the apparatus comprising:
- means for obtaining an encoded routability graph representative of feasible paths in an indoor environment represented by an encoded map;
- and
- means for assigning likelihoods of transition from an ingress edge in said encoded routability graph to individual egress edges through a junction connecting said ingress edge to a plurality of egress edges based, at least in part, on one or more features of said encoded map.
A computing platform comprising:
- memory;
- and
- one or more processing units to:
- obtain, from said memory, an encoded routability graph representative of feasible paths in an indoor environment represented by an encoded map;
- and
- assign likelihoods of transition from an ingress edge in said encoded routability graph to individual egress edges through a junction connecting said ingress edge to a plurality of egress edges based, at least in part, on one or more features of said encoded map.
An article for use in a computing platform, the article comprising:
- a non-transitory computer-readable medium having stored therein computer implementable instructions executable by one or more processing units to:
- obtain an encoded routability graph representative of feasible paths in an indoor environment represented by an encoded map;
- and
- assign likelihoods of transition from an ingress edge in said encoded routability graph to individual egress edges through a junction connecting said ingress edge to a plurality of egress edges based, at least in part, on one or more features of said encoded map.
Dependencies are inferred from the claim text.