Robot motion planning i Flashcards

1
Q

Define robot motion planning

A

The motion of a robot based on sensor values to reach goal positions effectively and reliably

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

Explain path planning

A

Establishes a path consisting of a sequence of steps.
-requires the existence of a map for navigation
-configuration space representation

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

What are the 2 steps of graph search

A

-Graph construction
-Graph search

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

What are the different graph construction approaches?

A

-Visibility graph
-Voroni diagram
-Exact cell decomposition

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

What are the different graph search approaches

A

-Breadth-first
-Depth-first
-Dijkstra’s algorithm
-A* algorithm
-D* algorithm

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

What are techniques for path planning?

A

Graph construction techniques
Graph search techniques
Randomised Graph search
Potential field path planning

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

Explain the potential field path planning concept

A

Create a field or gradient across the mao to direct the robot to the goal.
-The robot is considered to be a point under the influence of the field

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

Give the pros and cons of potential field path planning

A

-leads to collision free path to goal
-local minima can be an issue (stuck)
-if robot is not a point mass, it is complex

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