IMagic Senior Project Emre AYDIN Asil Kaan BOZCUOĞLU Onur ÖZBEK Egemen VARDAR Onur YÜRÜTEN Project Supervisor: Asst. Prof. Uluç Saranlı.

Slides:



Advertisements
Similar presentations
Robot Sensor Networks. Introduction For the current sensor network the topography and stability of the environment is uncertain and of course time is.
Advertisements

Bidding Protocols for Deploying Mobile Sensors Reporter: Po-Chung Shih Computer Science and Information Engineering Department Fu-Jen Catholic University.
Hilal Tayara ADVANCED INTELLIGENT ROBOTICS 1 Depth Camera Based Indoor Mobile Robot Localization and Navigation.
Probabilistic Path Planner by Someshwar Marepalli Pratik Desai Ashutosh Sahu Gaurav jain.
By Lydia E. Kavraki, Petr Svestka, Jean-Claude Latombe, Mark H. Overmars Emre Dirican
The Bioloid Robot Project Presenters: Michael Gouzenfeld Alexey Serafimov Supervisor: Ido Cohen Winter Department of Electrical Engineering.
Robocup ve USARSIM Dr. Muhammet Balcılar. What is RoboCup? an international research and education initiative an attempt to foster AI and intelligent.
Probabilistic Roadmap
REU LEGO MINDSTORMS NXT SOCCER Kenneth Mendoza, Paul Balda, Abimilex Reverón & Mentor : Andres Buss Molina Department of Computer Science & Engineering.
Kinodynamic Path Planning Aisha Walcott, Nathan Ickes, Stanislav Funiak October 31, 2001.
Proximity Computations between Noisy Point Clouds using Robust Classification 1 Jia Pan, 2 Sachin Chitta, 1 Dinesh Manocha 1 UNC Chapel Hill 2 Willow Garage.
1 Last lecture  Configuration Space Free-Space and C-Space Obstacles Minkowski Sums.
On Efficient Clustering of Wireless Sensor Networks Mohamed Younis, Poonam Munshi, Gaurav Gupta (Univ. of Maryland) Sameh M. Elsharkawy( Catholic Univ.)
Discovering Environmental Structure with Mobile Robots Rahul Biswas CS326A Class Project.
A Self-Supervised Terrain Roughness Estimator for Off-Road Autonomous Driving David Stavens and Sebastian Thrun Stanford Artificial Intelligence Lab.
Final Presentation Advancing the soccer robot Ben Jenkins Supervisors: Gordon Lowe, Dr. Haim Hiok Lim Mentor: Charles Greif.
Brent Dingle Marco A. Morales Texas A&M University, Spring 2002
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces Kavraki, Svestka, Latombe, Overmars 1996 Presented by Dongkyu, Choi.
Planning for Humanoid Robots Presented by Irena Pashchenko CS326a, Winter 2004.
Presented By: Huy Nguyen Kevin Hufford
Bluenet a New Scatternet Formation Scheme * Huseyin Ozgur Tan * Zifang Wang,Robert J.Thomas, Zygmunt Haas ECE Cornell Univ*
Robot Motion Planning Bug 2 Probabilistic Roadmaps Bug 2 Probabilistic Roadmaps.
Study on Mobile Robot Navigation Techniques Presenter: 林易增 2008/8/26.
Distributed Robot Agent Brent Dingle Marco A. Morales.
STC Robot Optimally Covering an Unknown Indoor Environment Majd Srour, Anis Abboud Under the supervision of: Yotam Elor and Prof. Alfred Bruckstein.
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces Kavraki, Svestka, Latombe, Overmars 1996 Presented by Chris Allocco.
Created by Chris Bracken
1 DARPA TMR Program Collaborative Mobile Robots for High-Risk Urban Missions Second Quarterly IPR Meeting January 13, 1999 P. I.s: Leonidas J. Guibas and.
Decentralised Coordination of Mobile Sensors School of Electronics and Computer Science University of Southampton Ruben Stranders,
Presented by: Chaitanya K. Sambhara Paper by: Maarten Ditzel, Caspar Lageweg, Johan Janssen, Arne Theil TNO Defence, Security and Safety, The Hague, The.
Behavior Based Robotics: A Wall Following Behavior Arun Mahendra - Dept. of Math, Physics & Engineering, Tarleton State University Mentor: Dr. Mircea Agapie.
Nuttapon Boonpinon Advisor Dr. Attawith Sudsang Department of Computer Engineering,Chulalongkorn University Pattern Formation for Heterogeneous.
Autonomous Tracking Robot Andy Duong Chris Gurley Nate Klein Wink Barnes Georgia Institute of Technology School of Electrical and Computer Engineering.
Joint International Master Project Dennis Böck & Dirk C. Aumueller 1.
Adapted for STLP Camp ‘09 Mobile Robots Why do robots need to move?
Cooperating AmigoBots Framework and Algorithms
Algorithms for Robot-based Network Deployment, Repair, and Coverage Gaurav S. Sukhatme Center for Robotics and Embedded.
Intelligent Mobile Robotics Czech Technical University in Prague Libor Přeučil
788.11J Presentation “Multi-AUV Control” Presented By Mukundan Sridharan.
UNDERWATER GLIDERS.
Distributed Computation in MANets Robot swarm developed by James Rice University.
Towards Cognitive Robotics Biointelligence Laboratory School of Computer Science and Engineering Seoul National University Christian.
Design and Implementation of Cooperative Mobile Robots G. B. Lush and Gustavo A. Martinez Electronic Devices Laboratory Department of Electrical and Computer.
Mapping and Localization with RFID Technology Matthai Philipose, Kenneth P Fishkin, Dieter Fox, Dirk Hahnel, Wolfram Burgard Presenter: Aniket Shah.
Patch Based Mobile Sink Movement By Salman Saeed Khan Omar Oreifej.
DARPA TMR Program Collaborative Mobile Robots for High-Risk Urban Missions Third Quarterly IPR Meeting May 11, 1999 P. I.s: Leonidas J. Guibas and Jean-Claude.
Use bluetooth for communication 1. enable bluetooth in NXT and also enable visibility 2. configure setting in brickCC –Wait about 30 seconds for searching.
Final Presentation.  Software / hardware combination  Implement Microsoft Robotics Studio  Lego NXT Platform  Flexible Platform.
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces (1996) L. Kavraki, P. Švestka, J.-C. Latombe, M. Overmars.
The Mitre Meteor Robot Control Software “Simulate As You Operate” Presented by Darrell L Sims Richard M. Weatherly Frederick S. Kuhl Robert H. Bolling.
Boundary Assertion in Behavior-Based Robotics Stephen Cohorn - Dept. of Math, Physics & Engineering, Tarleton State University Mentor: Dr. Mircea Agapie.
1 Distributed and Optimal Motion Planning for Multiple Mobile Robots Yi Guo and Lynne Parker Center for Engineering Science Advanced Research Computer.
A Multidisciplinary Approach for Using Robotics in Engineering Education Jerry Weinberg Gary Mayer Department of Computer Science Southern Illinois University.
Behavior-based Multirobot Architectures. Why Behavior Based Control for Multi-Robot Teams? Multi-Robot control naturally grew out of single robot control.
COMP 417 – Jan 12 th, 2006 Guest Lecturer: David Meger Topic: Camera Networks for Robot Localization.
Cooperative Mapping and Localization using Autonomous Robots Researcher: Shaun Egan Superviser: Dr Karen Bradshaw.
Using IR For Maze Navigation Kyle W. Lawton and Liz Shrecengost.
Randomized Kinodynamics Planning Steven M. LaVelle and James J
Streaming Applications for Robots with Real Time QoS Oct Supun Kamburugamuve Indiana University.
Richard Patrick Samples Ph.D. Candidate, ECE Department 1.
Incremental Run-time Application Mapping for Heterogeneous Network on Chip 2012 IEEE 14th International Conference on High Performance Computing and Communications.
Mobile Sensor Network Deployment Using Potential Fields: A Distributed, Scalable Solution to the Area Coverage Problem Andrew Howard, Maja J Matari´c,
Learning Roomba Module 5 - Localization. Outline What is Localization? Why is Localization important? Why is Localization hard? Some Approaches Using.
Beard & McLain, “Small Unmanned Aircraft,” Princeton University Press, 2012, Chapter 12: Slide 1 Chapter 12 Path Planning.
Students: Yossi Turgeman Avi Deri Self-Stabilizing and Efficient Robust Uncertainty Management Instructor: Prof Michel Segal.
Automation as the Subject of Mechanical Engineer’s interest
Distributed Sensing, Control, and Uncertainty
Viability of vanishing point navigation for mobile devices
Market-based Dynamic Task Allocation in Mobile Surveillance Systems
Fundamental Problems in Mobile Robotics
Presentation transcript:

