WO2003052352A1 - Routeplanner - Google Patents

Routeplanner Download PDF

Info

Publication number
WO2003052352A1
WO2003052352A1 PCT/NL2002/000846 NL0200846W WO03052352A1 WO 2003052352 A1 WO2003052352 A1 WO 2003052352A1 NL 0200846 W NL0200846 W NL 0200846W WO 03052352 A1 WO03052352 A1 WO 03052352A1
Authority
WO
WIPO (PCT)
Prior art keywords
information
type
sort
data file
geographical
Prior art date
Application number
PCT/NL2002/000846
Other languages
French (fr)
Inventor
Wilhelmus Hendrikus Nederend
Original Assignee
And Products B.V.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by And Products B.V. filed Critical And Products B.V.
Priority to AU2002353664A priority Critical patent/AU2002353664A1/en
Publication of WO2003052352A1 publication Critical patent/WO2003052352A1/en

Links

Classifications

    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
    • G01C21/34—Route searching; Route guidance
    • G01C21/3446—Details of route searching algorithms, e.g. Dijkstra, A*, arc-flags, using precalculated routes

Definitions

  • the invention relates to a route planner for use in combination with a computer system having an input and output device and a processor unit and at least one data file for geographical information, wherein the same provides a search algorithm for determining a connecting route between a starting point and a point of destination, wherein the starting point, point of destination and connecting route form part of the geographical information.
  • the invention also relates to composing such a route planner.
  • a known route planner of this type is being marketed by applicants under the name of "Route 2001".
  • This route planner comes in the form of a CD-ROM that includes a search algorithm, as well as geographical information with respect to which the search algorithm may be active for determining a connecting route between a starting point and a point of destination to be entered into the computer system on which the route planner is installed.
  • This known route planner pressing one key suffices to determine the optimal route right down to street level in a predetermined geographical area. To do this, the system requires the input of the address data or the complete postal code of the starting point and the point of destination.
  • a route planner is known corresponding with the preamble, which provides for the geographical information being divided into geographical information of a first sort, and geographical information of a second sort, and in which:
  • the information of the first sort is grouped in at least one type of data file
  • the information of the second sort is grouped in at least a second type of data file
  • the search algorithm is designed to develop a search strategy when determining the connecting route between starting point and point of destination, which at a common geographical datum is able to selectively change between the first type of data file and the second type of data file, or is able to continue both in the first type of data file and the second type of data file.
  • This route planner is known from WO 93/05492; US-A-5, 258, 391 and US-A-5, 974, 419.
  • a route planner may be a component of numerous products. Mentioned earlier was the CD-ROM product "route 2001". The application in geographical information systems, logistic planning kits, depot localisation systems and autonavigation systems is also possible. Applicants also use the route planner for Internet services and WAP services for mobile telephones.
  • the method proposed by the invention for composing such a route planner corresponding to the preamble of claim 1, and wherein the information of the second sort is incorporated in the route planner as basis, is characterised in that the information of the first sort is available as independent data file and is added as independent component to the information of the second sort such that the common geographical data couple the first type of data file with the second type of data file, and that the search algorithm when developing the search strategy will start in the first type of data file, and after passing a predetermined number of common data and/or after exceeding a predetermined distance covered in the first type of data file, will continue the search strategy in an area between starting point and point of destination exclusively in the second type of data file.
  • the route planner is characterised in that when developing the search strategy, the search algorithm starts in the first type of data file, and after passing a predetermined number of common data and/or after exceeding a predetermined distance covered in the first type of data file, the search strategy continues in an area between starting point and point of destination ex- clusively in the second type of data file.
  • data files from the different sources that is to say the first type of data file and the second type of data file
  • the two types of data files are coupled only at those points where they have relevant common geographical data, thereby establishing the relationship between the first type of data file and the second type of data file, allowing the search algorithm to effectively switch during its search of the con- necting route (or parts thereof) between the starting point and the point of destination in the first type of data base and/or the second type of data base.
  • the geographical information of the first sort substantially comprises detailed street information
  • the information of the second sort substantially comprises information about highways.
  • the search algorithm for determining the connecting route between the starting point and point of destination can change to a search strategy focused substantially or exclu- sively on the data file comprising the information of the second sort. Since the information of the second sort is essentially less detailed, the search there can progress more quickly and more efficiently.
  • the route planner ac- cording to the invention is characterised in that the information of the first sort is distributed in several individual and independent first type of data files that store detailed geographical information of various predetermined areas, wherein these separate first type of data files each possesses at least one common geographical datum with the information of the second sort for coupling these various first type of data files with the second type of data file.
  • This also anticipates that the starting point and the point of destination may be far apart so that they will already automatically form part of completely different data files.
  • the coupling between these different data files, which themselves may be very detailed, occurs as explained above by means of the data file of the second type, which as it were forms a backbone for the route planner according to the in- vention.
  • data files may be added to this data file of the second type, such as the data file of the first type which may be very detailed, but also other sorts of data files exhibiting a degree of detail betwee that of the first type of data file and the second type of data file.
  • a suitable manner for coupling various types of data files is, for example, one wherein the common data coupling the first type of data files with the second type of data files are comprised of road numbers or the like. This offers the prospect that instead of effecting an attended coupling between data files it can be accomplished automatically by means of a software solution in which the method according to the invention is embodied.
  • first type of data file and the second type of data file may be of different categories, for example, the second type of data file may contain information concerning the road net while the first type of data file may relate to information concerning a network of public transport services or a network of flights for air' traffic. This facilitates the provision of services relating to multi-mode travel.
  • Figure 1 shows a portion of this composed network in which two points A and B are indicated representing a starting point and a point of destination, respectively.
  • the route planner serves to find a linking path between these two points A and B.
  • the figure further shows points marked ⁇ l, U2 and U3. These points represent common data from the information file of the first sort and the information file of the second sort.
  • the above mentioned points A and B are each situated in an area which while being limited in size is relatively detailed, and on which information of the first sort is available. These two areas are embedded in a backbone formed by less detailed information of the second sort, representing highways.
  • the common geographical data ⁇ l, U2 and U3 coupling the two types of files are situated on such highways.
  • Planning of the route is realised such that departing from starting point A as well as point of destination B possible connecting roads are investigated; this is done by so called tree formation, departing both from starting point A and point of destination B.
  • tree formation departing both from starting point A and point of destination B.
  • the explanation will cover the tree-formation departing from starting point A only. In practise, the tree-formation occurs alternately from starting point A and point of destination B.
  • the route searched for is found when the trees meet at one tip.
  • Figure 2 shows the beginning of the tree-formation, departing from starting point A. In the vicinity of this starting point A, the roads leading to A are marked with arrows that indicate the possible path to be followed.
  • Figure 2 shows that one of the branches of the tree has reached the common geographical datum Ul. From there the search algorithm can also or exclusively examine further roads in the coarse network data file of the second type. However, in the embodiment shown another search activity takes place in the data file of the first type after passing the common geographical datum Ul, as can be seen in figure 3 by the further prolif- eration of the small arrows.
  • the larger arrows shown in figure 3 represent the development of the connecting route in the data file of the second type in the direction of the point of destination B, leading back to starting point A.
  • the search algorithm stops the further development of the connecting routes and the connecting route between A and B that was found can be made available to the user of the route planner via the output device of the computer system.
  • the above example is very schematic and is a rudimentary representation of how the route planner according to the invention works.
  • a route planner according to the invention as usable in practice works with a vast variety of data files, which in respect of complexity may be enormous detailed while the relevant geographical information on the other hand may be a very course network representation.

