RoboCup Multiagent Systems Daniel Polani Adaptive Systems Research - - PowerPoint PPT Presentation

robocup multiagent systems
SMART_READER_LITE
LIVE PREVIEW

RoboCup Multiagent Systems Daniel Polani Adaptive Systems Research - - PowerPoint PPT Presentation

RoboCup Multiagent Systems Daniel Polani Adaptive Systems Research Group School of Computer Science University of Hertfordshire UK August 2, 2013 Daniel Polani RoboCup Multiagent Systems Thanks! Sven Magg Wong J urgen Perl


slide-1
SLIDE 1

RoboCup — Multiagent Systems

Daniel Polani

Adaptive Systems Research Group School of Computer Science University of Hertfordshire UK

August 2, 2013

Daniel Polani RoboCup — Multiagent Systems

slide-2
SLIDE 2

Thanks!

Gliders Mikhail Prokopenko Oliver Obst HELIOS Hidehisa Akiyama Bold Hearts Sander van Dijk Drew Noakes Ismael Duque- Garcia Nicole Hendrick- son Daniel Barry Oliver Old- ing Alex Metaxas Valerio Lattarulo Sven Magg Jamie Hurst Julian Zoellner Peter Snow Vighnesh Pindoria Steve Hunt Michael Snelling Jenna Gar- ner Jayasudha Selvaraj Parham Haghigi- Rad Chin Foo Wong Qiming Shen Chaohua Zhu Santiago Franco Baltic L¨ ubeck Thomas Martinetz Martin Haker Andr´ e Meyer Behboud Kalantary Jan Balster Kord Eick- meyer Tobias Kochems Nima Mader- shahian Jan Hendrik Sauselin

Mainz Rolling Brains

Christian Bauer Michael Junges Volker Haas Marc Hell- wig Ulf Krebs Oliver Labs Mathias Maul Roman Pelek Jens Scheid Beate Starck Thomas Uthmann J¨ urgen Perl Michael W¨ unstel Christian Meyer Erich Kutschinski Axel Arnold G¨

  • tz

Schwandt- ner Manuel Gauer Birgit Schappel Tobias Hummrich Sebastian Oehm Frank Schulz Ralf Schmitt Peter Dauscher Tobias Jung Achim Liese Michael Hawlitzki Peter Faiß and the International RoboCup Community

Daniel Polani RoboCup — Multiagent Systems

slide-3
SLIDE 3

Part I What is an Agent?

Daniel Polani RoboCup — Multiagent Systems

slide-4
SLIDE 4

What is an Agent? I

One Agent and a World

. . . Wt−3

  • Wt−2
  • Wt−1
  • Wt
  • Wt+1
  • Wt+2. . .

St−3

  • At−3
  • St−2
  • At−2
  • St−1
  • At−1
  • St
  • At
  • St+1
  • At+1
  • . . . Mt−3
  • Mt−2
  • Mt−1
  • Mt
  • Mt+1. . .
  • Daniel Polani

RoboCup — Multiagent Systems

slide-5
SLIDE 5

What is an Agent? II

Agent with World (and Other Agent)

. . . M′

t−3

  • M′

t−2

  • M′

t−1

  • M′

t

  • M′

t+1. . .

  • S′

t−3

  • A′

t−3

  • S′

t−2

  • A′

t−2

  • S′

t−1

  • A′

t−1

  • S′

t

  • A′

t

  • S′

t+1

  • A′

t+1

  • . . . Wt−3
  • Wt−2
  • Wt−1
  • Wt
  • Wt+1
  • Wt+2. . .

St−3

  • At−3
  • St−2
  • At−2
  • St−1
  • At−1
  • St
  • At
  • St+1
  • At+1
  • . . . Mt−3
  • Mt−2
  • Mt−1
  • Mt
  • Mt+1. . .
  • Daniel Polani

RoboCup — Multiagent Systems

slide-6
SLIDE 6

What is an Agent? III

Initial Observations Purely Passive World: a passive world has a dynamics runs according to fixed dynamics “reacts” to agent’s actions World with Active Agent: strictly spoken, world with agent has dynamics however, dynamics of these agents looks like dictated by a “purpose”

