Localization where am I? ( again? ) ? Bookkeeping 2 u Assignment 3 - - PDF document

localization
SMART_READER_LITE
LIVE PREVIEW

Localization where am I? ( again? ) ? Bookkeeping 2 u Assignment 3 - - PDF document

11/19/15 Localization where am I? ( again? ) ? Bookkeeping 2 u Assignment 3 u Comments? u Next Reading: none u Unless you are behind; catch up u Today u Knowledge Representation u Maps u Belief states The last band of color indicates the


slide-1
SLIDE 1

11/19/15 1

Localization

where am I? (again?)

?

2

Bookkeeping

u Assignment 3

u Comments?

u Next Reading: none

u Unless you are behind; catch up

u Today

u Knowledge Representation

u Maps u Belief states

u Upcoming

u Grades

The last band of color indicates the snake’s tolerance for being ! held before biting.

slide-2
SLIDE 2

11/19/15 2

3

Localization Review (1)

u What is localization?

u Figuring out location wrt. a model of the world

u What are the two purely proprioceptive approaches?

u Odometry: belief about motion only

u Wheel encoders, mostly

u Dead reckoning: belief about motion + heading sensors

?

4

Localization Review (2)

u What is sensor aliasing?

u Different locations giving the same sensor readings

u What is behavior-based navigation?

u Navigating without localizing

slide-3
SLIDE 3

11/19/15 3

5

u (Model of) the map or environment

u Discrete vs. continuous u Probabilistic vs. labeled u Geometric vs. topographical vs. semantic

u Beliefs about the robot’s state or location

u Discrete vs. continuous u Probabilistic vs. bounded vs. point u Single vs. multiple hypotheses

u Paths

u Consecutive vs. kidnapped

Belief Representations

Design decisions: based on storage ef1iciency, reasoning speed, sensor capability, intended task, …

6

u How precise does it have to be?

u To accomplish what?

u What types of features are represented?

u Depends on robot’s sensors

u If the robot can’t see it, no point storing it

u How much processing power do we have?

u What characteristics does it have?

Map Representations

slide-4
SLIDE 4

11/19/15 4

7

u Discrete vs. continuous

Characterizing Maps (1)

Obstacles represented as polygons Obstacles represented as blocks in a grid Continuous Discretized

8

u Geometric vs. topological

Characterizing Maps (2)

Geometric Topological Actual locations of

  • bstacles

and areas Relative locations

slide-5
SLIDE 5

11/19/15 5

9

u Semantically labeled

u Example: semantically labeled topological map

Characterizing Maps (3)

Topological Semantic Room Hall Junction

10

u What characteristics does it have? u Discrete vs. continuous

u Fixed to a grid, or anywhere?

u Single vs. multiple hypotheses

u At any given time, how many possible locations

are being considered?

u Probabilistic vs. bounded vs. point

u The first two are multiple-hypothesis

Location (Belief) Representation

slide-6
SLIDE 6

11/19/15 6

11

u Discrete vs. continuous

u Fixed to a grid vs. infinitely fine resolution

Characterizing Belief R. (1)

Continuous Discrete In one

  • f these

{x = 81.1, y = 14.2}

12

u Discrete vs. continuous

u Belief

elief can be discretized on a continuous map

Characterizing Belief R. (1.1)

Continuous Discrete {x = 81.1, y = 14.2} In one

  • f these
slide-7
SLIDE 7

11/19/15 7

13

u Single hypothesis vs. multiple hypothesis

Characterizing Belief R. (2)

Multiple Single

14

u Probabilistic vs. bounded vs. point

u You are here u Somewhere in here (undifferentiated) u Spread of likelihood

Characterizing Belief R. (3)

Point Bounded Polygon Probabilistic

slide-8
SLIDE 8

11/19/15 8

15

u Single or multiple, discrete or continuous u Point: these are orthogonal choices

Probability & Combinations

Single Hypothesis Multiple Hypothesis Discrete

16

Belief Representation

u a) Continuous map

with single hypothesis

u b) Continuous map

with multiple hypothesis

u d) Discretized map

with probability distribution

u d) Discretized

topological map with probability distribution

slide-9
SLIDE 9

11/19/15 9

17

Belief Representation

u a) Continuous map

with single hypothesis

u b) Continuous map

with multiple hypothesis

u d) Discretized map

with probability distribution

u d) Discretized

topological map with probability distribution

18

u Location: Probabilistic? Discrete? u Map: Discretized? Topological?

Example

yes, no maybe? no, geometric

slide-10
SLIDE 10

11/19/15 10

19

u Can contain:

u Static or dynamic obstacles u Features (e.g., doors, floor tiles)

u Can be semantically labeled u Environment Representation

u Continuous Metric

→ {x,y,θ}

u Discrete Metric

→ metric grid (eg, sq. D76)

u Discrete Topological

→ topological grid

The Environment

Room Hall Junction

20

u Raw sensor data (ex.: laser range, grayscale images)

u Lots of data, low distinctiveness (per reading) u Uses all acquired information

u Low level features (ex.: line extraction)

u Some data, average distinctiveness u Filters out some useful information, still ambiguities

u High level features (ex.: doors, a car, the Eiffel tower)

u Little data, high distinctiveness u Filters out the useful information, few/no ambiguities,

insufficient environmental information

The Environment: Features

easy to get hard to get

slide-11
SLIDE 11

11/19/15 11

21

About Map Representations

  • 1. Map precision vs. application

u How precise does it need to be?

  • 2. Features precision vs. map precision

u 20cm. map precision 20cm. obstacle avoidance

  • 3. Precision vs. computational complexity

u More capability = more computational complexity

u Continuous Representation u Decomposition (Discretization)

22

u Continuous line, single hypothesis

Map Representations

slide-12
SLIDE 12

11/19/15 12

23

u Single hypothesis – Grid and Topological Map

Map Representations

24

Continuous Line Based

a) Representation with set of infinite lines (line

extraction)

slide-13
SLIDE 13

11/19/15 13

27

Map Decomposition (1)

u Fixed cell decomposition

u Narrow passages disappear 28

Map Decomposition (2)

u Adaptive cell decomposition

slide-14
SLIDE 14

11/19/15 14

29

Map Decomposition (3)

u Fixed cell decomposition – Example with very small cells

Courtesy of S. Thrun 32

Map Decomposition (4)

u Topological Decomposition

~ 400 m ~ 1 km ~ 200 m ~ 50 m ~ 10 m

slide-15
SLIDE 15

11/19/15 15

33

Map Decomposition (5)

u Occupancy Grid

35

Probabilistic Map-Based Localization

u Consider a mobile robot moving in a known environment u As it starts to move from a precisely known location, it

might keep track of its location using odometry.

u However, after a certain movement the robot will get

very uncertain about its position. è update using an observation of its environment.

u observation lead also to an estimate of the robots

position which can than be fused with the odometric estimation to get the best possible update of the robots actual position.

slide-16
SLIDE 16

11/19/15 16

37

u Improving belief state

by moving