EP2288872A1 - Procédé et dispositif de calcul d'un itinéraire de navigation vers des points cibles contigus - Google Patents

Procédé et dispositif de calcul d'un itinéraire de navigation vers des points cibles contigus

Info

Publication number
EP2288872A1
EP2288872A1 EP09761325A EP09761325A EP2288872A1 EP 2288872 A1 EP2288872 A1 EP 2288872A1 EP 09761325 A EP09761325 A EP 09761325A EP 09761325 A EP09761325 A EP 09761325A EP 2288872 A1 EP2288872 A1 EP 2288872A1
Authority
EP
European Patent Office
Prior art keywords
poi
pois
route
category
target
Prior art date
Legal status (The legal status 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 status listed.)
Withdrawn
Application number
EP09761325A
Other languages
German (de)
English (en)
Inventor
K.C. Dayananda
Richard Malingkas
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Garmin Wurzburg GmbH
Original Assignee
Navigon AG
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 Navigon AG filed Critical Navigon AG
Publication of EP2288872A1 publication Critical patent/EP2288872A1/fr
Withdrawn legal-status Critical Current

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/3453—Special cost functions, i.e. other than distance or default speed limit of road segments
    • G01C21/3476—Special cost functions, i.e. other than distance or default speed limit of road segments using point of interest [POI] information, e.g. a route passing visible POIs