Abstract

The invention relates to a route planner for use in combination with a computer system having an input and output device and a processor unit and at least one data file for geographical information, wherein the same provides a search algorithm for determining a connecting route between a starting point and a point of destination, wherein the starting point, point of destination and connecting route form part of the geographical information.

Description

ROUTEP ANNER
The invention relates to a route planner for use in combination with a computer system having an input and output device and a processor unit and at least one data file for geographical information, wherein the same provides a search algorithm for determining a connecting route between a starting point and a point of destination, wherein the starting point, point of destination and connecting route form part of the geographical information. The invention also relates to composing such a route planner. A known route planner of this type is being marketed by applicants under the name of "Route 2001". This route planner comes in the form of a CD-ROM that includes a search algorithm, as well as geographical information with respect to which the search algorithm may be active for determining a connecting route between a starting point and a point of destination to be entered into the computer system on which the route planner is installed. With this known route planner pressing one key suffices to determine the optimal route right down to street level in a predetermined geographical area. To do this, the system requires the input of the address data or the complete postal code of the starting point and the point of destination.
From the prior art a route planner is known corresponding with the preamble, which provides for the geographical information being divided into geographical information of a first sort, and geographical information of a second sort, and in which:
- the information of the first sort is grouped in at least one type of data file, and the information of the second sort is grouped in at least a second type of data file
- the information of the first sort and the information of the second sort overlap, at least partly
- there are several common geographical data pertaining to the information of the first sort and to the information of the second sort - the common geographical data are able to couple the first type of data file to the second type of data file
- the search algorithm is designed to develop a search strategy when determining the connecting route between starting point and point of destination, which at a common geographical datum is able to selectively change between the first type of data file and the second type of data file, or is able to continue both in the first type of data file and the second type of data file. This route planner is known from WO 93/05492; US-A-5, 258, 391 and US-A-5, 974, 419.
It is noted that a route planner may be a component of numerous products. Mentioned earlier was the CD-ROM product "route 2001". The application in geographical information systems, logistic planning kits, depot localisation systems and autonavigation systems is also possible. Applicants also use the route planner for Internet services and WAP services for mobile telephones.
In practise the data files containing geographical information that are offered on the market show varied degree of detail. If a supplier of a route planner wishes to use such information from another supplier, this further information needs to be entered an processed in the data file with geographical information already contained in the route planner. It goes without saying that completing the data file of the route planner with information obtained from third parties is time consuming and costly, which forms an obstacle for an optimal use of the available information. An additional disadvantage is that when later improved releases of such information files appear, a general revision of the composed data file is required with possible errors being unavoidable.
It is the object of the invention to make the integration and the use of data files originating from different sources more simple, less expensive and more efficient, at least to make the information from these data files accessible so as to allow the information in the various data files to be used effectively without extensive pre-processing, for an efficient determination of the connecting route between an entered starting point and point of destination.
The method proposed by the invention for composing such a route planner corresponding to the preamble of claim 1, and wherein the information of the second sort is incorporated in the route planner as basis, is characterised in that the information of the first sort is available as independent data file and is added as independent component to the information of the second sort such that the common geographical data couple the first type of data file with the second type of data file, and that the search algorithm when developing the search strategy will start in the first type of data file, and after passing a predetermined number of common data and/or after exceeding a predetermined distance covered in the first type of data file, will continue the search strategy in an area between starting point and point of destination exclusively in the second type of data file.
In accordance with the invention, the route planner is characterised in that when developing the search strategy, the search algorithm starts in the first type of data file, and after passing a predetermined number of common data and/or after exceeding a predetermined distance covered in the first type of data file, the search strategy continues in an area between starting point and point of destination ex- clusively in the second type of data file.
In this way data files from the different sources, that is to say the first type of data file and the second type of data file, can be incorporated in the route planner according to the invention without special processing. The two types of data files are coupled only at those points where they have relevant common geographical data, thereby establishing the relationship between the first type of data file and the second type of data file, allowing the search algorithm to effectively switch during its search of the con- necting route (or parts thereof) between the starting point and the point of destination in the first type of data base and/or the second type of data base. In practise this can be suitably realised such that the geographical information of the first sort substantially comprises detailed street information, and that the information of the second sort substantially comprises information about highways. In this way, as the algorithm becomes further removed from the starting point and/or the point of destination the search algorithm for determining the connecting route between the starting point and point of destination can change to a search strategy focused substantially or exclu- sively on the data file comprising the information of the second sort. Since the information of the second sort is essentially less detailed, the search there can progress more quickly and more efficiently.
In a favourable embodiment, the route planner ac- cording to the invention is characterised in that the information of the first sort is distributed in several individual and independent first type of data files that store detailed geographical information of various predetermined areas, wherein these separate first type of data files each possesses at least one common geographical datum with the information of the second sort for coupling these various first type of data files with the second type of data file. This also anticipates that the starting point and the point of destination may be far apart so that they will already automatically form part of completely different data files. The coupling between these different data files, which themselves may be very detailed, occurs as explained above by means of the data file of the second type, which as it were forms a backbone for the route planner according to the in- vention. As may be clear from the foregoing, further data files may be added to this data file of the second type, such as the data file of the first type which may be very detailed, but also other sorts of data files exhibiting a degree of detail betwee that of the first type of data file and the second type of data file.
A suitable manner for coupling various types of data files is, for example, one wherein the common data coupling the first type of data files with the second type of data files are comprised of road numbers or the like. This offers the prospect that instead of effecting an attended coupling between data files it can be accomplished automatically by means of a software solution in which the method according to the invention is embodied.
Attention is expressly drawn to the fact that the first type of data file and the second type of data file may be of different categories, for example, the second type of data file may contain information concerning the road net while the first type of data file may relate to information concerning a network of public transport services or a network of flights for air' traffic. This facilitates the provision of services relating to multi-mode travel.
Herewith the invention will be further elucidated with reference to a greatly simplified example of how the route planner works.
The example will be discussed with reference to the drawing, which in the figures 1-4 shows a composition of a network formed on the basis of information of the first (de- tailed) sort and a network based on information of the second (less detailed) sort.
Figure 1 shows a portion of this composed network in which two points A and B are indicated representing a starting point and a point of destination, respectively. The route planner serves to find a linking path between these two points A and B. The figure further shows points marked ϋl, U2 and U3. These points represent common data from the information file of the first sort and the information file of the second sort. The above mentioned points A and B are each situated in an area which while being limited in size is relatively detailed, and on which information of the first sort is available. These two areas are embedded in a backbone formed by less detailed information of the second sort, representing highways. The common geographical data ϋl, U2 and U3 coupling the two types of files are situated on such highways.
Planning of the route is realised such that departing from starting point A as well as point of destination B possible connecting roads are investigated; this is done by so called tree formation, departing both from starting point A and point of destination B. For the sake of clarity, the explanation will cover the tree-formation departing from starting point A only. In practise, the tree-formation occurs alternately from starting point A and point of destination B. The route searched for is found when the trees meet at one tip.
Figure 2 shows the beginning of the tree-formation, departing from starting point A. In the vicinity of this starting point A, the roads leading to A are marked with arrows that indicate the possible path to be followed. Figure 2 shows that one of the branches of the tree has reached the common geographical datum Ul. From there the search algorithm can also or exclusively examine further roads in the coarse network data file of the second type. However, in the embodiment shown another search activity takes place in the data file of the first type after passing the common geographical datum Ul, as can be seen in figure 3 by the further prolif- eration of the small arrows. The larger arrows shown in figure 3 represent the development of the connecting route in the data file of the second type in the direction of the point of destination B, leading back to starting point A. The synchronous development of the connecting route between starting point A and point of destination B in the data files of the first type and the second type referred to, renders the route planner very robust. Any possible diversions in the data file of the second type are thereby prevented from negatively affecting the ability to find the shortest connecting route between starting point A and point of destination B. Figure 4 finally shows that the development of the connecting route after passage of the common geographical data U2 and U3 takes places exclusively in the data file of the second type. It should be born in mind that an identical type of route development takes place from starting point B (as already remarked earlier) . The connecting route developing from point of destination B eventually meets the connecting route that, as shown in figure 4, was developed from starting point A. At the intersection of these connecting routes the search algorithm stops the further development of the connecting routes and the connecting route between A and B that was found can be made available to the user of the route planner via the output device of the computer system. It should be noted that the above example is very schematic and is a rudimentary representation of how the route planner according to the invention works. A route planner according to the invention as usable in practice works with a vast variety of data files, which in respect of complexity may be immensely detailed while the relevant geographical information on the other hand may be a very course network representation. It goes without saying therefore, that the invention is no way limited to the above exemplary embodiment, but that the significance of this exemplary embodiment serves exclusively to remove any ambiguities in the appended claims, without in any way limiting these claims with respect to the scope of protection to which these claims are entitled.

