1 / 20

# Sonar and Localization .

26 views
Description
Sonar and Localization. LMICSE Workshop June 14 - 17, 2005 Alma College. Presentation Outline. Implementing Search Algorithms Understanding Sonar Monte Carlo Localization. Sonar (Ultrasonic) Sensors.
Transcripts
Slide 1

﻿Sonar and Localization LMICSE Workshop June 14 - 17, 2005 Alma College

Slide 2

Presentation Outline Implementing Search Algorithms Understanding Sonar Monte Carlo Localization

Slide 3

Sonar (Ultrasonic) Sensors Sonar sensors are regularly utilized as a part of robots for snag evasion, route and guide assembling Much of the early work depended on a gadget created by Polaroid for camera go discovering Sonar sensors work by radiating a short burst of ultrasonic sound (frequently 40 khz) detecting reflected signs (assuming any) processing object remove by utilizing the slipped by time

Slide 4

Beam Width The viable pillar width is around 30 degrees, yet there are auxiliary "projections"

Slide 5

Sonar Effects (a) Sonar giving an exact range estimation (b-c) Lateral determination is not exceptionally exact; the nearest question in the shaft\'s cone gives the reaction (d) Specular reflections make dividers vanish (e) Open corners deliver a frail round wavefront (f) Closed corners measure to the corner itself due to different reflections

Slide 6

Our Sonar Unit (1) From Mindsensors ( http:www.mindsensors.com ) They have two models: 24 khz and 40 khz Ours is the 40 khz show From a programming perspective, regard it as a light sensor returns values from 0 to 100, which is the separation to the distinguished protest in inches not precise at close separations (say underneath 8 inches).

Slide 7

Our Sonar Unit (2) Not encased in a block Doesn\'t dispatch with an associating wire Can utilize a Lego wire with standard Lego connector on every end We utilize wires and connectors from Mindsensors (modest) Here\'s a standard mounting arrangement:

Slide 8

Sonar Activity (1) Determine through analyses the capacities of your sonar unit First compose a basic LeJOS program which shows on the LCD the present perusing of the sonar unit Since separations in our playing territory are in centimeters, change over the readings of the sonar unit to that estimation framework before showing them Display the esteem once every second

Slide 9

Sonar Activity (2) Determine Effective Beam Width Distance Accuracy Minimum Distance Maximum Distance Object Size Requirements Can you confirm the sonar impacts a through f checked on before?

Slide 10

Localization Robot confinement is the way toward assessing a robot\'s area in a known domain, given its developments and its sensor readings after some time. Two assortments: position following issue: the robot knows its beginning position and simply need to suit the little mistakes in its odometry that development after some time. worldwide confinement issue: the robot does not know its beginning position but rather needs to make sense of where it is. We will consider the worldwide limitation issue, and specifically the Monte Carlo way to deal with its answer. this approach is otherwise called molecule separating.

Slide 11

Our Project We have built up a venture which concentrates on a streamlined form of the worldwide restriction issue: A one dimensional world. Utilizes a sonar unit for detecting the earth Given the computational way of the issue, utilizes constant correspondence between the RCX and a base PC Computer shows a representation of the computational procedure The understudy is given working code that exhibits RCX - Computer correspondence and utilization of the perception class They should finish the parts of the venture that include taking care of the restriction issue

Slide 12

Problem Statement (1) Imagine a long lobby with an arrangement of open entryways along one side. The entryways are appropriated unevenly along it, and the entryways are not the greater part of similar width. Your robot can move forward and backward along the lobby, and at whenever it is either before one of the entryways or is along a divider section. The circumstance may resemble this: The robot\'s assignment is move to a predefined objective point along the foyer. Be that as it may, it doesn\'t know its beginning stage.

Slide 13

Problem Statement (2) To tackle this issue, the robot rehashed advances a settled separation and takes a sonar perusing. On the off chance that it supposes it has achieved the end of the corridor, it begins moving down as opposed to pushing ahead. It might need to move forward and backward along the foyer a couple times before it precisely knows where it is.

Slide 14

Problem Statement (3) Not just does the robot not know its beginning position, but rather there are two extra issues that should be thought about: The sonar perusing might not be right (e.g., the perusing demonstrates an open entryway when before a divider fragment). The separation the robot endeavors to move may not the real separation it moved (e.g. when it endeavors to advance 2 inches it truly just moves 1.9 inches). So you should create probabilistic models for both of these wellsprings of blunder. Sonar Model Movement Model

Slide 15

The Monte Carlo Approach The Monte Carlo way to deal with limitation depends on an accumulation of tests (which are otherwise called particles). Every specimen comprises of a conceivable area the robot may as of now possess, alongside an esteem which speaks to the probability that the robot is right now at that area.

Slide 16

Algorithm Outline Initialize the arrangement of tests (the present examples) so that their areas are uniformly dispersed and their significance weights are equivalent. Rehash until finished with the present arrangement of tests: Move the robot a settled separation and after that take a sensor perusing. Upgrade the area of each of the examples (utilizing the development show). Allocate the significance weights of every example to the probability of that sensor perusing given that new area (utilizing the sensor demonstrate). Make another gathering of tests by inspecting (with substitution) from the present arrangement of tests in light of their significance weights. Give this a chance to be new gathering turn into the present arrangement of tests.

Slide 17

General Comments The Monte Carlo approach after some time holds most particles with high weights and will probably copy them more often than not discards particles with low weights The dispersion of the particles mirrors the calculation\'s conviction state about the robot\'s area The area (or region) with the most particles is the evaluated area Simple to actualize Very proficient calculation when contrasted and other confinement calculations There is a total writeup of this venture at the LMICSE site in the Intelligent Systems range

Slide 18

Video 1: Quick Localization

Slide 19

Video 2: A Different Starting Position

Slide 20

Video 3: A More Ambiguous World

Recommended
View more...