McKerrow Method: A Sonar Refinement Technique - PowerPoint PPT Presentation

1 / 19
About This Presentation
Title:

McKerrow Method: A Sonar Refinement Technique

Description:

Beam Angle angle from the beam axis to the outside of the cone ... Move robot parallel to surface by half the beam width, scan ... – PowerPoint PPT presentation

Number of Views:22
Avg rating:3.0/5.0
Slides: 20
Provided by: NCon7
Category:

less

Transcript and Presenter's Notes

Title: McKerrow Method: A Sonar Refinement Technique


1
McKerrow Method A Sonar Refinement Technique
  • Nicole Takahashi
  • Ryosuke Sakai

2
McKerrow Method Overview
  • Obstacle is tangent to closest sonar arc
  • Use previous sonar sensor data
  • Obstacle is tangent to both arcs
  • Create outline segments
  • Combine segments Outlined obstacle

3
Assumptions
  • Two dimensions
  • Discrete motion
  • Straight lines applicable to curves

4
Terminology
  • Arc Center point equidistant to all points on
    the arc
  • Beam Angle angle from the beam axis to the
    outside of the cone
  • Beam Width function of beam angle and distance
    to object
  • Range Vector passes through
  • arc center and tangent point

5
Reference Frames
6
Single Sonar Reading
7
Two Sonar Readings
8
Mapping Algorithm
  • Orient left side to surface on left, scan
  • Repeat
  • Move robot parallel to surface by half the beam
    width, scan
  • Calculate and display outline segments
  • Terminating conditions
  • Too close to another object
  • Traveled a specified distance

9
Outline Segment Algorithm (1)
  • Calculations in sensor coordinates
  • Final points are transformed into world
    coordinates
  • Apply at each sensing position except the first
  • Apply to each sensor except the front and rear
    sensors
  • Current and previous readings for one sonar

10
Outline Segment Algorithm (2)
  • Calculate distance (d) robot has moved
  • For each sensor
  • Determine if common tangent exists between
    current and previous readings
  • If so
  • Calculate intersection points
  • Transform points

11
Common Tangent Condition
  • d distance between
  • arc centers
  • r radius of arc
  • b beam angle
  • a angle of beam
  • axis to x-axis
  • -d cos (a - b) lt rc rp lt -d cos (a b)

12
Common Tangent Condition
  • d distance between
  • arc centers
  • r radius of arc
  • b beam angle
  • a angle of beam
  • axis to x-axis
  • -d cos (a - b) lt rc rp lt -d cos (a b)

13
Common Tangent Condition
  • d distance between
  • arc centers
  • r radius of arc
  • b beam angle
  • a angle of beam
  • axis to x-axis
  • -d cos (a - b) lt rc rp lt -d cos (a b)

14
Calculate Intersection Points
  • Tangent to arc Perpendicular
  • to Range Vector
  • Common tangent will have slope m
  • Range vector will have slope 1/m
  • Knowing arc centers and slope, equations
    describing range vectors can be found
  • Using range vector equations and radii, points of
    intersection can be found

15
Example World
16
Example Cluttered
17
Example Clearer Picture
18
ATM Comparison
  • Similarities
  • Compares history of sonar readings
  • Differences
  • Only compare sonar readings with their own
    history
  • Uses tangents, not intersections
  • Finds segments, not points
  • No transversal criterion

19
Works Cited
  • McKerrow, P.J. 1993. Echolocation From Range
    to Outline Segments, Special Issue Best Papers
    from IAS-3, Robitics and Autonomous Systems,
    Elsevier, Vol 11, No 4, pp 205-211.
Write a Comment
User Comments (0)
About PowerShow.com