Data processing: vehicles – navigation – and relative location – Navigation – Employing position determining equipment
Reexamination Certificate
1998-12-09
2001-09-18
Louis-Jacques, Jacques H. (Department: 3661)
Data processing: vehicles, navigation, and relative location
Navigation
Employing position determining equipment
C701S019000
Reexamination Certificate
active
06292746
ABSTRACT:
BACKGROUND OF THE INVENTION
The invention involves a process for specifying position data for several routes, in particular vehicle routes. For fleet management, particularly in the area of local public transit, it is necessary to have available precise position data of the route to be driven. For example, the activation points for the triggering of LSA (light-signal-system) telegrams for priority switchover of traffic signal systems must be reproducible with tighter tolerances. Furthermore, the position data can also be used to control an optic and/or acoustic stop (i.e., bus stop or metro stop) signaling inside the vehicle as well as for the triggering of an arrival indication at the bus stops prior to arrival. Depending on the position of the vehicle at a particular point in time, a specific waiting time would result at the individual stops. This projected waiting time can be indicated, for example, as “Arrival in XY minutes”. Position data are also used to determine adherence to the route schedule. By comparing the reference position data to the actual position data, deviation from schedule—later or earlier—can be determined in a simple way, and can be signaled to the driver, and possibly to the riders.
The position data management for several routes has previously occurred separately for each individual route. Essentially equidistant position data is determined for each route. Junctions or co-uses of position data of other routes are also not provided for if the routes only deviate from one another in a small partial section. The volume of data is correspondingly large. The low flexibility with regard to route changes is furthermore disadvantageous, in particular for the necessity of bypass sections.
SUMMARY OF THE INVENTION
The invention is based on the task of specifying a process of the generic type in which the volume of data required is reduced, and which is characterized through flexibility in terms of simpler adjustability to changed conditions.
The task is resolved according to the invention by dividing the routes up into partial routes, such that route sections that are common to at least two routes form common partial routes in which at least one point of each partial route is used for specifying position data. Through the introduction of common partial routes, which are managed to an extent as a data record for several routes, a considerable reduction of the volume of data to be stored results.
In an advantageous embodiment, the beginning point and/or the end point of each partial route is used for specifying of position data, whereby the quantity of data is reduced to a maximum of only two position data records each for each partial route of the entire line. Therefore it is sufficient if only the first, or the last, partial route is also characterized by the starting point, or end point. Except for this one partial route, the remaining partial routes are clearly defined by only their starting, or end point. All partial routes can be used simultaneously as a data basis for additional routes, since the beginning and end point of the common partial routes are accepted. With intermediate partial routes, the starting or end points of neighboring partial routes can be referenced.
Especially interesting is a process in the case of rail-bound routes, wherein the position of switchpoints is used for specifying position data. Since, for example, a streetcar system is limited to fixed routes that are predetermined by the rail network, partial routes can each be defined in a simple way between two switchpoints. Branch lines that form the starting point, or the end point of various partial routes, are thus clearly identified.
Bypass lines can also be integrated into the partial route formation without a problem. Therefore, the volume of data to be managed can be kept lower if the partial routes that form the bypass routes, are already known at least in part from other routes.
The position data can be managed according to the specific route, by entering the position data into a database preferably of a central control unit but also or alternatively into an on-board computer of the vehicle. If entered into a central control unit, the data can be made available to the vehicles traveling on the corresponding route by means of a mobile data storage unit, e.g., the position data of a route, including by-pass(es) when applicable, can be entered into the on-board computer of the vehicle by means of a magnetic card or a disc. Route plan specifications, in some cases with incorporation of planned bypass lines can be very flexibly converted in this way.
Therefore, the position data of a route, including by-pass(es) where applicable, can be entered into a respective mobile data storage medium for each route. Each vehicle that travels on the corresponding route can thus be quickly supplied with the required position data and alongside other vehicles. For example, before starting his/her route the driver can load the position data of the particular route assigned to him/her into the onboard computer by means of a magnetic card, disc or similar medium that goes with this route.
REFERENCES:
patent: 3553449 (1971-01-01), Hathaway
patent: 3598990 (1971-08-01), Convey
patent: 4066228 (1978-01-01), Elder
patent: 4538521 (1985-09-01), Fastenau
patent: 4862807 (1989-09-01), Guadagno
patent: 5371678 (1994-12-01), Nomura
patent: 5623413 (1997-04-01), Matheson et al.
patent: 5669587 (1997-09-01), Van Alstine et al.
patent: 5671680 (1997-09-01), DelGreco
patent: 5794172 (1998-08-01), Matheson et al.
patent: 5828979 (1998-10-01), Polivka et al.
patent: 5893898 (1999-04-01), Tanimoto
patent: 5905451 (1999-05-01), Sakashita
patent: 5951622 (1999-09-01), Nomura
patent: 5978733 (1999-11-01), Seshimaru et al.
patent: 6014607 (2000-01-01), Yagyu et al.
patent: 6023652 (2000-02-01), Arakawa et al.
patent: 6023655 (2000-02-01), Nomura
patent: 6026346 (2000-02-01), Ohashi et al.
patent: 39 05 493 A1 (1990-08-01), None
patent: 38 28 725 C2 (1991-03-01), None
patent: 290 074 A5 (1991-05-01), None
patent: 41 04 351 A1 (1991-08-01), None
patent: 43 26 237 C1 (1994-12-01), None
patent: 44 06 721 A1 (1995-08-01), None
patent: 195 08 486 A1 (1996-09-01), None
patent: 195 32 104 C1 (1997-01-01), None
patent: 196 11 915 A1 (1997-10-01), None
patent: 0 715 285 A1 (1991-11-01), None
patent: 0 457 064 A1 (1991-11-01), None
patent: 0 471 405 A1 (1992-02-01), None
patent: 0 494 499 B1 (1992-07-01), None
patent: 0 702 209 A1 (1996-03-01), None
patent: 0 756 153 A2 (1997-01-01), None
patent: 0 763 808 A2 (1997-03-01), None
patent: 2 281 141 A (1995-02-01), None
Oster Martin
Schiehser Gunter
Weisbier Peter
Alcatel
Louis-Jacques Jacques H.
Sughrue Mion Zinn Macpeak & Seas, PLLC
LandOfFree
Process for the specification of position data does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Process for the specification of position data, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Process for the specification of position data will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2439191