Claims

1. A route planner for use in combination with a computer system having an input and output device and a processor unit and at least one data file for geographical information, wherein the same provides a search algorithm for determining a connecting route between a starting point and a point of destination, wherein the starting point, point of destination and connecting route form part of the geographical information, and in which:
- the geographical information is divided into geographical information of a first sort, and geographical information of a second sort,
- the information of the first sort is grouped in at least one type of data file, and the information of the second sort is grouped in at least a second type of data file - the information of the first sort and the information of the second sort overlap at least partly
- there are several common geographical data pertaining to the information of the first sort and to the information of the second sort - the common geographical data are able to couple the first type of data file to the second type of data file
- the search algorithm is designed to develop a search strategy when determining the connecting route between starting point and point of destination, which at a common geographi- cal datum is able to selectively change between the first type of data file and the second type of data file, or is able to continue both in the first type of data file and the second type of data file, characterised in that the search algorithm when developing the search strategy will start in the first type of data file, and after passing a predetermined number of common data and/or after exceeding a predetermined distance covered in the first type of data file the search strategy, will continue in an area between starting point and point of destination exclusively in the second type of data file.
2. A route planner according to claim 1, characterised in that the geographical information of the first sort substantially comprises detailed street information, and that the information of the second sort substantially comprises information about highways .
3. A route planner according to claim 1 or 2, characterised in that the information of the first sort is distributed in several individual and independent first type of data files that store detailed geographical information of various predetermined areas, wherein these separate first type of data files each possesses at least one common geographical datum with the information of the second sort for coupling these various first type of data files with the second type of data file.
4. A route planner according to one of the preceding claims, characterised in that the common data coupling the first type of data files with the second type of data files are comprised of road numbers or the like.
5. A route planner according to claim 1 or 3, char- acterised in that the geographical information of the first sort and the geographical information of the second sort belong to different categories, such as information concerning the road net and information concerning public transport or information concerning air traffic, respectively.
6. A method for composing a route planner suitable for use in combination with a computer system having an input and output device and a processor unit and at least one data file for geographical information, wherein the same provides a search algorithm for determining a connecting route between a starting point and a point of destination, wherein the starting point, point of destination and connecting route form part of the geographical information, and in which:
- the geographical information is divided into geographical information of a first sort, and geographical information of a second sort,
- the information of the first sort is grouped in at least one type of data file, and the information of the second sort is grouped in at least a second type of data file - the information of the first sort and the information of the second sort overlap at least partly
- there are several common geographical data pertaining to the information of the first sort and to the information of the second sort
- the search algorithm is designed to develop a search strategy when determining the connecting route between starting point and point of destination, which at a common geographical datum is able to selectively change between the first type of data file and the second type of data file, or is able to continue both in the first type of data file and the second type of data file, and wherein the information of the second sort is incorporated as basis in the route planner module, characterised in that the information of the first sort is available as independent data file and is added as independent component to the information of the second sort such that the common geographical data couple the first type of data file with the second type of data file, and that the search algorithm when developing the search strategy will start in the first type of data file, and after passing a predetermined number of common data and/or after exceeding a predetermined distance covered in the first type of data file, will continue the search strategy in an area between starting point and point of destination exclusively in the second type of data file.
PCT/NL2002/000846 2001-12-19 2002-12-18 Routeplanner WO2003052352A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
AU2002353664A AU2002353664A1 (en) 2001-12-19 2002-12-18 Routeplanner

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
NL1019606A NL1019606C2 (en) 2001-12-19 2001-12-19 Route planner module.
NL1019606 2001-12-19

