Landmark-Based and SLAM EKF localization with landmarks assume that - - PowerPoint PPT Presentation

landmark based and slam
SMART_READER_LITE
LIVE PREVIEW

Landmark-Based and SLAM EKF localization with landmarks assume that - - PowerPoint PPT Presentation

Autonomous and Mobile Robotics Prof. Giuseppe Oriolo Localization 3 Landmark-Based and SLAM EKF localization with landmarks assume that a unicycle-like robot is equipped with a sensor that measures range (relative distance) and bearing


slide-1
SLIDE 1

Autonomous and Mobile Robotics

  • Prof. Giuseppe Oriolo

Localization 3

Landmark-Based and SLAM

slide-2
SLIDE 2

Oriolo: Autonomous and Mobile Robotics - Landmark-based and SLAM

2

EKF localization with landmarks

  • assume that a unicycle-like robot is equipped with a

sensor that measures range (relative distance) and bearing (relative orientation) to certain landmarks

  • the position of the landmarks is fixed and known
  • depending on the robot configuration, only a subset of

the landmarks is actually visible

  • suitable sensors are laser rangefinders, depth cameras
  • r RFID sensors
  • landmarks may be artificial or natural
slide-3
SLIDE 3

Oriolo: Autonomous and Mobile Robotics - Landmark-based and SLAM

3

sagittal axis robot sensor field of view i-th range i-th bearing i-th landmark

  • ut-of-view

landmarks sensor

slide-4
SLIDE 4

Oriolo: Autonomous and Mobile Robotics - Landmark-based and SLAM

4

  • assume that L landmarks are present, and denote by

(xl,i,yl,i) the position of the i-th landmark

  • odometric equations can be used as a discrete-time

model of the robot; e.g., using Euler method where vk = (v1,k v2,k v3,k)T is a white gaussian noise with zero mean and covariance matrix Vk

  • let Lk ∙ L be the number of landmarks that the robot

can actually see at step k

slide-5
SLIDE 5

Oriolo: Autonomous and Mobile Robotics - Landmark-based and SLAM

5

  • each of the Lk measurements actually contains two

components, i.e., a range component and a bearing component

  • assume that for each measurement the identity of
  • bserved landmark is known (landmarks are tagged,

e.g., by shape, color or radio frequency)

  • we build the association map of step k

measurements landmarks

hence, a(i) is the index of the landmark observed by the i-th measurement

slide-6
SLIDE 6

Oriolo: Autonomous and Mobile Robotics - Landmark-based and SLAM

6

  • the output equation is

where and wk = (w1,k ... wL ,k)T is a white gaussian noise with zero mean and covariance matrix Wk

k

i-th landmark range i-th landmark bearing

slide-7
SLIDE 7

Oriolo: Autonomous and Mobile Robotics - Landmark-based and SLAM

7

  • actually, since both process and output equations are

nonlinear, we must apply the EKF and, to this end, the equations must be linearized

  • process dynamics linearization
  • we want to maintain an accurate estimate of the

robot configuration in the presence of process and measurement noise: this is the ideal setting for KF

slide-8
SLIDE 8

Oriolo: Autonomous and Mobile Robotics - Landmark-based and SLAM

8

  • output equation linearization

where

  • at this point, just crank the EKF engine
slide-9
SLIDE 9

Oriolo: Autonomous and Mobile Robotics - Landmark-based and SLAM

9

a typical result

estimated robot actual path (ground truth) covariance of the estimate estimated landmark actual landmark

slide-10
SLIDE 10

Oriolo: Autonomous and Mobile Robotics - Landmark-based and SLAM

10

data association

  • remove the hypothesis that the identity of each
  • bserved landmark is known: in practice, landmarks

can be undistinguishable by the sensor

  • basic idea: associate each observation to the landmark

that minimizes the magnitude of the innovation

  • the association map must be estimated as well
  • at the k+1-th step, consider the i-th measurement

yi,k+1 and compute all the candidate innovations

actual measurement expected measurement if yi,k+1 referred to the j-th landmark

slide-11
SLIDE 11

Oriolo: Autonomous and Mobile Robotics - Landmark-based and SLAM

11

  • the smaller the innovation ºij, the more likely that the

i-th measurement corresponds to the j-th landmark

  • however, the innovation magnitude must be weighted

with the uncertainty of measurement; in the EKF, this is encoded in the matrix and let a(i) = j, where j minimizes Âij

  • to determine the association function, let

measurement uncertainty due to prediction uncertainty measurement uncertainty due to sensor noise

slide-12
SLIDE 12

Oriolo: Autonomous and Mobile Robotics - Landmark-based and SLAM

12

