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/38—Electronic maps specially adapted for navigation; Updating thereof
  • G01C21/3804—Creation or updating of map data
  • G01C21/3807—Creation or updating of map data characterised by the type of data
  • G01C21/3811—Point data, e.g. Point of Interest [POI]

Definitions

• the present invention relates to a method for establishing relations or points of proximity for a digital road network system making it possible to identify the neighborhood point situated closest to a given intersection and to create a link between the data corresponding to this intersection and those of this point of neighborhood.
• the neighborhood relationships thus established can be used to supplement the guidance information used to produce routes for users of road networks or other types.
• the cartographer provided, from a paper map, the proximity data of a given municipality in relation to the surrounding road network.
• some databases of digital road networks still include such indications.
• the maintenance of such data because of the extension of the built-up areas and / or the modification of the road network, is very tedious and very expensive.
• current data sources mostly on a large scale (ie a scale with a high level of detail), do not include such indications. Given the enormous size that this would represent, given the number of objects in the current road databases, it is unimaginable to manually update or update these databases in order to provide them with proximity data.
• most bases do not contain any indications relating to the environment, in particular concerning the proximity or the vicinity of places easily visible or locatable on the route of a route, during its actual realization.
• indications are very useful for allowing the user to make the link between the route map of a route, and what he sees or sees when he drives his vehicle to make the route.
• Such proximity indications may also be useful as progress markers along a route.
• the present invention provides a method for establishing neighborhood points for a digital road network system stored on a storage medium and comprising a plurality of sections and positioning indications of these sections, said sections being capable of to be arranged in a reconstruction of a road network so as to form portions of roads and intersections, in which, in order to link a given point of neighborhood to a given intersection: (a) the class of said intersection is established (CC) ; (b) it is checked whether the class (CC) of this junction is greater than a threshold for taking into account the given junction (CCPC);
• Such a method can make it possible either to constitute a new database of a digital road network, by creating, by a treatment carried out beforehand, data relating to indications of proximity or neighborhood on the entire network, or to create dynamically (on demand) such indications, for example during the establishment of a given route to return them in the waybill.
• a mixed mode in which, for certain sections (preferably the most used or busiest), the neighborhood indications are pre-established, and for the other sections (preferably the less traveled or less busy), neighborhood indications are established on demand, for example when establishing a given route.
• the threshold (SPV) depends on the class (CC) of the intersection so that the higher the class, the higher the threshold (SPV). In other words, the larger the junction, the higher the neighborhood point (PV) must be.
• the maximum radiation of a neighborhood point depends, on the one hand, on the milestone of this point, and on the other hand on the class (CC), so that for a value of class (CC), the higher the neighbor point (PV) milestone, the higher the maximum radiation increases, and for a given neighborhood point (PV) milestone, the higher the class (CC), the higher the maximum radiation increases .
• the larger the crossroads the closer the neighborhood point (PV) can be.
• the class of a junction is the average of the classes of the three main sections.
• the class of a junction may also correspond to the average of all the sections of this junction, or to the average of the two main sections, or more simply to the class of the main section.
• the network also comprises nodes, allowing, in a representation of the road network, to join together a plurality of sections.
• a neighborhood is a locality (city, village, town, ...) and its milestone is established according to the importance, judged from the population, administrative rank and resources (hotel, tourist) of the said locality.
• a neighborhood can also be a tourist site, a geological or archaeological site, a monument or remarkable building, or any other easily identifiable landmark during a trip on a road axis, likely to the user to navigate with minimal risk of error.
• the invention also provides software comprising code elements programmed for the implementation of the method according to one of claims 1 to 6, when said software is loaded into a computer system and executed by said computer system.
• This software may be in the form of a product recorded on a computer-readable medium, comprising code elements programmed as stated above.
• the invention furthermore provides a method of establishing a route map sheet, intended to establish a list of instructions enabling a user to navigate a route on the basis of the indications provided by this list. , in which the instructions relating to the changes of direction to be made at the intersections are completed by neighborhood points of this intersection, the neighborhood points (PV) being established using the previously stated method.
• the points making it possible to establish said route are identified by selecting a first road network modeling element, preferably a node, close to the starting point, and a second road network modeling element, preferably a road network modeling element. node, near the arrival point, identifying a plurality of routes, each consisting of a plurality of road elements connected from the first element to the second element, and searching for at least one intermediate element for each of said roads in said set road network modeling elements.
• said plurality of routes is determined from a DIJKSTRA algorithm.
• said plurality of routes is determined from a FORD algorithm.
• the invention also provides software comprising code elements programmed for the implementation of the previously stated method, when said software is loaded into a computer system and executed by said computer system.
• This software may be in the form of a product recorded on a computer-readable medium, comprising code elements programmed as stated above.
• the invention finally provides a route calculation device, comprising:
• a data entry unit intended to receive data associated with a starting point and those associated with an end point
• a computing unit arranged for
• said device makes it possible in particular to produce and arrange the data necessary for the establishment of a waybill by including at least one neighborhood point (PV) in association with at least one intersection.
• PV neighborhood point
• Said device preferably comprises a guide unit, arranged to generate guidance information according to the map elements of the selected route.
• the invention also provides a computer system comprising a device as previously stated in the foregoing. All the details of embodiment are given in the description which follows, supplemented by FIGS. 1 to 4 where:
• FIGS. 1 and 2 show examples of waybills for a route from Courpière to Riom: the waybill of FIG. 1 does not include any indication of neighborhood whereas the waybill of FIG. neighborhood (near Thiers and near Maringues).
• FIGS. 3 and 4 illustrate portions of the route corresponding to the waybill of FIG. 2: FIG. 3 shows a point of proximity near Thiers; Figure 4 shows the one near Maringues.
• a “node” is a point of intersection between a first map or road network element (or other network) and a second element of such a network, in particular the intersection between a plurality of roadways.
• a node also designates a point of physical or qualitative change of a section, as for example a passage from two to three lanes, a change of the speed limit, a zone (even temporary) being the subject of work, a point breaking like a boundary, etc.
• section refers to a portion of a track between two nodes.
• Crossroads is an intersection of several roads at the same level.
• a "route” is a subset of points derived from the modeling elements of a road network, creating a link between data in such a way as to enable them to model or represent a route or route on the road network that connects a road network. starting point and a point of arrival. This subset consists of the data relating to the sections connecting departure and arrival. Data relating to sections refers to the identifications, the lengths of the sections and the spatial coordinates.
• This subset may be used to represent said route in different forms, for example by means of a graphic representation, preferably in the form of a map comprising the starting point, the arrival point, and the sections forming said route, or in the form of a "waybill" or list of instructions, comprising an enumeration or sequence of written instructions or pictograms, explaining to a possible driver of a vehicle, the various steps to follow to make said route.
• a graphic representation preferably in the form of a map comprising the starting point, the arrival point, and the sections forming said route
• a "waybill" or list of instructions comprising an enumeration or sequence of written instructions or pictograms
• the neighborhood is a close relationship between a crossroads and a locality. This relationship is advantageously used as part of a route description for:
• the neighborhoods apply to all portions of the route that are in a rural area (that is to say that are not located in the urban area of a locality). It is conceivable that the name of the locality to be quoted must be chosen with care. It is not necessarily a question of the locality on the territory of which one is: for example, another locality can be, physically, closer, and therefore more relevant to quote.
• intersections are considered as "interesting intersections" (if not real, case number 3): -all intersections (intersection of several roads: at least 3 road segments converge at this point), in the commonly accepted sense of at least four sections of all sizes, provided that at least three of them are of sufficient importance.
• road sections that are closed to traffic should not be considered: those in pedestrian areas are eliminated because of their small size, but they are of higher importance and should not be taken into account (for example: communications between highway pavement prohibited to traffic in normal use).
• -the intersections in the commonly accepted sense, having exactly three sections of sufficient importance, except in the case of a doubling of the road surface. Duplication is characterized by the passage of a two-way stretch to / from two sections in one direction, the three having the same importance.
• class The importance, called class, of an intersection is judged by the importance of all the sections that converge there, and not only that of the most important road: all the intersections of the national road 4 (which leads from Paris to France) are not of the same class and therefore do not deserve the same treatment.
• the maximum radiation of a locality is proportional to its importance.
• the radiation can be either "bird's eye” (the fastest to calculate, but probably the least relevant), or calculated by road, according to a time or km criterion.
• the km criterion makes it possible to reduce certain aberrations likely to occur in "bird's eye” mode.
• the proximity calculation is made from the urban boundary if it exists and, in the absence of an urban area, from the center of the locality. In the latter case, the absolute limits must be increased. When the urban area extends beyond administrative boundaries, the spread calculation is based on administrative boundaries. Examples of absolute limits proposed:
• FIGS. 1 to 4 are examples of roadmaps for a route from Courpière to Riom.
• the waybill of Figure 1 is made in a conventional manner, and does not include a neighborhood indication.
• the waybill of Figure 2 is made according to the invention and has two indications of neighborhood (near Thiers and near Maringues).
• Figure 3 shows a portion of this route (identified by a series of lines perpendicular to the road) when passing near Thiers. It is also this city which constitutes the neighborhood point # 1 of this route. Indeed, well before the junction to take the N89, the driver can easily see and identify Thiers which he addresses the suburbs. It is likely that the local signage will allow him to guess the name of this city, even if he does not know it.
• Figure 4 shows the neighborhood near Maringues. The portion of the route present in this figure is indicated in dark line. Before reaching the roundabout, the driver sees the town of Maringues in front of him and on his left. It can therefore once again better anticipate the instruction or next step at the roundabout.
• the presence of neighborhood points on the waybill on the one hand, and on the routes of routes on the other hand, is possible thanks to the method of establishing neighborhood points according to the invention.
• the digital network database includes neighborhood points that can generate such route sheets and tracks.
• All neighborhood points are stored in association or association with one or more intersections.
• this point when it comprises a junction linked to a point of vicinity, this point is likely to be used. It is used to generate, on a waybill, an indication of the type "near-neighborhood-point". The route of this route can then display the selected neighborhood point.
• the neighborhood indications are used in particular according to the following conditions:
• the neighborhood point cited is important as such: the choice to quote it or not can then be according to the length of the route. According to this criterion, one is all the more demanding on the importance of the point of neighborhood that the route is large, not to overload the route unnecessarily. In the latter case of Figure, the neighborhood points then have a progress marker function along the route.

Landscapes

• Engineering & Computer Science (AREA)
• Radar, Positioning & Navigation (AREA)
• Remote Sensing (AREA)
• Automation & Control Theory (AREA)
• Physics & Mathematics (AREA)
• General Physics & Mathematics (AREA)
• Traffic Control Systems (AREA)
• Mobile Radio Communication Systems (AREA)
• Navigation (AREA)

Applications Claiming Priority (2)

Publications (1)

Family

ID=34949954

Family Applications (1)

Country Status (3)

Families Citing this family (13)

Family Cites Families (15)

• 2005
  • 2005-10-13 WO PCT/EP2005/011006 patent/WO2006042688A2/fr active Application Filing
  • 2005-10-13 US US11/665,652 patent/US20080195307A1/en not_active Abandoned
  • 2005-10-13 EP EP05793642A patent/EP1805671A2/de not_active Withdrawn

Non-Patent Citations (1)

Also Published As

Similar Documents

Legal Events