August 31, Reactive Algorithms I

31
Multi-Robot Systems CSCI 7000-006 Monday, August 31, 2009 Nikolaus Correll

description

Multi-robot Systems

Transcript of August 31, Reactive Algorithms I

Page 1: August 31, Reactive Algorithms I

Multi-Robot Systems

CSCI 7000-006Monday, August 31, 2009

Nikolaus Correll

Page 2: August 31, Reactive Algorithms I

So far

• Introduction to robotics and multi-robot systems

• Similar algorithms and properties for robot teams, robot swarms and smart materials

Page 3: August 31, Reactive Algorithms I

Today

• Reactive algorithms• Environmental templates• Collaboration in reactive swarms

Page 4: August 31, Reactive Algorithms I

Reactive Algorithms

• Directly couple perception to action

• Extremely simple hardware (analog electronics will do)

• Robustness out of simplicity

• Potential for miniaturization

• First instance: Grey Walter’s tortoises

© The i-Swarm project

Page 5: August 31, Reactive Algorithms I

Concept: Braitenberg Vehicles

• Couple perception to action

• Sensor input coupled to actuator output

• Inspired by brain architecture – left/right hemisphere– Neural network

• Course question: how do the vehicles behave with respect to a light source?

Light Sensor

Motors

Page 6: August 31, Reactive Algorithms I

More complex behaviors

• Braitenberg– More sensors (e.g. camera)– More connections (e.g.

brain)• Synthesis by genetic

algorithms– Modify random connections– Unfit individuals fall of the

table• Hierarchical Decompositon

Page 7: August 31, Reactive Algorithms I

Subsumption Architecture (Brooks)

• Decompose behavior into modules– Collision avoidance, light

following, etc.• Arrange modules in layers

representing goals• Upper layers subsume lower

layers• Difficult to design with

increasing complexity

Avoid Obstacles

Wander around

Explore world

Brooks, R. (1986). "A robust layered control system for a mobile robot". Robotics and Automation, IEEE Journal of 2 (1): 14–23.

Page 8: August 31, Reactive Algorithms I

Alternative view: Artificial Potential Fields

• Aka virtual physics, motor schemes

• Goals are represented by virtual forces (attraction/repulsion)

• Forces are calculated from sensor input

• Addition yields vector field that the robots follow

• Obvious problem: local minima and cycles

© Craig Reynolds

Page 9: August 31, Reactive Algorithms I

Further Reading

• Valention Braitenberg“Experiments in synthetic psychology”, 1986

• Rodney Brooks“Elephants don’t play chess”, 1990

• Ronald Arkin“Behavior-based Robotics”, 1998

Page 10: August 31, Reactive Algorithms I

Example: Jet Turbine Inspection• Goal: surround every

blade in a turbine with a robotic sensor

• Robots need to be small, only local communication

• Alice (ASL, EPFL), sugar cube, 368bytes of RAM

Page 11: August 31, Reactive Algorithms I

Robotic Platform• Alice miniature robot [Caprari2005]• PIC microcontroller (368 bytes

RAM, 8Kb FLASH)• Length of 22mm• Maximal speed of 4cm/s, stepper

motors• 4 IR modules serve as very crude

proximity sensors (3cm) and local communication devices

• Energetic autonomy 5h-10h

Page 12: August 31, Reactive Algorithms I

Baseline: Randomized Coverage without Localization

Search Inspect Translate

Search Inspect Translatealong blade

Avoid Obstacle

Wall | Robot Obstacle clear

Blade pt

1-pt

Tt expired

Page 13: August 31, Reactive Algorithms I

Robot Capabilities

• Sensing: infrared distance sensors• Computation: FSM, wall following• Actuation: differential wheels• Communication: none

Page 14: August 31, Reactive Algorithms I

Analysis (Intuition)

• Collaboration: implicit• Completeness: probabilistic, asymptotic• Probability to leave blade at round or sharp tip

affects robot distribution

Page 15: August 31, Reactive Algorithms I

Experimental Results

20, 25, 30 robots

Page 16: August 31, Reactive Algorithms I

Spatial distribution for pt=0