Publications (1)

Publication Number Publication Date
WO2003052352A1 true WO2003052352A1 (en) 2003-06-26

Family

ID=19774409

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/NL2002/000846 WO2003052352A1 (en) 2001-12-19 2002-12-18 Routeplanner

Country Status (3)

Country Link
AU (1) AU2002353664A1 (en)
NL (1) NL1019606C2 (en)
WO (1) WO2003052352A1 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE102004044968A1 (en) * 2004-09-16 2006-04-06 Siemens Ag Navigation system and method for determining a route

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0504854A1 (en) * 1991-03-19 1992-09-23 Matsushita Electric Industrial Co., Ltd. Route selection method and apparatus therefor
WO1993005492A1 (en) * 1991-08-28 1993-03-18 Anagnostopoulos A Panagiotis Method for automatic routing, navigation, protection and guidance for vehicle drivers
US5410485A (en) * 1992-10-22 1995-04-25 Alpine Electronics, Inc. Navigation apparatus and method for exploring an optimal route based on characteristics of an exploration object zone
US5684704A (en) * 1995-01-20 1997-11-04 Mitsubishi Denki Kabushiki Kaisha In-car navigation apparatus
US5974419A (en) * 1996-10-25 1999-10-26 Navigation Technologies Corporation Parcelization of geographic data for storage and use in a navigation application

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0504854A1 (en) * 1991-03-19 1992-09-23 Matsushita Electric Industrial Co., Ltd. Route selection method and apparatus therefor
WO1993005492A1 (en) * 1991-08-28 1993-03-18 Anagnostopoulos A Panagiotis Method for automatic routing, navigation, protection and guidance for vehicle drivers
US5410485A (en) * 1992-10-22 1995-04-25 Alpine Electronics, Inc. Navigation apparatus and method for exploring an optimal route based on characteristics of an exploration object zone
US5684704A (en) * 1995-01-20 1997-11-04 Mitsubishi Denki Kabushiki Kaisha In-car navigation apparatus
US5974419A (en) * 1996-10-25 1999-10-26 Navigation Technologies Corporation Parcelization of geographic data for storage and use in a navigation application

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE102004044968A1 (en) * 2004-09-16 2006-04-06 Siemens Ag Navigation system and method for determining a route

