EP3824247A1 - Procédé et système destiné à déterminer une position d'un véhicule - Google Patents

Procédé et système destiné à déterminer une position d'un véhicule

Info

Publication number
EP3824247A1
EP3824247A1 EP19749243.2A EP19749243A EP3824247A1 EP 3824247 A1 EP3824247 A1 EP 3824247A1 EP 19749243 A EP19749243 A EP 19749243A EP 3824247 A1 EP3824247 A1 EP 3824247A1
Authority
EP
European Patent Office
Prior art keywords
data
landmark
vehicle
factor graph
determined
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.)
Pending
Application number
EP19749243.2A
Other languages
German (de)
English (en)
Inventor
Daniel WILBERS
Christian MERFELS
Bernd Rech
Thilo Schaper
Niklas KOCH
Stefan Jürgens
David Perdomo Lopez
Constanze HUNGAR
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.)
MAN Truck and Bus SE
Volkswagen AG
Original Assignee
MAN Truck and Bus SE
Volkswagen 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 MAN Truck and Bus SE, Volkswagen AG filed Critical MAN Truck and Bus SE
Publication of EP3824247A1 publication Critical patent/EP3824247A1/fr
Pending 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/20—Instruments for performing navigational calculations
    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/38—Electronic maps specially adapted for navigation; Updating thereof
    • G01C21/3804—Creation or updating of map data
    • G01C21/3833—Creation or updating of map data characterised by the source of data
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T7/00—Image analysis
    • G06T7/70—Determining position or orientation of objects or cameras
    • G06T7/73—Determining position or orientation of objects or cameras using feature-based methods
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06V—IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING
    • G06V20/00—Scenes; Scene-specific elements
    • G06V20/50—Context or environment of the image
    • G06V20/56—Context or environment of the image exterior to a vehicle by using sensors mounted on the vehicle

