Systems and Methods for Street Level Routing

• US 20160084662A1
• Filed: 09/21/2015
• Published: 03/24/2016
• Est. Priority Date: 09/19/2014
• Status: Active Grant

• Current Assignee: ARRIS Enterprises LLC (CommScope Holding Company, Inc.)
• Original Assignee: ARRIS Enterprises LLC (CommScope Holding Company, Inc.)
• Inventors: Thompson, Stuart, Gardner, Robert
• Granted Patent: US 10,753,751 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G01C 21/34 Route searching; Route guidance
• CPC Class Codes: G01C 21/343 Calculating itineraries, i.e. routes leading from a starting point to a series of categorical destinations using a global route restraint, round trips, touristic trips travelling salesman problem G06Q10/04; optimisation of routes G06Q10/047
• CPC Class Codes: G06Q 10/04 Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem" market predictions or forecasting for commercial activities G06Q30/0202
• CPC Class Codes: G06Q 10/047 Optimisation of routes or paths, e.g. travelling salesman problem

Abstract

A system and method for street level routing.

Claims

1. A system for street level routing comprising a computing device configured for:

dividing a geospatial region into cells and ways;

weighting the cells and ways to accommodate for their individual measure of traversability;

pre-calculating total weights for traversing every cell to every other cell; and

using one or more of the pre-calculated total weights to determine one or more most efficient routes between two points.

2. A method for street level routing comprising:

dividing a geospatial region into cells and ways;

weighting the cells and ways to accommodate for their individual measure of traversability;

pre-calculating total weights for traversing every cell to every other cell; and

using one or more of the pre-calculated total weights to determine one or more most efficient routes between two points.

3. A non-transitory computer-readable storage medium comprising stored instructions which, when executed by one or more computer processors, cause the one or more computer processors to perform steps of:

dividing a geospatial region into cells and ways;

weighting the cells and ways to accommodate for their individual measure of traversability;

pre-calculating total weights for traversing every cell to every other cell; and

using one or more of the pre-calculated total weights to determine one or more most efficient routes between two points.