Route Search Method
AssigneeClarion Co., Ltd.
InventorKentaro Daikoku
Life of this patent
Estimating the term…
Abstract
A route search method includes: a step in which the computer generates a first network by, for each of nodes and each of links, generating a plurality of duplicates thereof; a step in which the computer generates a second network by adding first additional links to the first network; and a step in which the computer searches for a route from a duplicate of a node corresponding to the departure point to a duplicate of a node corresponding to the destination point, using the second network. The first additional links are links for which predetermined non negative link costs are set, and in each of which a node of an end point of a duplicate of each of the links is changed to a node of an end point of another duplicate of the each of the links.
Claims13
A route search method, comprising:
- from map data including node data relating to nodes and link data relating to links, extracting nodes and links included in a map area in which a departure point and a destination point are included;
- for the links extracted, determining non negative link costs related to energy consumption or non positive link costs related to energy regeneration;
- generating a first road network by, for each of the nodes and each of the links extracted, generating a plurality of duplicates thereof;
- generating a second road network by adding first additional links and second additional links to the first road network;
- and
- searching for a route from a duplicate of a node corresponding to the departure point to a duplicate of a node corresponding to the destination point, using the link costs determined and the second road network generated;
- wherein:
- the first additional links are links for which predetermined non negative link costs are set, and in each of which a node of an end point of a duplicate of each of the links generated is changed to a node of an end point of another duplicate of the each of the links;
- and
- the second additional links are links for which predetermined non negative link costs are set, and each of which connects between duplicates of node corresponding to the destination point.
-9. (canceled)
A route search device, comprising
- a control unit that
- extracts, from map data including node data relating to nodes and link data relating to links, nodes and links included in a map area in which a departure point and a destination point are included;
- determines, for the links extracted, non negative link costs related to energy consumption or non positive link costs related to energy regeneration;
- generates a first road network by, for each of the nodes and each of the links extracted, generating a plurality of duplicates thereof;
- generates a second road network by adding first additional links and second additional links to the first road network;
- and
- searches for a route from a duplicate of a node corresponding to the departure point to a duplicate of a node corresponding to the destination point, using the link costs determined and the second road network generated;
- wherein:
- the first additional links are links for which predetermined non negative link costs are set, and in each of which a node of an end point of a duplicate of each of the links generated is changed to a node of an end point of another duplicate of the each of the links;
- and
- the second additional links are links for which predetermined non negative link costs are set, and each of which connects between duplicates of node corresponding to the destination point.
Dependencies are inferred from the claim text.