Daniel Polani RoboCup — Multiagent Systems

slide-7
SLIDE 7

Braitenberg Vehicles

[Braitenberg, 1984]

Purposeful Behaviour fleeing the light

Daniel Polani RoboCup — Multiagent Systems

slide-8
SLIDE 8

Braitenberg Vehicles

[Braitenberg, 1984]

Purposeful Behaviour through Simple Dynamics fleeing the light seeking the light

Daniel Polani RoboCup — Multiagent Systems

slide-9
SLIDE 9

Braitenberg Vehicles

[Braitenberg, 1984]

Purposeful Behaviour through Simple Dynamics fleeing the light seeking the light

Daniel Polani RoboCup — Multiagent Systems

slide-10
SLIDE 10

Braitenberg Vehicles

[Braitenberg, 1984]

Purposeful Behaviour through Simple Dynamics fleeing the light seeking the light

Daniel Polani RoboCup — Multiagent Systems

slide-11
SLIDE 11

Notes

Passive Objects and Agents not always distinguishable sometimes by virtue of “camouflage” sometimes by simple lack of ability

Daniel Polani RoboCup — Multiagent Systems

slide-12
SLIDE 12

Notes

Passive Objects and Agents not always distinguishable sometimes by virtue of “camouflage” sometimes by simple lack of ability Do not attribute to malice what is equally explained by incompetence. Napoleon The “Pizza Tower” Lesson

Daniel Polani RoboCup — Multiagent Systems

slide-13
SLIDE 13

Notes

Passive Objects and Agents not always distinguishable sometimes by virtue of “camouflage” sometimes by simple lack of ability Do not attribute to malice what is equally explained by incompetence. Napoleon The “Pizza Tower” Lesson Are those agents standing around waiting to spring a trap?

Daniel Polani RoboCup — Multiagent Systems

slide-14
SLIDE 14

Notes

Passive Objects and Agents not always distinguishable sometimes by virtue of “camouflage” sometimes by simple lack of ability Do not attribute to malice what is equally explained by incompetence. Napoleon The “Pizza Tower” Lesson Are those agents standing around waiting to spring a trap

  • r are they just lost?

Daniel Polani RoboCup — Multiagent Systems

slide-15
SLIDE 15

Recap

World with Another Active Agent world with agent has dynamics looking like dictated by a “purpose” may or may be not consistent with one’s own “purpose”

Daniel Polani RoboCup — Multiagent Systems

slide-16
SLIDE 16

Mottos of Edification and Purpose

Goldfinger’s Motto

1 Once is happenstance. 2 Twice is bad luck. 3 Three times is enemy action Daniel Polani RoboCup — Multiagent Systems

slide-17
SLIDE 17

Mottos of Edification and Purpose

Goldfinger’s Motto

1 Once is happenstance. 2 Twice is bad luck. 3 Three times is enemy action

“Kafka’s Motto” The fact that you are paranoid does not mean they are not after you.

Daniel Polani RoboCup — Multiagent Systems

slide-18
SLIDE 18

Slightly More Formal: Single Agents

Properties single entity controls decisions single mind single goal external world may be noisy challenge: “optimal” ways of coping with external dynamics constraints and noise

Daniel Polani RoboCup — Multiagent Systems

slide-19
SLIDE 19

Transition to Multiagent Systems

Agents “interests” shared goals antagonisms Motto multiple agents have inconsistent/conflicting agenda but even if consistent agenda, multiple brains crisscross interaction

Daniel Polani RoboCup — Multiagent Systems

slide-20
SLIDE 20

Types of Scenarios

Classification single agent 2-agent multiagent cooperative antagonistic something in-between (real life, economy)

Daniel Polani RoboCup — Multiagent Systems

slide-21
SLIDE 21

Multiagent Systems

In General multiagent (> 2)-systems can produce intricate strategy balances even fully antagonistic scenarios can be temporarily cooperative rich set of strategies, even for simple agents/dynamics

Daniel Polani RoboCup — Multiagent Systems

slide-22
SLIDE 22

Introductory Example: Ant Colony Scenario

