Lecture 7 - Occupancy Grids Flashcards

1
Q

What’s the Pose of the robot?

A

The rotation and translation of a robot, or in general its full state configuration.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What’s the Odometry of the robot?

A

The transformation of the body frame with respect to its initial pose (fixed frame of reference).

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What’s the Dynamics Model of the robot?

A

What is the next state given current state and control?

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What’s the Sensor Model of the robot?

A

What value will be returned on a given sensor channel from a given state?

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Why is mapping a problem?

A

Because building maps is hard even for humans.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What are the two main sources of uncertainty in robotic mapping?

A
  1. Accumulating uncertainty in the dynamics.
  2. Uncertainty in sensor measurements.
    EXTRA: maps change.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

State the probability of a robot’s state.

A

p(xt+1 | xt, ut)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

State the probability of a robot’s sensor reading.

A

p(zt | xt)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

State the probability of any map

A

p(m | x1:t, z1:t)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Why is the probability of a map that considers all previous paths and sensor readings instractable?

A

for a 100*100 grid there are 2^10000 possible binary maps.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What probability approximation makes mapping easier?

A

Approximation ignores all dependencies between map cells, given known info. Assumes (for tractability) that cells are independent given path and measurements.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Explain the steps in Inverse sensor measurement model

A

Given map cell (i,j) , the robot’s state xytheta , and beams rk
Find index k of sensor beam that is closest in heading to the cell
If the cell is sufficiently closer than rk
// Cell is most likely free
Return that is well below 0.5
If the cell is sufficiently farther than rk or out of the field of view
// We don’t have enough information to decide whether cell is occupied
Return prior occupation probability
If the cell is nearly as far as the measurement
// Cell is most likely occupied
Return that is well above 0.5

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What’s the threshhold for the maximum likelihood map?

A

p = 0.5

How well did you know this?
1
Not at all
2
3
4
5
Perfectly