Definitions

  • the invention relates to a method for calculating a navigation route to connected destination points of different POI categories (Points of Interest).
  • the invention relates to a device for carrying out the navigation method according to the invention.
  • POIs Points of Interest
  • places points
  • interest special characteristics or special functions
  • POIs such as petrol stations, restaurants, amusement parks, banks, etc.
  • clusters ie accumulations of POIs in coherent spatial Neighborhoods that meet different requirements and are thus assigned to different POI categories, for example a collection of a gas station with a restaurant, and it is desirable that the navigation procedure be as short as possible
  • a so-called “combined goal” is therefore a cluster of POIs that is considered as one entity and comprises POIs of different POI categories, so a combined goal comprises at least two POIs defined as addresses or as different POI categories It is desirable if the POIs of a combined destination have an optimal distance from each other and have an optimal distance to the current vehicle position or to a reference location, where as “optimal” different boundary conditions to the route, such as shortest travel distance, shortest travel time, preference for secondary lines or Highways, etc., should be specified.
  • the user goes through a multi-level POI category menu and chooses a specific category with the aim of obtaining a list of POIs of that category. From this list, the user can select one of the POIs as the route destination. This process is repeated for each POI of a combined destination, ie for each POI of a POI destination category.
  • a user who needs both a restaurant and a gas station at the same time for example, must start two separate navigation requests that result in two separate routes.
  • the POI of the first category of destination, the selected restaurant is far removed from the POI of the second category, the filling station, which translates into a high driving distance or an increased travel time between the individual POIs.
  • the navigation methods known from the prior art do not give the user the possibility of entering a POI of a first target category and a POI of a second target category, so that a combined route is found which is the optimum distance starting from the start position to the first and the second POI calculated close to the starting position.
  • a user has hitherto been no way for a user to make only one step in a destination input to cause the calculation of a route to two POIs of two different destination categories.
  • the known from the prior art POI relationships are only accidentally or rarely used and do not cover all neighborhood relationships, such as a restaurant opposite a central station.
  • US 2005/0177303 A1 discloses a method for finding a cluster of POIs of a single target category. For example, it is proposed to search a spatial area for a specific POI target category and display its distribution as a distribution matrix so that a desired POI of a single POI target category can be found quickly. However, the Dl does not teach to create a route to linked POIs of different target categories.
  • US 2005/0187707 A1 discloses a method which calculates an optimized route to two or more nearby POIs of different POI target categories starting from a starting position.
  • US Pat. No. 7,082,365 B2 describes a method for determining POIs in spatial proximity to the position of a vehicle. For this purpose, advanced information on POIs of a specific target category that are located nearby can be displayed. Furthermore, EP 1 174 685 A1 discloses a method and a device for the combined search of POIs of a target category in spatially adjacent areas. Finally, EP 1 703 257 A1 describes a navigation method that is able to find POIs based on a starting position in a specific spatial area and adjacent areas. From all the above documents, however, no method emerges that can optimally calculate a combined route to POIs of different target categories.
  • US Pat. No. 6,983,203 B1 discloses, in the context of combined objectives, the characterization of clusters of POIs by special icons, ie icons, which comprise a collection of POIs of different target categories, for example combined restaurants and filling stations, combined parking lots and toilets etc. , to mark.
  • special icons ie icons
  • the prior art methods do not allow selection of multiple POIs of different target categories in a single query at the same time.
  • the conventional methods do not always allow the finding of an "optimal" route, ie a route between a starting position and a contiguous number of POIs of different target categories, selected according to an optimization criterion such as shortest travel time, shortest distance, preferred road type, etc. is determined.
  • the prior art presents the problem of finding two closely located POIs of different target categories, the route being optimally calculated from a starting position to find POIs of different target categories located at a reference position.
  • the method according to the invention for calculating a navigation route to connected target points comprises the steps:
  • th category leads near the reference position, wherein the determination and route calculation is determined under a pre-definable optimization criterion.
  • the method according to the invention is characterized in that the optimized POI determination and route calculation uses at least one information item assigned to each POI of a destination category and stored in advance, which contains information about at least one nearby POI of another destination category.
  • the method is based on the determination of a route between POIs of different destination categories, whereby information of each POI about nearby POIs of other destination categories is used to determine the route and the location of the individual POIs.
  • the method obtains the ability to find a plurality of POIs in direct proximity to each other, i. So that the complexity of the use of the navigation system is reduced, since only a request for approaching POIs of different target categories must be made.
  • the method enables a minimization of the breakpoints to be approached by a user.
  • the method allows the user to save time and money by driving an optimal route that meets multiple requirements (e.g., food and gas station) simultaneously.
  • the method is given a start position, for example the current vehicle position, in particular via a GPS position determination, or a desired starting point of the route as entered address, zip code, district, place name or the like or by selecting or entering an excellent POI.
  • a start position for example the current vehicle position, in particular via a GPS position determination, or a desired starting point of the route as entered address, zip code, district, place name or the like or by selecting or entering an excellent POI.
  • the method is informed in the same way of a reference position, in the spatial proximity of which are to be found the POIs.
  • the reference position will be identical to the starting position, so that POIs close to the starting position are searched for under the search criterion shortest airline (radius search). or shortest distance (shortest route) can be found.
  • the reference position may also be selected differently from the starting position by selecting an address, postal code, district or place name, etc., or by selecting an excellent POI.
  • POIs are selected by defining a POI target category and / or, for example, an address specification.
  • the task is to determine a close spatial relationship between POIs of the POI cluster in order to calculate an optimal route.
  • POIs are found at a remote reference position, whereby the reference position can itself be a POI.
  • the reference position can itself be a POI.
  • route planning from the current vehicle location (starting position) to an ATM (POI of a first destination category) in a specific district (reference position) is subject to the constraint of a nearby shopping center
  • a plurality of reference positions can be selected in the context of the method according to the invention so that POIs of the first and / or second target category can be found in spatial proximity of a first and / or a second reference position.
  • the invention is based on a route planning to one or more destinations in the vicinity of one or more reference positions and includes a radius search for POIs of certain other POI destinations. categories starting from the reference position, for example a preselected POI of a POI target category or an address, a district, etc .; This process is called determining the POIs and finds spatially adjacent POIs.
  • the method according to the invention proposes improved indexing of POI information, in order in particular to be able to store conventional POI combinations with the least possible memory overhead, and enables an improved route planning technique, for example by using routing threads (multiple simultaneous routing method queries), which allows fast locating of multiple targets.
  • a finding of POIs associated with two or more POI categories is possible, so that a single POI is simultaneously a destination POI of the first and the second POI destination category.
  • the method would find a single POI that fulfills the function of the first and second POI target category. For example, finding a restaurant at the port may serve as an example, with this destination being assigned to both the POI category "Restaurant" and the destination category "Port”. Entering these two target categories would therefore find at least one restaurant at the port, in addition to restaurants that are located near a port.
  • the POI "car rental” also meets the POI "airport". Equivalent to this is the finding of a POI under the boundary condition of the spatial proximity to another POI (be it that the other POI has been selected as the reference position or that the POI belongs to another POI target category).
  • An example is the search query for the route planning of a "restaurant” on "Lake Starnberg", whereby Lake Starnberg was selected as the POI reference location.
  • the route calculation calculates a route to a POI of a first destination category under the boundary condition of spatial proximity to a POI of a second POI destination category.
  • a route request for finding a restaurant (POI of a first target category) in the vicinity of a lake (POI of a second target category and boundary condition) in Greater Kunststoff can be answered as reference position by the inventive method.
  • a POI of the second target category has to be approached by the found route, the route leads only to a POI of the first target category, but its boundary is determined by the spatial proximity to a POI of the second target category.
  • a target position is defined in addition to a reference position and an implicit start position, the calculated route leading from the start position over the specific POIs in the vicinity of the reference position of the individual target categories to the target position.
  • the search for the desired categories corresponding POI clusters instead of the starting position in the.
  • the type of search is arbitrary, in addition to the radius search, as it is advantageous to the reference position, a search of POIs within the desired municipality to the entered place name is advantageous, as a filtering of the desired destination POIs is easily possible.
  • an optimization criterion for planning the route desired according to the above-mentioned list can be used to adapt the route planning to the wishes of the user.
  • an optimization criterion relates only to a partial route, in particular the route between the individual POIs of the different destination categories, the route between the starting point to the first POI to be approached or the route between the last approaching POI and the destination position. This makes it possible that only on individual sub-routes an optimization criterion is followed.
  • the order of the POIs to be approached is arbitrary, so that first a POI of a first target category, then a POI of a further category is approached, without the user having any influence on the order, and this is only influenced by the preset optimization criterion.
  • constellations arise in which a prioritization of the approaching POI target category is desirable, so that, for example, first refueled and then a restaurant should be searched. It is also possible to search for a toilet as quickly as possible and then search for a tourist information center.
  • the definitions tion of the set of POI target categories includes a prioritization of POI target categories
  • the POI determination and / or the route calculation takes into account the prioritization of the POI categories to determine the order of the POIs to be approached.
  • the order of the POI destination categories to be approached can be defined in the route sequence, so that a cardialization of the POI destination requests becomes possible.
  • the POI determination and / or the route calculation summarizes the POIs of the defined POI categories assigned to a route as a combined destination and provides the user with additional information about the estimated travel time, driving distance, etc. of a route the combined goal, ie to the totality of the POIs of the different target categories.
  • the selection of individual POI target categories according to this embodiment enables the definition of a combined target, for example a commonly used combination of ATM, gas station and restaurant.
  • combined targets can be defined as "templates" so that they can be retrieved, for example, in a simple POI cluster template as a stored combined target for which the best possible route is to be calculated.
  • a selection list of combined destinations according to prioritization criteria, such as estimated travel time, shortest travel distance, closer specification of a destination category, etc. in a further development of the method according to the invention. For example, if several combined goals "gas station ATM" found, so they can be listed in a selection list in terms of distance or travel time, so that a user can easily and easily select from them to his
  • the calculation of the route between the individual POIs of different target categories can basically be carried out arbitrarily.
  • within the framework of the POI within the framework of the POI
  • Determination and / or the route calculation created a graph network of all eligible POIs the defined target groups and set within the graph an underlying the optimization criterion route from the start position on the plurality of POIs of the different target categories in the vicinity of the reference position.
  • the establishment of the graph network of candidate POIs of the selected POI target categories in spatial proximity to the reference position is here considered to be a determination of the POIs. Consequently, by means of a graph network, all POIs of all selected POI target categories lying near the reference position are networked with each other by means of available road courses, by means of a graph which adheres to the presettable optimization criteria, a path through the graph network is sought which optimally matches the POIs of the different target categories "connects with each other.
  • the graph can be searched for any algorithm.
  • a Bellmann Ford Algorithm or algorithm of Floyd and Warshall conceivable.
  • the application of a Dijkstra algorithm has proved to be particularly advantageous, which can optionally be extended to an A * algorithm.
  • This class of graph algorithms allows for efficient, optimizable criteria graph search within a graphing network to find an optimal route.
  • the goal of a Dijkstra algorithm is to find the shortest path connecting the POIs of the different categories.
  • Spatial positions of the POIs are set as vertices (vertices) and thus are nodes of the graph.
  • the straight-line between the vertices and optionally additional costs are used as the weight of the edge from one node to another.
  • the search of the nodes within the graph is started from the reference location (probably the current vehicle position) and moves from there to all directions of the graph.
  • a shortest route between the two nodes can be used as edge, whereby this variant requires a corresponding computing power of the system. This allows a request to be made to a database for geographically located POIs from a reference position.
  • the POI result list creates nodes for the network.
  • airline distances between the candidate POIs are taken into account as optimization criteria for the POI determination and / or the route calculation by means of the graph network.
  • shortest road routes between candidate POIs it is quite conceivable to use shortest road routes between candidate POIs as an optimization criterion.
  • the method according to the invention proposes that at least one information item associated with each POI of a target category is used about spatially nearby POIs of other target categories for route calculation and POI determination.
  • pre-stored information of POIs of one target category about nearby POIs of another target category comprise information about a combination of several spatially proximate POIs, these POIs originating from different POI target categories.
  • information about a frequently requested category combination for example "gas station and restaurant”, “gas station and toilet”, “shopping center and ATM” or comparable such combinations, can be assigned to each POI of a respective other POI category
  • such combined information can also be dynamically created and assigned to the POIs over time by means of experience-based software, for example, in the event of frequent demand, the POI may be dynamically generated -Combination "ATM station" Any POIs that are not ATMs or gas stations will be assigned information about nearby ATMs and gas stations as part of data maintenance operations.
  • the nodes of the graph network are identified, spatially adjacent nodes that represent POIs of other target categories can be found by means of the additional information.
  • the previously stored information of each POI of one target group is stored in bit-coded fashion via nearby POIs of other target categories. If this information is stored by means of a bit marker index, the nearby POIs can be incorporated into the graph network very quickly and in a memory-efficient manner.
  • a graph network has been created, all possible paths will be from the reference position (in most cases identical to the Start position) to the potential result POIs while searching in graphs. Each path is incrementally built with the goal that each POI for a given category exists at least once, but is found regardless of the order.
  • the found paths represent a shortest path tree (SPT) and are evaluated according to an optimization criterion, whereby the path with the lowest weight is selected as the "shortest path" and thus as the end result All POIs, the nodes of the The said POIs within the combined destination are stored according to the shortest path and thereby correspond to the optimization criterion of the shortest path distance, using known methods for calculating a route to a plurality of predetermined destinations. so-called Traveling Salesman problems, which can be used to improve the route planning algorithm.
  • SPT shortest path tree
  • the POI determination and / or the route calculation comprises a recursive POI search based on a found POI of a destination category for locating a POI of another destination category.
  • a recursive POI search based on a found POI of a destination category for locating a POI of another destination category.
  • the invention further relates to a navigation device for carrying out a method according to one of the preceding claims.
  • the navigation device comprises an input device for inputting a start position, in particular a GPS-determined current vehicle position, a reference position in the vicinity of which the sought-after POIs are to be located, and for defining a set of target categories of POIs; a POI determination and route calculation device for determining POIs of the target categories and calculating a route from the start position to the determined POIs of the individual target categories in the vicinity of the reference position; and output means for outputting the route and information regarding the particular POIs.
  • the navigation device is characterized in that it comprises a POI category storage unit in which information for at least one POI category can be stored pointing to nearby POIs of at least one further POI category.
  • the navigation device comprises a POI category storage unit in which with respect to each POI information relating to spatially nearby POIs of other POI categories can be stored, so that in the context of a request of a combined destination, the corresponding spatially nearby POIs the other requested target categories can be found as quickly as possible.
  • This information can include the exact spatial location of the other POIs, but also additional information about usage details for the POI, such as in the case of restaurants about the available food offer, opening hours, telephone number, etc.
  • a bit index list or one or more ID lists of all nearby gas station POIs could be maintained for all restaurant POIs, and vice versa.
  • the POI determination and route calculation device comprises an optimization unit which can perform an optimization of the POI determination and / or route calculation, in particular of a partial route calculation on the basis of optimization criteria that can be set in advance. Accordingly, the optimization unit undertakes an optimization of the route calculation either between the individual POIs of the different destination categories or between start position and first POI or last POI to be approached in the vicinity of the reference position and a destination position.
  • the input device and the POI determination and route calculation device comprise at least parts of a prioritization unit which makes it possible to prioritize POI target categories for determining the starting order of POIs of different destination categories for the route calculation.
  • a cardinalized prioritization of the approached POIs of the individual POI categories can be defined, so that first of all a most wanted POI is approached, and thereafter a POI of a second most urgently desired POI target category, etc.
  • the input device, the POI determination and route calculation device and / or the output device comprise at least parts of a combined destination unit which is designed to combine certain POIs of all defined destination categories of a POI determination as a combined destination issue.
  • combined destinations such as "gas station restaurant” or "bank vending machine shopping center”
  • the route planning is jointly stored and processed, as well as in the output device a combined goal can be summarized. This allows a simplified handling of such in the case of particularly frequent POI target category clusters Combined goals and forms the basis for a template system of combined goals.
  • the input device comprises a selection unit for selecting a combined destination from a selection list of combined destinations. For example, for frequently selected combined targets, these can be included in a list that can be made available to the user as a "combined target template".
  • the POI determination and route calculation device advantageously comprises a graph network analysis unit which is designed to create a network graph between a plurality of POIs of the same and different destination categories and an optimized path from the start position to a plurality of POIs of different destination categories near the reference position.
  • the graphene network analysis unit can advantageously be based on a Dijkstra algorithm.
  • the POI category storage unit comprises a binary storage unit that can store binary attributes relating to each POI via neighborhood relationships to spatially adjacent POIs of other destination categories, in particular POIs of combinations of destination categories.
  • a bit marker may be stored for each POI, indicating, for example, the proximity of a gas station POI at a restaurant POI.
  • a bit marker can be set memory efficient for all common combinations of categories.
  • the position of the nearby eg gas station POI can then be carried out by a runtime search in a smaller radius around the restaurant POI, so that the bit marker only gives an indirect indication of the POI of the other destination category. This is a compromise between runtime and card storage space.
  • a single byte per POI can thus define up to eight neighboring categories for each category, although it may also make sense to define the same category as a potential neighboring category.
  • This information of each POI about neighboring POIs of other target categories may be pre-stored in the map data and thus prepared "factory-made.”
  • a dynamic creation of the neighborhood information is conceivable, for example, in the context of an evolutionary process, during the POI category combinations frequently requested by the user in the past as neighborhood information of the corresponding POIs as part of a data maintenance process.
  • a typical user interface of a navigation system has to be revised in order to allow a selection of several POI categories at the same time.
  • a button in order to be able to select an additional POI of a further POI category in the course of route planning for a POI of a specific destination category.
  • FIG. 1a shows an exemplary embodiment of a graph network of spatially adjacent POIs of different target categories
  • FIG. 1b shows an embodiment of a bit marker index as stored information of each POI about spatially adjacent POIs of other target categories
  • FIG. 1b shows an embodiment of a bit marker index as stored information of each POI about spatially adjacent POIs of other target categories
  • FIG. 2 shows an embodiment of a user interface of a navigation device for carrying out an inventive device
  • Fig. 3 shows another user interface of an embodiment of a
  • FIG. 4 is a construction diagram of an embodiment of a navigation device according to the invention.
  • a query can be made after the POI category "gas station” and "restaurant” are selected.
  • the query processing comprises an area search around a reference position, usually the start position, ie current GPS position of the vehicle, or an entered address / postal code / district etc., for all POIs of the corresponding categories within a predefinable distance limit.
  • the resulting POIs are used to create a Graph Network of Shortest Path Tree (SPT), as discussed earlier.
  • SPT Shortest Path Tree
  • the generated shortest path tree can now be searched for the shortest route in terms of distance by providing an optimized path through the Tree that links the POIs of the desired categories together.
  • Another scenario is when the restaurant is first selected and then the nearest gas station is to be visited.
  • the complexity of the query processing increases nonlinearly.
  • the proposed method according to the invention is able to solve this problem. It is irrelevant in which order the POI categories are specified, but it is possible to specify a prioritization of the individually approaching POIs of the various POI target groups.
  • FIG. 1 a shows a graph network which links spatially adjacent POIs of a first category 1 (POI 1), a second category 2 (POI 2) and a third category 3 (POI 3).
  • POI 1 first category 1
  • POI 2 second category 2
  • POI 3 third category 3
  • the two POIs, POI I a and POI Ib have been found for the target category POI 1.
  • POI 2a to POI 2c rectangle
  • POI 3 two POIs, POI 3 a and POI 3b (oval) have been found.
  • the graph network graphically illustrates the possible drivable routes between the reference position (ref) and the various POIs of the individual target categories.
  • the graph network is examined to find a route to POIs belonging to a plurality of categories.
  • the user asks for a route that passes the POIs of categories 1, 2 and 3.
  • a POI of category 1 is designated in Fig. 1 as POI Ix with x from ⁇ a, b, c ... ⁇ .
  • the order of reaching the POIs of certain given categories is not important.
  • a plurality of relevant POIs, which now belong to one of the various categories are selected as POI candidates.
  • routes are calculated that take into account the weights between the various POIs, taking into account the distance between the POIs, in particular the airline distance and / or other cost parameters.
  • bit markers for the most common category combinations can be provided and stored together with each POI.
  • An example of such bit-marker values is shown in FIG. 1b with reference to the example case shown in FIG. 1a.
  • the neighborhood relation is listed by way of example, which can be stored for these POIs in the so-called PS format (physical storage format).
  • PS format designates the individually specified format, which is optimized for both volume and access, in which map data is stored for a navigation application.
  • the POI 1a has the POIs 2a, 2b and 3b as immediately adjacent and directly approachable POIs.
  • a bit marker index for POI I a (POI I a bit index)
  • a reference to POI 2a, POI 3b and POI 2b is stored.
  • the neighboring POIs 3a, POI 3b, POI 1a and POI Ib are stored as directly approachable spatially adjacent POIs.
  • no information is stored for POIs of other categories, however, no information is stored.
  • FIGS. 2 and 3 show, by way of example, adaptations of the user interfaces of navigation devices to the method according to the invention to carry out.
  • 2 shows a familiar user interface 1 for the POI input for determining a destination of a route calculation.
  • the POI input screen of a Navigon Mobile Navigator 6.x will be displayed.
  • an entry of a street or house number and / or cross street is possible.
  • another POI category can be selected, for example, through a drop-down menu or drop-down list
  • a fuzzy search may be useful, for example, for the industries a business directory.
  • the new UI feature in this example is placed below the preselected category in FIG.
  • button 2 an additional category can be selected, or with button 3 the POI search for the entered category "restaurant” can be started
  • the user interface looks like in fig.
  • the second target category "Harbor” 4 has been added. With the selection shown, a restaurant near a port would be searched or a route selected, with a restaurant and a harbor on it, with the restaurant mainly located near the port.
  • the navigation device 05 comprises an input device 06 as well as a POI determination and route calculation device 07.
  • An the POI determination and route calculation device 07 is connected to a storage device 08, which comprises a POI storage unit 14, in which a POI category storage unit 15 is embedded.
  • the navigation device 05 comprises an output device 09 which can output a route to the POIs of different target groups and thereby comprises a combined destination output unit 18 for outputting a combined destination, for example a frequently used and popular group of POI destination categories ,
  • a prioritization input unit 10 serves to define an order of desired POI destination categories, so that a predetermined approach order of POIs of different destination categories can be set. Furthermore, the combined destination selection unit 1 1 makes it possible to combine several target categories into frequently desired combined target templates in order to be able to conveniently and easily plan a route to a group of POIs without a high interaction effort between the user and the navigation device.
  • the data of the input device 06 are forwarded to the POI determination and route calculation device 07.
  • This comprises a prioritization calculation unit 12, which orders the order of the POIs of the different POI target groups to be approached, and a graph network analysis unit 13, which can create a graph network of spatially adjacent POIs of different target groups.
  • an optimization unit 16 an optimized route is laid through the created graphics network or, using a combined destination calculation unit 17, an optimal route is created between a preset combined destination.
  • data are read from the card memory unit 08, in particular from the POI memory unit 14, the information about the location of the POIs of the individual Contains target categories.
  • the information stored in the POI category storage unit 15 serves to determine the neighborhood relationships between spatially adjacent POIs of different target groups. These neighborhood relationships can already be pre-stored when creating the map data.