Definitions

  • the present invention relates to a method and a system for determining a position of a vehicle.
  • GNSS global navigation satellite systems
  • GPS global positioning system
  • DE 10 2013 208 521 A1 describes a method for the collective learning of a highly precise digital street model.
  • a route is traveled several times and trajectory and perception data are recorded.
  • the trajectories are associated and an information graph is formed and optimized, whereby optimal trajectory points are determined.
  • Based on the perception data a highly precise street model is created on this basis.
  • DE 10 2016 205 193 A1 describes a method for marginalizing a Poznan graph, in which graphs that get larger and larger over time are reduced. Optimization is carried out to obtain an estimated position. Then a node of the graph is marked and removed. For this purpose, a fixed node is determined, for example a position that has not been changed by the optimization.
  • a local lane arrangement is recorded relative to the vehicle. Based on a geometric similarity of this recorded lane arrangement
  • the pose can be updated using the specified map material.
  • An arrangement and a method for sensor fusion are proposed in DE 10 2014 209 340 A1.
  • a factor graph is generated on the basis of received sensor data and a fused sensor signal is generated using an interference machine.
  • a maximum travel length is determined as a function of the accuracy of detection for the odometry data.
  • the present invention is based on the object of providing a method and a system of the type mentioned at the outset which enable position determination with high accuracy and with efficient use of the resources available in a vehicle.
  • provisional position data of the vehicle and environmental data are recorded.
  • Landmark measurement data for detected landmarks in an environment of the vehicle are determined on the basis of the environmental data.
  • Map data is acquired, the map data comprising prior landmark data.
  • a factor graph is determined, the factor graph comprising vehicle position nodes that represent preliminary vehicle position data and landmark position nodes that represent landmark position data.
  • the factor graph is optimized, with optimized vehicle position data being determined. The position is determined on the basis of the optimized vehicle position data. This can then be output.
  • the determination of the position or pose becomes one
  • a factor graph is determined and used to create a
  • a relationship between the accuracy of the localization and the required computing time can also be adapted and, if necessary, adapted according to the specific situation or configuration of the vehicle. This can be done in particular by taking into account a suitable number of measurements from the past and / or by setting a length of the trajectory that is used for localization. The use of a sliding window and the consideration of a large number of positions along a trajectory is discussed in more detail below.
  • the method also relates to a map-relative localization, so that the specification of the global coordinates in the map data used is less critical than, for example, with known RTK-GPS methods (real-time kinematic).
  • the creation of the maps is therefore less complex and less expensive.
  • Such a map-relative localization can be used in particular for automated driving functions, it also being possible to load further information from other parts of the map if required. If, however, the map is correctly globally referenced, a global localization can be carried out directly on the basis of the map-relative localization according to the invention, ie correct data about the position or the pose are generated in a global coordinate system.
  • map data with a smaller file size are required, so that advantages in the use of storage space and possibly bandwidth when reloading data are achieved. Furthermore, the Computing time can be shortened. Maps with semantic objects and landmarks can also be checked and serviced particularly easily, as the corresponding ones
  • Landmarks can be easily found and checked.
  • an abstraction layer is used between the raw sensor data and the localization step, and different sensors can be used to detect landmarks. In this way, sensors can be exchanged and changed more easily, for example when changing between different ones
  • maps with landmarks can be created particularly easily by third-party providers who do not need to know exactly which raw sensor data is available in the vehicle.
  • known methods typically assume that features and characteristics are specified in the way they are observed, for example, with a specific camera or a specific type of radar sensor.
  • the relevant input data are displayed in a factor graph, this is optimized and an optimized vehicle position can then be read out.
  • the optimization method of the invention also leads to the fact that the
  • Input prior existing landmark data can also be optimized. This means that, depending on the data collected, these sizes can also be adjusted so that reality is as accurate and accurate as possible.
  • optimization methods are usually more precise than simple filter methods, which have to allow greater noise in the system in order to deliver non-divergent results. Optimization methods like the one used here are deterministic, which is not the case with a Monte Carlo method like the particle filter.
  • non-deterministic methods are fundamentally critically evaluated in questions of functional safety and it therefore seems unlikely that they can form the basis for highly automated driving functions.
  • non-deterministic methods provide poorly reproducible results because they depend on
  • positions can be specified in any coordinate systems in a manner known per se. In particular is a global one
  • Coordinate system is provided or a relative coordinate system, for example relative to the vehicle or another reference point.
  • a coordinate system can be specified within a certain area, for example in a parking lot, in a parking garage or on a private site.
  • the term “position” should be broadly defined and in particular also include poses. In addition to the position within a coordinate system, these also indicate an orientation, in particular a two-dimensional or three-dimensional orientation relative to the coordinate system. Poses are of particular importance for applications in the field of automotive technology, since they usually also dictate a direction of movement of the vehicle.
  • Position data therefore include information on the position, possibly also in a broader sense information on the pose of the vehicle and / or on a state of motion of the vehicle. This information can relate to a current or earlier point in time, in particular also a series of successive points in time.
  • the position data are recorded or made available in a manner known per se.
  • the recorded provisional position data comprise a global position estimate and a local position estimate.
  • local and global describes the coordinate system in particular: local pose and landmark factors are described in the vehicle coordinate system, while global pose and landmark factors are described in a global (world coordinate system).
  • a global position estimate can be made, for example, using a global
  • Navigation satellite system such as GPS can be determined.
  • the result of a corresponding GPS measurement can include information about a position and / or a pose of the vehicle.
  • Other methods known per se can alternatively or additionally be used.
  • a global position estimate can be used in particular for initialization.
  • a local position estimate can be determined, for example, using odometry methods, for example by means of tire odometry, visual odometry or other methods known per se, such as LIDAR scan / Wafc / 7 / ' n or inertial navigation.
  • odometry methods for example by means of tire odometry, visual odometry or other methods known per se, such as LIDAR scan / Wafc / 7 / ' n or inertial navigation.
  • the acquisition of the environmental data is also carried out in a manner known per se, in particular in such a way that the data provides information about landmarks and other features in one
  • Environment of the vehicle can be determined, in particular information about the relative positions of landmarks relative to the vehicle.
  • the environmental data are recorded using a camera, a laser sensor and / or a radar sensor.
  • a laser sensor or a radar sensor.
  • an ultrasonic sensor or an infrared camera can be used alternatively or additionally.
  • further known detector modules or sensors of the vehicle can be used or data can be received from an external source or detection device. As a result, sensors can advantageously be used which are already widespread and inexpensively available in many modern vehicles.
  • the position and environment data can be recorded in particular for a large number of times and / or positions during the movement of the vehicle.
  • the movement of the vehicle along a trajectory that is, along a specific path as a function of time, can be tracked.
  • the method according to the invention is card-based, which means that it requires that
  • Map data is present that includes prior landmark data. With similar known localization methods, this data is neglected, which is disadvantageous for the
  • the card data can be on
  • a storage unit of the vehicle such as can be included in a navigation system.
  • they can be accessed and accessed from an external facility can be received, for example via a computer network such as the Internet or from a local service, for example a server, which provides the card data for a parking lot or an operating site.
  • a transmission through a network of vehicles can be provided.
  • the map data can be recorded in particular when driving through a specific geographical area, for example by providing it when the vehicle is on a specific section of a road, a parking lot or a
  • the acquisition is carried out in particular on the basis of an initial global position estimate, for example using GPS.
  • the card data can also be recorded on the instruction of a user, for example when manually calling up updated map data.
  • the prior landmark data included in the map data are treated in particular as global landmark factors. They include information about landmarks in a geographic area, in particular their position, orientation and / or other features that can be used for their identification and localization.
  • “Landmarks” in the sense of the invention are, in a broad sense, features in a geographical environment to which at least one position can be assigned.
  • Landmarks can be, for example, road markings and strips, posts, piles and pillars, signs, corners, edges and surfaces of buildings, elements of vegetation, artificial landmarks such as barcodes or other features.
  • landmark data are determined on the basis of the surrounding data. Landmarks are detected and for the detected ones
  • Landmarks are determined further information, such as their position, orientation, characteristics, certain characteristics such as color, length, radius or other.
  • the parameters used here depend, in particular, on the type of landmark: for example, a start and an end position can be assigned to a road marking, which gives a length and direction, and also, if appropriate, a thickness, color, shape and / or pattern.
  • the environmental data can be evaluated for further landmarks and other types of landmarks.
  • semantic landmarks are assumed, which are based on the
  • Environment data can be recognized and classified as objects.
  • a Landmarks not only a pattern recognizable in the surrounding data, but a type of landmark is recognized, to which certain properties can be assigned.
  • the raw data are not evaluated directly, for example on the basis of a pattern recognition in the data recorded by a laser scanner, but a landmark is recognized as an object that belongs to a certain category of landmarks and has certain, clearly defined properties that are associated with different methods can be measured.
  • One advantage of this procedure is that the information stored in a map about such semantic landmarks can be checked for correctness particularly easily, in particular also manually. It is also possible to use map data with prior landmark data from any source, making it particularly high
  • the factor graph determined in the method consists of a set of nodes and edges, which represent factors here.
  • the nodes comprise estimated values that are to be determined, in particular vehicle poses at specific times and landmarks with their corresponding poses. Vehicle poses are parameterized as points in one
  • landmark nodes (two-dimensional: x, y, theta; three-dimensional: x, y, z, roll, pitch, yaw angle).
  • a global coordinate system is provided.
  • the parameterization of landmark nodes differs depending on the landmark type, whereby landmarks are divided into classes of different geometries. Landmarks whose position can be represented by a point, such as posts, are parameterized as a point (two-dimensional: x, y; three-dimensional: x, y, z) in a coordinate system. For other types of landmarks, at least one position is also provided as a parameter, possibly together with other parameters.
  • a factor can be connected to any number of nodes.
  • the factors are connected to only one node (unary factors) or they connect two nodes in pairs (binary factors).
  • unary factors describe a prior, i.e. information that is already known, about the linked estimate. Are in the process
  • Global pose factors are connected to a node that represents a vehicle pose and describe the (mathematical) prior about which position or pose this node corresponds to, which is the estimated value for the vehicle pose at the node.
  • This unary factor is formed by a GPS measurement and assigned to a vehicle pose. In the resulting optimization problem, the boundary condition is that the estimate should remain close to the GPS measurement.
  • Landmark node that represents the parameters of a landmark to be estimated. In the method, they are formed directly from the prior landmark data included in the map data. They are then assigned to a landmark node and linked to it. With the resulting optimization problem, this results in the boundary condition that the estimate should be close to the prior landmark data.
  • association of landmark measurement data carried out wherein associated landmark measurement data are determined depending on a specific point in time.
  • associated landmark measurement data are determined depending on a specific point in time.
  • several repeated observations of the same landmark are identified in the method. This advantageously makes it possible to reduce the scope of the optimization problem to be solved arithmetically and to solve it more efficiently by repeating
  • the results obtained can also be compared with the prior information in order to check the correctness and consistency of the prior information.
  • Landmark measurement data can be associated with the map data, in particular the prior landmark data. This can be done at any time step for which the method is carried out. As a result, registered landmarks can be assigned to landmarks included in the map data, and incorrect assignments can be corrected if necessary, even retrospectively for a previous time step. The subsequent checking of an assignment or the subsequent correction of an incorrect assignment is made possible in particular by the fact that the assignment can be repeated as a separate method step for each point in time of the landmark data recorded.
  • the method can also include a history of assignments between local landmark factors, which are determined on the basis of the landmark measurement data, and map landmarks, determined from the prior landmark data. For example, it counts how often a local landmark is assigned to a map landmark. If this number of matches of the mappings reaches or exceeds a threshold, this hypothesis is assumed to be valid. This makes it possible to avoid incorrect assignments.
  • association hypotheses can be compared, for example for several points in time for which the method is carried out, and incorrect or defective associations can be prevented or corrected. The association can also be subsequently corrected. Landmarks detected locally by the vehicle and determined on the basis of the prior landmark data can thus be associated with particular certainty.
  • a local landmark which was determined on the basis of the landmark measurement data and to which no map landmark could be assigned on the basis of the prior landmark data, can subsequently be a probable map landmark for the
  • Time of the acquisition of the landmark measurement data can be assigned. Furthermore, incorrect assignments or associations with a too low probability can subsequently be identified on the basis of the history.
  • the acquisition of the environmental data and the position data always takes place synchronously with one another and exactly at the point in time for which a position is to be estimated.
  • Different methods can therefore be used in order to be able to use the measurements for a specific point in time:
  • the time offset can be ignored, in particular if the times are very short or if it is known that the movement of the vehicle is so slow that there is no relevant shift in position for the time offset.
  • the position data in particular data of an odometry method, can be used to extrapolate the displacement of the position during the time offset from the movement sequence or to interpolate between two points in time.
  • the factor graph is determined for points in time that are regular
  • Factor graph completely redesigned. As a result, a movement of the vehicle along a trajectory can advantageously be tracked.
  • the regular intervals can relate to fixed time intervals.
  • the factor graph can be generated at regular spatial distances or it can be a minimum spatial distance
  • Condition for the creation of a new factor graph can be provided. Before the Determining a new factor graph can also be checked whether there is data from a particular input source or from several input sources. In particular, at the times when the factor graph is newly determined, new estimates for the position, that is to say new position nodes, are generated.
  • map measurement data and prior landmark data are assigned and the vehicle position data and landmark position data of the factor graph are determined on the basis of the assignment.
  • the assignment is made locally in particular.
  • the assignment can be based on the information stored on the landmarks
  • a local proximity between a detected landmark and the predefined estimated position is used for the assignment, that is to say that a detected landmark is assigned to a landmark within the map data on the basis of the landmark measurement data, that of the respective one
  • Position estimate corresponds as closely as possible.
  • Landmark position node of the factor graph determines optimized landmark position data. This advantageously also optimizes the positions of the landmarks when optimizing the factor graph.
  • the method can be used to improve the prior landmark data given by the map data on the basis of measurements.
  • quality data is generated and output on the basis of the prior landmark data and the optimized landmark position data.
  • the quality data can include information as to whether and to what extent the landmarks actually detected differ from the information that is provided with the map data.
  • the map data is updated on the basis of the quality data.
  • the method is repeated iteratively for a plurality of points in time and a trajectory of positions is output, with a later factor graph each representing one is assigned later, is determined on the basis of an earlier factor graph which is assigned to an earlier time.
  • the factor graph is marginalized in such a way that the later factor graph does not reach a predetermined maximum size
  • the method is carried out at regular time intervals. This advantageously allows a trajectory of the vehicle to be traced.
  • the maximum size of the factor graph can be defined in a manner known per se, in particular as the number of nodes and edges and / or on the basis of a complexity measure which quantifies the computation effort required to solve the optimization problem.
  • a “sliding window” which defines a fixed time window based on a current point in time. For example, all the data of the factor graph can always be taken into account for a specific time interval before the current time. Older data can be completely ignored, especially if the time interval is long and the older data is therefore out of date. Weighting can also be carried out depending on the age of the data, with older data in particular being weighted less strongly. In addition, the data from earlier times
  • the method involves a completely new optimization of the factor graph for each time step.
  • older estimates are typically not improved in conventional methods, since errors in the estimate are continued at earlier points in time.
  • the method therefore advantageously optimizes the estimates at any point in time instead of being dependent on the results of past estimates.
  • the factor graph comprises landmark position nodes and prior landmark data, which can be represented in particular by global landmark factors.
  • the landmark position nodes are often removed by marginalization. Marginalizing the
  • the system according to the invention for determining a position of a vehicle comprises a detection unit for detecting preliminary position data of the vehicle and
  • a processing unit for determining landmark measurement data for detected landmarks in an environment of the vehicle based on the environment data and an interface for receiving map data, the map data comprising prior landmark data. It also includes an arithmetic unit that is set up to determine a factor graph, the factor graph comprising vehicle position nodes that represent preliminary vehicle position data and landmark position nodes that represent landmark position data. It is also set up to optimize the factor graph, determining optimized vehicle position data, and determining and outputting the position on the basis of the optimized vehicle position data.
  • the system according to the invention is particularly designed to implement the method according to the invention described above.
  • the system thus has the same advantages as the method according to the invention.
  • the interface for receiving card data can be designed in different ways known per se.
  • an interface to a computer network such as the Internet
  • a local service such as a local server
  • the vehicle can comprise a storage unit or a storage unit of an external device can be used, in particular data from a navigation device being accessible.
  • the detection unit comprises a camera, an ultrasound sensor, a laser sensor and / or a radar sensor.
  • sensors and sensor types can be used.
  • sensors which are widely used and available in many vehicles are advantageously used, the system not being limited to these sensors.
  • Figure 1 shows a vehicle with an embodiment of the invention
  • FIG. 2A shows an exemplary embodiment of the factor graph according to the invention
  • Figure 2B shows an embodiment of a situation on a road with the
  • FIG. 3 shows an embodiment of the method according to the invention.
  • a vehicle 1 comprises a detection unit 2, which is coupled to a control unit 8.
  • the detection unit 2 comprises a plurality of detection and not shown
  • Sensor modules including modules for determining the position using GPS (global positioning system) and using odometry, in particular by detecting the wheel speed and the steering angle of the vehicle 1. It also includes a laser scanner and a camera for detecting the surroundings of the vehicle 1.
  • the control unit 8 comprises one
  • the vehicle 1 also includes drive and steering means 7, which are designed in a manner known per se and allow longitudinal and / or lateral control of the vehicle 1.
  • the vehicle 1 further comprises an interface 6, which is coupled to the control unit 8 and can establish a separable, wireless data connection to an external server 10 in a manner known per se.
  • the factor graph comprises nodes and edges, the edges being referred to as factors in the exemplary embodiment.
  • unary and binary factors are provided, which are connected to one or two nodes.
  • the nodes are shown as circles in FIG. 2A, the factors are represented by rectangles and linear connections to the nodes.
  • the nodes p 0 to p 6 represent (vehicle) pose nodes, that is to say the poses (positions and orientations) of the vehicle 1 at specific times.
  • the method essentially serves to specify and optimize estimates for these pose nodes, in particular using a global coordinate system.
  • the nodes l 0 and h represent landmark nodes, that is, poses of different landmarks.
  • the local pose factors o 0 to o 5 represent odometry factors. They therefore depend on the data of an odometry device measured by the detection unit 3, which during the movement from one pose to another data on the movement,
  • approximately o 0 represents the change in the pose of the vehicle 1 between the pose nodes p 0 and pi.
  • the global pose factors a 0 and ai represent prior information about a vehicle pose, the exemplary embodiment here providing for a global position determination by means of the GPS module of the detection unit 3.
  • the local landmark factors g 0 to g 3 represent observations of a landmark from a vehicle pose to a landmark. That is, while the vehicle 1 is in a certain pose, it detects its surroundings with at least the landmarks by means of the detection unit 3. The measurements go into the local landmark factors g 0 to g 3 and allow the determination of a relative position of the landmarks relative to the vehicle 1. In the example shown, the landmark belonging to the landmark position node l 0 was detected from the vehicle positions pi and p 3 , the landmark at h from p 3 and p 5 .
  • the global landmark factors m 0 and mi represent prior landmark data.
  • these are comprised of map data, in particular absolute positions, orientations and further parameters of different landmarks.
  • FIG. 2B there is a vehicle 24 on a road 21 on which road markings 22 are attached and guide posts 23 are arranged on the edge thereof.
  • the vehicle 24 detects its surroundings by means of a detection unit 3, which in the Is essentially designed as shown in Figure 1 for the embodiment of the system according to the invention. Dashed lines indicate that some of the guide posts 23 are detected by the vehicle 24, in particular their positions relative to the position of the vehicle 24 being detected.
  • the data on the map 30 together with the detections of the vehicle 24 flow into a factor graph which it Essentially as shown in FIG. 2A, the pose of the vehicle 24 at certain times is represented by the pose nodes p 0 to p 6 , the global pose factors a 0 and ai represent GPS measurements at certain times and the local pose factors o 0 to o 5 correspond to a movement of the vehicle 24 between two times in each case.
  • the positions of the landmarks 23 are represented by the landmark nodes l 0 and h, global landmark factors m 0 and mi represent prior landmark data as included in the map 30, and the local landmark factors g 0 to g 3 represent observations of landmarks 23.
  • Embodiments of the factor graph and a situation on a street with the associated map section are possible.
  • the map data can be provided by the navigation system 5 or a storage system, for example. These input data can be made available in different ways, in particular by means of the detection unit 2 and via the interface 6 of the vehicle 1.
  • the input data are buffered in further steps S21, S22, S23, S24, that is, a memory is provided which collects and makes available input data at least until it is processed.
  • the input data include provisional position data, which in the exemplary embodiment is carried out using an odometry method and as global position estimates, in particular using GPS, be recorded.
  • Global position estimates are buffered in step S21, and odometry data are buffered in step S22.
  • Processing unit 3 initially detected landmarks in a manner known per se.
  • semantic landmarks are determined, that is to say the landmarks are assigned to specific types and parameters for the individual landmarks are determined.
  • the determined parameters include at least one position, possibly further properties of the detected landmark, such as a length or other extent, a radius, a geometric shape or a start and end point.
  • the landmark detection is buffered in step S23.
  • the map data acquired at the beginning include, in particular, a map with prior landmark data, that is to say information about landmarks in the map
  • the map data can be fully loaded at the beginning, reloaded in sections, or from a backend or other vehicles,
  • step S24 The map data, in particular a landmark map, is buffered in step S24.
  • the buffering S21, S22, S23, S24 of the input data also takes place concurrently during a cycle, in particular in order to be able to provide data for pose determination at later times.
  • the graph structure is started and then the graph optimization. Finally, the final pose estimate is extracted from the graph by optimization.
  • the times at which the vehicle pose is to be estimated are first determined. This is done in the embodiment in a fixed time interval, but could also happen, for example, by a spatial minimum distance that the vehicle travels between two estimates. Another possibility is to link these times to the existence of the data of one or more input sources. At these times, Poznan nodes, in particular vehicle position nodes, are then inserted in the graph and a new one can be created
  • a step S41 global pose factors a 0 , ai are calculated using the global pose estimates that are present in the buffer. These must fit in time with the pose nodes previously created. Since in general the global post estimates are not recorded at the point in time for which the factor graph is to be determined, the global post estimates must be postponed using a suitable strategy. In the exemplary embodiment, a nearest neighbor strategy is used for this, in which the next point in time is selected. This works well in cases when the time difference between Poznan nodes p 0 to p 6 is small, about only a few milliseconds.
  • An alternative strategy is to interpolate between two global position estimates in the buffer in order to obtain a new estimate that fits in time to a pose node p 0 to p 6 .
  • Another strategy is to determine the shift in global posture estimates using odometry. This works well when odometry makes small mistakes for short sections. After determining the global pose factors a 0 , ai, these are inserted into the graph and connected to the corresponding pose nodes p 0 to p 6 .
  • a step S42 the odometry data are processed in the buffer.
  • the times of the input data that is to say the odometry measurements detected by the detection unit 2 generally do not match the times of the pose nodes Po to p 6 .
  • interpolation and closest neighbor processes can be used.
  • the odometry measurements are preferably chained to one another by the distance traveled between any points in time
  • the corresponding local pose factors o o to o 5 are inserted in the factor graph.
  • the local pose factors o o to o 5 each link two vehicle poses p o to p 6 .
  • Either the pose nodes p 0 to p 6 that are closest in time to the measurement or two always successive pose nodes p 0 to p 6 are preferably linked.
  • the landmark detections buffered in step S23 are also processed in a similar manner. The landmarks are first brought together in a local association step S31. This step S31 does two things: First, the detections are projected onto the time stamp of the closest Poznan node p 0 to p 6 .
  • the data from the odometry buffer can be used for this purpose.
  • optimized pose nodes p 0 to p 6 can be used to determine the movement and to carry out an interpolation or extrapolation. If there is no data in the factor graph at the time the method is carried out, a movement model of the vehicle can be used to extrapolate the movement at a desired point in time.
  • step S31 hypotheses are made as to which of the detected landmarks which are stored in the buffer relate to the same physical object in the vicinity of the
  • Vehicle 1 belong.
  • the same landmark can be detected several times by the same detector or by different sensors. This can be done, for example, using a nearest neighbor strategy, with threshold values for excessive distances leading to rejection of the hypothesis.
  • Another option is to use special descriptors of the
  • Embodiment found a clear solution, it is accepted as a hypothesis. If there are several possible candidates, the hypothesis formation appears to be too uncertain and the hypothesis is therefore not accepted.
  • step S31 thus delivers a set of local landmark factors g 0 to g 3 , which are now used directly in a step S43 to determine the factor graph.
  • step S32 for a card assignment.
  • the local landmark factors g 0 to g 3 are compared with the map included in the map data and hypotheses are generated which of the local ones
  • Landmark factors g 0 to g 3 agree with which map landmark, that is to say a landmark comprised by the prior landmark data.
  • step S32 it is thus determined which subset of the map landmarks corresponds to which subset of the local landmark factors g 0 to g 3 .
  • the execution of this step S32 can be made more difficult by the fact that map landmarks are missing and / or by incorrect detections of the detector are present, in which case no association can be found in each case.
  • step S32 is a set of associations between local landmark factors g 0 to g 3 and map landmarks. These are then processed in a further step S33 for the time comparison.
  • step S33 of the time comparison a history is formed about the assignments between local landmark factors g 0 to g 3 and map landmarks.
  • this includes the number of times the hypothesis was generated that a specific local landmark factor factor g 0 to g 3 can be assigned to a specific map landmark.
  • This hypothesis is only assumed to be valid after a minimum number of matches, so that incorrect detections can be avoided.
  • hypotheses for data association are validated over a longer period of time, and short-term bad associations can also be prevented and corrected. In this way, a more stable assignment is achieved between landmarks recorded locally by the vehicle and present on the map.
  • Map landmarks are formed in a step S44 global landmark factors m 0 , mi. These are then built into the factor graph. In particular, they indicate at which position a particular landmark is expected.
  • step S50 the factor graph with the information is one
  • the function graph has normally become larger in normal operation.
  • a sliding window is provided in the exemplary embodiment, that is to say a time window that shifts with each time step. If through If such a shift of information in the function graph falls out of the time window, the function graph must be trimmed accordingly, for which different methods can be used:
  • the oldest nodes and factors are removed outside the time window.
  • the nodes and factors of the factor graph that have the least information content can be removed.
  • a first option is to simply delete nodes and factors. This is of low complexity and can be sufficient for a large factor graph.
  • Another option preferred in the exemplary embodiment is the marginalization of information. For this the
  • the factor graph is optimized, whereby known algorithms for graph optimization can be used.
  • This optimization provides a determination of the node values, which represent all factors in the best possible way. All pose nodes Po to p 6 and landmark nodes l o , h are thus determined so that the conditions of the factors m o , mi, g o to g 3 , o o to o 5 , a o , ai are as good as possible be respected.
  • the pose nodes p o to p 6 are of interest, those on the graph head are the most recent vehicle poses
  • step S70 the most recently determined vehicle pose is usually output. For other applications, it may be of interest to alternatively or additionally output older pose nodes in this step S70, for example in order to carry out calculations for the past.
  • a trajectory that is driven can be relevant for other applications, that is to say a train that is bordered by the vehicle and that can also be output.
  • the determined landmark positions l 0 , h, which can also be output in this step S70, can be relevant for yet other applications.
  • an initial pose is determined by means of GPS measurement or on the basis of comparable data.
  • the factor graph can be built up beforehand, but optimizing it does not bring any meaningful results for most applications, especially if the assignment to the map landmarks is not achieved can.
  • a fixed position can be used, which is set, for example, ex works or from a parking space for company vehicles, or which can be configured in a configurable manner, for example a position in a garage for private individuals.
  • the procedure is independent of GPS measurements and the initial pose can be determined particularly easily.
  • Additional landmarks can also be integrated in the method if they can be represented geometrically and an error function can be specified for them. This can be implemented for common landmarks using methods known per se, for example for posts, road markings, manhole covers, house surfaces, house edges,
  • Tunnel entrances traffic signs, traffic lights, roundabout centers, drains, curbs and similar landmarks.
  • the global landmark factors m 0 , mi determined in the method serve in particular as prior landmark data, that is to say as predetermined from the outside of the method
  • the landmark nodes l 0 , h of the factor graph can also be marginalized in order to achieve a smaller state vector, which means a reduced memory consumption and a shorter execution time in the construction and optimization of the factor graph.
  • losses in accuracy may have to be weighed in favor of speed.
  • no estimated landmark positions are obtained on the basis of the landmark nodes l 0 , h, while the preferred landmark data can also be evaluated in preferred exemplary embodiments of the method.

