Presentation is loading. Please wait.

Presentation is loading. Please wait.

City College of New York 1 Dr. John (Jizhong) Xiao Department of Electrical Engineering City College of New York A Taste of Localization.

Similar presentations


Presentation on theme: "City College of New York 1 Dr. John (Jizhong) Xiao Department of Electrical Engineering City College of New York A Taste of Localization."— Presentation transcript:

1 City College of New York 1 Dr. John (Jizhong) Xiao Department of Electrical Engineering City College of New York jxiao@ccny.cuny.edu A Taste of Localization Problem Introduction to ROBOTICS

2 City College of New York 2 Localization Methods Markov Localization: –Represent the robot’s belief by a probability distribution over possible positions and uses Bayes’ rule and convolution to update the belief whenever the robot senses or moves Monte-Carlo methods Kalman Filtering Particle Filtering SLAM (simultaneous localization and mapping) ….

3 City College of New York 3 Markov Localization What is Markov Localization ? –Special case of probabilistic state estimation applied to mobile robot localization –Initial Hypothesis: Static Environment –Markov assumption –The robot’s location is the only state in the environment which systematically affects sensor readings –Further Hypothesis Dynamic Environment

4 City College of New York 4 Markov Localization –Instead of maintaining a single hypothesis as to where the robot is, Markov localization maintains a probability distribution over the space of all such hypothesis –Uses a fine-grained and metric discretization of the state space

5 City College of New York 5 Example Assume the robot position is one- dimensional The robot is placed somewhere in the environment but it is not told its location The robot queries its sensors and finds out it is next to a door

6 City College of New York 6 Example The robot moves one meter forward. To account for inherent noise in robot motion the new belief is smoother The robot queries its sensors and again it finds itself next to a door

7 City College of New York 7 Basic Notation Bel(Lt=l ) Is the probability (density) that the robot assigns to the possibility that its location at time t is l The belief is updated in response to two different types of events: sensor readings, odometry data

8 City College of New York 8 Notation Goal:

9 City College of New York 9 Markov assumption (or static world assumption)

10 City College of New York 10 Markov Localization

11 City College of New York 11 Update Phase ab c

12 City College of New York 12 Update Phase

13 City College of New York 13 Prediction Phase

14 City College of New York 14 Summary


Download ppt "City College of New York 1 Dr. John (Jizhong) Xiao Department of Electrical Engineering City College of New York A Taste of Localization."

Similar presentations


Ads by Google