EKF localization on a map

  • assume that a metric map M of the environment is

known to the robot

  • this may be a line-based map or an occupancy grid
slide-13
SLIDE 13

Oriolo: Autonomous and Mobile Robotics - Landmark-based and SLAM

13

  • assume that the robot is equipped with a range finder;

e.g., a laser sensor, whose typical scan looks like this (note the uncertainty intervals)

+

  • use the whole scan as output vector: its components

are the range readings in all available directions

slide-14
SLIDE 14

Oriolo: Autonomous and Mobile Robotics - Landmark-based and SLAM

14

  • note that no data association is needed; on the other

hand, aliasing may severely displace the estimate

  • the innovation is then computed as the difference

between the actual scan and the predicted scan where h ( ) computes the predicted scan by placing the robot at a configuration in the map

  • both the process dynamics (i.e., the robot kinematic

model) and the output function h are nonlinear, and therefore the EKF must be used

slide-15
SLIDE 15

Oriolo: Autonomous and Mobile Robotics - Landmark-based and SLAM

15

architecture

proprioceptive (encoders) exteroceptive (range finder)

  • dometric

prediction correction matching

  • utput

prediction previous estimate current estimate velocity inputs actual scan predicted scan innovation

+ —

yes map no hold

EKF-based localization sensing

predicted configuration

slide-16
SLIDE 16

Oriolo: Autonomous and Mobile Robotics - Landmark-based and SLAM

16

a typical result

EKF estimate actual robot (ground truth)

  • dometric

estimate

  • robotized wheelchair

with high slippage

  • 5 ultrasonic sensors

with 2 Hz rate

  • shadow zone behind

the robot

slide-17
SLIDE 17

Oriolo: Autonomous and Mobile Robotics - Landmark-based and SLAM

17

EKF SLAM

  • remove the hypothesis that the environment is known

a priori: as it moves, the robot must use its sensors to build a map and at the same time localize itself

  • in probabilistic SLAM, the idea is to estimate the map

features in addition to the robot configuration

  • here we discuss a simple landmark-based version of

the problem which can be solved using KF or EKF

  • SLAM: Simultaneous Localization And Map-building
slide-18
SLIDE 18

Oriolo: Autonomous and Mobile Robotics - Landmark-based and SLAM

18

  • assumptions:
  • the robot is an omnidirectional point-robot, whose

configuration is then a cartesian position

  • L landmarks are distributed in the environment

(their position is unknown)

  • the robot is equipped with a sensor that can see,

identify and measure the relative position of all landmarks wrt itself (infinite FOV + no occlusions)

  • define an extended state vector to be estimated

robot position landmark 1 position landmark L position ...

slide-19
SLIDE 19

Oriolo: Autonomous and Mobile Robotics - Landmark-based and SLAM

19

  • since the landmarks are fixed, the discrete-time model
  • f the robot+landmarks system is

where uk = (ux,k uy,k)T are the robot velocity inputs and vxy,k = (vx,k vy,k)T is a white gaussian noise with zero mean and covariance matrix Vxy,k

slide-20
SLIDE 20

Oriolo: Autonomous and Mobile Robotics - Landmark-based and SLAM

20

  • this is clearly a linear model of the form

where ux,k, uy,k are the robot velocity inputs and vk = (v1,k v2,k)T is a white gaussian noise with zero mean and covariance matrix Vxy,k and the covariance of the process noise vk is

slide-21
SLIDE 21

Oriolo: Autonomous and Mobile Robotics - Landmark-based and SLAM

21

  • the i-th measurement contains the relative position of

the i-th landmark wrt the sensor where wi,k is a white gaussian noise with zero mean and covariance matrix Wi,k

  • it is a linear equation

with

(2i+1)-th column

slide-22
SLIDE 22

Oriolo: Autonomous and Mobile Robotics - Landmark-based and SLAM

22

  • stack all measurements to create the output vector

where and the covariance of the measurement noise is

  • at this point, just crank the KF engine
slide-23
SLIDE 23

Oriolo: Autonomous and Mobile Robotics - Landmark-based and SLAM

23

how realistic is KF/EKF localization?

  • KF/EKF assume that the probability distribution for

the state is unimodal, and in particular a gaussian

  • this requires an accurate estimate of the robot initial

configuration and also relatively small uncertainties (position tracking problem)

  • however, if the robot is released at an unknown (or

poorly known) position, the probability distribution for the state becomes multimodal in the presence of aliasing (kidnapped robot problem)

slide-24
SLIDE 24

Oriolo: Autonomous and Mobile Robotics - Landmark-based and SLAM

24

  • need to track

multiple hypotheses

  • more general

Bayesian estimators (e.g., particle filters) must be used