Landscapes

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

Abstract

L'invention concerne un procédé destiné à déterminer une position d'un véhicule (1), selon lequel des données de position provisoires du véhicule (1) et des données environnementales sont détectées ; des données de mesure de points de repère sont déterminées à l'aide des données environnementales pour des points de repère détectés dans un environnement du véhicule (1) ; et des données de carte sont détectées, les données de carte comprenant des données de points de repère préalables. Un graphique de facteurs est déterminé, le graphique de facteurs comprenant des nœuds de position de véhicule (p0, p1, p2, p3, p4, p5, p6) qui représentent les données de position provisoires de véhicule, et des nœuds de position de points de repère (l0, l1) qui représentent des données de position de points de repère ; et une optimisation du graphique de facteurs est mise en œuvre, des données de position optimisées de véhicule étant déterminées. La position est déterminée à l'aide des données de position optimisées de véhicule. L'invention concerne par ailleurs un système destiné à déterminer une position d'un véhicule (1), comprenant une unité de détection (2), une unité de traitement (3), une interface (6) et une unité de calcul (4). Selon l'invention, l'unité de calcul (4) sert à mettre en œuvre le procédé selon l'invention.
EP19749243.2A 2018-07-20 2019-07-18 Procédé et système destiné à déterminer une position d'un véhicule Pending EP3824247A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE102018117660.0A DE102018117660A1 (de) 2018-07-20 2018-07-20 Verfahren und system zum bestimmen einer position eines fahrzeugs
PCT/EP2019/069442 WO2020016385A1 (fr) 2018-07-20 2019-07-18 Procédé et système destiné à déterminer une position d'un véhicule

