1 / 53

Assignment, Project and Presentation

Assignment, Project and Presentation. Mobile Robot Localization by using Particle Filter by Chong Wang, Chong Fu, and Guanghui Luo. Tracking, Mapping & Localizing the iRobot: An effort using only the iRobot Create’s sensors by PankajKumar Mendapara, Dibyendu Mukherjee, Ashirbani Saha

yetta-terrell
Télécharger la présentation

Assignment, Project and Presentation

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Assignment, Project and Presentation • Mobile Robot Localization by using Particle Filterby Chong Wang, Chong Fu, and Guanghui Luo. • Tracking, Mapping & Localizing the iRobot: An effort using only the iRobot Create’s sensorsby PankajKumar Mendapara, Dibyendu Mukherjee, Ashirbani Saha • Implementing the Monte Carlo Localization using Lego NXT by Yuefeng Wang，Sepideh Seifzadeh • Little Border Protector Guard by Mohammad Raeesi Ahmad Soleimani • Autonomous Moving IRobot Based on Vision System by Thanh Nguyen, Mohammed Golam Sarwer • Soccer for Oneby Jonathan Vermette, Jonathan Farlam, Shawn DenHartogh

  2. Assignment, Project and Presentation • Thursday (Nov 20) • Yuefeng Wang，Sepideh Seifzadeh • Tuesday (Nov 25) • Mohammad Raeesi Ahmad Soleimani • Chong Wang, Chong Fu, and Guanghui Luo. • Thursday (Nov 27) • Jonathan Vermette, Jonathan Farlam, Shawn DenHartogh • PankajKumar Mendapara, Dibyendu Mukherjee, Ashirbani Saha • Tuesday (Dec 2) • Thanh Nguyen, Mohammed Golam Sarwer

  3. Mobile Robot Localization (ch. 7, 8) • We are now back to the topic of localization after reviewing some necessary background. • Mobile robot localization is the problem of determining the pose of a robot relative to a given map of the environment. • Remember, in localization problem, the map is given, known, available. • Is it hard? Not really, because,

  4. Mobile Robot Localization • Most localization algorithms are variants of Bayes filter algorithm. • However, different representation of maps, sensor models, motion model, etc lead to different variant.

  5. Mobile Robot Localization • Solved already, the Bayes filter algorithm. How? • The straightforward application of Bayes filters to the localization problem is called Markov localization. • Here is the algorithm (abstract?)

  6. Mobile Robot Localization • Algorithm Bayes_filter ( ) • for all do • endfor • return

  7. Mobile Robot Localization • Algorithm Markov Locatlization ( ) • for all do • endfor • return The Markov Localization algorithm addresses the global localization problem, the position tracking problem, and the kidnapped robot problem in static environment.

  8. Mobile Robot Localization • Revisit Figure 7.5 to see how Markov localization algorithm in working. • The algorithm Markov Localization is still very abstract. To put it in work (eg. your project), we need a lot of more background knowledge to realize motion model, sensor model, etc…. • We studied them (motion and sensor models) in Ch 5, and 6. • Put everything together in Markov Localization algorithm.

  9. Mobile Robot Localization

  10. Mobile Robot Localization

  11. Mobile Robot Localization • We will discuss a few different implementations of Markov Localization algorithm based on: • Kalman filter • Discrete, grid representation • Particle filter (MCL)

  12. Bayes Filter Implementations (1) (Extended) Kalman Filter (Gaussian filters) (Ch.3 and 7) Page 201-220 in Ch 7 and Page 40-64 Read and Compare them

  13. Bayes Filter Reminder • Prediction • Correction

  14. m Univariate -s s m Multivariate Gaussians

  15. Properties of Gaussians

  16. Multivariate Gaussians • We stay in the “Gaussian world” as long as we start with Gaussians and perform only linear transformations.

  17. Discrete Kalman Filter Estimates the state x of a discrete-time controlled process that is governed by the linear stochastic difference equation with a measurement

  18. Components of a Kalman Filter Matrix (nxn) that describes how the state evolves from t-1 to t without controls or noise. Matrix (nxl) that describes how the control ut changes the state from t-1 to t. Matrix (kxn) that describes how to map the state xt to an observation zt. Random variables representing the process and measurement noise that are assumed to be independent and normally distributed with covariance Rt and Qt respectively.

  19. Kalman Filter Updates in 1D

  20. Kalman Filter Updates in 1D

  21. Kalman Filter Updates in 1D

  22. Kalman Filter Updates

  23. Linear Gaussian Systems: Initialization • Initial belief is normally distributed:

  24. Linear Gaussian Systems: Dynamics • Dynamics are linear function of state and control plus additive noise:

  25. Linear Gaussian Systems: Dynamics

  26. Linear Gaussian Systems: Observations • Observations are linear function of state plus additive noise:

  27. Linear Gaussian Systems: Observations

  28. Kalman Filter Algorithm • Algorithm Kalman_filter( mt-1,St-1, ut, zt): • Prediction: • Correction: • Returnmt,St

  29. Prediction The Prediction-Correction-Cycle

  30. Correction The Prediction-Correction-Cycle

  31. Prediction Correction The Prediction-Correction-Cycle

  32. Kalman Filter Summary • Highly efficient: Polynomial in measurement dimensionality k and state dimensionality n: O(k2.376 + n2) • Optimal for linear Gaussian systems! • Most robotics systems are nonlinear!

  33. Nonlinear Dynamic Systems • Most realistic robotic problems involve nonlinear functions

  34. Linearity Assumption Revisited

  35. Non-linear Function

  36. EKF Linearization (1)

  37. EKF Linearization (2)

  38. EKF Linearization (3)

  39. EKF Linearization: First Order Taylor Series Expansion • Prediction: • Correction:

  40. EKF Algorithm • Extended_Kalman_filter( mt-1,St-1, ut, zt): • Prediction: • Correction: • Returnmt,St

  41. Landmark-based Localization

  42. Landmark-based Localization

  43. Landmark-based Localization • Our EKF localization algorithm assumes that the map is represented by a collection of features. • All features are uniquely identifiable. • At any point in time t, the robot gets to observe a vector of ranges and bearings to nearby features: • The identity of a feature is expressed by set of correspondence variables, denoted • The correspondence is known.

  44. Landmark-based Localization

  45. Landmark-based Localization • We have silently assumed the availability of an appropriate motion and measurement model, and have left unspecified a number of key variables in the EKF update. • We will now discuss a concrete implementation of the EKF, for feature-based maps. • Our feature-based maps consist of point landmarks. • For such point landmarks, we will use the common measurement model discussed in Chapter 6.6 (feature based measurement model). • We will also adopt the velocity motion model defined in Chapter 5.3 (velocity motion model).

  46. a

  47. Reminder– The notations • Prediction: • Correction:

  48. a

  49. a

  50. a

More Related