1 / 22

Autonomous construction of maps by miniature robots

This study presents a method for autonomous map construction using miniature robots, without the need for long-range sensors or extensive computation. The robots navigate by following boundaries and using landmarks to correct their position estimates. The maps can be used by behavior-based robots and are suitable for constrained conditions.

jamesbishop
Download Presentation

Autonomous construction of maps by miniature robots

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. Autonomous construction of mapsby miniature robots Paul Fitzpatrick Colin Flanagan

  2. Robot’s path traces the outline of the boundary • To follow a boundary :- • Move forward continuously • Turn left if boundary gets further away • Turn right if boundary gets closer Corner feature Move left Move right Edge feature

  3. Corner Landmarks Landmark position Landmark angle Landmark position • Location of corners used to correct robot’s position estimate • Angle between pairs of corners allow corrections to direction estimate

  4. Concave corner Convex corner Robot turns more sharply than the curve itself, giving a well-defined landmark. Robot cannot turn an arc with a radius less than the robot itself.

  5. Second pass First pass Wall dq Straight-Edge Landmarks dq • Correction suggested by apparent edge position • Correction suggested by apparent direction of the edge

  6. “Marker” representation scheme Recent marker Path of robot

  7. Recent marker Older marker Replaced marker Path of Robot Updating markers

  8. Recent marker Older marker Replaced marker Path of Robot Map = collection of markers

  9. Neighbourhoods Immediate Neighbourhood Near Neighbourhood Local Neighbourhood Distant Neighbourhood Current position of robot Markers

  10. Immediate Near Local Distant Index to marker currently being sorted Index of next marker to be sorted In each cycle of the sorting process, one marker from each neighbourhood is examined and moved to another neighbourhood if appropriate.

  11. Cyclic behaviour Robot caught in cyclic behaviour Robot shown trapped by an awkwardly shaped obstacle.

  12. Use of familiarity Familiar region expands until escape is possible Robot uses “familiarity” sensor to escape from trap.

  13. Use of background search Inspiration- background search succeeds Use of familiarity can be combined with conventional search

  14. Connectivity Markers not laid successively cannot be assumed to be reachable from each other, even if they are close Markers placed successively as robot moves can be assumed reachable from each other A B Path of robot

  15. Deducing connectivity Markers close to each other can be deduced to be connected if a short path between them can be found through other connected markers Path of robot A B C D D

  16. Direction of spread Most reachable Least reachable Updating connectivity

  17. Using connectivity 3 4 3 3 2 3 1 2 1 Goal 1 2 2 2 3 3

  18. Autonomous construction of mapsby miniature robots Paul Fitzpatrick Colin Flanagan

  19. Effect of not using landmarks

  20. Effect of using landmarks

  21. Conclusions • Maps can be built by an autonomous robot even under very constrained conditions: • Without long-range sensors such as sonar or vision • With limited processing power • With limited memory • Maps can be suitable for use by “behaviour-based” robots • No shared representation necessary • Don’t require extensive, time-extended computation

  22. Second pass First pass Wall dq Straight-Edge Landmarks dq • Correction suggested by apparent edge position • Correction suggested by apparent direction of the edge

More Related