EP3300030A1 - Dispositif de traitement de données et procédé de réduction de la complexité d'un réseau de tronçons de route - Google Patents

Dispositif de traitement de données et procédé de réduction de la complexité d'un réseau de tronçons de route Download PDF

Info

Publication number
EP3300030A1
EP3300030A1 EP16002069.9A EP16002069A EP3300030A1 EP 3300030 A1 EP3300030 A1 EP 3300030A1 EP 16002069 A EP16002069 A EP 16002069A EP 3300030 A1 EP3300030 A1 EP 3300030A1
Authority
EP
European Patent Office
Prior art keywords
sections
section
network
link
data processing
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.)
Ceased
Application number
EP16002069.9A
Other languages
German (de)
English (en)
Inventor
Gerald Bartz
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.)
Toll Collect GmbH
Original Assignee
Toll Collect GmbH
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 Toll Collect GmbH filed Critical Toll Collect GmbH
Priority to EP16002069.9A priority Critical patent/EP3300030A1/fr
Publication of EP3300030A1 publication Critical patent/EP3300030A1/fr
Ceased legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G07—CHECKING-DEVICES
    • G07B—TICKET-ISSUING APPARATUS; FARE-REGISTERING APPARATUS; FRANKING APPARATUS
    • G07B15/00—Arrangements or apparatus for collecting fares, tolls or entrance fees at one or more control points
    • G07B15/06—Arrangements for road pricing or congestion charging of vehicles or vehicle users, e.g. automatic toll systems
    • G07B15/063—Arrangements for road pricing or congestion charging of vehicles or vehicle users, e.g. automatic toll systems using wireless information transmission between the vehicle and a fixed station
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/40—Business processes related to the transportation industry
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q2240/00—Transportation facility access, e.g. fares, tolls or parking

