Evolving Societies of Learning Autonomous Systems (ESLAS) Franz J. - - PowerPoint PPT Presentation

evolving societies of learning autonomous systems eslas
SMART_READER_LITE
LIVE PREVIEW

Evolving Societies of Learning Autonomous Systems (ESLAS) Franz J. - - PowerPoint PPT Presentation

Organic Computing Final Colloquium / Sept 2011 Evolving Societies of Learning Autonomous Systems (ESLAS) Franz J. Rammig, Bernd Kleinjohann, Willi Richert, Alexander Jungmann University of Paderborn / C-LAB ESLAS Project - Background Main


slide-1
SLIDE 1

Evolving Societies of Learning Autonomous Systems (ESLAS)

Franz J. Rammig, Bernd Kleinjohann, Willi Richert, Alexander Jungmann University of Paderborn / C-LAB

Organic Computing Final Colloquium / Sept 2011

slide-2
SLIDE 2

ESLAS Project - Background Main goal: Self-organizing of heterogeneous societies

  • f autonomous robots

How to model dynamically changing goals of a robot? biological principles: motivation system in terms of drives How to individually achieve a specified goal? self-exploration, self-awareness, individual learning How to converge to group behaviour? imitation: observing, understanding and incorporating additional knowledge How to coordinate multiple possibly contradicting goals?

September 16, 2011 DFG 1183 ORGANIC COMPUTING

2

slide-3
SLIDE 3

ESLAS Project Phase III – Brief Recap

Motivation system in terms of

  • ccasionally contradicting drives

Each drive is represented by a dynamically abstracted and adjusted Semi-Markov Decision Process

DFG 1183 ORGANIC COMPUTING

3

September 16, 2011

controller

SMDP SMDP SMDP

  • bserver

input

DEC

decision

BC

behavior construction

LTM

long term memory

EXPL

exploration

ACT

action capabilities

EV

evaluation

EM

episode memory

  • utput

COORD

goal coordination

Coordinating multiple goals

  • f a single robot, e.g.:

1. battery loading 2. collecting items 3. transporting items to base

well-being region current motivation vector

  • riginal

abstracted

slide-4
SLIDE 4

ESLAS Project Phase III – Brief Recap

Goal coordination (COORD)

  • keeps track of states spaces
  • efficiently selects a robot’s actions

based on SMDP in the presence of dynamically prioritized goals Goal selection mechanism:

  • cumulative weighted reward of two

drives

  • detects a worthwhile detour in the

state space for one additional goal

  • acceptable runtime compared to

considering all possible sequences

DFG 1183 ORGANIC COMPUTING

4

September 16, 2011

controller

SMDP SMDP SMDP

  • bserver

input

DEC

decision

BC

behavior construction

LTM

long term memory

EXPL

exploration

ACT

action capabilities

EV

evaluation

EM

episode memory

  • utput

COORD

goal coordination

Coordinating multiple goals

  • f a single robot, e.g.:

1. battery loading 2. collecting items 3. transporting items to base

slide-5
SLIDE 5

Real World Evaluation

  • shift investigations from simulation to the real physical world

with all its dynamics

  • provide a demonstrative scenario

1. sophisticated investigations 2. appealing for audience

DFG 1183 ORGANIC COMPUTING

5

September 16, 2011

Bin with weight Items Boundary Robot

slide-6
SLIDE 6

Real World Evaluation

Integrating the ESLAS approach Learning: each robot has to individually learn proper strategies to maximize its score Imitation: each robot gathers additional learning samples by

  • bserving, understanding and incorporating

the behaviour of other robots Coordination: dynamically changing goals, such as defending the

  • wn items, gathering new items or loading the battery,

have to be coordinated by each robot Cooperation: team cooperation in a non-obtrusive manner, based on

  • bserving and understanding

September 16, 2011 DFG 1183 ORGANIC COMPUTING

6

slide-7
SLIDE 7

Real World Evaluation

DFG 1183 ORGANIC COMPUTING

7

September 16, 2011

Different types of robots with different capabilities for heterogeneity BeBot

(developed @ HNI)

Rovio

(commercial)

Spykee

(commercial)

slide-8
SLIDE 8

Real World Evaluation

September 16, 2011 DFG 1183 ORGANIC COMPUTING

8

Requirements:

  • overall view of the entire environment for debugging and

localization

  • robust localization of the robots, independent of the

robots’ capabilities (sensors)

  • scalability with respect to the scenario area as well as

computational power

  • scalability with respect to the degree of heterogeneity of

the applied robots

slide-9
SLIDE 9

Global View of the Entire Environment

September 16, 2011 DFG 1183 ORGANIC COMPUTING

9

  • eight cameras, supervising

an area with a total size of 665 cm x 607 cm

  • all eight areas overlap by

39 cm to guarantee a continuous tracking of robots

  • coherent picture is constructed

by a stitching mechanism

  • the stitching mechanism also

merges robots that were detected in more than one frame

slide-10
SLIDE 10

Marker-based Robot Localization

September 16, 2011 DFG 1183 ORGANIC COMPUTING

10 10

Realized by artificial landmarks that are attached to the top of the robots and detected by the external cameras

  • 1. color segmentation for extracting

regions of similar colors

  • 2. assign regions to pre-defined

color classes

  • 3. marker detection algorithm

based on heuristics

  • 4. translation into field

coordination system

slide-11
SLIDE 11

Subjective Perspective of a Robot

September 16, 2011 DFG 1183 ORGANIC COMPUTING

11 11

  • each robot has to individually perceive its actual

environment

  • focus on vision based data
  • computational power not sufficient to do image

processing on every robot

  • a proxy node provides the camera image of an applied

robot

  • by providing it to all interested clients, the network load

is minimized

slide-12
SLIDE 12

Scalable Structure

September 16, 2011 DFG 1183 ORGANIC COMPUTING

12 12

Software

  • distributed software architecture in terms of loosely

coupled nodes

  • communication via TCP/IP (across processes)

Hardware

slide-13
SLIDE 13

Deploying the system

September 16, 2011 DFG 1183 ORGANIC COMPUTING

13 13

Access and Usage Decentralized user management:

  • 1. passive access level (monitor experiments)
  • 2. active access level

(conduct experiments) A control node realizes the connection between robots, node architecture and user clients

Robot 1 Control Client Robot N

s_1 s_N s_1 … s_N, c_N s_1 … s_N, c_1 c_1 … c_N s_1 … s_N s_x: state of robot x c_x: control command for robot x

slide-14
SLIDE 14

Deploying the system

September 16, 2011 DFG 1183 ORGANIC COMPUTING

14 14

active access (standalone) passive access (webpage) Clients

slide-15
SLIDE 15

R3PB Test Bed

September 16, 2011 DFG 1183 ORGANIC COMPUTING

15 15

Remote Real Robots at the University of Paderborn

  • test bed for conducting experiments with mobile robots
  • enables students and researchers to control, program

and monitor groups of mobile robots

  • camera based tracking system for locating robots and

supervising the entire area

  • software system consists of loosely coupled,

distributed nodes

  • scalable infrastructure, which can be easily extended
slide-16
SLIDE 16

Summary

  • realized a controlled real-world environment for

conducting experiments under realistic conditions

  • the scenario is highly descriptive and easy to

understand on the one hand, and allows for sophisticated investigations on the other hand

  • ongoing: investigation and demonstration of the

Organic Computing principles provided by ESLAS in a real world scenario

September 2010 DFG 1183 ORGANIC COMPUTING

16 16

slide-17
SLIDE 17

Thank you for your attention!

DFG 1183 ORGANIC COMPUTING

17 17

September 16, 2011