iMagic Senior Project Emre AYDIN Asil Kaan BOZCUOĞLU Onur ÖZBEK Egemen VARDAR Onur YÜRÜTEN Project Supervisor: Asst. Prof. Uluç Saranlı

Introduction - MAGIC 2010 Multi Autonomous Ground-robotic International Challenge Jointly sponsored by the US and Australian Departments of Defense Robots that will conduct a mission of intelligence, surveillance and reconnaissance Mission objectives: – Accurately and completely exploring and mapping the challenge area – Correctly locating, classifying and recognising all simulated threats

Introduction – MAGIC 2010 (cont.) Program goals: – Accelerating the development of autonomous and unmanned vehicle technology. – Demonstrating that multi-UVS cooperatives can operate effectively with limited supervision by humans in realistic environments. – Bringing fresh insights to the problem of developing robust autonomous multi-vehicle cooperatives and to identify and transition technologies to meet emerging requirements.

Introduction - iMagic iMagic is an implementation of the contest in a simulated environment. Development of the two opposing teams: – Incursion robots – Objects of interest Project goals: – Efficient decision-making and planning algorithms – Task allocation and re-allocation for multiple robots – Full autonomy – Reliance on sensory information exclusively

Network Structure

Communication Between Services

Message Handling

Problems We Have Encountered A completely new technology (CCR & DSS) Complications due to asynchrounous and distributed computing Bugs related to the physics engine