Definitions

  • the present invention relates to a data processing device and a method for reducing the complexity of a link network.
  • a tolling system in which tolls are charged for each section of the route traveled, becomes more complex the more sections of the route network of this tolling system.
  • the examination of vehicle positions detected by vehicle equipment of a toll vehicle for sufficient local conformity with a toll section required more computing time the more toll sections of the section network are available for such a test.
  • the applicant is in the task of extending the toll collection from the network of sections of the federal highways of Germany (about 8,500 sections) on the network of sections of federal motorways and federal highways of Germany (a total of about 140,000 sections).
  • the sections of a first network superordinate are defined using map data at the beginning and at the end of each section of the first network either a branch (junction, junction, intersection, etc.) of another section of the first network or include a driveway from a second network of subordinate (in this case toll-free) roads or a descent into the second network of subordinate roads.
  • the object of the invention is to provide a data processing device and a method with which it is possible to reduce the number of route sections of an initial route network without or without significant financial losses.
  • the invention provides a data processing device and a method which determine trajectories of route sections of a route network from detected traffic lanes and identify suitable candidate route sections which are comprised in the form of a subsequence of a plurality of multiple section sequences of the trajectories.
  • the data processing device and the method generate a new route section network which, instead of the candidate route sections, comprises a consolidated route section composed of the candidate route sections.
  • a data processing device configured to provide a route network with a number R of route sections with predecessor-successor relationships from first route sections to second route sections in the route network Detecting lanes of at least one vehicle via in each case one or more sections of the section network, to determine a set of trajectories each having at least one section A i from the detected lanes, the plurality of multiple section sequences with multiple, each driven by a vehicle in the immediate sequence, sections caused by a predecessor-successor relationship or several predecessor-successor relationships of the link network in the link network immediately following each other, comprises and at least one q m tuple (q m > 1) of several directly in the link network successive candidate sections to identify which form a subsequence of q m immediately following traveled sections of several of the determined multi-segment sequences of the detected lanes.
  • a trajectory is understood to mean each section of the route and each sequence of sections of track that follow each other directly on the basis of a predecessor-successor relationship or several predecessor-successor relationships of the section network in the section network, one or more lanes of which may be inferred. Consequently, a trajectory can consist of only a single stretch of road. Such a trajectory is also referred to as a single or single-segment sequence.
  • a multiple-segment sequence comprises at least two link sections and may correspond to a trajectory having a plurality of link sections or may be part of a trajectory which contains a larger number of route sections than the multiple-segment sequence.
  • a subsequence may have a number of track sections of multiple section sequences that is less than or equal to the number of track sections of the multi-section sequences. If multiple-segment sequences comprising the partial sequence have different numbers of route sections, then the partial sequence-insofar as it is present according to the invention only because of these multiple-segment sequences-can have at most the number of route sections of the shortest multiple-segment sequence.
  • a new "consolidated" track section of a new track network combined from the candidate track sections can be formed.
  • the data processing device according to the invention is formed, U multiple halnabitessdisjunkte q m tuples to identify each of a plurality of directly in the path section mains successive candidate route sections which form chirnabitessdisjunkte partial sequences of q m immediate succession traffic path sections of several of the specific multi-portion sequences of the detected traffic lanes.
  • Sectionally disjoint subsequences and groups of route sections are characterized by the fact that no section of the route is common to them.
  • stretched sections konjunkte partial sequences and groups of sections are characterized by the fact that they have at least one section in common.
  • U new tilts of a new link network, combined from the respective candidate route sections, each composed of the candidate route sections of a subsequence, can be formed using a number of U-section disjoint points q m -tup.
  • To avoid double billing of track sections is to be foreseen from the formation of new sections of track section konjunkten q m tuples.
  • the new route section network can also contain a number V of one or more route sections of the original route network which have not been identified as candidate route sections according to the invention, but are also considered as new route sections because they - just like the consolidated sections - are new sections of a new section of track.
  • the predecessor-successor relationships of the new route sections of the new route network are preferably adjusted as a function of the predecessor-successor relationships of the (original) route sections of the (original) route network. This considerably reduces the complexity of a route network.
  • track sections that were not a trajectory of a lane or were not included in any lane trajectory can be removed from the link network, thus further reducing the number R 'of new links.
  • the invention is based on the idea that several sections directly following one another in the section network are combined to form a consolidated section if it results from a plurality of lanes that sections immediately following one another are always driven "en bloc", without departing between them and / or ascending.
  • the link network may be represented by a graph or by a predecessor-successor relationship matrix, in particular by an adjacency matrix.
  • the route segment network is stored in the form of a predecessor-successor relationship relation (graph or matrix) of its route sections in the data processing device according to the invention.
  • the set of trajectories may be configured as a multi-set by comprising a plurality of identical trajectories (and thus identical multiple-segment sequences) of the same lane (in the case of multi-pass by the same vehicle) or different lanes of the same vehicle or different vehicles. This is called that the trajectories or multiple-segment sequences are included with a multiplicity of greater than one of the multi-set.
  • the candidate route sections form a subsequence of several different lanes, and the data processing device according to the invention is preferably designed to identify these as such.
  • the data processing device can be configured to add only those multiple section sequences to the set of trajectories whose multiplicity is greater than one, that is: such multi-section sequences which are multiple section sequences of several different lanes or occur multiple times in the same lane.
  • the formation of the trajectory amount as a multi-set can be avoided and all multiple-segment sequences of the trajectory set are different. This measure reduces the memory requirement when creating the trajectory amount and increases the speed in identifying the candidate route sections.
  • the lanes comprise vehicle positions of the path covered by the respective vehicle in the route network
  • the data processing device according to the invention is designed to associate the traveled route sections with at least one geo-object characterized by at least one predetermined position by comparing vehicle positions of the respective lane, each associated with a route section are to determine under the recognition condition that at least one of the vehicle positions sufficiently coincides with the respective geo-object.
  • the lane already comprises at least one traveled route section
  • the data processing device is comprised by a toll system with at least one vehicle device carried by the vehicle and the vehicle device has a processor which is formed from at least one vehicle position received or generated by the vehicle device Comparing this vehicle position with at least one geo-object characterized by at least one predetermined position associated with a link to determine a traveled link under the recognition condition that at least the at least one vehicle position sufficiently coincides with the respective geo-object.
  • the said recognition conditions are in each case part of a recognition rule, which links the determination of a traveled route section as a recognition consequence to the fulfillment of the recognition condition.
  • the association with a route section can be realized, for example, by a data link of the geo-object with a route section identifier (eg a number) of this route section.
  • the data processing device is comprised of a toll system with at least one vehicle device carried by the vehicle, which records at least one lane, wherein the data processing device is designed to detect the recorded lane from the vehicle device by receiving it via a mobile radio network.
  • the invention also provides a toll collection system having a data processing device according to the invention (or one of its developments described below) and a plurality of vehicle devices which are designed to record lanes of the respective vehicle from which they are carried and to record recorded lanes to the data processing device wherein the data processing device is adapted to detect the transmitted lanes by receiving them.
  • the toll system comprises detection rules for determining traveled sections as a function of the sufficient correspondence of position data acquired or generated by a respective vehicle device with geo-objects each identified by at least one predetermined position and associated with a link section.
  • the detection rules can be stored in the data processing device according to the invention, wherein vehicle devices are designed to transmit the detected or generated position data to the data processing device according to the invention for determining the traveled sections by the data processing device according to the invention and the data processing device according to the invention is designed based on the received position data and the recognition rules Determine links that the vehicle has traveled, which carries the vehicle device from which the received position data come.
  • the detection rules may be stored in each of the vehicle devices, wherein the respective vehicle device is designed to determine based on the detected or generated position data and the detection rules, the route sections, which has traveled the vehicle, which carries the respective vehicle device, and the determined route sections to send to a control center of the toll system, in particular in the form of lanes to the data processing device according to the invention.
  • the link network represents a first network of parent roads and has driveways from a second network of minor roads at the beginning of at least some links and exits into the second network of minor roads at the end of at least some links
  • the data processing device is configured Determine set of trajectories, each with at least one link from the detected lanes, which includes multiple section sequences complete multiple section sequences that start with the access to a first link from the second network and ending with the departure of a second link in the second network and as at least one q m -tuple of a plurality of candidate track sections following each other directly in the link network, to identify one such that a subsequence of q m is immediately adjacent to one another Following tracked sections of several of the specific complete multi-segment sequences of the detected lanes has.
  • the data processing device can be configured to interpret a route section which lacks a predecessor according to the detected traffic lane as the first route section of the sequence at which the access from the second network into the first network took place, and a route section according to FIG detected lane fails to interpret as the first or second leg of the sequence at which the departure from the first network was made in the second network.
  • a trajectory is always a complete multiple section sequence of the respective lane or a single section without predecessor and successor of the respective lane.
  • the link network represents a first network of parent roads and has driveways from a second network of minor roads at the beginning of at least some links and runs into the second network of secondary roads at the end of at least some links
  • the computing device is configured to: determine a set of trajectories, each having at least one link from the detected lanes, which in addition to the multi-section sequences comprises single-section sequences of links beginning with the access to a link from the second network and the departure from the same link A i into the second link second network and identify as at least one q-tuple of several directly in the link network successive candidate route sections such that a subsequence of q m unmit sub-sequentially traveled sections of a plurality of the determined multi-segment sequences of the detected lanes, without including a link section of a single-segment sequence.
  • the data processing device can be designed to form at least one q-tuple of candidate sections directly following one another in the section network which always or more often than a predetermined relative frequency form a subsequence of sections of several consecutively traveled sections of several of the determined trajectories of the detected lanes , wherein the relative frequency is the quotient of the number of occurrences of the subsequence and the sum of the number of occurrences of the subsequence and the number of occurrences of trajectories comprising at least a first candidate stretch of the subsequence and at least one second candidate Stretch portion of the partial sequence does not correspond.
  • the toll operator With the approval of a given relative frequency of occurrence of a subsequence of, for example, 10%, the toll operator has the opportunity to significantly increase the toll income at a constant tariff (eg Euro per kilometer) by not exceeding the toll collection charge for the toll Fee, but as contribution forms. If, in a contribution system, only relatively few vehicles drive not all candidate route sections but at least one candidate route section of a consolidated route section, this is permitted In the interests of fair value added tax, this does not mean that these few vehicles will not pay a contribution to this consolidated section, the vast majority of which are used by almost all premium-paying vehicles on all candidate routes.
  • a constant tariff eg Euro per kilometer
  • these relatively few vehicles which in relatively few cases (eg not more than ten percent of all lanes) not all candidate stretches but at least one candidate stretch of a consolidated stretch used for the payment of the contribution for this consolidated section, which they have only partially traveled.
  • the invention makes it possible, for example, to identify candidate route sections that are included in more than ninety percent of the lanes of one of their trajectories.
  • the data processing device is designed to determine a set of trajectories, each with at least one route section from the detected lanes, comprising only those multi-segment sequences that are branch node-free in the sense that a branching node does not exist between any pair of immediately consecutive route sections of a multi-branch sequence free of branching nodes wherein the data processing device is further configured to separate branch node-terminated multiple-segment sequences from multi-segment node-containing node sections, which adds them to the set of trajectories as multi-segment node-free node sequences.
  • the identification of candidate route sections can be significantly simplified and accelerated, because the problem of the different, possibly stretch-segment partial sequences that extend over the same branching node, is avoided from the outset.
  • the data processing device can be designed to maximize an objective function of those subsets of an initial set of different subsequences contained in the set of trajectories fulfill a given constraint.
  • an objective function also called a utility function
  • the data processing device is preferably designed to identify, as a result of the maximization, at least one subsequence that belongs to a subset of the output quantity for which the objective function assumes the maximum value.
  • the data processing device can be designed to maximize an objective function of those subsets of an output set of all the different subsequences contained in the set of trajectories, which satisfy at least one predefined secondary condition.
  • the data processing device has the largest output quantity of subsequences for the target function available.
  • the data processing device according to the invention can be designed to maximize an objective function of those subsets of an output set of - in particular all - different subsequences and individual section sequences contained in the set of trajectories of link sections which do not belong to any subsequence of the output set that fulfill at least one predetermined constraint condition.
  • such a data processing device can be designed to add only partial sequences of those multiple section sequences of the initial set or of a subset whose Velfachheit are greater than one, that is: such multi-section sequences that are multi-segment sequences of several different lanes or multiple in the same lane occur.
  • a constraint may be that only such selected subsequences may belong to a subset that does not include a link segment of a trajectory that does not include the selected subsequence, wherein the data processing device of the invention is configured to add only such selected subsequences to a subset of the objective function. This avoids identification of candidate legs belonging to a partial sequence that is not fully navigated in all cases.
  • Another, alternative or cumulative constraint may be that a predetermined number of different subsequences - and optionally single subsequence sequences - are not exceeded, in particular, meted out.
  • the data processing device according to the invention is preferably designed to maximize an objective function of those subsets of an initial set of different subsequences contained in the determined set of trajectories - and optionally single subsequences - that satisfy the constraint that they do not exceed a predetermined number of different subsequences - and optionally single-segment sequences - contains.
  • the scope of a new link network can be set and optionally also its nature - namely whether or not (for example, a certain number) track sections of individual section sequences may be included or not.
  • the data processing device is particularly preferably designed to maximize an objective function of those subsets of an initial set of different subsequences and single subsequences contained in the set of trajectories that satisfy the first constraint that a given number of subsequences and subsequences of a subset do not exceeded - in particular hit - and satisfy the second constraint that the subsequences and single-section sequences are disjoint.
  • the disjunctive condition stipulates that no link section enters a subset multiple times, neither as a single section sequence nor as a link section of a subsequence, that is to say that only those individual section sequences belong to a subset that does not belong to a subsequence of this subset and only those subsequences belong to a subset, which have none of the remaining subsequences of this subset in common. This takes into account the avoidance of multiple charging of new sections of a new route network.
  • the data processing device is designed to include in the output quantity only those partial sequences which are composed of a plurality of - not necessarily different - multiple-segment sequences (that is, those with a multiplicity of greater than one or those that are different but include the same subsequence).
  • a database is provided which satisfies the proviso that the candidate route sections should form a subsequence of a plurality of specific multiple section sequences of the detected traffic lanes. The effect is a simplified and accelerated execution of the maximization process.
  • the data processing device is characterized in that subsequences and single-segment sequences depending on their respective multiplicity, with which they occur in the determined set of trajectories, enter into the objective function.
  • the partial sequences and single-segment sequences enter the target function with a power of their respective multiplicity, this power being greater than zero in each case.
  • the power can be one. This results in the result that preferably those subsequences of the subset of a result in the maximum objective function, which are particularly frequently traveled throughout.
  • the data processing device is characterized in that subsequences and individual section sequences enter into the objective function as a function of a respective weight assigned to them.
  • the respective weight is a measure of the length of the partial sequence or of the single-segment sequence.
  • those subsequences are elements of a subset of a result of the maximum objective function, which are particularly long.
  • the longest sections are the most expensive.
  • the data processing device is designed in its simplest form or any of its further developments to produce from the link network a new link network with a number of new link sections of a set of new link sections reduced by at least q-1 compared to the original number, identifying them Combines candidate route sections of at least one subsequence to at least one consolidated route section. This makes it possible to create a new, less complex network of sections from an original, complex route network.
  • such data processing device can be formed, each partial sequence as summarize the candidate sections a number U of several sub-sequences each having a q m -tuple of candidate road sections into a consolidated route section and by replacement of the candidate route sections of the original track section network a new route section network with U to produce consolidated sections.
  • a data processing device can be configured to not include in the new route network sections that are not included in any of the sequences (multiple and single-segment sequences) of the detected lanes. As a result, the complexity of a new route network can be further reduced compared to the original one.
  • the data processing device can be designed to create a new toll system with a new route network and new recognition rules from an original toll system with an original route network and new detection rules, each containing at least one new recognition condition with respect to a new Erkennungskonsequenz the determination of a busy consolidated section.
  • the data processing device can be configured to provide geo-objects, which are each identified by at least one predetermined position and are each associated with a link, in each case together with a recognition rule, which states that the sufficient match at least one vehicle position with at least one of the geo-objects corresponds to a tracing of the track section associated with the at least one geo-object, and candidate tracks identified by candidate geo-objects at least one associate with the consolidated track section to form a consolidated recognition rule.
  • the toll system preferably comprises such a data processing device.
  • at least one component (data processing device or vehicle device) of such a toll collection system is designed to detect at least one lane of at least one vehicle from driving on at least one of the route sections of the new route network. This provides a tolling system which optimizes its complexity.
  • such data processing device may be configured to determine, from the candidate geo objects of the identified candidate route sections that have been combined into a consolidated route section B, at least one candidate Geo object of a candidate route section with the consolidated route section, forming a consolidated recognition rule to associate, which says that the sufficient match of at least one vehicle position with the at least one candidate Geo objects corresponds to the driving of the consolidated track section.
  • the consolidated route section is already considered to be used if only one of the candidate route sections has been traveled.
  • such data processing means may be configured to obtain from the candidate geo-objects of the identified candidate legs that have been consolidated into a consolidated leg, at least two candidate geo-objects of different candidate legs with the consolidated one Associate a link to form a consolidated recognition rule, which means that the sufficient match of a plurality of vehicle positions with each of the at least two with the consolidated link segment corresponds to candidate geo-objects of the driving of the consolidated link section B.
  • the consolidated route section is considered to be used only when several of the candidate route sections have been traveled.
  • a method of reducing the complexity of a link network comprising the steps of: (a) providing a link network of a number R of links having predecessor-follower relationships from first links to second links in the link network, (b) sensing (c) determining a set of trajectories with in each case at least one route section from the detected traffic lanes, the several multi-segment sequences having a plurality of road sections, each traveled by a vehicle in direct succession, which, due to a predecessor-successor relationship or several predecessor-successor relationships of the section network, immediately follow one another in the section network, and (d) identifies at least one q-tuple (q> 1) of a plurality of candidate route sections following each other directly in the route network, forming a subsequence of q immediately consecutively traveled route sections of several of the determined multiple section sequences of the detected traffic lanes.
  • all these steps are performed by a data processing device.
  • Developments of the method according to the invention can be carried out by steps that correspond to the developments of the data processing device according to the invention.
  • the method according to the invention is characterized by the step of generating a new link network from the (original) link network with a new number R 'reduced by at least q-1 compared to the number R of new link sections of a set of new link sections by combining identified candidate link sections at least one subsequence to at least one consolidated route section.
  • this step is performed by a data processing device.
  • a step may be provided which, as described in the first aspect of the invention, provides for the creation of a new recognition rule for the at least one consolidated route section, in particular the creation of recognition rules for all consolidated route sections of the new route network.
  • this step is performed by a data processing device.
  • a further step it may be provided to detect the passage of at least one of the new route sections of the new route network on the basis of at least one vehicle position of at least one vehicle.
  • a vehicle device carried by the vehicle which has detected or generated the vehicle position of the vehicle, for example by means of a GNSS (Global Navigation Satellite System) receiver, and / or from a central, off-vehicle distance from the vehicle arranged device, for example, the data processing device according to the invention
  • GNSS Global Navigation Satellite System
  • An in Fig. 1 schematically illustrated toll system 70 has vehicles 30 f , which are each equipped with a vehicle unit 10 f .
  • the vehicles 30 f belong, for example, users of the in Fig. 2
  • the number of vehicles 30 f is preferably more than 1,000, more preferably more than 1,000,000.
  • the vehicle devices 10 f are each characterized by a vehicle device processor 11 f , a position determination device 12 f , a mobile communication module 13 f , a memory 16 f and a data write-read memory 17 f , wherein the position determination device 12 f the mobile Communication module 13 f , the memory 16 f and the data-read-write memory 17 f (for example, a solid-state disk, SSD) for data exchange communication technology with the vehicle unit processor 11 f are coupled.
  • a vehicle device processor 11 f characterized by a vehicle device processor 11 f , a position determination device 12 f , a mobile communication module 13 f , a memory 16 f and a data write-read memory 17 f , wherein the position determination device 12 f the mobile Communication module 13 f , the memory 16 f and the data-read-write memory 17 f (for example, a solid-state disk, SSD) for data exchange communication technology with the vehicle unit processor 11 f are coupled.
  • SSD solid-state
  • the position determining devices 12 f each receive navigation signals from satellites of a GNSS (Global Navigation Satellite System), for example GPS, and determine from the received navigation signals, optionally dependent on measured values of unillustrated means for coupling location, subsequently vehicle positions of the vehicle 30 f , of which they are carried.
  • the determined vehicle positions are successively received by the vehicle-mounted processor 11 f and a lane file is written which is provided in the working memory 16 f and / or in the data-writing-and-reading memory 17 f for receiving vehicle positions.
  • GNSS Global Navigation Satellite System
  • the vehicle-mounted processor 11 f instructs the mobile radio communication module 13 f to set the lane file with the lane F formed from the vehicle positions written in the lane file to the data processing device 50 via a mobile radio network 40 a toll center 58 of the toll system 70 to send.
  • the data processing device 50 has a central processor 51, a central communication device 53 (for example a modem or a gateway), a working memory 56 and two data read / write memories 57a and 57b (in short: memories, for example SSDs).
  • the two data read / write memories 57a and 57b may alternatively also be memory areas of a single data read / write memory (not shown).
  • the data processing device 50 is designed to detect a plurality of lanes F k of different vehicles 30 f by receiving them via the mobile radio network 40 and to store the detected lanes F k anonymously in the memory 57b by means of their central processor 51. By detecting lanes F k over a predetermined period of, for example, a month or a week or up to a predetermined number K of lanes F k , a set ⁇ F ⁇ of lanes F k is archived in the memory 57b and stored by the memory 57b Data processing device 50 is provided (see upper right part of Fig. 2 ).
  • an initial route section network G-in this case the German highway network-provided by the data processing device 50, in particular by its memory 57a, is provided as the first network of superordinate roads.
  • This initial route network is in the upper left part of Fig. 2 represented in the form of a map, which also shows the lengths and gradients of the sections. Lengths and / or courses of the route sections do not necessarily have to be stored as part of the route section network G in the memory 57a.
  • the identifiers of the route sections satisfy with their predecessor-successor relationships, which further develop the set ⁇ A ⁇ of the route sections into a route network G.
  • the link sections A i may be represented by their respective link identifier and / or by their start and end nodes (represented by corresponding node identifiers) including both branch nodes within the link network G and interface nodes for access from a second sub-network or for departure into the subnet second network of subordinate roads (in this case, federal highways, provincial roads, county roads and municipal roads). Interface nodes that are not branch nodes are also referred to as transit nodes.
  • predecessor-successor relationships may be represented by a graph of the link network G in which the links form the edges and the inlets and / or runs the nodes, or by a node-node (adjacency), node-edge (incidence -) or edge-edge matrix.
  • at least one geo-object O i which is characterized by at least one predetermined position, is stored in the memory 57a associated with each route section A i .
  • the data processing device 50 determines by means of its central processor 51 and its central memory 56 first by comparing the vehicle positions of the respective lane F k with the geo-objects O i under the recognition condition that at least one the vehicle positions sufficiently with at least one geo-object O i agrees whether, and if so, which sections A i were traveled.
  • information about the sequence in which the route sections A i were traveled in succession is derived from the sequence or a respective time information of the vehicle positions of the traffic lane.
  • the sets ⁇ A ⁇ k of the respective track sections A i traveled in the course of the recording of the lanes F k are then checked using the predecessor-successor relationships and the information about the order of their passing, which multi-section sequences M l with several, each of the vehicle 30 f , from which the lane F k comes, in immediate succession traveled, sections A i , due to a predecessor-successor relationship or several predecessor-successor relationships of the route section network G in the route section network G directly follow each other.
  • the data processing device 50 by processing the lanes F k taking into account the information of the link network G by means of the central processor 51, has a multi-set ⁇ M ⁇ d of each d l -fold occurring multiple different sequences before section M l, which form the set ⁇ M ⁇ of L different multiple sequences portion M l of the set ⁇ F ⁇ of K lanes F k.
  • all the certain multiple segment sequences M l are complete multiple section sequences M l, which are characterized in that each multi-section sequence M l with the access to a first track section A i starts from the second network, and with the departure of a second track section A j, j ⁇ i, ends in the second network.
  • Such complete multi-segment sequences M 1 are maximum in terms of inclusion in that they can no longer be added to a further section A i of the respective lane F k to form a longer multi-segment sequence.
  • the set of determined multiple-segment sequences M l forms at least a subset of the trajectory set ⁇ T ⁇ at trajectories T n , which contain multiple-segment sequences M l and can also contain single-segment sequences E i of the lanes F k .
  • the data processing device 50 in particular the central processor 51, is designed to analyze the multi-set ⁇ M ⁇ d of complete multiple-segment sequences M l in response to which partial sequences Q m with q m > 1 track sections A i , ..., A i + n-1 having a multiplicity H m of greater than 1 in the multiset ⁇ M ⁇ d and identifying and outputting the candidate link sections A i , ..., A i + qm-1 of these subsequences Q m .
  • At least one q m -tuple (q m> 1) of a plurality of immediately stretch mesh successive candidate route segments A i, ..., A i + qm-1 identified that a partial sequence Q m directly by q m more consecutively traveled sections A i , ..., A i + qm 1 of several of the determined multi-section sequences M 1 of the detected lanes F k .
  • a subsequence Q 1 contained in the two multiple section sequences M 1 and M 2 with the multiplicity 2 is the one with the route sections A 2 and A 3 .
  • the data processing device 50 has a set ⁇ Q ⁇ of M different subsequences Q m that occur in several identical or different multi-section sequences M l .
  • the data processing device 50 rejects from the set ⁇ Q ⁇ to partial sequences Q m those which were not traveled with a predetermined minimum frequency H min , that is to say at least with a frequency H m equal to H min in the multi-section sequences M l .
  • the minimum frequency H min is greater than or equal to 10 and less than 1000.
  • the minimum frequency is dependent on, in particular equal to, the quotient of the total number
  • first candidate route sections A i ,..., A i + qm 1 can be identified by section-segment - disjoint subsequences Q m which are completely contained in a plurality of multi-section sequences M 1 but are only partially contained in a multi-section sequence.
  • the question is, which sections of the route sectionally coincident partial sequences Q m and Q n A i , ..., A i + qm 1, which are to be combined by the two subsequences Q m and Q n to form a consolidated route section B m or B n .
  • the question is, which sections of the route sectionally coincident partial sequences Q m and Q n A i , ..., A i + qm 1, which are to be combined by the two subsequences Q m and Q n to form a consolidated route section B m or B n .
  • a plurality of subsequences Q m and Q n only those that are segmental disjoint, that is, no route segment A g, can be combined to form a consolidated route segment.
  • the data processing device 50 may be configured to first select those candidate stretch sections A i ,..., A i + qm-1 in a first subsequent step from the set of all identified part sequences Q m , whose subsequences Q m are segment-by-segment disjoint with each other subsequence Q n .
  • the remaining remaining quantity of stretch-section partial subsequences is limited to the subset of identified double-segment subsequences Q (2) m , and in a third subsequent step only those candidate stretch segments A i , A i + 1 are selected Dual section partial sequences Q (2) m is the stretched segment disjoint with every other two-part subsequences Q (2) n .
  • candidate stretch sections A i , A i + 1 of those two-section subsequences Q (2) m are selected which are stretched with not more than a single further two-section subsequence Q (2) m , the further two-section subsequences Q (2) n be excluded from the further process of identification.
  • the further Q (2) n double-segment subsequences it is possible that the remaining remainder of the determined double-segment subsequences receives new stretched segment single-conjunct double-segment subsequences Q (2) m , which are also dealt with.
  • This method can be continued with stretch-section single-conjugate dual-portion subsequences Q (2) m until the remainder does not contain a double-segment subsequence Q (2) m .
  • the data processing device can determine 50 whether the amount of the selected dual section subsequences Q (2) m, two or more double portion subsequences Q (2) m are included, which according to a predecessor-successor relationship of their respective route segments A i, A i +1 in the section network G immediately adjoin one another.
  • Such q / 2 tuples of dual section subsequences Q (2) m can then be grouped into a q m tuple of q m candidate route sections A i , ..., Ai + qm-1 .
  • the second sequence step can initially be a limitation on groups of sub-sequences, which also include longer partial sequences for this subset, the two-compartment section subsequences Q (2) m, triple portion sequences Q ( 3) m and longer subsequences Q (p) m , which can be determined by eliminating even longer subsequences Q (q) m with q> p, possibly newly formed stretch-segment-disjoint multi-segment sequences Q (p) m .
  • This step combination can be carried out several times in succession by successively reducing the maximum length of the subsequences remaining in the remaining set.
  • the data processing device 50 may be configured to carry out the determination of segment-section-disjoint partial sequences Q m in regions on the route segment network G.
  • it can be determined according to a split condition for simplification that a consolidation of route sections via a branching node is excluded, that is, q m -tuple of identified candidate route sections A i , ..., A i + qm-1 can not extend over a branching node (multiple-segment sequences in which branching nodes possibly occur as terminating nodes are considered below as branching node-free).
  • the data processing device 50 may first be configured, those particular complete branching node-containing multiple section sequences M l having at least one at immediately consecutive sections and A i + 1 a branch node to branch node-free junction node-terminated multiple section sequences (ie multiple section sequences in which branch nodes, exclusively as terminating Nodes occur), possibly resulting in released branching node-terminated single-section sequences remain stored for later use.
  • branch node-free junction node-terminated multiple section sequences ie multiple section sequences in which branch nodes, exclusively as terminating Nodes occur
  • a longest branch node-free multiple-segment sequence Q m between two, a first and a second, immediately adjacent branch node on one side of a closed loop in the link network G thus begins with the first branch node and ends with the second branch node.
  • Such a longest sequence of C immediately consecutive route sections A i ,..., A i + C-1 between two immediately adjacent branching nodes of a mesh in the link network G may be referred to as maximum meshing side sequence.
  • a closed loop with X branch nodes has such a maximum mesh side sequence for each of its X mesh sides, assuming corresponding lanes F k . This consideration applies analogously to mesh sides of open meshes that end only on one side in a branching knot.
  • the data processing device is configured to subsequently, for each mesh side, starting from a first route section A 1 terminated by the first branching node and successively progressing in the direction of the last second branching node A 1 + C-1 of the mesh side, the multiple-route sections M 1 of the respective mesh side thereto check if, and if so, how many of them have the stretch sections A 1 and A 2 .
  • the corresponding multiplicity (or absolute frequency) of the occurrence of this link combination in the multi-set of the multipath sections M l is H 1 . Subsequently, it is checked whether, and if so, how many of the multi-span sections M 1 have the stretched sections A 2 and A 3 (frequency H 2 ), and so on.
  • the data processing device 50 is designed to first identify that first two-segment subsequence which occurs with the greatest frequency.
  • a second two-segment subsequence it identifies that which occurs after the first two-segment subsequence having the next largest frequency without being stretch-segment-concurrent with the first two-segment subsequence. Thereafter, that third two-segment subsequence is identified which occurs from all other sub-segment sub-sequence sequences having the greatest frequency, which are stretched with both the first and the second two-segment subsequence, and so on.
  • the set of these branch node-terminated single-segment sequences together with the set of branching-node-free multi-segment sequences counts to the group of sequences from which the number H M of the Occurrence of sequences is determined which have at least one first candidate stretch A i of the partial sequence Q m and at least one second candidate stretch A j, j # i, the partial sequence Q m not provided, it being assumed that the second condition for Single-segment sequences is always met.
  • the data processing device 50 may be configured to determine, in addition to the multimount of the complete multiple section sequences M l from the lanes F k, also the multimount of the various single section sequences E i with their respective multiplications d i , which are also complete in the sense that the sequence begins with the access to a first section A i from the second network and ends with the departure of the first section A i in the second network.
  • the data processing device 50 is designed, for example, to select only those subsequences Q m whose relative frequency h (T) m is equal to 1, which means that in no traffic lane F k between two candidate route sections A i and A i + 1 of this subsequence Q m ascended from the second network in the first network or traversed from the first network in the second network.
  • the data processing device 50 is designed to select only those partial sequences Q m whose relative frequency h (T) m is greater than a predetermined minimum frequency h min ⁇ 1, which means that only in one Proportion 1 - h (T) m of those lanes F k which contain a section A i of the subsequence Q m , the sequence of the traveled sections in the subsequence Q m is interrupted.
  • the central processor 51 of the data processing device 50 consolidates the original route network G to a new route network G 'whose new route sections S z stores together with new predecessor-successor relationships of these new sections S z in the first central memory 57a.
  • S is a general identifier for both of sub-sequences Q m of several candidate sections A i , ..., A i + qm-1 consolidated sections B m and for individual sections A v , the candidate sections A i ,. ... A i + qm-1 of a partial sequence Q m , but are nevertheless sections of the new route section network G '(and also of the original route section network G).
  • Fig. 2 In the lower part of Fig. 2 is for the in the dashed section of the original route section network G (upper left part of Fig. 2 ) shows on the basis of a map-like representation of a subset of the set ⁇ S ⁇ of new route sections S z, a new route section network G ', which after the aforementioned split condition under the proviso of a frequency h (T) m of subsequences of more than 90% has been generated and in addition to each of a common section B m combined candidate sections A i , ..., A i + qm-1 as new sections S z also not combined sections A v of the original route section network G contains.
  • T frequency h
  • the nodes N k of the original route section network G are shown to illustrate combined sections B m and un-combined sections A v .
  • the seven original sections A i in each direction on the A24 motorway between the junction nodes to the A19 to Rostock and the A14 to Schwerin in the direction of Berlin to Hamburg four original sections have been combined to form a new section B 717 and two original sections to a new link B 718 has been combined while a section A 719 . has been preserved from the original route section network G in the new route section network G '.
  • an original section A 114 was preserved, while six original sections were combined to form a new section B 113 .
  • the second embodiment is described in the first embodiment trajectory Multi set ⁇ T ⁇ d of the trajectories T n of complete multi-part sequences M l and complete single portion sequences e i in their respective multiplicities of d l and d i is based, with their recorded tracks according to the amount of traffic lanes ⁇ F ⁇ were done.
  • ⁇ P ⁇ is the set of all possible link sequences (mathematical: paths) P m in the new link network G '
  • xs is a binary vector of dimension
  • is, for that applies x S ⁇ 1 .
  • S ⁇ T is determined to require that a new link S z be completely contained in a trajectory T n .
  • the parameter p s (T) specifies that only new track sections S z traveled completely in a trajectory T n are counted in the utility function.
  • the parameter p s (T) may also be determined to require that a new link S z in a predetermined number of trajectories T n of the trajectory multiset ⁇ T ⁇ d and / or several different trajectories T n of the Trajectory set ⁇ T ⁇ is completely contained.
  • a ⁇ S A ⁇ T 0 .
  • a ⁇ S A ⁇ T be replaced, which requires that at least a section A i of a new section S z is included in a trajectory.
  • the alternative parameter p A (T) specifies that new route sections S z are counted in the utility function as often as one of their sections A i is included in a trajectory T n .
  • the condition that the resulting number R 'of new link sections S z of the new link network G' is smaller than the original number R of original link sections A i of the original link network G, by the maximization requirement, ensures that as a result only those original link sections A i candidate sections A i , ..., A i + qm-1 are identified for merging into a consolidated link B m of a set ⁇ S ⁇ of new links S z whose multi-section sequences M l in the trajectory multimetry ⁇ T ⁇ d with a multiplicity of d l of greater than 1 occurs.
  • a further optimization can be based on a utility function u ( ⁇ S ⁇ ), which provides the new route sections S z with a weight w (s) z , preferably as a function of the length of the original route sections A i passing through the new route sections S z are included in the form of track sections B m combined from original (candidate) track sections A i and optionally original track sections A v :
  • u S ⁇ S ⁇ P w S ⁇ x S ⁇ T ⁇ T d T ⁇ p S T - ⁇ S ⁇ P w 0 ⁇ x S
  • w 0 is an elimination weight which is smaller than each weight w (S) z of each possible new route section S z and ensures that, due to the parameter p (T) s, for lack of driving, the utility function is not included in the first addend (inclusion sum) incoming possibly new route sections S z in the second summand (Exclusion sum) are assigned a negative benefit, which leads to the exclusion of unused route sections from the set ⁇ S ⁇ opt of the optimal new route sections S z .
  • w 0 may be 0.01 or 0.001, for example.
  • the length of a route section S z as weight w (S) z is advantageous in charge systems in which a charge is proportional to the length of the route section S z traveled.
  • a weight of 0.1 may for example correspond to the length of a section of 100 meters.
  • the data processing device 50 is in principle configured to add only those multiple section sequences M l to the trajectory multimetry ⁇ T ⁇ d whose multiplicity d l is greater than 1.
  • Multiple section sequences M l whose multiplicity d l is equal to 1 are either decomposed into single section sequences E k and added to the trajectory multimetry ⁇ T ⁇ d as such as single section sequences E l which do not originate from a decomposition of multiple section sequences M l or become complete discarded.
  • a maximum benefit set of new route sections S z is determined whose consolidated route sections B m identify candidate route sections A i ,..., A i + qm-1 , the subsequences Q m of several of the determined ones Form multiple section sequences M l of the detected lanes F k .
  • the route section network G can be decomposed into subnetwork G p and an optimization can be carried out separately for each subnet G p .
  • Optimized subnets G ' p are then combined to form an optimized, new route section network G'.
  • a new route section network G 'with a reduced number of new route sections S z is now available whose quantity ⁇ S ⁇ comprises at least one route section consolidated from candidate route sections A i , ..., A i + qm 1 B m includes.
  • U> 0, while V 0, when the set ⁇ S ⁇ of new link sections S z comprises only consolidated link sections B m .
  • each original route section A i is associated with at least one geo object O i , which is characterized by at least one predetermined position, and at least one component of the toll system, for example a vehicle device 10 f and / or the central data processing device 50, is configured to determine a traveled route section A i by comparing at least one vehicle position detected and / or generated by a vehicle device 10 f with at least one geo-object O i , under the recognition condition that at least one vehicle position sufficiently with the at least one geo-object O i matches.
  • Fig. 3a shows, for each link A i of a sequence of candidate links A 1 , A 2 and A 3 , a candidate Geo object O 1 , O 2 and O 3, each in the form of lines indicated by two predetermined positions each, namely a starting point and an end point of the line.
  • geo-objects O i may be circles characterized by a center point as (first) predetermined position and a radius or a second predetermined position on the edge of the circle.
  • a sufficient spatial agreement of two immediately successive vehicle positions with such a line Geo object is given when the connecting line of the two immediately consecutive vehicle positions (vehicle position pair) intersects the line of the line Geo object.
  • the data processing device 50 is configured to derive from the candidate route sections A 1 , A 2 and A 3 in each case the candidate Geo object of the first section of the sequence (A 1 ) and the candidate Geo object of the last section of the sequence (A 3 ) and to reject the others (in this case that of Section A 2 ).
  • a toll system 70 which comprises at least one component (vehicle device 10 f and / or data processing device 50) which is designed to recognize at least one lane of at least one vehicle 30 f for the passage of at least one consolidated route section B of the new route section network G '.
  • the data processing device 50 is configured to send the selected candidate geo-objects O 1 and O 3 associated with consolidated link segments and consolidated recognition rules to at least one vehicle device 20 f, which is linked to consolidated link sections as a result of receiving the selected candidate geo-objects consolidated detection rules is configured to detect based on vehicle positions generated or detected by the vehicle unit 20 f the driving of the consolidated track section B.
  • the data processing device 50 is formed, the selected candidate spatial objects O 1 and O 3 linked 57a to store and based on the selected candidate spatial objects O 1 and O 3 under with consolidated route sections and consolidated detection rules in the first central memory Application of the consolidated recognition rule from at least one lane of at least one vehicle to detect at least the consolidated track section B of the new route section network G '.