Landscapes

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

Abstract

La présente invention concerne un procédé de calcul d'un itinéraire de navigation vers des points cibles POI (Points of Interest) contigus appartenant à des catégories cibles de POI différentes, le procédé comprenant les opérations suivantes : définition d'au moins une position de référence; définition d'une quantité d'au moins deux catégories cibles de POI, une première catégorie de POI et au moins une deuxième catégorie de POI étant tout d'abord sélectionnées; détermination des POI de la première et de la deuxième catégorie à proximité spatiale de la position de référence et calcul d'un itinéraire qui, en partant d'une position initiale, mène au moins à un POI de la première catégorie et/ou à un POI de la deuxième catégorie, la détermination et le calcul d'itinéraire s'effectuant selon un critère d'optimisation pouvant être préalablement établi. Le procédé de l'invention se caractérise en ce que la détermination de POI optimisée et le calcul d'itinéraire font appel à au moins un élément d'informations associé à chaque POI d'une catégorie cible et enregistré préalablement, qui contient des renseignements sur au moins un POI proche d'une autre catégorie cible. L'invention a également pour objet un dispositif de navigation pour mettre en oeuvre ledit procédé.
EP09761325A 2008-06-12 2009-06-10 Procédé et dispositif de calcul d'un itinéraire de navigation vers des points cibles contigus Withdrawn EP2288872A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE102008027961 2008-06-12
PCT/DE2009/000828 WO2009149704A1 (fr) 2008-06-12 2009-06-10 Procédé et dispositif de calcul d'un itinéraire de navigation vers des points cibles contigus

