COMMUNICATION IN MULTIROBOT TEAMS - BARATH CHRISTOPHER PETIT.

Slides:



Advertisements
Similar presentations
Programming exercises: Angel – lms.wsu.edu – Submit via zip or tar – Write-up, Results, Code Doodle: class presentations Student Responses First visit.
Advertisements

A 2 -MAC: An Adaptive, Anycast MAC Protocol for Wireless Sensor Networks Hwee-Xian TAN and Mun Choon CHAN Department of Computer Science, School of Computing.
Dead Reckoning Objectives – –Understand what is meant by the term dead reckoning. –Realize the two major components of a dead reckoning protocol. –Be capable.
Coverage by Directional Sensors Jing Ai and Alhussein A. Abouzeid Dept. of Electrical, Computer and Systems Engineering Rensselaer Polytechnic Institute.
Multi Robot Systems Course Bar Ilan University Mor Vered.
School of Systems, Engineering, University of Reading rkala.99k.org April, 2013 Motion Planning for Multiple Autonomous Vehicles Rahul Kala Lateral Potentials.
The AGILO Autonomous Robot Soccer Team: Computational Principles, Experiences, and Perspectives Michael Beetz, Sebastian Buck, Robert Hanek, Thorsten Schmitt,
Software Quality Ranking: Bringing Order to Software Modules in Testing Fei Xing Michael R. Lyu Ping Guo.
Resource Management of Highly Configurable Tasks April 26, 2004 Jeffery P. HansenSourav Ghosh Raj RajkumarJohn P. Lehoczky Carnegie Mellon University.
AuRA: Principles and Practice in Review
Monday, June 01, 2015 ARRIVE: Algorithm for Robust Routing in Volatile Environments 1 NEST Retreat, Lake Tahoe, June
11Sahalu JunaiduICS 573: High Performance Computing5.1 Analytical Modeling of Parallel Programs Sources of Overhead in Parallel Programs Performance Metrics.
1 Clockless Logic Montek Singh Thu, Jan 13, 2004.
Reinforcement Learning Rafy Michaeli Assaf Naor Supervisor: Yaakov Engel Visit project’s home page at: FOR.
802.11n MAC layer simulation Submitted by: Niv Tokman Aya Mire Oren Gur-Arie.
On the Construction of Energy- Efficient Broadcast Tree with Hitch-hiking in Wireless Networks Source: 2004 International Performance Computing and Communications.
Results Showing the potential of the method for arbitrary networks The following diagram show the increase of networks’ lifetime in which SR I =CR I versus.
CS 599 Intelligent Embedded Systems1 Adaptive Protocols for Information Dissemination in Wireless Sensor Networks W.R.Heinzelman, J.kulik, H.Balakrishnan.
Integrating POMDP and RL for a Two Layer Simulated Robot Architecture Presented by Alp Sardağ.
Motor Schema Based Navigation for a Mobile Robot: An Approach to Programming by Behavior Ronald C. Arkin Reviewed By: Chris Miles.
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks IEEE transactions on Mobile Computing Weifa Liang, YuZhen Liu.
Opportunistic Optimization for Market-Based Multirobot Control M. Bernardine Dias and Anthony Stentz Presented by: Wenjin Zhou.
DAMN : A Distributed Architecture for Mobile Navigation Julio K. Rosenblatt Presented By: Chris Miles.
Geometric Probing with Light Beacons on Multiple Mobile Robots Sarah Bergbreiter CS287 Project Presentation May 1, 2002.
Design of Cooperative Vehicle Safety Systems Based on Tight Coupling of Communication, Computing and Physical Vehicle Dynamics Yaser P. Fallah, ChingLing.
Fast and Reliable Estimation Schemes in RFID Systems Murali Kodialam and Thyaga Nandagopal Bell Labs, Lucent Technologies Presented by : Joseph Gunawan.
Introduction to Behavior- Based Robotics Based on the book Behavior- Based Robotics by Ronald C. Arkin.
Decentralized Scattering of Wake-up Times in Wireless Sensor Networks Amy L. Murphy ITC-IRST, Trento, Italy joint work with Alessandro Giusti, Politecnico.
A Cooperative Diversity- Based Robust MAC Protocol in wireless Ad Hoc Networks Sangman Moh, Chansu Yu Chosun University, Cleveland State University Korea,
Wei Gao1 and Qinghua Li2 1The University of Tennessee, Knoxville
Mobile Routing protocols MANET
Power Save Mechanisms for Multi-Hop Wireless Networks Matthew J. Miller and Nitin H. Vaidya University of Illinois at Urbana-Champaign BROADNETS October.
 Communication Tasks  Protocols  Protocol Architecture  Characteristics of a Protocol.