[Polani and Uthmann, 1998]

Scenario competition between ant colonies feeding transporting food signaling fighting Variations

1 XRaptor (1997–) 2 Google AI

Challenge (2011)

Daniel Polani RoboCup — Multiagent Systems

slide-23
SLIDE 23

RoboCup as Multiagent System

Notes comparatively “simple” case clear cooperation/antagonism structure We will now visit the different levels of multiagenthood

Daniel Polani RoboCup — Multiagent Systems

slide-24
SLIDE 24

Part II Behaviour Analysis

Daniel Polani RoboCup — Multiagent Systems

slide-25
SLIDE 25

Motivation

Analysis

  • f processes
  • f agent behaviors
  • f multi-agent systems
  • f RoboCup

Goal automated analysis behavior-based (no internal knowledge) state-space trajectories analysis of:

“micro”-behavior of a single player player-ball interaction

Daniel Polani RoboCup — Multiagent Systems

slide-26
SLIDE 26

Self-Organizing Maps for Analysis

[W¨ unstel et al., 2001]

What are SOMs? Properties high-to-low dimension mapping clustering topology preservation sequence detection and identification

Daniel Polani RoboCup — Multiagent Systems

slide-27
SLIDE 27

Trajectory Representation

Steps SOM Representation: vector space metrics Task: transform trajectory to a SOM representation Problem: space of complete trajectories too large Solution: consider trajectory slices

Daniel Polani RoboCup — Multiagent Systems

slide-28
SLIDE 28

Spatially Focused Representation

pt−1 pt     ut−1 ut ut+1 . . .     ut = ∆pt−1

SOM Training RoboCup game yields sequence of positions conversion to u representation giving vector space with Euclidean distance

Daniel Polani RoboCup — Multiagent Systems

slide-29
SLIDE 29

Results SFR

III I II IV V VI VII III I II IV V VI VII

I V II VI IV III VII

CMU 1999 MRB 1999 Daniel Polani RoboCup — Multiagent Systems

slide-30
SLIDE 30

Enhanced SFR (ESFR)

pplayert−1         uplayert−1 uballt uplayert uballt+1 uplayert+1 . . .         uballt = ∆pballt−1 uplayert−1 pballt−1 pballt

Daniel Polani RoboCup — Multiagent Systems

slide-31
SLIDE 31

Results ESFR

I II III IV V VI VII VIII I II III IV V VI VII VIII

VII VI I VIII III II IV V MRB 1999 CMU 1999

I pass to right side II pass forward III pass backward IV pass to left side V near-ball game VI Dribbling VII Dribbling VIII Dribbling

Daniel Polani RoboCup — Multiagent Systems

slide-32
SLIDE 32

Results ESFR II (Details)

Daniel Polani RoboCup — Multiagent Systems

slide-33
SLIDE 33

Results ESFR III (Details)

Daniel Polani RoboCup — Multiagent Systems

slide-34
SLIDE 34

Intermediate Bottom Line

Observations analysis of micro-behavior by SOMs trajectory characteristics made visible and transparent implicit representations usefulness for particularly for reactive analysis More to do higher level analysis of trajectories semantic analysis

Daniel Polani RoboCup — Multiagent Systems

slide-35
SLIDE 35

Part III Perception, Prediction and (Antagonistic) Action

Daniel Polani RoboCup — Multiagent Systems

slide-36
SLIDE 36

World Model

agent control communication world model actions raw data filtered data

sensor values filtered via world model consistent view of past and future match between assumptions and observations to identify present

Daniel Polani RoboCup — Multiagent Systems

slide-37
SLIDE 37

Ball Position Filtering

[Haker et al., 2002]

Simulator state sensor data are noisified and quantized Filtering improvement of state information by

additional evidence

  • bject movement

related to particle filtering

Daniel Polani RoboCup — Multiagent Systems

slide-38
SLIDE 38

Ball Position Filtering II

x-axis 1 2 v max

x

vx-axis

  • bservation

Daniel Polani RoboCup — Multiagent Systems

slide-39
SLIDE 39

Ball Position Filtering II

x-axis 1 2 v max

x

