Fundamental Problems in Mobile Robotics

Slides:



Advertisements
Similar presentations
Reactive and Potential Field Planners
Advertisements

EKF, UKF TexPoint fonts used in EMF.
Sensor Based Planners Bug algorithms.
Chapter 2 : Bug Algorithms Hyoekjae Kwon Sungmin Lee.
Advanced Mobile Robotics
Geometric Modeling Notes on Curve and Surface Continuity Parts of Mortenson, Farin, Angel, Hill and others.
April Bug Algorithms Shmuel Wimer Bar Ilan Univ., School of Engineering.
Rotary Encoder. Wikipedia- Definition  A rotary encoder, also called a shaft encoder, is an electro- mechanical device that converts the angular position.
Sensors For Robotics Robotics Academy All Rights Reserved.
Beam Sensor Models Pieter Abbeel UC Berkeley EECS Many slides adapted from Thrun, Burgard and Fox, Probabilistic Robotics TexPoint fonts used in EMF. Read.
IMagic Senior Project Emre AYDIN Asil Kaan BOZCUOĞLU Onur ÖZBEK Egemen VARDAR Onur YÜRÜTEN Project Supervisor: Asst. Prof. Uluç Saranlı.
SA-1 Probabilistic Robotics Probabilistic Sensor Models Beam-based Scan-based Landmarks.
Uncertainty Representation. Gaussian Distribution variance Standard deviation.
SA-1 Probabilistic Robotics Probabilistic Sensor Models Beam-based Scan-based Landmarks.
Robotic Mapping: A Survey Sebastian Thrun, 2002 Presentation by David Black-Schaffer and Kristof Richmond.
Discovering Environmental Structure with Mobile Robots Rahul Biswas CS326A Class Project.
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)
Mobile Intelligent Systems 2004 Course Responsibility: Ola Bengtsson.
Regionalized Variables take on values according to spatial location. Given: Where: A “structural” coarse scale forcing or trend A random” Local spatial.
Grid Maps for Robot Mapping. Features versus Volumetric Maps.
Weighted Range Sensor Matching Algorithms for Mobile Robot Displacement Estimation Sam Pfister, Kristo Kriechbaum, Stergios Roumeliotis, Joel Burdick Mechanical.
Sonar-Based Real-World Mapping and Navigation by ALBERTO ELFES Presenter Uday Rajanna.
Geometric Probing with Light Beacons on Multiple Mobile Robots Sarah Bergbreiter CS287 Project Presentation May 1, 2002.
June 12, 2001 Jeong-Su Han An Autonomous Vehicle for People with Motor Disabilities by G. Bourhis, O.Horn, O.Habert and A. Pruski Paper Review.
1 DARPA TMR Program Collaborative Mobile Robots for High-Risk Urban Missions Second Quarterly IPR Meeting January 13, 1999 P. I.s: Leonidas J. Guibas and.
Kalman filter and SLAM problem
Localisation & Navigation
Lecture 12 Statistical Inference (Estimation) Point and Interval estimation By Aziza Munir.
An Introduction to Mobile Robotics CSE350/ Sensor Systems (Continued) 2 Sep 03.
Mapping and Localization with RFID Technology Matthai Philipose, Kenneth P Fishkin, Dieter Fox, Dirk Hahnel, Wolfram Burgard Presenter: Aniket Shah.
SA-1 Probabilistic Robotics Probabilistic Sensor Models Beam-based Scan-based Landmarks.
Mobile Robot Navigation Using Fuzzy logic Controller
Lab 3b: Distribution of the mean
Forward-Scan Sonar Tomographic Reconstruction PHD Filter Multiple Target Tracking Bayesian Multiple Target Tracking in Forward Scan Sonar.
University of Windsor School of Computer Science Topics in Artificial Intelligence Fall 2008 Sept 11, 2008.
COMP322/S2000/L281 Task Planning Three types of planning: l Gross Motion Planning concerns objects being moved from point A to point B without problems,
1 Motion Fuzzy Controller Structure(1/7) In this part, we start design the fuzzy logic controller aimed at producing the velocities of the robot right.
1/17/2016CS225B Kurt Konolige Probabilistic Models of Sensing and Movement Move to probability models of sensing and movement Project 2 is about complex.
CHAPTER 2.3 PROBABILITY DISTRIBUTIONS. 2.3 GAUSSIAN OR NORMAL ERROR DISTRIBUTION  The Gaussian distribution is an approximation to the binomial distribution.
GraffitiBot Sensor Report Andy Kobyljanec EEL 5666C March 25, 2008.
Digital Image Processing Lecture 17: Segmentation: Canny Edge Detector & Hough Transform Prof. Charlene Tsai.
CHAPTER 4 ESTIMATES OF MEAN AND ERRORS. 4.1 METHOD OF LEAST SQUARES I n Chapter 2 we defined the mean  of the parent distribution and noted that the.
Particle Filter for Robot Localization Vuk Malbasa.
COMP322/S2000/L81 Direct Kinematics- Link Coordinates Questions: How do we assign frames? At the Joints? At the Links? Denavit-Hartenberg (D-H) Representation.
Intelligent Systems 2017 Spring
Group 3 Corey Jamison, Joel Keeling, & Mark Langen
- Usable range of 0 to 6 feet. - Find dark or bright areas.
Sensors For Robotics Robotics Academy All Rights Reserved.
Optimum Passive Beamforming in Relation to Active-Passive Data Fusion
Sensors For Robotics Robotics Academy All Rights Reserved.
Project Overview Introduction Clawbot Build Design Modification
Day 32 Range Sensor Models 11/13/2018.
آشنايی با اصول و پايه های يک آزمايش
Probability Review 11/22/2018.
HW2 EE 562.
788.11J Presentation “Robot Navigation using a Sensor Network ”
Probabilistic Robotics
Distance Sensor Models
Coverage and Connectivity in Sensor Networks
Day 29 Bug Algorithms 12/7/2018.
Day 29 Bug Algorithms 12/8/2018.
Day 33 Range Sensor Models 12/10/2018.
A Short Introduction to the Bayes Filter and Related Models
Section 10.4 Other Angle Relationships in Circles
Reflection, Refraction, Diffraction
Probability Review 2/24/2019.
Bug Algorithms.
Localization Using Landmarks
Principle of Bayesian Robot Localization.
Motion Planning for a Point Robot (1/2)
Presentation transcript:

Fundamental Problems in Mobile Robotics Day 14 Fundamental Problems in Mobile Robotics 4/29/2019

Sensing the Environment Bug1 and Bug2 use a perfect contact sensor we might be able to achieve better performance if we equip the robot with a more powerful sensor a range sensor measures the distance to an obstacle; e.g., laser range finder emits a laser beam into the environment and senses reflections from obstacles essentially unidirectional, but the beam can be rotated to obtain 360 degree coverage 4/29/2019

Tangent Bug assumes a perfect 360 degree range finder with a finite range measures the distance r(x, q) to the first obstacle intersected by the ray from x with angle q has a maximum range beyond which all distance measurements are considered to be r =  the robot looks for discontinuities in r(x, q) 4/29/2019

Tangent Bug O2 O3 O1 O6 O4 O5 4/29/2019

Tangent Bug currently, bug thinks goal is reachable goal 4/29/2019

Tangent Bug once the obstacle is sensed, the bug needs to decide how to navigate around the obstacle move towards the sensed point Oi that minimizes the distance d(x, Oi) + d(Oi, qgoal) (called the heuristic distance) O1 goal 4/29/2019

Tangent Bug if the heuristic distance starts to increase, the bug switches to boundary following full details Principles of Robot Motion: Theory, Algorithms, and Implementations http://www.library.yorku.ca/find/Record/2154237 nice animation http://www.cs.cmu.edu/~motionplanning/student_gallery/2006/st/hw2pub.htm goal 4/29/2019

Localization for a Point Robot Bug1 and Bug2 assume that the robot can perfectly sense its position at all times consider a 1D point robot (moves on the x-axis) that moves a distance Δxi after taking N steps starting from x0 it can be shown that (textbook Chapter 2): 4/29/2019

Characterizing Error 1D normal, or Gaussian, distribution standard deviation variance 4/29/2019

Characterizing Error in 2D isotropic 4/29/2019

Characterizing Error in 2D anisotropic 4/29/2019

Characterizing Error in 2D anisotropic 4/29/2019

Characterizing Error in 2D anisotropic 4/29/2019