Landscapes

  • Business, Economics & Management (AREA)
  • Physics & Mathematics (AREA)
  • Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Health & Medical Sciences (AREA)
  • Economics (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Human Resources & Organizations (AREA)
  • Marketing (AREA)
  • Finance (AREA)
  • Strategic Management (AREA)
  • Tourism & Hospitality (AREA)
  • General Business, Economics & Management (AREA)
  • Theoretical Computer Science (AREA)
  • Traffic Control Systems (AREA)
  • Navigation (AREA)
EP16002069.9A 2016-09-22 2016-09-22 Dispositif de traitement de données et procédé de réduction de la complexité d'un réseau de tronçons de route Ceased EP3300030A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
EP16002069.9A EP3300030A1 (fr) 2016-09-22 2016-09-22 Dispositif de traitement de données et procédé de réduction de la complexité d'un réseau de tronçons de route

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
EP16002069.9A EP3300030A1 (fr) 2016-09-22 2016-09-22 Dispositif de traitement de données et procédé de réduction de la complexité d'un réseau de tronçons de route

Publications (1)

Publication Number Publication Date
EP3300030A1 true EP3300030A1 (fr) 2018-03-28

Family

ID=57153224

Family Applications (1)

Application Number Title Priority Date Filing Date
EP16002069.9A Ceased EP3300030A1 (fr) 2016-09-22 2016-09-22 Dispositif de traitement de données et procédé de réduction de la complexité d'un réseau de tronçons de route

Country Status (1)

Country Link
EP (1) EP3300030A1 (fr)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1659550A2 (fr) * 2004-11-19 2006-05-24 DaimlerChrysler AG Procédé pour détecter des données de traffic
EP1811480A1 (fr) * 2006-01-18 2007-07-25 GMV Aerospace and Defence S.A. Système de chargement routier automatique basé uniquement sur la navigation satellite en considerant l'erreur de la position et procédé
EP2854111A1 (fr) * 2013-09-30 2015-04-01 Toll Collect GmbH Procédé, dispositifs, système et produit de programme informatique destinés à percevoir un péage dans un système de péage double

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1659550A2 (fr) * 2004-11-19 2006-05-24 DaimlerChrysler AG Procédé pour détecter des données de traffic
EP1811480A1 (fr) * 2006-01-18 2007-07-25 GMV Aerospace and Defence S.A. Système de chargement routier automatique basé uniquement sur la navigation satellite en considerant l'erreur de la position et procédé
EP2854111A1 (fr) * 2013-09-30 2015-04-01 Toll Collect GmbH Procédé, dispositifs, système et produit de programme informatique destinés à percevoir un péage dans un système de péage double

Similar Documents

Publication Publication Date Title
EP3611710B1 (fr) Simulateur de flux de la circulation
EP2842087B1 (fr) Procédé de détermination d'une valeur attendue de consommation d'un véhicule automobile
DE102012218058A1 (de) Verkehrssensormanagement
EP3161808B1 (fr) Procédé de traitement des données de mesure d'un véhicule en vue de définir le début de la recherche d'un emplacement de stationnement et produit logiciel informatique
DE102018202712A1 (de) Schwarmbasierte Trajektorien für Kraftfahrzeuge
DE102012204306A1 (de) Verfahren zur Steuerung eines Bereitstellens von Verkehrsinformationsdaten zur Aktualisierung einer Verkehrsinformation
EP2009610A2 (fr) Procédé et dispositif destinés à déterminer une quantité de trafic relative à une voie d'un réseau routier
EP2507589A1 (fr) Procédé pour simplifier une description d'un itinéraire routier
DE102019126736A1 (de) Verfahren und einrichtung zur fahrzeugabgestimmten strassenbeurteilung und -empfehlung
DE102017208509A1 (de) Verfahren zum Erzeugen eines Straßenmodells während einer Fahrt eines Kraftfahrzeugs sowie Steuervorrichtung und Kraftfahrzeug
EP1430273B1 (fr) Procede de calcul automatique d'itineraires optimaux
DE102010001700A1 (de) Verfahren zur Bestimmung eines Bildes benutzter oder bekannter Streckenabschnitte
DE102015008968A1 (de) Verfahren zur Auswertung von Fahrzeugdaten
DE102019211100A1 (de) Verfahren, Vorrichtung und Computerprogramm zum Aufbereiten von Daten über eine Ampelanlage
DE102012210454A1 (de) Verfahren und Vorrichtung zur Bereitstellung von Daten für einen elektronischen Horizont für ein Fahrerassistenzsystem eines Fahrzeugs
DE102017008667A1 (de) Verfahren zur dynamischen Routenplanung
EP3300030A1 (fr) Dispositif de traitement de données et procédé de réduction de la complexité d'un réseau de tronçons de route
DE102022109659A1 (de) Schätzung der lateraldynamik von fahrzeugen anhand von telemetriedaten
DE102021207200A1 (de) Verfahren und Server zur Verwaltung von mobilen Akku-Pools für mehrere Stationen
DE102011075351A1 (de) Verfahren zum Betrieb eines Kraftfahrzeugs mit einem Navigationssystem
DE102004032499B3 (de) Verfahren und Routenplanungssystem zur Generierung und Speicherung von für eine dynamische Routenplanung benötigten Daten
AT522734B1 (de) Verfahren zur Ermittlung eines Bewegungsprofils einer Person
DE102018217610A1 (de) Verfahren zur Luftqualitätsoptimierung, Steuerung, Fahrzeug und System zur Durchführung des Verfahrens
DE102021204191B4 (de) Vorrichtung und Verfahren zur echtzeit-basierten dynamischen Verkehrszuordnung für zumindest zwei nachfolgende Fahrbahnen
DE102004001906B4 (de) Verfahren und Computerprogramm zum Generieren von mindestens einem Datensatz als Repräsentation für einen Abschnitt einer gebührenpflichtigen Straße

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

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

Free format text: STATUS: THE APPLICATION HAS BEEN PUBLISHED

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL 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 RS SE SI SK SM TR

AX Request for extension of the european patent

Extension state: BA ME

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

Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE

17P Request for examination filed

Effective date: 20180928

RBV Designated contracting states (corrected)

Designated state(s): AL 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 RS SE SI SK SM TR

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

Free format text: STATUS: EXAMINATION IS IN PROGRESS

17Q First examination report despatched

Effective date: 20200623

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

Free format text: STATUS: EXAMINATION IS IN PROGRESS

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

Free format text: STATUS: THE APPLICATION HAS BEEN REFUSED

18R Application refused

Effective date: 20230619