Also Published As

Publication number Publication date
NL1019606C2 (en) 2003-06-20
AU2002353664A1 (en) 2003-06-30

Similar Documents

Publication Publication Date Title
CN103512577B (en) Map updating system
CN100397043C (en) Single or multi-path map matching device for navigation service and its method
CN103090876B (en) The method of navigational route database, its content of structuring, update method and navigator
EP0689034B1 (en) Method for identifying highway access ramps for route calculation in a vehicle navigation system
JP4121157B2 (en) Vehicle navigation system
EP1909068B1 (en) Map data distribution system
US6687611B1 (en) Method for coding and decoding objects in a road traffic network
US11320275B2 (en) Method for producing alternative route suggestions
CN100578152C (en) Heuristic path culculating method for treating large scale floating vehicle data
CN101089560B (en) Optimum route determination employing an estimation function
US6314360B1 (en) Process and apparatus for transmitting route information and analyzing a traffic network in a vehicular navigation system
US20130204528A1 (en) Route Guidance System, Route Guidance Server Apparatus and Navigation Terminal Apparatus
US9677904B2 (en) Generating travel time data
JPH09218047A (en) Route calculator for vehicle
US20020128773A1 (en) Multiple navigation routes based on user preferences and real time parameters
EP0955520B1 (en) Route searching device
CN1380622A (en) Method for operating automatic trade information system
CN101514904A (en) Position information transmitting and receiving, and target road segment identifying method and device
JPH11345247A (en) Aggregation of segment in geographic database and method for using the same for navigation application
JP2013508692A (en) Additional map generation, refinement and expansion using GPS trajectories
US7162363B2 (en) Travel route mapping
JP3386816B2 (en) A system that combines elements into complex junctions and links in a road network representation for vehicles.
Bodin et al. A detailed description of a computer system for the routing and scheduling of street sweepers
JP2004126036A (en) Distribution map data structure, distribution map data preparation method, distribution map data preparation device, and terminal equipment
US20090222198A1 (en) Method of determining a route as a function of the sinuosity index

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ OM PH PL PT RO RU SD SE SG SK SL TJ TM TN TR TT TZ UA UG US UZ VN YU ZA ZM ZW

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR IE IT LU MC NL PT SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
122 Ep: pct application non-entry in european phase
NENP Non-entry into the national phase

Ref country code: JP

WWW Wipo information: withdrawn in national office

Country of ref document: JP