vx-axis

  • bservation

However

  • bserving another agent

introduces significantly more variation and unpredictability in fact: try to be as unpredictable as possible!

Daniel Polani RoboCup — Multiagent Systems

slide-40
SLIDE 40

Example: Optimal Goal Scoring

[Kok et al., 2002]

Task simplest example of an antagonistic RoboCup problem contains all basic ingredients relevant to the RoboCup scenario Observations/Assumptions ball shot in straight direction will deviate by Gaussian with deviation σ(d) after travelling d

l l

p

) !3"#( y y

2 1

Daniel Polani RoboCup — Multiagent Systems

slide-41
SLIDE 41

Example: Optimal Goal Scoring II

[Kok et al., 2002]

Observations probability of hitting goal can be computed via probability of missing it left and right

) 3"#(

p

l

l

3"#(ll )

r

lr d

l r

d

l

Daniel Polani RoboCup — Multiagent Systems

slide-42
SLIDE 42

Goal Scoring

Scoring Success use given goal keeper for generating tests classification problem:

given player/goalie positions determine class (interception or not)

record experiments of interception

Daniel Polani RoboCup — Multiagent Systems

slide-43
SLIDE 43

Ball Interception

parametrization: angle goalie/shooting point and distance player/goalie

4 6 8 10 12 14 10 20 30 40 50 60 70 80 distance player−goalie angle player sees goalie−shooting point not passed passed −2 −1.5 −1 −0.5 0.5 1 1.5 2 2.5 50 100 150 200 250 300 350 passed −2 −1.5 −1 −0.5 0.5 1 1.5 2 2.5 50 100 150 200 250 300 not passed −2 −1.5 −1 −0.5 0.5 1 1.5 2 2.5 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 not passed (normalized) passed (normalized) −2 −1.5 −1 −0.5 0.5 1 1.5 2 2.5 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 1−d feature probabiliy of passing the goalie Bayes sigmoid

Daniel Polani RoboCup — Multiagent Systems

slide-44
SLIDE 44

Goal Score Probability

Consider goal hitting and interception are independent unprotected versus well-defended goal

−10 −8 −6 −4 −2 2 4 6 8 10 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 y−coordinate of shooting point probability

  • prob. to pass goalkeeper
  • prob. ball enters goal
  • prob. for scoring

−10 −8 −6 −4 −2 2 4 6 8 10 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 y−coordinate of shooting point probability

  • prob. to pass goalkeeper
  • prob. ball enters goal
  • prob. for scoring

Daniel Polani RoboCup — Multiagent Systems

slide-45
SLIDE 45

Part IV Multiagent Strategies

Daniel Polani RoboCup — Multiagent Systems

slide-46
SLIDE 46

Some General Principles

[Almeida et al., 2010]

Challenges simultaneous multimodal information: difficult to process unpredictable environment unreliable message reception low bandwidth limits conveyance of meaningful knowledge in messages uncertainty in perceived world information may lead to conflicting/inconsistent behaviours

[Penders, 2001] Daniel Polani RoboCup — Multiagent Systems

slide-47
SLIDE 47

Concrete Problems

[Almeida et al., 2010]

Perception Where, when and how to use vision? Whom to listen to? How to estimate information of others? Communication What, when and how to exchange information? How to use exchanged information? Action Which action of player is best for the team? How to evaluate different types of actions (e.g. pass vs dribble)? How to execute a given elementary (e.g. kick) or compound action (e.g. dribble)?

Daniel Polani RoboCup — Multiagent Systems

slide-48
SLIDE 48

Coordination

[Almeida et al., 2010]

Types Ball-centered: react to ball velocity changes (e.g. after kick) Active: consider target location of desired action (e.g. a pass to perform) Strategic: consider strategic location (e.g. find open space for pass) Global: locker-room agreements

[Stone, 2000]

Time Range Approach Usage Scope

  • Inf. Validity Period

ball-centered individual short active individual or collective short to medium strategic collective medium to long

Daniel Polani RoboCup — Multiagent Systems

slide-49
SLIDE 49

Part V Meditation: Limits on Cooperation

Daniel Polani RoboCup — Multiagent Systems

