Route Searching Device, Route Searching Method and Program
First Claim
1. A route searching device provided with route terminal points, intersections and branching points as nodes, which comprises links which connect the nodes, a route network database containing the corresponding costs of the links, and a route searching section which uses a label setting method for searching a route from a starting point to a destination by referring to the route network database, whereby each link is stored in the route network database comprising attribute information which represents a group to which such link belongs;
- the route searching section calculates a specific upper-order bit in the link cost cumulative value memory of such link as logic “
1”
, where the potential of a link spreading at a node reached by the user exceeds the potential assumed in route searching if the attribute information on the tracked link is different from that of the link spreading from the node reached when the potential at the node reached is calculated by summing up the costs of the links along an outgoing link from the starting point node; and
the route searching section outputs the thus-determined route with lowest accumulated cost as the guide route requiring the least number of link attribute changes.
1 Assignment
0 Petitions
Accused Products
Abstract
A route seeking device, a route seeking method, and a program capable of determining a guide route requiring a small number of transfers of transportation means by a single route seek. In the route seeking device comprising a route seeking section for seeking a route from a start point to a goal with reference to a route network DB consisting of nodes, links to which attribute information representing the groups to which the links belong is added, and costs. The route seeking section calculates a specific upper-order bit in a link cost accumulation value memory of the link as logic “1” such that the potential at the reached node of a spreading node exceeds a potential assumed in route seek if the attribute information on the tracked link is different from that of a link spreading from the reached node with the potential at the reached node is calculated by accumulating the costs of the links along an outgoing link from the start node, and outputs the thus determined route of minimum accumulation cost as a guide route requiring the smallest number of transfers.
17 Citations
12 Claims
-
1. A route searching device provided with route terminal points, intersections and branching points as nodes, which comprises links which connect the nodes, a route network database containing the corresponding costs of the links, and a route searching section which uses a label setting method for searching a route from a starting point to a destination by referring to the route network database,
whereby each link is stored in the route network database comprising attribute information which represents a group to which such link belongs; -
the route searching section calculates a specific upper-order bit in the link cost cumulative value memory of such link as logic “
1”
, where the potential of a link spreading at a node reached by the user exceeds the potential assumed in route searching if the attribute information on the tracked link is different from that of the link spreading from the node reached when the potential at the node reached is calculated by summing up the costs of the links along an outgoing link from the starting point node; and
the route searching section outputs the thus-determined route with lowest accumulated cost as the guide route requiring the least number of link attribute changes. - View Dependent Claims (2, 3, 4)
-
-
5. A route searching method having route terminal points, intersections and branching points as nodes, which comprises links which connect the nodes, a route network database containing the corresponding costs of the links, and a route searching section which uses a label setting method for searching a route from a starting point to a destination by referring to the route network database, whereby each link is stored in the route network database comprising attribute information which represents a group to which such link belongs, and comprises the following steps:
-
the route searching section calculates a specific upper-order bit in a link cost cumulative value memory of such link as logic “
1”
such that the potential at the node reached by a spreading link exceeds the potential assumed in route searching if the attribute information on the tracked link is different from that of the link spreading from the node reached when the potential thereat is calculated, by adding up the costs of the links along an outgoing link from the starting point node; and
the route searching section outputs the thus-determined route of lowest cumulative cost as a guide route requiring the least number of link attribute changes. - View Dependent Claims (6, 7, 8)
-
-
9. A program for a computer comprising a route searching device providing nodes consisting of the terminal points, intersections and diverging points of a route, and links connecting the nodes, a route network database containing the corresponding costs of the links, and a route searching section which uses a label setting method for searching a route from a starting point to a certain destination by referring to the said route network database, wherein each link which is recorded in the route network database comprising attribute information which represents a group to which such link belongs, characterized by executing:
-
an operation which calculates a specific upper-order bit in a link cost cumulative value memory of the link as logic “
1”
where the potential at the node reached by a spreading link exceeds the potential assumed in route searching if the attribute information on the tracked link is different from the attribute information of such spreading link when the potential at the reached node is calculated by accumulating the costs of the links along an outgoing link from the starting point node; and
an operation which outputs the thus-determined route of lowest cumulative cost as a guide route requiring the least number of link attribute changes. - View Dependent Claims (10, 11, 12)
-
Specification