Using IR For Maze Navigation Kyle W. Lawton and Liz Shrecengost.

Slides:



Advertisements
Similar presentations
Mobile Robot ApplicationsMobile Robot Applications Textbook: –T. Bräunl Embedded Robotics, Springer 2003 Recommended Reading: 1. J. Jones, A. Flynn: Mobile.
Advertisements

Reactive and Potential Field Planners
Sensor Based Planners Bug algorithms.
NW Computational Intelligence Laboratory Experience-Based Surface-Discernment by a Quadruped Robot by Lars Holmstrom, Drew Toland, and George Lendaris.
The Bioloid Robot Project Presenters: Michael Gouzenfeld Alexey Serafimov Supervisor: Ido Cohen Winter Department of Electrical Engineering.
Carnegie Mellon University School of Computer Science Carnegie Mellon University School of Computer Science Cognitive Primitives for Mobile Robots Development.
DARPA Mobile Autonomous Robot SoftwareMay Adaptive Intelligent Mobile Robotics William D. Smart, Presenter Leslie Pack Kaelbling, PI Artificial.
Silvina Rybnikov Supervisors: Prof. Ilan Shimshoni and Prof. Ehud Rivlin HomePage:
Cartographic Order Specified Task Robot. Overview  Design and build a compact robot to traverse a maze.  Perform tasks located throughout the maze in.
IMagic Senior Project Emre AYDIN Asil Kaan BOZCUOĞLU Onur ÖZBEK Egemen VARDAR Onur YÜRÜTEN Project Supervisor: Asst. Prof. Uluç Saranlı.
1 Panoramic University of Amsterdam Informatics Institute.
An object in front of a curved mirror gives off light in all different directions. Most miss the mirror so don’t make an image. Many, many, many light.
A* and D* Search Kevin Tantisevi. Outline Overview of Search Techniques A* Search D* Search.
ECE 7340: Building Intelligent Robots QUALITATIVE NAVIGATION FOR MOBILE ROBOTS Tod S. Levitt Daryl T. Lawton Presented by: Aniket Samant.
Experiences with an Architecture for Intelligent Reactive Agents By R. Peter Bonasso, R. James Firby, Erann Gat, David Kortenkamp, David P Miller, Marc.
Maze Solving with an AIBO Bernard Maassen, Hans Kuipers, Max Waaijers & Andrew Koster 2005.
Ratbert: Nearest Sequence Memory Based Prediction Model Applied to Robot Navigation by Sergey Alexandrov iCML 2003.
Color Recognition and Image Processing CSE321 MyRo Project Rene van Ee and Ankit Agarwal.
Integration of Representation Into Goal- Driven Behavior-Based Robots By Dr. Maja J. Mataric` Presented by Andy Klempau.
TETRIX/VEX Challenge (use either robot hardware) There will be two events for the May Madness 2010 Challenge –The Grand Challenge - completely autonomous.
Study on Mobile Robot Navigation Techniques Presenter: 林易增 2008/8/26.
Team P.A.C.K men EE 296 Project. Chris Mcleod Hardware Specialist.
Heterogenous Hazard Avoidance Behavior in Autonomous, Mobile Robots Joseph D. Lawton & Jeffery A. Seeger Project Advisor: Jeffrey Horn Northern Evolutionary.
Sonar-Based Real-World Mapping and Navigation by ALBERTO ELFES Presenter Uday Rajanna.
Mobile Robot ApplicationsMobile Robot Applications Textbook: –T. Bräunl Embedded Robotics, Springer 2003 Recommended Reading: 1. J. Jones, A. Flynn: Mobile.
Patent Liability Analysis Andrew Loveless. Potential Patent Infringement Autonomous obstacle avoidance 7,587,260 – Autonomous navigation system and method.
How can robots help people and make the world a better place?
June 12, 2001 Jeong-Su Han An Autonomous Vehicle for People with Motor Disabilities by G. Bourhis, O.Horn, O.Habert and A. Pruski Paper Review.
Vision-based Navigation and Reinforcement Learning Path Finding for Social Robots Xavier Pérez *, Cecilio Angulo *, Sergio Escalera + and Diego Pardo *
Modularly Adaptable Rover and Integrated Control System Mars Society International Conference 2003 – Eugene, Oregon.
Administrative Introduction Our goals for this project is for the two robots to work together intelligently using wireless communication Not only did.
Lecture 1 Note: Some slides and/or pictures are adapted from Lecture slides / Books of Dr Zafar Alvi. Text Book - Aritificial Intelligence Illuminated.
ROBOT LOCALISATION & MAPPING: NAVIGATION Ken Birbeck.
Xtreme Robot Olympiad Programming with Sensors Dr. Peter Laz Associate Professor Department of Engineering University of Denver.
LIGHT AND ITS USES. LIGHT RAY STRAIGHT LINE PATH OF LIGHT.
Lynbrook HS Robotics San Jose, CA aMazing Robot iARoC Presentation.
Exploring with Lego Robots Daniel Limbrick (Texas A&M University) Emily Sherrill (Tennessee Tech University)
An Implementation of Artificial Physics Using AIBO Robots and the Pyro Programming Environment Ankur Desai December 7, 2006.
Study on Genetic Network Programming (GNP) with Learning and Evolution Hirasawa laboratory, Artificial Intelligence section Information architecture field.
Administrative Introduction Our goals for this project are for the three robots to work together intelligently to complete a maze faster than an individual.
University of Amsterdam Search, Navigate, and Actuate - Qualitative Navigation Arnoud Visser 1 Search, Navigate, and Actuate Qualitative Navigation.
Boundary Assertion in Behavior-Based Robotics Stephen Cohorn - Dept. of Math, Physics & Engineering, Tarleton State University Mentor: Dr. Mircea Agapie.
Wandering Standpoint Algorithm. Wandering Standpoint Algorithm for local path planning Description: –Local path planning algorithm. Required: –Local distance.
Team November EGN 1935 Team: November Robot: November Team Members Giovanni Montoya Hussam Okasha Tommy Rooney EGN 1935 Dr. Arroyo, Dr Schwartz, Kevin.
Robotics Challenges. Challenge Slide 2 Have your robot make a left curved turn around your Lego person. Go forward, then reverse. Come to a stop, play.
1 Research Question  Can a vision-based mobile robot  with limited computation and memory,  and rapidly varying camera positions,  operate autonomously.
Learning to Navigate Through Crowded Environments Peter Henry 1, Christian Vollmer 2, Brian Ferris 1, Dieter Fox 1 Tuesday, May 4, University of.
Map-Making with a Four-Legged Mobile Robot Exploring Robotics and Robotic Map- making at the Undergraduate Level Ben Willard, Kurt Krebsbach Lawrence University.
Turning Autonomous Navigation and Mapping Using Monocular Low-Resolution Grayscale Vision VIDYA MURALI AND STAN BIRCHFIELD CLEMSON UNIVERSITY ABSTRACT.
Robotics Club: 5:30 this evening
PHY 235 Robotics Workshop Day 5 Distance Sensing Using The Ultrasonic Ping Sensor.
1 Energy-Efficient Mobile Robot Exploration Yongguo Mei, Yung-Hsiang Lu Purdue University ICRA06.
Ghislain Fouodji Tasse Supervisor: Dr. Karen Bradshaw Computer Science Department Rhodes University 24 March 2009.
Ray Model A useful model under certain circumstances to explain image formation. Ray Model: Light travels in straight-line paths, called rays, in ALL.
Chapter 2 Approaches/Methods Artificial Intelligence Instructor: Haris Shahzad Artificial Intelligence CS-402.
Artificial Intelligence The Future Alton Wilson AIL 690.
Vision-Guided Humanoid Footstep Planning for Dynamic Environments P. Michel, J. Chestnutt, J. Kuffner, T. Kanade Carnegie Mellon University – Robotics.
Task 1: 2 mirrors and a nail- observations At 180° we can see 2 nails. The reflection of the nail was repeated 3 times inside of the mirrors. We saw 9.
Integrated navigation systems for inland navigation – beyond chart and radar Dr.-Ing. Martin Sandler in – innovative navigation GmbH Leibnizstr
Autonomous Navigation of a
Vision-Guided Humanoid Footstep Planning for Dynamic Environments
COGNITIVE APPROACH TO ROBOT SPATIAL MAPPING
Robotics Application Framework
Schedule for next 2 weeks
Graduation Project SMART CAR Tariq Salameh Mohamed Qamhieh
BC Science Connections 8
The Study of Mirrors and Lenses
ECE 477 Digital Systems Senior Design Project  Spring 2013
Waves may reflect diffusely based on…
Using an Autonomous Swarm Robot Team to Locate Survivors in a Dangerous Area By Noah Sanz.
Presentation transcript:

Using IR For Maze Navigation Kyle W. Lawton and Liz Shrecengost

Project Goal The goal of the project was to allow the AIBO to autonomously navigate and map an unknown maze.

Outline The Sony AIBO Tekkotsu Our Project Conclusion

The Sony AIBO AIBO stands for Artificial Intelligence roBOt. It also means “companion” in Japanese. The first- generation AIBO was launched in 1999.

AIBO Diagram

Tekkotsu An open source program created at Carnegie Mellon University Handles routine tasks and allows the user to concentrate on their unique application Designed to make adding new functionality easy

Pertinent Abilities of the AIBO  Pre-programmed Walk  Walking is an extremely complicated process  Infrared Sensors

Infrared  The AIBO measures distance based on long it takes IR light to get back to it  It can only measure things within a very short range (no closer than 100 mm and no further than 900 mm)  Measurements are taken every 32 milliseconds

Maze Generation Virtual maps were generated to simulate the process of exploration As the AIBO actually moves, it stores which walls it actually sees and updates its own map

Maze Navigation Maze Navigation Unexplored cells are preferred to explored ones When the AIBO reaches a dead end, it is able to back-track # # ## # ## # ## # # ?? ?? # # ## ? ## ? ## ? # ? ?? ?? ?? ? # ? ## ? ## ? ## ? # ? ?? ?? ?? ? # ? ## ? ## ? ## ? # ? ?? ?? ?? ? # ? ## ? ## ? ## ? # # # ## # ## # ## # # ?? # # ## ## ? ## ? # ? ?? ?? ?? ? # ? ## ? ## ? ## ? # ? ?? ?? ?? ? # ? ## ? ## ? ## ? # ? ?? ?? ?? ? # ? ## ? ## ? ## ? # # # ## # ## # ## # # # # ## ## ## ? # ? ?? ?? ?? ? # ? ## ? ## ? ## ? # ? ?? ?? ?? ? # ? ## ? ## ? ## ? # ? ?? ?? ?? ? # ? ## ? ## ? ## ? # # # ## # ## # ## # # # # ## ## ## # # ? ?? ?? ?? ? # ? ## ? ## ? ## ? # ? ?? ?? ?? ? # ? ## ? ## ? ## ? # ? ?? ?? ?? ? # ? ## ? ## ? ## ? # # # ## # ## # ## # # # # ## ## ## # # ? ?? ?? ?? ? # ? ## ? ## ? ## ? # ? ?? ?? ?? ? # ? ## ? ## ? ## ? # ? ?? ?? ?? ? # ? ## ? ## ? ## ? # # # ## # ## # ## # # # # ## ## ## # # ? ?? ? # ? ## ? ## ## ? # ? ?? ?? ?? ? # ? ## ? ## ? ## ? # ? ?? ?? ?? ? # ? ## ? ## ? ## ? # # # ## # ## # ## # # # # ## ## ## # # ? ?? # # ? ## ? ## ## # # ? ?? ?? ?? ? # ? ## ? ## ? ## ? # ? ?? ?? ?? ? # ? ## ? ## ? ## ? # # # ## # ## # ## # # # # ## ## ## # # ? ?? # # ? ## ? ## ## # # ? ?? ?? ?? ? # ? ## ? ## ? ## ? # ? ?? ?? ?? ? # ? ## ? ## ? ## ? # # # ## # ## # ## # # # # ## ## ## # # ? ?? ## # # ? ## ? ## ## # # ? ?? ? # ? ## ? ## ## ? # ? ?? ?? ?? ? # ? ## ? ## ? ## ? # # # ## # ## # ## # # # # ## ## ## # # ? ?? ## # # ? ## ? ## ## # # ? ?? # # ? ## ? ## ## # # ? ?? ?? ?? ? # ? ## ? ## ? ## ? # # # ## # ## # ## # # # # ## ## ## # # ? ?? ## # # ? ## ? ## ## # # ? ?? # # ? ## ? ## ## # # ? ?? ?? ?? ? # ? ## ? ## ? ## ? # # # ## # ## # ## # # # # ## ## ## # # ? ?? ## # # ? ## ? ## ## # # ? ?? ## # # ? ## ? ## ## # # ? ?? ? # ? ## ? ## # ## ? # # # ## # ## # ## # # # # ## ## ## # # ? ?? ## # # ? ## ? ## ## # # ? ?? ## # # ? ## ? ## ## # # ? ?? # # ? ## ? ## # ## # # # # ## # ## # ## # # # # ## ## ## # # ? ?? ## # # ? ## ? ## ## # # ? ?? ## # # ? ## ? ## ## # # ? ?? # # ? ## ? ## # ## # # # # ## # ## # ## # # # # ## ## ## # # ? ?? ## # # ? ## ? ## ## # # ? ?? # # ? ## ? ## ## # # ? ?? ## # # ? ## ? ## # ## # # # # ## # ## # ## # # # # ## ## ## # # ? ?? # # ? ## ? ## ## # # ? ?? ## # # ? ## ? ## ## # # ? ?? ## # # ? ## ? ## # ## # # # # ## # ## # ## # # # # ## ## ## # # ? ?? ## # # ? ## ? ## ## # # ? ?? ## # # ? ## ? ## ## # # ? ?? ## # # ? ## ? ## # ## # # # # ## # ## # ## # # # # ## ## ## # # ? ?? ## # # ? ## ? ## ## # # ? ?? ## # # ? ## ? ## ## # # ? ?? ## # # ? ## ? ## # ## # # # # ## # ## # ## # # # # ## ## ## # # ? ## # # ? ## # ## ## # # ? ?? ## # # ? ## ? ## ## # # ? ?? ## # # ? ## ? ## # ## # # # # ## # ## # ## # # # # ## ## ## # # ? ## ## # # ? ## # ## ## # # ? ?? ## # # ? ## ? ## ## # # ? ?? ## # # ? ## ? ## # ## # # # # ## # ## # ## # # # # ## ## ## # # ? ## ## # # ? ## # ## ## # # ? ?? ## # # ? ## ? ## ## # # ? ?? ## # # ? ## ? ## # ## # # # # ## # ## # ## # # # # ## ## ## # # ## ## # # ## # ## ## # # ? ?? ## # # ? ## ? ## ## # # ? ?? ## # # ? ## ? ## # ## # # # # ## # ## # ## # # # # ## ## ## # # # ## ## # # ## # ## ## # # ## # # ## ? ## ## # # ? ?? ## # # ? ## ? ## # ## # # # # ## # ## # ## # # # # ## ## ## # # # ## ## # # ## # ## ## # # ## # # ## ## ## # # ? ?? ## # # ? ## ? ## # ## # # # # ## # ## # ## # # # # ## ## ## # # # ## ## # # ## # ## ## # # # ## # # ## ## ## # # ? ## # # ? ## # ## # ## # # # # ## # ## # ## # # # # ## ## ## # # # ## ## # # ## # ## ## # # ## # # ## ## ## # # ? ## ## # # ? ## # ## # ## # # # # ## # ## # ## # # # # ## ## ## # # # ## ## # # ## # ## ## # # ## # # ## ## ## # # ? ## ## # # ? ## # ## # ## # # # # ## # ## # ## # # # # ## ## ## # # # ## ## # # ## # ## ## # # # ## # # ## ## ## # # ## ## # # # ## # ## # ## # #

Alignment  The robot is very likely to go off course as it is traveling through the maze.  Alignment comes in two steps:  Position to the center of the path  Orientation parallel to walls

Processing Alignment Pan head to get the distances and angles of walls Use this information to determine your relative position in the maze The picture to the left represents actual data from a maze Breakpoint

Integration The program uses a finite state automaton to transfer between the different behaviors Each state is called when the previous one has completed its motion

Results The maze navigation uses a grid, but the AIBO is not confined to move likewise The preprogrammed walk had to be recalibrated in order to account for the different surfaces that it was walking on. It is able to explore a maze and account for commonly occurring anomalies

What Else Could Be Done Adapt for different maze types Different wall thicknesses Curved walls More efficient navigation Removing excessive stops Panning head while walking Cutting corners

Conclusion The real world is very different from our maze Accounting for errors is critical for robust behaviors Real World Applications Building Navigation Search and Rescue

Image Credits (slides 1 and 7) (slide 4) (slide 5) (slide 6) (cow, slide 17) (slides 8 and 17) We would also like to thank Dr. David S. Touretzky for the use of the equipment and The Robotics Education Laboratory for the use of the maze walls