slide-50
SLIDE 50

Principled Limits of Multiagent Coordination

[Harder et al., 2010]

Question What’s the best two agents can do in terms of coordination? How does it compare to “two agents with one brain”?

Daniel Polani RoboCup — Multiagent Systems

slide-51
SLIDE 51

Principled Limits of Multiagent Coordination

[Harder et al., 2010]

Question What’s the best two agents can do in terms of coordination? How does it compare to “two agents with one brain”? Separate Action Selection

) A(1)

t

St St+1 A(2)

t

Shared Action Selection

) A St St+1

Daniel Polani RoboCup — Multiagent Systems

slide-52
SLIDE 52

Two Agents: One Goal

Prototypical Scenario

Daniel Polani RoboCup — Multiagent Systems

slide-53
SLIDE 53

Utility vs. Relevant Information

  • 25
  • 20
  • 15
  • 10
  • 5

0.5 1 1.5 2 2.5 3 E[U] I(A; S) - 1 × 6 Field

Daniel Polani RoboCup — Multiagent Systems

slide-54
SLIDE 54

Shared vs. Individual Controllers

Individual Controllers

0.2 0.4 0.6 0.8 1 0.5 1 1.5 2 2.5 3 I(A(1); A(2)) I(A; S)

Shared Controllers

0.2 0.4 0.6 0.8 1 0.5 1 1.5 2 2.5 3 I(A(1); A(2)), I(A(1); A(2)|S) I(A; S)

Bottom Line coordination I(A(1); A(2)) distinguished by intrinsic coordination I(A(1); A(2)|S) vs. coordination via environment

Daniel Polani RoboCup — Multiagent Systems

slide-55
SLIDE 55

Part VI Tactics and Strategy: Case Studies

Daniel Polani RoboCup — Multiagent Systems

slide-56
SLIDE 56

Tactics and Strategy: Passing

[Lau et al., 2011]

Pass Coordination RolePasser RoleReceiver PassFlag TRYING TO PASS Align to receiver Align to Passer PassFlag READY Kick the ball PassFlag BALL PASSED Move to next position Catch ball

Daniel Polani RoboCup — Multiagent Systems

slide-57
SLIDE 57

Tactics and Strategy: Goal Defense

[Lau et al., 2011]

Goal Defense line ball—goal

  • ne player on this line, as

close as possible to ball two players near penalty area

  • ne player near ball, 45o

from above line to observe ball and report to teammates

  • ne player to oppose

progression of ball through closest side of field

Daniel Polani RoboCup — Multiagent Systems

slide-58
SLIDE 58

Optimization of Opponent Marking

[Kyrylov and Hou, 2007, Kyrylov and Hou, 2010] I

Problem Description Collaborative Defensive Positioning: multi-criteria assignment problem n defenders are assigned to m attackers each defender must mark at most one attacker each attacker must be marked by no more than one defender Pareto Optimization: improve the usefulness of the assignments simultaneously minimizing required time

to execute an action and prevent threat by an attacker

Daniel Polani RoboCup — Multiagent Systems

slide-59
SLIDE 59

Optimization of Opponent Marking

[Kyrylov and Hou, 2007, Kyrylov and Hou, 2010] II

Parameters Angular size of own goal from the opponent’s location Distance from the opponent’s location to own goal; Distance between the ball and opponent’s location

Daniel Polani RoboCup — Multiagent Systems

slide-60
SLIDE 60

Optimization of Opponent Marking

[Kyrylov and Hou, 2007, Kyrylov and Hou, 2010] III

Criticisms

[Almeida et al., 2010]

Outnumbered Defenders: should not mark specific attackers should position themselves to prevent ball/attackers’ progression towards goal’s center Outnumbered Attackers: more than one defender should mark attacker (e.g. ball

  • wner)

pursue strategy to quickly intercept the ball

  • r compel the opponent to make bad decision/lose the ball

Daniel Polani RoboCup — Multiagent Systems

slide-61
SLIDE 61

Bold Hearts Example

Formations different formations depending on game situations e.g. trying to get 2 players around ball Coordination visual goalie decides roles according to freed positions and required roles crowding rules jitter suppression:

