Presentation is loading. Please wait.

Presentation is loading. Please wait.

Chapter 2 : Bug Algorithms Hyoekjae Kwon Sungmin Lee.

Similar presentations


Presentation on theme: "Chapter 2 : Bug Algorithms Hyoekjae Kwon Sungmin Lee."— Presentation transcript:

1 Chapter 2 : Bug Algorithms Hyoekjae Kwon Sungmin Lee

2 contents 1. About Bug 2. Bug1 Algorithms 3. Bug2 Algorithms 4. Tangent Bug Algorithm 5. Implementation 6. Q & A

3 (Bug1, Bug2)

4 What’s Special About Bugs

5 Bug 1 Goal Start

6 Bug 1 More formally

7 Bug 1 analysis Goal Start

8 Bug 2 Goal Start

9 The Spiral Goal Start Goal Start

10 Bug 2 More formally

11 Bug 2 analysis Start Goal

12 head-to-head comparison Goal Start Goal

13 BUG 1 vs. BUG 2

14 (Tangent Bug)

15 The Basic Ideas A motion-to-goal behavior as long as way is clear or there is a visible obstacle boundary pt that decreases heuristic distance A boundary following behavior invoked when heuristic distance increases. A value d min which is the shortest distance observed thus far between the sensed boundary of the obstacle and the goal A value d leave which is the shortest distance between any point in the currently sensed environment and the goal Terminate boundary following behavior when d leave < d min

16 Tangent Bug Algorithm H : hit pointD : depart point M : minimum pointL : leave point Goal Start

17 Tangent Bug Algorithm 1) repeat ◦ a) Compute continuous range segments in view ◦ b) Move toward n  {T,O i } that minimizes h(x,n) = d(x,n) + d(n,q goal ) until ◦ a) goal is encountered, or ◦ b) the value of h(x,n) begins to increase 2) follow boundary continuing in same direction as before repeating a) update {O i }, d leave and d min until ◦ a) goal is reached ◦ b) a complete cycle is performed (goal is unreachable) ◦ c) d leave < d min

18 Raw Distance Function Saturated raw distance function

19 Intervals of Continuity Tangent Bug relies on finding endpoints of finite, continued segments of ρ R

20 Motion-to-Goal Transition from Moving Toward goal to “following obstacles” Currently, the motion-to-goal behavior “thinks” the robot can get to the goal

21 Transition from Motion-to-Goal

22 Motion To Goal Example

23

24 Minimize Heuristic Example At x, robot knows only what it sees and where the goal is, so moves toward O2. Note the line connectingO2 and goal pass through obstacle so moves toward O4. Note some “thinking” was involved and the line connectingO4 and goal pass through obstacle For any Oi such that d(Oi,qgoal) < d(x,qgoal), choose the part Oi that minimizes d(x,Oi) + d(Oi,qgoal)

25 d min and d leave A value d min which is the shortest distance observed thus far between the sensed boundary of the obstacle and the goal A value d leave which is the shortest distance between any point in the currently sensed environment and the goal

26 Example: Zero Sensor Range H : hit pointD : depart point M : minimum pointL : leave point

27 Example: Finite Sensor Range H : hit pointD : depart point M : minimum pointL : leave point H : hit pointD : depart point M : minimum pointL : leave point Goal Start

28 Example: Infinite Sensor Range There is no boundary-following Start Goal

29 d min is constantly updated Goal Start

30 (Implementation)

31 What Information: The Tangent Line The dashed line represents the tangent to the offset curve at x. safe distance

32 How to Process Sensor Information The dashed line is the actual path, but the robot follows the thin black lines, predicting and correcting along the path. The black circles are samples along the path.

33 Sensors

34 Tactile sensors Tactile sensors are employed wherever interactions between a contact surface and the environment are to be measured and registered. A tactile sensor is a device which receives and responds to a signal or stimulus having to do with force.

35 Ultrasonic sensors Ultrasonic sensors generate high frequency sound waves and evaluate the echo which is received back by the sensor. Sensors calculate the time interval between sending the signal and receiving the echo to determine the distance to an object.

36 Polaroid ultrasonic transducer The disk on the right is the standard Polaroid ultrasonic transducer found on many mobile robots; the circuitry on the left drives the transducer.

37 Beam pattern for the Polaroid transducer. This obstacle can be located anywhere along the angular spread of the sonar sensor's beam pattern. Therefore, the distance information that sonars provide is fairly accurate in depth, but not in azimuth.

38 Centerline model The beam pattern can be approximated with a cone. For the commonly used Polaroid transducer, the arc base is 22.5degrees

39 Reference dent_gallery/2006/st/hw2pub.htm Howie Choset with slides from G.D. Hager and Z. Dodds (Bug Algorithms) Book : Principles of Robot Motion

40 Question & Answer


Download ppt "Chapter 2 : Bug Algorithms Hyoekjae Kwon Sungmin Lee."

Similar presentations


Ads by Google