公开(公告)号：WO1984001823A1

公开(公告)日：1984-05-10

申请号：PCT/DE1983000177

申请日：1983-10-21

Applicant: ROBERT BOSCH GMBH ,  FREIENSTEIN, Bernd ,  NEUKIRCHNER, Ernst, Peter ,  PILSAK, Otmar ,  SCHLÖGL, Dietmar

Inventor： ROBERT BOSCH GMBH

IPC: G01C21/12

CPC classification number: G01C21/28 ,  G01C22/02 ,  G01C22/025 ,  G06K15/00 ,  G06K2215/0088

Abstract: Method and device for guiding road vehicles, particularly usable in densely interconnected road networks. A vehicle apparatus is used with a desired destination input unit and road instruction output unit. The vehicle position finding (determination of the road taken and the travelling direction) is carried out by the detection and analysis of the wheel turns of a non driven vehicle axle. When determining the travelling direction, a correction factor depending on the speed and the curve radius is taken into consideration.

Abstract translation: 用于引导道路车辆的方法和装置，特别可用于密集相连的道路网络。 车辆装置与期望的目的地输入单元和道路指令输出单元一起使用。 通过检测和分析非从动车辆车轮的车轮转弯来进行车辆位置查找（所采取的路线的确定和行进方向）。 当确定行进方向时，考虑到取决于速度和曲线半径的校正因子。

公开(公告)号：WO1988009916A1

公开(公告)日：1988-12-15

申请号：PCT/DE1988000332

申请日：1988-06-04

Applicant: ROBERT BOSCH GMBH ,  NEUKIRCHNER, Ernst-Peter ,  SCHLÖGL, Dietmar

Inventor： ROBERT BOSCH GMBH

IPC: G01C11/22

CPC classification number: G01C21/30 ,  G08G1/137

Abstract: In a process and device for determining the position of a land craft by acquiring and evaluating driving data followed by correcting the position calculated on the basis of the driving data by comparing them with the data of a recorded, digitalised road netword, it is important to be able to determine the position in a reliable way. In the case of an extensive road network, such as a whole state or the whole territory of the Federal Republic of Germany, this can lead to extremely long calculations that stand in the way of a meaningful application of the process. To solve this problem, a grid is superimposed on the road network to subdivide it in meshes of limited surface. Beginning from a starting position, successive meshes are selected, in which the vehicle is situated at a given moment, and the position calculated on the basis of the driving data is corrected in predetermined intervals to give the possible and most probable position of the landcraft given through the road network in the selected mesh and its neighborhood.

Abstract translation: 在用于通过获取和评估驾驶数据来确定陆战机的位置的过程和装置中，通过将驾驶数据与记录的数字化道路网络的数据进行比较来校正基于驾驶数据计算的位置，重要的是 能够以可靠的方式确定职位。 在诸如整个国家或德意志联邦共和国的整个领土等广泛的道路网络的情况下，这可能导致非常长的计算，阻碍了对该过程的有意义的应用。 为了解决这个问题，网格被叠加在道路网上，将其细分到有限表面的网格中。 从起始位置开始，选择连续的网格，其中车辆位于给定的时刻，并且基于驾驶数据计算的位置以预定间隔被校正，以给出给定的可能的和最可能的位置 通过选择的网格及其邻域的道路网络。

公开(公告)号：WO1988009974A1

公开(公告)日：1988-12-15

申请号：PCT/DE1988000329

申请日：1988-06-04

Applicant: ROBERT BOSCH GMBH ,  NEUKIRCHNER, Ernst-Peter ,  SCHLÖGL, Dietmar

Inventor： ROBERT BOSCH GMBH

IPC: G06F15/60

CPC classification number: G08G1/096827 ,  G01C21/3446 ,  G06F17/509 ,  G08G1/096838 ,  G08G1/096844 ,  G08G1/096872 ,  G08G1/0969

Abstract: In process for determining an itinerary between a starting point and a destination point that are both situated within a digitally recorded street network, there is the problem of carrying out the necessary calculations to determine the itinerary in a short time also in the case of extensive street networks. Otherwise the results may be obtained too late and not help the driver to make a decision. This problem is solved by dividing and recording the street network into at least two levels of different mesh densities and regional sizes, several smaller partial areas with a finer mesh density being arranged on the lower level and one or more larger partial areas with a larger mesh density being arranged on the higher level. A possible intinerary is then sought at first on the lower level of the street network and if the result is negative the search is carried out on the next higher level until a positive result is obtained. The itinerary is then determined on the level in which a positive result was obtained, for example on the same level or up and down between levels.

Abstract translation: 在确定位于数字记录的街道网络中的起始点和目的地点之间的行程的过程中，存在在广泛街道的情况下在短时间内进行必要计算以确定行程的问题 网络。 否则结果可能太迟了，不能帮助司机作出决定。 这个问题是通过将街道网分成并记录到不同网格密度和区域尺寸的至少两个级别来解决的，在较低级别上布置有较细网格密度的几个较小的部分区域和具有较大网格的一个或多个更大的部分区域 密度排列在较高层。 首先在街道网络的较低级别寻求可能的行程，如果结果为负，则搜索在下一个更高的级别执行，直到获得肯定的结果为止。 然后在获得积极结果的水平上确定行程，例如在相同水平上或在水平之间上下。