both go, one decides reinforces decisions

Ball 1 or 2 positions fixed to the ball: supporting players field/ball equilibrium Opponent Harassment predicting opponent’s behaviour putting obstacles in

  • pponent’s plan

Passing dribble attack pass panic kick

Daniel Polani RoboCup — Multiagent Systems

slide-62
SLIDE 62

Part VII Influence

Daniel Polani RoboCup — Multiagent Systems

slide-63
SLIDE 63

Who gets the Ball?

Simplest Case both agents move immediately and with same speed

Daniel Polani RoboCup — Multiagent Systems

slide-64
SLIDE 64

Who gets the Ball?

Simplest Case both agents move immediately and with same speed

Daniel Polani RoboCup — Multiagent Systems

slide-65
SLIDE 65

Who gets the Ball?

Simplest Case both agents move immediately and with same speed

Daniel Polani RoboCup — Multiagent Systems

slide-66
SLIDE 66

Who gets the Ball?

Simplest Case both agents move immediately and with same speed Voronoi Cells/Delaunay Triangulation

[Almeida et al., 2010, Prokopenko et al., 2012, Akiyama et al., 2013] Daniel Polani RoboCup — Multiagent Systems

slide-67
SLIDE 67

Turn to the ball

Task Goal: turn to the ball and go there Assume: agent looks along x-axis turning is elementary action in 2D simulator

  • f course, not in humanoids

(not necessary in PythoCup) Ball Agent φ ∆y ∆x

Daniel Polani RoboCup — Multiagent Systems

slide-68
SLIDE 68

Getting to the Ball

Task Goal: go to the ball Assume: ball is not moving Steps

1 assume we have angle φ 2 elementary turn by φ 3 move to the ball 4 duration:

d: distance v: maximum velocity t = d/v

Daniel Polani RoboCup — Multiagent Systems

slide-69
SLIDE 69

Getting to the Ball

Task Goal: go to the ball Assume: ball is not moving Steps

1 assume we have angle φ 2 elementary turn by φ 3 move to the ball 4 duration:

d: distance v: maximum velocity t = d/v − 1

  • time for turning

Daniel Polani RoboCup — Multiagent Systems

slide-70
SLIDE 70

Getting to the Ball — Ball is Moving I

Task Goal: go to the ball Assume: ball is moving in given direction Approach movement of ball movement of agent could compute contact point directly

Daniel Polani RoboCup — Multiagent Systems

slide-71
SLIDE 71

Getting to the Ball — Ball is Moving II

Steps however, easier to do step-wise consider circle of radius dt = vplayer · t for t = 0, 1, 2, 3 . . . consider s∗

t = s0 + vball · t

for t = 0, 1, 2, 3 . . . if s∗

t ≤ dt, agent can — in

principle — catch ball at this position if agent moves in relevant direction

s0 s∗

t

Daniel Polani RoboCup — Multiagent Systems

slide-72
SLIDE 72

Getting to the Ball — Ball is Moving III

Notes allows handling of slowing-down ball allows handling of turn delay if ball fast, consider catch to fail may need to consider running after the ball, until slower

  • 2

2 4 6 8 10 12 14 16 5 10 15 20 25 30 35 40 45 50 ’ball_move.dat’

Daniel Polani RoboCup — Multiagent Systems

slide-73
SLIDE 73

Influence Regions: “Grass-Chess”

Daniel Polani RoboCup — Multiagent Systems

slide-74
SLIDE 74

Influence Regions II: “Grass-Chess”

Daniel Polani RoboCup — Multiagent Systems

slide-75
SLIDE 75

Example Insights III: “Grass-Chess”

Daniel Polani RoboCup — Multiagent Systems

slide-76
SLIDE 76

Example Insights IV: “Grass-Chess”

Daniel Polani RoboCup — Multiagent Systems

slide-77
SLIDE 77

Pass Optimization

Pass Value Iteration V (n+1)

i

=      max

j∈N(i)

  • pjV (n)

j

+ (1 − pj)V (n)

ˆ j

  • if i friend

min

j∈N(i)

  • pjV (n)

