Method and apparatus for searching for route

• US 5,041,983 A
• Filed: 03/30/1990
• Issued: 08/20/1991
• Est. Priority Date: 03/31/1989
• Status: Expired due to Fees

• Current Assignee: Aisin Seiki Co., Ltd. (Aisin Corp.)
• Original Assignee: Aisin Seiki Kabushiki Kaisha
• Inventors: Kuzuya, Keiji, Nakahara, Naoji
• Primary Examiner(s): Chin, Gary
• Application Number:
  US07/501,914
• Time in Patent Office: 508 Days
• Field of Search: 364/443, 364/444, 364/449, 73/178 R, 340/988, 340/990, 340/995
• US Class Current: 701/209
• CPC Class Codes: G01C 21/3446 Details of route searching algorithms, e.g. Dijkstra, A*, arc-flags, using precalculated routes

Abstract

There are disclosed an apparatus and a method for searching for the optimum route to be followed by a vehicle. The apparatus comprises a memory storing road maps, a keyboard having keys, and a microcomputer. The driver of the vehicle specifies a starting point and a destination in a network of roads displayed on a color CRT. Then, the microcomputer searches the network for a route which connects the starting point to the destination at the shortest distance.

Claims

1. An apparatus for searching for a route to be followed by a vehicle, said apparatus comprising:

a storage means storing information about a network of roads that can be followed by the vehicle;

a specifying means for specifying a first point and a second point in the network; and

a processing means which, when the first and the second points in the network are specified, searches for a route connecting the first point to the second point at a shortest estimated distance while accumulating the distance from the first point, searches for a route that connects the second point to the first point at a shortest estimated distance while accumulating the distance from the second point, and selects a road that extends from one of the two points and first meets a road extending from the other of the two points to determine the optimum route;

wherein said storage means stores information about the positions of junctions of the roads that can be followed by the vehicle and information about the interconnection of said junctions, and wherein said processing means searches for roads connected to the first point, while accumulating the distance from the first point each time a junction in the network is encountered and narrowing the search at said junction, and searches for roads connected to the second point while accumulating the distance from the second point each time a junction in the network is encountered and narrowing the search at said junction.