Abstract: For the further development of an information processing system (navigation assistance), an allocated navigation system, and a method for processing data with regard to successive units, such as successive spatial and/or temporal route segments of a path, at least one information list having at least one information element being allocated to each unit, in such a way that data or information items that are equivalent per se, such as road names or road numbers of a path or a route, are weighted with regard to successive units, such as path segments or route segments, and especially so that no faulty data (travel recommendations) are output that irritate and/or disturb the user, it is provided that in at least one of the information lists at least one of the information elements is weighted while taking into consideration the relationship, as a function of the order, of the unit, to which this information list is allocated, to at least one of the further units.

Abstract: A display device is for displaying a travel route, the travel route including a chain of route elements, and each route element having a measured value and a quantity of attributes. The display device includes a partial chain ascertainer, a calculation unit, a sorter, and a display unit. For each attribute of at least one route element the partial chain ascertainer determines a continuous partial chain of route elements of maximum length, including the route element, that have an identical attribute. For each partial chain, the calculation unit calculates an individual total measured value from the measured values of the route elements of the partial chain.

Abstract: A method for creating a directory of road sections of a digital road map for a navigation system is provided. Furthermore, a method for ascertaining all road sections within a search area is provided. Moreover, a computer program for performing a method for creating a directory of road sections and a method for ascertaining all road sections within a search area is provided.

Abstract: A method for storing, in a navigation system, map data that represent traffic path segments, in particular for motor vehicles, is provided such that only map data within a corridor around a driving route are deposited in a memory of the navigation system. The map data within the corridor are selected before storage in the navigation system. In this manner, the method according to the present invention enables an enlarged geographical region (corridor) around a calculated driving route to be covered by the map data kept on hand in the device memory.

Abstract: A method is provided for displaying at least one hierarchically structured list having at least two levels, and a display unit for such a method is also provided, in which the user is offered an optimum overview in the display of hierarchically structured lists having at least two levels. In the display of one or more of the subordinate elements of the list, the respective superordinate element of the list associated with the subordinate element of the list is also always displayed.

Abstract: A method for ascertaining routes in a route network is provided, in which an optimal route to a target of a certain category can be determined. A route is calculated from a point of origin to an optimal target point from a plurality of spatially separated target points that are allocated to at least one directed segment and/or to at least one node. The method includes defining the target points from entries of addresses, map targets, target memory entries given by an index of a given category, such as, for instance, post office, gas stations. The respective route to the target point is optimized as a sequence of the directed segments having nodes situated between the directed segments such that the sum of all resistances of the sequence to the respective target point becomes a minimum. A list of the respective routes to the respective target point is then drawn up.

Abstract: A method for automatically calculating optimum routes in a traffic-route network is provided, taking into consideration at least one set, fixed route section, where the traffic-route network is described by segments for traffic-route sections, weighted with a resistance, and nodes for the intersection points of traffic-route sections, and the route to be calculated runs from a starting segment to a destination segment, and where, for purposes of optimization, the segments from the destination segment to the starting segment are evaluated with respect to the best resistance. The route is optimized, in each instance, from a starting segment up to the fixed route sections, at the fixed route sections, and from the fixed route section up to a destination segment.

Abstract: The method calculates by means of a navigation device an optimized route to a final destination, which is constrained to pass through at least one transition region of a real road network. Each transition region corresponds to a surface region of a stored digital map, which represents the road network with segments having resistances and nodes. The location and extent of each surface region are defined by a user of the navigation device. Relevant segments are stored in a via area list (VAL) in the navigation device. Route segments are optimized in the navigation device by a route-searching algorithm and are stored in route tables. Segment optimizations are executed and results are stored in separate sectional route tables. The overall resistance of the route is minimized under constraint that it passes through the at least one surface region. A navigation apparatus for performing this method is also described.