Using Pattern of Social Dynamics in the Design of Social Networks of Sensors - Marello Tomasini, Franco Zambonelli, Ronaldo Menezes 한국기술교육대학교 전기전자통신 공학부.
Maximum Network Lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges Cardei, M.; Jie Wu; Mingming Lu; Pervaiz, M.O.; Wireless And Mobile.
1 Distributed Energy-Efficient Scheduling for Data-Intensive Applications with Deadline Constraints on Data Grids Cong Liu and Xiao Qin Auburn University.
ENERGY-EFFICIENT FORWARDING STRATEGIES FOR GEOGRAPHIC ROUTING in LOSSY WIRELESS SENSOR NETWORKS Presented by Prasad D. Karnik.
CSC321: 2011 Introduction to Neural Networks and Machine Learning Lecture 9: Ways of speeding up the learning and preventing overfitting Geoffrey Hinton.
Deployment Strategy for Mobile Robots with Energy and Timing Constraints Yongguo Mei, Yung-Hsiang Lu, Y. Charlie Hu, and C.S. George Lee School of Electrical.
Impact of Process Variation on Input Referred Current Offset in Current Sense Amplifiers Riya Shergill Meenakshi Sekhar.
REECH ME: Regional Energy Efficient Cluster Heads based on Maximum Energy Routing Protocol Prepared by: Arslan Haider. 1.
LOCAL AREA NETWORKS. CSMA/CD Carrier Sense Multiple Access with Collision Detection The CSMA method does not specify the procedure following a collision.
UAV’s: Scenarios Smart bombs  no need to return to base Reconnaissance/surveillance  types of sensors used, mission specifics (e.g. round trip, refuel.
COMPUTER ORGANIZATION AND ASSEMBLY LANGUAGE Lecture 19 & 20 Instruction Formats PDP-8,PDP-10,PDP-11 & VAX Course Instructor: Engr. Aisha Danish.
Optimal Self-placement of Heterogeneous Mobile Sensors in Sensor Networks Lidan Miao AICIP Research Oct. 19, 2004.
Recitation 8 Wireless Networks.
Behavior-based Multirobot Architectures. Why Behavior Based Control for Multi-Robot Teams? Multi-Robot control naturally grew out of single robot control.
a/b/g Networks Routing Herbert Rubens Slides taken from UIUC Wireless Networking Group.
Selection of Behavioral Parameters: Integration of Case-Based Reasoning with Learning Momentum Brian Lee, Maxim Likhachev, and Ronald C. Arkin Mobile Robot.
Computer Science and Engineering Power-Performance Considerations of Parallel Computing on Chip Multiprocessors Jian Li and Jose F. Martinez ACM Transactions.
M2M Study Item 3GPP2 Orlett W. Pearson May | 3GPP2 M2M Study Item | May GPP2 M2M This study will include the following study targets: 
Turbo Codes. 2 A Need for Better Codes Designing a channel code is always a tradeoff between energy efficiency and bandwidth efficiency. Lower rate Codes.
Quality of Service Schemes for IEEE Wireless LANs-An Evaluation 主講人 : 黃政偉.
Queue Scheduling Disciplines
Mobile Sensor Network Deployment Using Potential Fields: A Distributed, Scalable Solution to the Area Coverage Problem Andrew Howard, Maja J Matari´c,
Path Planning Based on Ant Colony Algorithm and Distributed Local Navigation for Multi-Robot Systems International Conference on Mechatronics and Automation.
Toward Reliable and Efficient Reporting in Wireless Sensor Networks Authors: Fatma Bouabdallah Nizar Bouabdallah Raouf Boutaba.
Quantizing Behavioral Heterogeneity Jon Beckham 11/21/02.
Adiabatic Quantum Computing Josh Ball with advisor Professor Harsh Mathur Problems which are classically difficult to solve may be solved much more quickly.
SERENA: SchEduling RoutEr Nodes Activity in wireless ad hoc and sensor networks Pascale Minet and Saoucene Mahfoudh INRIA, Rocquencourt Le Chesnay.
MARS 2020 Kick-Off Meeting 13 November 2002 Georgia Tech.
On Mobile Sink Node for Target Tracking in Wireless Sensor Networks Thanh Hai Trinh and Hee Yong Youn Pervasive Computing and Communications Workshops(PerComW'07)
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
Threshold sensitive Energy Efficient sensor Network (TEEN)
On the Lifetime of Wireless Sensor Networks
Bluetooth Based Smart Sensor Network
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks
CS 4630: Intelligent Robotics and Perception
CS 188: Artificial Intelligence Spring 2006
Algorithm Research of Path Planning for Robot Based on Improved Artificial Potential Field(IAPF) Fenggang Liu.
Presentation transcript:

COMMUNICATION IN MULTIROBOT TEAMS - BARATH CHRISTOPHER PETIT

PAPER COMMUNICATION IN REACTIVE MULTIAGENT SYSTEMS -Tucker Balch and Ronald Arkin

ISSUES ● Multiple robot teams are faster and reliable than a single robot system. ● Can communication between the robots in a multirobot team enhance the performance? ● What level of communication yields the best performance?(relative to the performance metrics being used to evaluate the performance.)

PERFORMANCE EVALUATION ● Three benchmark tasks were devised to evaluate system performance, namely: ● FORAGE ● CONSUME ● GRAZING

PERFORMANCE EVALUATION ● Six parameters for classification ● TASK ● COMMUNICATION TYPE ● NUMBER OF ROBOTS ● NUMBER OF ATTRACTORS ● MASS OF ATTRACTORS ● PERCENTAGE OF OBSTACLE COVERAGE

THE FORAGE TASK ● Robot wanders in environment looking for items of interest (attractors). ● Once attractor is sighted, robot moves towards it, acquires it and finally returns it to specified home base. ● Mass of attractor dictates completion time. ● Several robots can cooperate in carrying an attractor to home base but speed of slowest robot will be the bottleneck.

THE CONSUME TASK ● Similar to FORAGE but after acquiring the attractor the robot operates on the attractor instead of carrying it to a home base. ● Time to completion is proportional to mass of attractor. ● Several robots can cooperate while operating or 'consuming' the attractor. ● Rate of consumption is linear with number of operating robots, (there is no ceiling).

THE GRAZE TASK ● Unlike FORAGE, CONSUME there are no discrete attractors. ● Aim is to completely visit the environment (or some percentage of it). ● Time of completion dictated by size of the environment. ● Multiple robots reduce time if they avoid previously grazed areas and if they can sight ungrazed areas quickly.

TASK PARAMETERS ● NUMBER OF ATTRACTORS (for FORAGE and CONSUME). ● MASS OF ATTRACTORS (for FORAGE and CONSUME). ● GRAZE COVERAGE (for GRAZE).

COMPLEX TASKS Complex tasks can be viewed as being a combination of simpler tasks like foraging, consume or grazing.

Wander Acquire Deliver Encounter Deposit Attach The FORAGE FSA

THE WANDER STATE ● Noise: high gain to maximize coverage. ● Avoid-static-obstacle (for objects): high to avoid collisions. ● Avoid-static-obstacle (for robots) : high to avoid other robots to ensure maximum and efficient area coverage. ● Detect-attractor: a perceptual schema that is triggered when an attractor is sighted, enabling the transition to the ACQUIRE state.

THE ACQUIRE STATE ● Noise: low gain, to overcome local minimas ● Avoid-static-obstacle (for objects): high to avoid collisions with obstacles. ● Avoid-static-obstacle (for robots): very low so that robots can converge on same attractor to cooperate. ● Move-to-goal: high to move to the detected attractor. ● Detect-attachment: a perceptual schema that is triggered when robot is close enough to attach to the attractor.

THE DELIVER STATE ● Noise: low to overcome local minima. ● Avoid-static-obstacle (for objects): high to avoid collisions. ● Avoid-static-obstacle (for robots): low to enable robots to cooperate. ● Move-to-goal: high (target is home base). ● Detect-deposit: a perceptual schema that is triggered when home base is reached.

Wander Acquire Consume Encounter Complete Attach The CONSUME FSA

CONSUME ● WANDER and ACQUIRE states are similar to states in FORAGE but instead of DELIVER, the CONSUME state is used. ● In CONSUME, only one motor schema is active which reduces the mass of the attractor till it becomes zero. ● Once attractor is consumed, the robot transitions to the WANDER state.

Wander Acquire Graze Encounter Encounter grazed area Move to ungrazed part The GRAZE FSA

The GRAZE state ● Noise: low gain to overcome local minima. ● Avoid-static-obstacle: (for objects) high to avoid collision. ● Avoid-static-obstacle: (for robots) very low to enable robots to graze closeby. ● Probe: moderate to enable robot to move along its current heading. ● Graze: the graze mechanism, which 'tags' the area being grazed. ● Detect-grazed-area: this triggers transition to WANDER.

INTER–AGENT COMMUNICATION ● NO COMMUNICATION ● STATE COMMUNICATION ● GOAL COMMUNICATION

NO COMMUNICATION ● Robots can sense other robots, obstacles and attractors. ● However none of the information is transmitted to other robots. ● Note that robots can still cooperate (in tasks like foraging and consume), as was shown by Arkin.

STATE COMMUNICATION ● Robots can detect internal states of other robots. ● Single bit communication: a one indicates that the robot is in WANDER state, and a zero indicates a state other than WANDER. ● State communication need not be deliberate.

GOAL COMMUNICATION ● Transmission and reception of goal information. ● Needs to be deliberate, unlike previous two modes of communication. ● Robot can get to goal directly rather than follow the sender robot (unlike state communication).

PERFORMANCE METRICS ● COST: minimize system cost. Aims to reduce number of robots. ● TIME: minimizes completion time. Tends to increase number of robots. ● ENERGY: minimizes the energy expended in completing the task. ● RELIABILITY/SURVIVABILITY: Priority is on completion of task.

BASELINE PERFORMANCE ● 3-dimensional plot ● ● Maximum time for single robot. ● Minimum time for maximum robots. ● In some cases, improvement in time with addition of robots is not significant. ● For given number of robots, it takes longer to complete the task with more number of attractors.

AMORTIZED COST METRIC ● If systems needs to be both fast and inexpensive, then thers is a tradeoff. ● In this case the metric is: N*300 + T. ● N: number of robots. ● T: Time taken. ● The cost of each robot per run is taken as (for eg.) 300. ● For FORAGE, a system with 2 robots is best for 3-4 attractors.

SPEEDUP ● Measures efficiency of n robot team relative to a single robot system in performing a task. ● If attractors are fixed, then it is defined as : (time taken by 1 robot)/ (n * time taken by n robots). ● Speedup is higher for larger number of attractors. ● Speedup is sublinear for CONSUME, but can be superlinear for lower mass of attractors. ● Speedup for GRAZE is mostly superlinear.

RESULTS WITH COMMUNICATION ● FORAGE:State communication improved performance by 16%. Goal communication is better than state communication by 3%. ● CONSUME: State communication gives 10% improvement. Goal communication gives 6% improvement (over no communication). ● For low mass attractors, Goal communication almost indistinguishable from state communication. ● GRAZE: Communication has hardly any effect, due to implicit communication.

RESULTS ● Initial testing on mobile robots support simulation results. ● Comunication improves performance in tasks with little implicit communication. ● Communication is not effective in tasks which include implicit communication. ● More complex strategies offer little or no benefit over low-level communication.