Odometry Robotics Studio does not have encoder in standard configurations We implemented our own encoders with following formula: rotation = update_elapsed_time * rotation_scale(1/2*pi)*wheel_speed

Odometry (cont’d) The formulae: O T+1 = O T + (D R - D L ) / W D T,T+1 = (D R + D L ) / 2 X T+1 = X T + D T,T+1 cos(O T+1 ) Y T+1 = Y T + D T,T+1 sin(O T+1 )

Odometry (cont’d) Odometry can be erroneous Our case: - In mapping, we don’t see much error - That can be because we implement the encoders virtually.

Mapping One of the main goal of the Magic 2010 While the target OOIs are neutralized, mapping process also must be done.

Mapping Algorithm (cont’d) Occupancy Map Principle - Every pixel has a value. ( Default: 128) - Robots’ laser range finders measure distance in 180 degree. - If it returns max range, corresponding pixel values in the range are increased. -Otherwise, the value of the end point of the corresponding ray is decreased.

Incursion Team Robots Pioneer 3DX Equipments: - Laser Range Finder - Differential Drive on two wheels - Web cam

Incursion Team Robots (Cont.) They can be in either of the following 3 states: – Wander – OOI Following – Motion-to-goal

Incursion Team Robots (Cont.) ‘Wander’ State: – Default state – Move randomly and explore the environment

Incursion Team Robots (Cont.) ‘OOI Following’ State: – Follow an OOI until neutralizing it Neutralizing an OOI: – Keep the OOI under surveillance for 20 seconds. – Neutralized OOIs are removed from the environment.

Incursion Team Robots (Cont.) ‘Motion-to-goal’ State: – Try to reach a goal point – For fast and deterministic exploration

Incursion Team Robots (Cont.) How is collision avoidance handled? – Slowing down – Doing boundary following – Backing off

Incursion Team & Command Center Switching to OOI Following State: – Command center calculates the distance between incursion robots and OOIs. – If it finds an ‘available’ incursion robot close enough to an OOI, it sends a message to that incursion robot.

Incursion Team & Command Center Switching to ‘Motion-to-goal’ State: – Command center determines the unexplored regions in the map built so far. – Generates a random point in the most unexplored region; finds an available incursion robot, and assigns that point as a goal to that robot.

OOI Robots’ Motion Goal Provide a collision-free motion Patrol within a subregion

Robot Information Lego mindstorm NXT Actuators and Sensors  Differential drive on two wheels  Laser range finder  Webcam

Lego Mindstorm NXT

Motion Planning Algorithm “Node construction” phase “Patrol” phase Local planner: Artificial potential fields

Node Construction Produce # of samples = # of existing nodes

Node Construction (cont.) Randomly pick one of the samples

Node Construction (cont.) Connect the sample with up to k (k=3) neighbours of the previous node

Node Construction (cont.)

Patrol Select target from the node set

Patrol Generate additional “bridge” nodes if needed.

Analysis Incremental node construction  Avoiding massive pre-computation  Motion is not delayed Implicitly building “borders”  Tentative area for patrolling Collision-free, elegant motion