• Leaving the blades at a tip generates drift in the environment

• “Enviromental Template”

• Probability to inspect some of the blades higher

Page 17: August 31, Reactive Algorithms I

Exploiting environmental templates: example from Biology

• Probability to pick up or drop certain objects is a function of local temperature

• Temperature gradient controls location of objects 3.00 a.m. 3.00 p.m.

T

Location of Eggs, Larvae, and Pupae in the nest of the ant Acantholepis Custodiens,© Guy Theraulaz

Page 18: August 31, Reactive Algorithms I

Randomized Coverage with Collaboration

Search Inspect MobileMarker

Avoid Obstacle

Wall | Robot Obstacle clear

Blade pt

1-pt | Marker

Tt expired

Translate Inspect Inspect

Page 19: August 31, Reactive Algorithms I

Robot Capabilities

• Sensing: infrared distance sensors• Computation: FSM, wall following• Actuation: differential wheels• Communication: single bit (blade busy or not)

Page 20: August 31, Reactive Algorithms I
Page 21: August 31, Reactive Algorithms I

Improvement of CollaborationReal

Macroscopic Model

Page 22: August 31, Reactive Algorithms I

Example 2: Stick-Pulling

• Goal: pull sticks out of the ground

• Two robots need to collaborate

A. Martinoli, K. Easton, and W. Agassounon. Modeling Swarm Robotic Systems: A Case Study in Collaborative Distributed Manipulation. Int. Journal of Robotics Research, 23(4):415-436, 2004.

Page 23: August 31, Reactive Algorithms I

Robotic Platform

• 16 MHz Motorola CPU• Incremental wheel encoders• 6 frontal infra-red sensors• Position feedback in arm (communication!)

Page 24: August 31, Reactive Algorithms I

Robot Capabilities

• Sensing: infrared distance sensors, detect stick• Computation: FSM, wall following• Actuation: differential wheels• Communication: explicit, physical via stick

• Course question: what happens if time-out is too high?

Page 25: August 31, Reactive Algorithms I

Analysis (Intuition)

• Time-out during wait key for performance• Less robots than sticks– Time-out too low: collaboration unlikely– Time-out too high: robot depletion

• More robots than sticks– The longer the time-out, the better

• Optimal value for gripping time when less robots than sticks?

Page 26: August 31, Reactive Algorithms I

Experimental Results

A. Martinoli, K. Easton, and W. Agassounon. Modeling Swarm Robotic Systems: A Case Study in Collaborative Distributed Manipulation. Int. Journal of Robotics Research, 23(4):415-436, 2004.

Page 27: August 31, Reactive Algorithms I

Example 3: Aggregation

• Goal: aggregate objects into structures

• Inspired by nest-building of termites

• Algorithm– Search for seeds– Pick-up seed– Drop close to other seeds– Only seeds at end of

cluster are identified as such -> Line formation

Martinoli, A., Ijspeert, A.J. and Mondada, F. (1999) Understanding collective aggregation mechanisms: from probabilistic modelling to experiments with real robots. Robotics and Autonomous Systems, 29(1) pp. 51-63.

Page 28: August 31, Reactive Algorithms I

Aggregation

Martinoli, A., Ijspeert, A.J. and Mondada, F. (1999) Understanding collective aggregation mechanisms: from probabilistic modelling to experiments with real robots. Robotics and Autonomous Systems, 29(1) pp. 51-63.

Page 29: August 31, Reactive Algorithms I

Results

Martinoli, A., Ijspeert, A.J. and Mondada, F. (1999) Understanding collective aggregation mechanisms: from probabilistic modelling to experiments with real robots. Robotics and Autonomous Systems, 29(1) pp. 51-63.

Page 30: August 31, Reactive Algorithms I

Summary

• Reactive control: tight coupling between perception and actuation

• Behavior is function of controller and environment

• Collaboration in reactive swarms– Implicit– Explicit: via the environment and local

communication

Page 31: August 31, Reactive Algorithms I

Next Sessions

• Wednesday: More on reactive algorithms– threshold-based algorithms– message propagation

• Friday: First lab