j

+ (1 − pj)V (n)

ˆ j

  • if i foe

Daniel Polani RoboCup — Multiagent Systems

slide-78
SLIDE 78

Part VIII References

Daniel Polani RoboCup — Multiagent Systems

slide-79
SLIDE 79

Akiyama, H., Nakashima, T., and Yamashita, K. (2013). Helios2013 team description paper. Team Description Paper. Almeida, F., Lau, N., and Reis, L. P. (2010). A survey on coordination methodologies for simulated robotic soccer teams. In MAS&S@Mallow ’2010 — 4th Int. Workshop on Multi-Agent Systems and Simulation (MAS&S), held at MALLOW - Multi-Agent Logics, Languages, and Organisations Federated Workshops, Lyon, France. Braitenberg, V. (1984). Vehicles: Experiments in Synthetic Psychology. MIT Press, Cambridge. Haker, M., Meyer, A., Polani, D., and Martinetz, T. (2002). A method for incorporation of new evidence to improve world state estimation.

Daniel Polani RoboCup — Multiagent Systems

slide-80
SLIDE 80

In Birk, A., Coradeschi, S., and Tadokoro, S., editors, RoboCup-2001: Robot Soccer World Cup V, Berlin. Springer. Harder, M., Polani, D., and Nehaniv, C. L. (2010). Two agents acting as one. In Proc. Artificial Life, Odense, Denmark, pages 599–606. Kok, J. R., de Boer, R., and Vlassis, N. (2002). Towards an optimal scoring policy for simulated soccer agents. In Gini, M., Shen, W., Torras, C., and Yuasa, H., editors,

  • Proc. 7th Int. Conf. on Intelligent Autonomous Systems, pages

195–198, Marina del Rey, California. IOS Press. Kyrylov, V. and Hou, E. (2007). While the ball in the digital soccer is rolling, where the non-player characters should go in a defensive situation? In Kapralos, B., Katchabaw, M., , and Rajnovich, J., editors, Future Play, pages 90–96. ACM, Toronto, Canada. Kyrylov, V. and Hou, E. (2010).

Daniel Polani RoboCup — Multiagent Systems

slide-81
SLIDE 81

Pareto-optimal collaborative defensive player positioning in simulated soccer. In Baltes, J., Lagoudakis, M., Naruse, T., and Shiry, S., editors, RoboCup 2009: Robot Soccer World Cup XIII, volume 5949 of LNAI, Berlin. Springer. Lau, N., Lopes, L. S., Corrente, G., Filipe, N., and Sequeira,

  • R. (2011).

Robot team coordination using dynamic role and positioning assignment and role based setplays. Mechatronics, 21:445–454. Penders, J. (2001). Conflict-based behaviour emergence in robot teams. In Conflicting Agents: Conflict Management in Multi-Agent Systems, Multiagent Systems, Artificial Societies, and Simulated Organizations, International Book Series, pages 169–202. Kluwer Academic Publishers, Norwell. Polani, D. and Uthmann, T. (1998).

Daniel Polani RoboCup — Multiagent Systems

slide-82
SLIDE 82

Survival strategies for ant-like agents in a competitive environment. In Wilke, C., Altmeyer, S., and Martinetz, T., editors, Proc. Third German Workshop on Artificial Life, pages 185–196. Harri Deutsch. Prokopenko, M., Obst, O., Wang, P., and Held, J. (2012). Gliders2012: Tactics with action-dependent evaluation functions. Team Description Paper. Stone, P. (2000). Layered Learning in Multiagent Systems: A Winning Approach to Robotic Soccer. MIT Press. W¨ unstel, M., Polani, D., Uthmann, T., and Perl, J. (2001). Behavior classification with self-organizing maps. In Stone, P., Balch, T., and Kraetzschmar, G., editors, RoboCup-2000: Robot Soccer World Cup IV, pages 108–118. Springer Verlag, Berlin.

Daniel Polani RoboCup — Multiagent Systems

slide-83
SLIDE 83

Winner of the RoboCup 2000 Scientific Challenge Award.

Daniel Polani RoboCup — Multiagent Systems