Publications (1)

Publication Number Publication Date
EP2288872A1 true EP2288872A1 (fr) 2011-03-02

Family

ID=41257247

Family Applications (1)

Application Number Title Priority Date Filing Date
EP09761325A Withdrawn EP2288872A1 (fr) 2008-06-12 2009-06-10 Procédé et dispositif de calcul d'un itinéraire de navigation vers des points cibles contigus

Country Status (3)

Country Link
EP (1) EP2288872A1 (fr)
DE (1) DE102009025039A1 (fr)
WO (1) WO2009149704A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2020012241A1 (fr) 2018-07-08 2020-01-16 Nng Software Developing And Commercial Llc. Procédé et appareil de navigation optimale vers de multiples emplacements

Families Citing this family (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE102010031078A1 (de) * 2010-07-07 2012-01-12 Bayerische Motoren Werke Aktiengesellschaft Navigationssystem
DE102013221630A1 (de) * 2013-10-24 2015-04-30 Volkswagen Aktiengesellschaft Ansteuereinrichtung und Verfahren zum Markieren einer Mehrzahl möglicher Ziele
CN106940189B (zh) * 2016-01-04 2020-12-18 阿里巴巴（中国）有限公司 导航系统中的经典线路获取方法、装置
DE102016003018A1 (de) 2016-03-12 2017-04-20 Audi Ag Navigationsvorrichtung und Verfahren zum Planen und Durchführen einer Tour
TR201901113A2 (tr) * 2019-01-24 2019-03-21 Maptriks Bilisim Teknolojileri Sanayi Ve Ticaret Anonim Sirketi Bi̇rbi̇ri̇ne yakin lokasyonlari tespi̇t eden bi̇r si̇stem
CN111861040B (zh) * 2020-07-31 2024-03-22 长沙理工大学 公交线路的优化调整方法及装置、设备、存储介质
CN112197779A (zh) * 2020-09-14 2021-01-08 汉海信息技术(上海)有限公司 导航路径规划方法、装置、打印设备
CN113175940B (zh) * 2021-04-26 2024-04-30 北京百度网讯科技有限公司 数据处理方法、装置、设备和存储介质
DE102023206655B3 (de) 2023-07-13 2024-10-24 Volkswagen Aktiengesellschaft Verfahren und Assistenzsystem zur aktivitätsbasierten Navigationsunterstützung und entsprechend eingerichtetes Kraftfahrzeug

Family Cites Families (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH10288533A (ja) 1997-04-11 1998-10-27 Alpine Electron Inc 車載用ナビゲーション装置の施設探索方法
EP1174685A1 (fr) 2000-07-19 2002-01-23 Visteon Global Technologies, Inc. Méthode et appareil pour proposer une région géographique lors d'une sélection de centre d'intéret
US6983203B1 (en) 2000-07-28 2006-01-03 Alpine Electronics, Inc. POI icon display method and navigation system
US7082365B2 (en) 2001-08-16 2006-07-25 Networks In Motion, Inc. Point of interest spatial rating search method and system
JP3899947B2 (ja) 2002-01-29 2007-03-28 マツダ株式会社 経路設定方法、ナビゲーション装置、並びにそれらのコンピュータ・プログラム
US7353109B2 (en) 2004-02-05 2008-04-01 Alpine Electronics, Inc. Display method and apparatus for navigation system for performing cluster search of objects
US7239960B2 (en) 2004-02-19 2007-07-03 Alpine Electronics, Inc. Navigation method and system for visiting multiple destinations by minimum number of stops
JP4135110B2 (ja) 2005-03-15 2008-08-20 ソニー株式会社 地点検索装置、検索方法

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See references of WO2009149704A1 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2020012241A1 (fr) 2018-07-08 2020-01-16 Nng Software Developing And Commercial Llc. Procédé et appareil de navigation optimale vers de multiples emplacements

Also Published As

Publication number Publication date
WO2009149704A1 (fr) 2009-12-17
DE102009025039A1 (de) 2009-12-17

Similar Documents

Publication Publication Date Title
WO2009149704A1 (fr) Procédé et dispositif de calcul d'un itinéraire de navigation vers des points cibles contigus
DE69934301T2 (de) Wegesuchsystem
DE69935184T2 (de) Verfahren und System zur Generierung einer Navigationsroute
DE69735387T2 (de) Vorrichtung zum Suchen einer Route
DE69736967T2 (de) Gerät zur Gewinnung von Strassennetzzonendaten aus den Blockdaten einer Strassennetzkarte, System zum Umformen dieser Daten und Darstellung einer umgeformten Karte und geographisches Informationssystem
DE69129892T2 (de) Vorrichtung für eine günstige Route-Auswahl
DE69515377T2 (de) Verfahren zum Identifizieren von Autobahnauffahrten für Routenberechnung in einem Fahrzeugnavigationssystem
DE69926435T2 (de) Routensuchvorrichtung
DE69526825T2 (de) Verfahren und System zur Routenauswahl
DE69925779T2 (de) Routensuchvorrichtung
DE60028143T2 (de) Verfahren zur Erzeugung einer durch ein Navigationssystem berechneten Vorschauroute
DE69633880T2 (de) Navigationssystem
DE60130054T2 (de) Verfahren und Vorrichtung zur Routenführung
DE69621400T2 (de) Informationsnavigationsgerät basierend auf einer Struktur-konfigurierten Karte
DE69729426T2 (de) Kartographisches Datenbankgerät
DE112004002635T5 (de) Routensuchverfahren für ein Navigationsgerät
DE10356695B4 (de) Navigationssystem
DE19928295A1 (de) Verfahren und Vorrichtung zum Bestimmen einer Route von einem Ausgangsort zu einem Zielort
DE102013217310A1 (de) Fahrzeugreichweitenprognose
EP2507589B1 (fr) Procédé pour simplifier une description d'un itinéraire routier
DE102008061981A1 (de) Navigationsgerät
DE112009005327T5 (de) Kartenzeichnungsvorrichtung
DE102015223656A1 (de) Fahrerassistenzsystem und -Verfahren zur Fahrspurempfehlung
EP3069103B1 (fr) Système de navigation et son procédé d'exploitation
DE102006057920B4 (de) Verfahren und Vorrichtung zum Steuern der Anzeige eines Navigationssystems in einem Modus, bei dem keine Route und kein Ziel eingegeben ist

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20101220

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO SE SI SK TR

AX Request for extension of the european patent

Extension state: AL BA RS

RIN1 Information on inventor provided before grant (corrected)

Inventor name: MALINGKAS, RICHARD

Inventor name: DAYANANDA, K.C.

DAX Request for extension of the european patent (deleted)
17Q First examination report despatched

Effective date: 20120222

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 20120704