Chapter 2 : Bug Algorithms Hyoekjae Kwon Sungmin Lee.

Slides:



Advertisements
Similar presentations
Reactive and Potential Field Planners
Advertisements

Lecture 7: Potential Fields and Model Predictive Control
Decoding of Convolutional Codes  Let C m be the set of allowable code sequences of length m.  Not all sequences in {0,1}m are allowable code sequences!
Sensor Based Planners Bug algorithms.
Sonar and Localization LMICSE Workshop June , 2005 Alma College.
April Bug Algorithms Shmuel Wimer Bar Ilan Univ., School of Engineering.
Computational Geometry, WS 2007/08 Lecture 17 Prof. Dr. Thomas Ottmann Algorithmen & Datenstrukturen, Institut für Informatik Fakultät für Angewandte Wissenschaften.
Visibility Graph and Voronoi Diagram CS Tutorial.
5. Roadmaps Hyeokjae Kwon Sungmin Kim. 1. RoadMap Definition.
Position Sensors ​ Little knowledge on position sensor helps at some point in your carrier. ​ By Riku Sorsa and Suman Dahal.
The George Washington University Electrical & Computer Engineering Department ECE 002 Dr. S. Ahmadi Lab 1.
Foundations of Computer Graphics (Fall 2012) CS 184, Lecture 11: Curves Problems
1 Stochastic Event Capture Using Mobile Sensors Subject to a Quality Metric Nabhendra Bisnik, Alhussein A. Abouzeid, and Volkan Isler Rensselaer Polytechnic.
ECE 7340: Building Intelligent Robots QUALITATIVE NAVIGATION FOR MOBILE ROBOTS Tod S. Levitt Daryl T. Lawton Presented by: Aniket Samant.
1 Motion Planning Algorithms : BUG-family. 2 To plan a path  find a continuous trajectory leading from initial position of the automaton (a mobile robot)
Presented by David Stavens. Autonomous Inspection Compute a path such that every point on the boundary of the workspace can be inspected from some point.
Navigation Strategies for Exploring Indoor Environments Presented by Mathieu Bredif February 17, 2004 CS326A: Motion Planning.
Robot Motion Planning Bug 2 Probabilistic Roadmaps Bug 2 Probabilistic Roadmaps.
Geometric Probing with Light Beacons on Multiple Mobile Robots Sarah Bergbreiter CS287 Project Presentation May 1, 2002.
PRESENTATION BY ATIF DAR ULTRASONIC SENSORS.. CONTENTS PAGE Page 1 – Homepage Page 3 – Description of Ultrasonic Sensor. Page 4 – How the Ultrasonic Sensor.
Copyright © 2005 Pearson Education, Inc. Chapter 3 Radian Measure and Circular Functions.
Basics of Sensors. A sensor is a device which is used to sense the surroundings of it & gives some useful information about it. This information is used.
©2008 by W.H. Freeman and Company Chapter 2 Motionin One Dimension.
Ultrasonic Sensor Made By: 1.Hadeer Radwan 2.Alaa Mustafa 3.Amany Amr.
May 2008US Sensor Calibration1 Ultrasonic Sensors Calibration Omar A. Daud Truc-Vien T. Nguyen May 16, 2008.
感測器原理與應用.
Traffic Monitoring System using Acoustic Sensors Yuping Dong May 14, 2008.
LabVIEW Program and Data Flow Review LabVIEW Robotics Fundamentals.
© Manfred Huber Autonomous Robots Robot Path Planning.
Chapter 36 In Chapter 35, we saw how light beams passing through different slits can interfere with each other and how a beam after passing through a single.
Sentry System Multiple Sensors
Honors Physics Review 2 Chapter
WAVES. Chapter Twenty-Three: Waves  23.1 Harmonic Motion  23.2 Properties of Waves  23.3 Wave Motion.
Chapter 14 Waves & Energy Transfer I. Waves Properties 1. A wave is a rhythmic disturbance that carries energy 1. A wave is a rhythmic disturbance that.
Robotics Club: 5:30 this evening
PHY 235 Robotics Workshop Day 5 Distance Sensing Using The Ultrasonic Ping Sensor.
Introduction to Robotics Tutorial 10 Technion, cs department, Introduction to Robotics Winter
Optimal Path Planning Using the Minimum-Time Criterion by James Bobrow Guha Jayachandran April 29, 2002.
A* optimality proof, cycle checking CPSC 322 – Search 5 Textbook § 3.6 and January 21, 2011 Taught by Mike Chiang.
Diffraction AP Physics B. Superposition..AKA….Interference One of the characteristics of a WAVE is the ability to undergo INTERFERENCE. There are TWO.
Motion Planning Howie CHoset. Assign HW Algorithms –Start-Goal Methods –Map-Based Approaches –Cellular Decompositions.
Structure and Motion Ocean Mapping. Ocean Basin.
2.9 Beats Source 1 Detector , x Source 2
Particle filters for Robot Localization An implementation of Bayes Filtering Markov Localization.
Forward Until Near Stop when near a wall.
- Usable range of 0 to 6 feet. - Find dark or bright areas.
Prof. Sajid Naeem (DOES – PC)
Schedule for next 2 weeks
CSE 167 [Win 17], Lecture 11: Curves Problems Ravi Ramamoorthi
LEGO Robotics Ultrasonic Sensor
How Does an Ultrasonic Sensor Work?
WAVES.
Day 32 Range Sensor Models 11/13/2018.
Obstacle Detection Ultrasonic Sensor.
Introductory Presentation
Chapter 36 In Chapter 35, we saw how light beams passing through different slits can interfere with each other and how a beam after passing through a single.
Navigation In Dynamic Environment
HW2 EE 562.
Distance Sensor Models
Day 29 Bug Algorithms 12/7/2018.
Day 29 Bug Algorithms 12/8/2018.
3.4 Push-Relabel(Preflow-Push) Maximum Flow Alg.
Project Schematics Circuit Working Principle and Equations
Bug Algorithms.
Device Fabrication & Components Conclusions and Future Advancements
Fundamental Problems in Mobile Robotics
How Does an Ultrasonic Sensor Work?
Obstacle Detection.
Motion Planning for a Point Robot (1/2)
Planning.
Presentation transcript:

Chapter 2 : Bug Algorithms Hyoekjae Kwon Sungmin Lee

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

(Bug1, Bug2)

What’s Special About Bugs

Bug 1 Goal Start

Bug 1 More formally

Bug 1 analysis Goal Start

Bug 2 Goal Start

The Spiral Goal Start Goal Start

Bug 2 More formally

Bug 2 analysis Start Goal

head-to-head comparison Goal Start Goal

BUG 1 vs. BUG 2

(Tangent Bug)

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

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

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

Raw Distance Function Saturated raw distance function

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

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

Transition from Motion-to-Goal

Motion To Goal Example

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)

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

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

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

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

d min is constantly updated Goal Start

(Implementation)

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

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.

Sensors

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.

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.

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.

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.

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

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

Question & Answer