发明名称 |
ROUTE CALCULATION SYSTEM, ROUTE CALCULATION METHOD, AND ROUTE CALCULATION PROGRAM |
摘要 |
Route calculation systems, methods, and programs extract from stored past routes, past routes that at least partly pass through a departure point area and at least partly pass through a destination area, and calculate, for each extracted past route, a new departure point side section route and a new destination side section route. The systems, methods, and programs calculate, for each extracted past route, a new candidate route that sequentially passes through the calculated new departure point side section route, a past section route, and the calculated new destination side section route. The systems, methods, and programs compute a cost of each calculated new candidate route and set the new route as the new candidate route having the smallest computed cost. |
申请公布号 |
US2015377637(A1) |
申请公布日期 |
2015.12.31 |
申请号 |
US201414766073 |
申请日期 |
2014.03.04 |
申请人 |
AISIN AW CO., LTD |
发明人 |
TANIZAKI Daisuke;SHIBATA Tomofumi |
分类号 |
G01C21/34 |
主分类号 |
G01C21/34 |
代理机构 |
|
代理人 |
|
主权项 |
1. A route calculation system comprising:
a memory that stores:
map information;route information including past routes from past departure points to past destinations; anda route calculation program; and a processor that, when executing the stored program: determines a new departure point and a new destination for a new route; extracts, from the stored past routes, one or more stored past routes that at least partly pass through a departure point area and at least partly pass through a destination area based according to the stored map information stored by the map information storing means and the stored route information, the departure point area being a range area including the new departure point, the destination area being a range area including the new destination; calculates, for each of the extracted past routes, a new departure point side section route that is a route from the new departure point to an exit point, the exit point being a point at which the extracted past route intersects with a border of the departure point area on a side of the past destination of the extracted past route; calculates, for each of the extracted past routes, a new destination side section route that is a route from an entrance point to the new destination, the entrance point being a point at which the extracted past route intersects with a border of the destination area on a side of the past departure point of the extracted past route; calculates, for each of the extracted past routes, a new candidate route that sequentially passes through the calculated new departure point side section route, a past section route, and the calculated new destination side section, route, the past section route being a route between the exit point and the entrance point on the extracted past route; computes a cost of each calculated new candidate route; and sets, as the new route from the new departure point to the new destination, the new candidate route having the smallest computed cost. |
地址 |
Aichi JP |