Dynamic routing via intelligent mapping system
US-9395199-B2 · Jul 19, 2016 · US
US2016321618A1 · US · A1
| Field | Value |
|---|---|
| Publication number | US-2016321618-A1 |
| Application number | US-201415105044-A |
| Country | US |
| Kind code | A1 |
| Filing date | Dec 23, 2014 |
| Priority date | Dec 30, 2013 |
| Publication date | Nov 3, 2016 |
| Grant date | — |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
There is provided a method of generating a recommendation for one or more target locations for running a target errand. The method generates a recommendation for at least one candidate location as the target location,based on a waiting time and a travel time predicated according to target time schedules. Also, there are provided a device and system to provide the recommendation for target locations.
Opening claim text (preview).
1 . A device for generating a recommendation for one or more target locations for running a target errand, including: a schedule setting module for determining one or more target time schedules when a user intends to run the target errand, a location identifying module for identifying the user's location and one or more candidate locations where the user can run the target errand, a travel time predicating module for predicating a travel time from the user's location to each of the candidate locations according to the target time schedules, a waiting time estimating module for estimating a waiting time for running the target errand at each of the candidate locations according to the target time schedules, and a recommending module for generating a recommendation for at least one of the candidate locations as the target location, based on the waiting time and the travel time. 2 . The device according to claim 1 , wherein the travel time predicating module is configured to determine available routes and/or available means of transportation from the user's location to each of the candidate locations. 3 . The device according to claim 2 , wherein the travel time predicating module is configured to: select a route from a plurality of available routes, divide the selected route into multiple segments, estimate a segment time of each of the multiple segments from historical traffic data and/or real-time traffic data according to the target time schedules, and add up all estimated segment times for the selected route. 4 . The device according to claim 1 , wherein the waiting time estimating module is configured to estimate the crowdedness of a candidate location, based on historical data and/or surveillance data of the candidate location according to the available time schedule. 5 . The device according to claim 1 , further comprising: a display for displaying the recommended candidate locations in ascending order according to the sum of the waiting time and the travel time. 6 . A system for generating a recommendation for one or more target locations for running a target errand, comprising: the device of claim 1 ; and historical data storage means communicatively coupled to the device for providing information selected from a group comprising: candidate locations for different types of errands, available routes and/or means of transportation to the candidate locations, historical traffic data, and/or historical crowdedness data at the candidate locations. 7 . The system according to claim 6 , further comprising: monitoring devices for monitoring the crowdedness at the candidate locations, and surveillance devices for monitoring real-time traffic data. 8 . A method of generating a recommendation for one or more target locations for running a target errand, including the steps of: determining one or more target time schedules when a user intends to run the target errand, identifying the user's location and one or more candidate locations where the user can run the target errand, predicting travel time from the user's location to each of the candidate locations according to the target time schedules, estimating a waiting time for running the target errand at each of the candidate locations according to the target time schedules, and generating a recommendation for at least one of the candidate locations as the target location, based on the waiting time and the travel time. 9 . The method according to claim 8 , wherein the step of predicating the travel time comprises the step of determining available routes and/or available means of transportation from the user's location to each of the candidate locations. 10 . The method according to claim 9 , wherein the step of predicating the travel time comprises steps of: selecting a route from a plurality of available routes, dividing the selected route into multiple segments, estimating a segment time of each of the multiple segments from historical traffic data and/or real-time traffic data according to the target time schedules, and adding up all estimated segment times for the selected route. 11 . The method according to claim 8 , wherein the step of estimating the waiting time at each candidate location further comprises the steps of: determining the crowdedness at a candidate location, based on historical data and/or surveillance data of the candidate location according to the target time schedules, determining a processing speed at the candidate location, and estimating the waiting time according to the crowdedness and the processing speed. 12 . The method according to claim 11 , wherein the crowdedness is determined from the registration data at a candidate location, the amount of cars at a candidate location, the number of people entering a candidate location, and/or the CO 2 concentration at a candidate location. 13 . The method according to claim 11 , wherein the waiting time is estimated according to the target time schedules and the travel time. 14 . The method according to claim 8 , wherein the recommended candidate locations are displayed to the user in ascending order according to the sum of the waiting time and the travel time. 15 . A computer readable storage medium comprising instructions stored thereon that are responsive to execution by a processor, causes the processor to perform a method according to claim 8 .
Retrieval, searching and output of information related to real-time traffic, weather, or environmental conditions (arrangements for giving variable traffic instructions G08G1/09) · CPC title
using calendar-based scheduling for task assignment · CPC title
Electricity · mapped topic
Calculating itineraries (travelling salesman problem G06Q10/04; optimisation of routes G06Q10/047) · CPC title
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 title
Related publications grouped by family.
Answers are generated from the same data shown on this page.