Publications (1)

Publication Number Publication Date
EP3824247A1 true EP3824247A1 (fr) 2021-05-26

Family

ID=67539439

Family Applications (1)

Application Number Title Priority Date Filing Date
EP19749243.2A Pending EP3824247A1 (fr) 2018-07-20 2019-07-18 Procédé et système destiné à déterminer une position d'un véhicule

Country Status (4)

Country Link
EP (1) EP3824247A1 (fr)
CN (1) CN113330279A (fr)
DE (1) DE102018117660A1 (fr)
WO (1) WO2020016385A1 (fr)

Families Citing this family (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE102019119000B4 (de) * 2019-07-12 2022-02-10 Bayerische Motoren Werke Aktiengesellschaft Bestimmen einer Fahrspurbegrenzung
DE102019123538A1 (de) * 2019-09-03 2021-03-04 Bayerische Motoren Werke Aktiengesellschaft Verfahren und Vorrichtung zur Ermittlung einer Trajektorie eines Fahrzeugs
DE102019216722A1 (de) * 2019-10-30 2021-05-06 Zf Friedrichshafen Ag Verfahren zum Lokalisieren eines Fahrzeugs in einer digitalen Karte
DE102020115718A1 (de) 2020-06-15 2021-12-16 Man Truck & Bus Se Verfahren zur Bestimmung einer Nutzungsart eines Landmarkenmusters für eine Eigenlokalisierung eines Fahrzeugs, sowie elektronisches Eigenlokalisierungssystem für ein Fahrzeug
CN112595330B (zh) * 2020-11-13 2021-10-15 禾多科技（北京）有限公司 车辆定位方法、装置、电子设备和计算机可读介质
CN112577496B (zh) * 2020-11-25 2024-03-26 哈尔滨工程大学 一种基于自适应选权的多源融合定位方法
DE102021117744A1 (de) 2021-07-09 2023-01-12 Cariad Se Selbstlokalisierung eines Fahrzeugs basierend auf einer initialen Pose
DE102022103856A1 (de) * 2022-02-18 2023-08-24 Bayerische Motoren Werke Aktiengesellschaft Verfahren und Vorrichtung zur Erkennung eines Problems bei der Ermittlung eines Fahrpfades
WO2023198090A1 (fr) * 2022-04-14 2023-10-19 The Hong Kong Polytechnic University Positionnement cinématique en temps réel gnss assisté par vision 3d de systèmes autonomes dans des canyons urbains
CN115183778A (zh) * 2022-07-01 2022-10-14 北京斯年智驾科技有限公司 一种基于码头石墩的建图方法、装置、设备以及介质
DE102022207829A1 (de) 2022-07-29 2024-02-01 Robert Bosch Gesellschaft mit beschränkter Haftung Verfahren zum Hinzufügen eines oder mehrerer Ankerpunkte zu einer Karte einer Umgebung

Family Cites Families (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
NO20082337L (no) * 2008-05-22 2009-11-23 Modulprodukter As Fremgangsmate til fremstilling av veikart og bruk av samme, samt system for veikart
DE102013208521B4 (de) 2013-05-08 2022-10-13 Bayerische Motoren Werke Aktiengesellschaft Kollektives Erlernen eines hochgenauen Straßenmodells
DE102014209340A1 (de) 2014-05-16 2015-11-19 Siemens Aktiengesellschaft Anordnung und Verfahren zur Sensorfusion
US9558424B2 (en) 2015-06-30 2017-01-31 Mitsubishi Electric Research Laboratories, Inc. On-road stereo visual odometry without explicit pose determinations
DE102015214338A1 (de) * 2015-07-29 2017-02-02 Volkswagen Aktiengesellschaft Bestimmung einer Anordnungsinformation für ein Fahrzeug
JP6776513B2 (ja) * 2015-08-19 2020-10-28 ソニー株式会社 車両制御装置と車両制御方法と情報処理装置および交通情報提供システム
DE102015218041A1 (de) 2015-09-21 2017-03-23 Bayerische Motoren Werke Ag Verfahren und Vorrichtung zur Bereitstellung von Daten für eine Geometriekarte für ein autonomes oder automatisiertes Fahren eines Fahrzeugs
WO2018071416A1 (fr) * 2016-10-11 2018-04-19 Kaarta, Inc. Scanner laser à estimation d'égo-mouvement en ligne en temps réel
DE102016205193A1 (de) 2016-03-30 2017-10-05 Volkswagen Aktiengesellschaft Marginalisieren eines Posen-Graphen
US10083606B2 (en) * 2016-08-22 2018-09-25 Allstate Insurance Company Glare detection systems and methods for automated vehicular control
WO2018111920A1 (fr) * 2016-12-12 2018-06-21 The Charles Stark Draper Laboratory, Inc. Système et procédé permettant une localisation et un mappage simultanés sémantiques d'objets statiques et dynamiques

Also Published As

Publication number Publication date
CN113330279A (zh) 2021-08-31
WO2020016385A1 (fr) 2020-01-23
DE102018117660A1 (de) 2020-01-23

Similar Documents

Publication Publication Date Title
EP3824247A1 (fr) Procédé et système destiné à déterminer une position d'un véhicule
EP3491417B1 (fr) Procédé et système de détection de points de repère dans un environnement de circulation d'une unité mobile
EP3695244B1 (fr) Procédé et dispositif de génération d'un modèle de capteur inverse et procédé de détection d'obstacles
DE102019104974A1 (de) Verfahren sowie System zum Bestimmen eines Fahrmanövers
EP3490862B1 (fr) Procédé et dispositif permettant de déterminer un modèle de chaussée pour un environnement de véhicule
EP3814720B1 (fr) Système de localisation et procédé pour faire fonctionner ce dernier
DE102016214030A1 (de) Verfahren und System zum Erfassen eines Verkehrsumfeldes einer mobilen Einheit
DE102016214470B4 (de) Verfahren und System zum Erfassen eines Verkehrsumfeldes einer mobilen Einheit
DE102016214028A1 (de) Verfahren und System zum Bestimmen einer Position einer mobilen Einheit
DE102017105086A1 (de) Aktualisieren einer Landmarkenkarte
DE102015203016A1 (de) Verfahren und Vorrichtung zur optischen Selbstlokalisation eines Kraftfahrzeugs in einem Umfeld
DE102018203583B4 (de) Verfahren, Fahrerassistenzsystem sowie Kraftfahrzeug zur Prädiktion einer Position oder einer Trajektorie mittels eines graphbasierten Umgebungsmodells
DE102018133441A1 (de) Verfahren und System zum Bestimmen von Landmarken in einer Umgebung eines Fahrzeugs
DE102020118629B4 (de) Computerimplementiertes Verfahren zum Bestimmen der Validität einer geschätzten Position eines Fahrzeugs
DE102021114724A1 (de) Verbesserter fahrzeugbetrieb
EP3440433B1 (fr) Procédé pour déterminer une pose d'un véhicule, se déplaçant de manière au moins partiellement automatisée, au moyen de points d'intérêt spécialement sélectionnés et transmis par un serveur principal
DE102017108107A1 (de) Verfahren, vorrichtung und computerlesbares speichermedium mit instruktionen zur schätzung einer pose eines kraftfahrzeugs
DE102021111325A1 (de) Verfahren und Assistenzeinrichtung zum Unterstützen eines Fahrbetriebs eines Kraftfahrzeugs und Kraftfahrzeug
DE102021103153A1 (de) System und verfahren zur ende-zu-ende-vorhersage der spurerkennungsunsicherheit
DE102021214763A1 (de) Verfahren und Steuervorrichtung zum Steuern eines automatisierten Fahrzeugs
DE102021124736A1 (de) Verfahren und Vorrichtung zur Ermittlung einer Positions-Hypothese
DE102018215136B4 (de) Verfahren zum Auswählen eines Bildausschnitts eines Sensors
EP3671125B1 (fr) Système de détection de la position et procédé de fonctionnement d'un système de détection de la position pour une unité mobile
DE102018210712A1 (de) System und Verfahren zur gleichzeitigen Lokalisierung und Kartierung
DE102022002334B3 (de) Verfahren zur Ermittlung und Bereitstellung von Fahrspurverläufen

Legal Events

Date Code Title Description
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: UNKNOWN

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

Free format text: STATUS: THE INTERNATIONAL PUBLICATION HAS BEEN MADE

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

Free format text: STATUS: THE INTERNATIONAL PUBLICATION HAS BEEN MADE

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: REQUEST FOR EXAMINATION WAS MADE

17P Request for examination filed

Effective date: 20210118

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

RIN1 Information on inventor provided before grant (corrected)

Inventor name: HUNGAR, CONSTANZE

Inventor name: PERDOMO LOPEZ, DAVID

Inventor name: JUERGENS, STEFAN

Inventor name: KOCH, NIKLAS

Inventor name: SCHAPER, THILO

Inventor name: RECH, BERND

Inventor name: MERFELS, CHRISTIAN

Inventor name: WILBERS, DANIEL

DAV Request for validation of the european patent (deleted)
DAX Request for extension of the european patent (deleted)
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: 20220321