Interactions sur le fonctionnement dans les systmes multi-agents - - PowerPoint PPT Presentation

interactions sur le fonctionnement dans les syst mes
SMART_READER_LITE
LIVE PREVIEW

Interactions sur le fonctionnement dans les systmes multi-agents - - PowerPoint PPT Presentation

Interactions sur le fonctionnement dans les systmes multi-agents ouverts et htrognes Interactions about Actions in Open and Heterogenous Multi-Agent Systems Soutenance d'Habilitation Diriger des Recherches Nicolas Sabouret Lundi


slide-1
SLIDE 1

1/47

Interactions sur le fonctionnement dans les systèmes multi-agents

  • uverts et hétérogènes

Soutenance d'Habilitation à Diriger des Recherches

Nicolas Sabouret

Lundi 20 novembre 2009

Interactions about Actions in Open and Heterogenous Multi-Agent Systems

slide-2
SLIDE 2

2/47

Agents that can understand what they are doing

  • What they can do
  • How and Why
  • When
  • etc

Explainations

Symbolic AI reasoning

Introspection

Problematics

Real World situations (ex: Ambient Computing)

Open & Heterogeneous Multi-Agent Systems in

slide-3
SLIDE 3

3/47

Problematics (cont.)

 Distributed

 System behaviour ← entities + interactions  Need to combine functionalities

 Open

Services can (dis)appear at runtime

 Loosely coupled

→ no a priori information about others

 Heterogeneous

 Inconsistent models for data & actions  Agent interactions and Human-Agent interactions

slide-4
SLIDE 4

4/47

Two problems

Discovery & Composition

Explicit goal → dynamic choregraphy Implicit goal → learning interactions

Service composition

Very simple problems often turn out very difficult to solve...

Management of semantic heterogeneity

Incompatible representations → dynamic semantic interpretation

Introspection!

slide-5
SLIDE 5

5/47

Outline

 Related work in…

 Service composition  Semantic heterogeneity  Reinforcement learning & interactions

 The VDL model  Service composition  Learning interactions  Semantic heterogeneity  Conclusion & future work

slide-6
SLIDE 6

6/47

Related work

Introspection Service composition Reinforcement learning & Interactions Semantic Heterogeneity

Open & Heterogenous MAS

slide-7
SLIDE 7

7/47

Service composition

Service Composition

Orchestration Planing Coalition formation Ontologies

  • f Services

Choreography

[Peltz, 03] → service orchestration & choreography [OWL-S, 04] [WSDL, 03] [Moreau, 08] → syntactic service orchestration [Durfee, 01] → task-oriented [Shehory, 99] [Aknine, 02] [Müller, 06] → workflow description [Ermolayev, 03] → goal description

Multi-Agent coordination Service Oriented Architectures

[Traversore, 04] → planing on service ontology [Wu, 03] → H TaskNets

Negociation protocols

[Paurobally, 05]

slide-8
SLIDE 8

8/47

Service composition

Reasoning

Service description

Service composition

Tasks decomposition

Choreography (static) Orchestration

slide-9
SLIDE 9

9/47

Service composition

 Existing work

 A priori task decomposition  A priori known set of possible actions

→ static service choreography

 Open MAS

→ dynamic service choerography

 Discover tasks at runtime

→ instrospection → interaction model

slide-10
SLIDE 10

10/47

Related work

Introspection Service composition Reinforcement learning & Interactions Semantic Heterogeneity

Open & Heterogenous MAS

slide-11
SLIDE 11

11/47

Semantic Heterogeneity

Semantic Heterogeneity

Ontology engineering KR model Ontology alignment

[Laera, 07] → MAS protocol for

  • nto alignment

Thesaurus [WN, 98] Semantic Networks Ontologies [OWL, 04] Structure-based Instance-based Reference

  • ntology

Semantic negociation [Morge, 07] [Breitman, 05] [Ichise, 03] [van Diggelen, 06] (Anemone) [Aleksowski, 06] [Valencia, 04]

slide-12
SLIDE 12

12/47

Semantic Heterogeneity

 Reference ontology

→ concept anchoring

 Semantic negociation

→ dynamic alignment

 Open & loosely coupled MAS

→ impossible or incomplete alignments

 Dynamic understanding of concepts

→ Introspection → Interaction protocol

slide-13
SLIDE 13

13/47

Related work

Introspection Service composition Reinforcement learning & Interactions Semantic Heterogeneity

Open & Heterogenous MAS

slide-14
SLIDE 14

14/47

Learning & Interactions

 Interaction protocols for learning

Data exchange → learning acceleration

 Open MAS

→ Learning interactions

 Learning when to interact

[Melo & Veloso, 08]

 Learning what to interact

[Kasai & al., 08]

? Open MAS

slide-15
SLIDE 15

15/47

Learning & Interactions

MDPs POMDPs Memory [Dutech, 03]

Multi-Agent Systems Reinforcement Learning

SMDPs Asynchronism Other agents Delegation

 Asynchronous & open

→ Memory → Introspection → Interaction protocols

slide-16
SLIDE 16

16/47

Introspection & Interaction models for reasoning about actions in

  • pen & heterogeneous

MAS

slide-17
SLIDE 17

17/47

Agent & Interaction Model

Service composition Learning Interactions Semantic Heterogeneity

Introspection & MAS Interactions for...

slide-18
SLIDE 18

18/47

Architecture

Language Layer Interaction Layer

View Design Language Capacities Softbofy Preconditions & effects Introspection

  • Query

→ softbody

  • Request

→ events

  • Others

→ questions about actions! Anchoring

Agent Ontology Interaction model

Cognitive Layer

Planing, learning, decision taking...

Interaction control Runtime control Observers

slide-19
SLIDE 19

19/47

The VDL model

 XML tree rewriting

[Gurevich, 95]

 Data

v(val) → softbody

 Ontology

(Concepts x Relations)

 typeof and includes

→ IC(c) [Seco, 04]

 Other relations

→ p(R)

slide-20
SLIDE 20

20/47

The VDL model (2)

 Actions

 Preconditions – effets

 Effects on data

→ v(newval)

 Message sending

→ <snd,perf(rcv,ct)>

 Preconditions

 Events: evt(x1(val1),...,xn(valn))  Event patterns

→ evt(x1,...xn)

 Boolean preconditions

→ vars(p)

 Context  Context-Structure  Structure

slide-21
SLIDE 21

21/47

Generative bottom-up

 Capacities = acceptable events

→ Precondition evaluation

 evale(p,evt) → true iff p∈Ps∪Pc

s is true under evt

 evalc(p) → true iff p∈Pc is true

 VDL code introspection (using precondition and data structure)

→ generation of all syntactically possible events

→ Set of possible events E → Set of currently impossible events F

np(e) = set of failed preconditions

∀ p∈Ps∪P cs ,eval e p ,e=true ∀ p∈Pc evalc p=true ∃ p∈Pcs ,evale p ,e= false∨∃ p∈ Pcevalc p= false

slide-22
SLIDE 22

22/47

VDL interaction model

Sender: AID Receivers: AIDs Performative Content Conv-id Message-id

FIPA-ACL based

<snd,p(rcv,c)>

snd rcv

 Specific performatives

 query, inform, unknown  request, agree  impossible, assert-cannot  assert-can, clarify, suggest  what-can  query-contraint  not-understood, error

slide-23
SLIDE 23

23/47

Interaction model (cont.)

Agt1 Agt2

query(v) inform(v=val)

ALT

unknown(v)  Query & al.

Generalisation:

query-constraint(X,C) → set of variables → inform({vi=vali})

 Request & al.

Agt1 Agt2

request(e) agree

ALT

impossible(np(e)) assert-cannot(e) assert-can(e'∈F) clarify(E)

slide-24
SLIDE 24

24/47

Service composition Learning Interactions Semantic Heterogeneity

Introspection & MAS Interactions for...

slide-25
SLIDE 25

25/47

Service choreography

 Initial request

 Service discovery  Dynamic choreography  Final answer → initiator agent

Yasmine Charif (2004-2007)

2 1 3 4

slide-26
SLIDE 26

26/47

Service choreography

 Initiator - participants  Delegation to all participants

request → assert-can query-constraint → query

→ trigger sub-conversations

 Waiting for answers  Convergence in EXPTIME

→ timeouts

→ Management of sub-conversations

Message history

<id,m0,M,R>

VDL ?

slide-27
SLIDE 27

27/47

Protocols

init part

query-constraint inform

ALT

unknown

OPT

query init part

request assert-can

ALT

agree

OPT

query assert-can * part1 part2

query inform

ALT

unknown

n k m kmn

part1 part2

assert-can inform

OPT

query OR Agent

inform

  • r

unknown

history

answer to m0 ?

query-constraint request assert-can

[IAT, 07]

slide-28
SLIDE 28

28/47

Example

 Implemented in Java on the VDL platform (2006)

[RIA, 08]

slide-29
SLIDE 29

29/47

Service composition Learning Interactions Semantic Heterogeneity

Introspection & MAS Interactions for...

slide-30
SLIDE 30

30/47

Learning interactions

 Goal → reward function  Problems:

 Asynchronous → learn to wait  Non-observable → POMDPs  Delegation (request) → Memory

 Limited to…

 1 learning agent  Performatives query & request

Shirley Hoet (2008-?)

Internal action Send message Wait Acquire requests Acquire queries

Q-table Memory

Environment

reward action Lastest requests

  • r query-results

Temperature

slide-31
SLIDE 31

31/47

Learning interactions

 Acquiring requests  Acquiring queries

Agt1 Agt2

request impossible query

add(query)

vars  p, p∈NP Agt1 Agt2

what-can suggest request

add(request)

E

+ timeouts + timeouts

slide-32
SLIDE 32

32/47

Learning interactions

 Memory

 State + latest request(s) or query-result(s)

[McCallum, 96]

 Iterative construction memory

→ Only some states are provided with a memory

s1: a1>a2 s4: a4>a1 s2: a3>a1>a4

0 slot memory 1 slot memory 2 slot memory etc

s1: a2>a3 s4: a4>a1 s2: a3>a1>a4 a1 s1: a1>a2 a2 s1: a2>a3 s4: a1>a3 s2: a3>a1>a4 a1,a2 s1: a1>a2 a2 a1,a1 s1: a1>a2 a4

slide-33
SLIDE 33

33/47

Algorithm

rand W 〈 snd , what-candest ,∅〉 evt answer ∈? A

adjust W

At each step

rand W  proba= e

Q s, a/T

∑b∈A e

Qs ,a/T

OR send message query OR send message request OR perform action store answer store action adjust Q(s,a)

ambs=wait s1 3rang s [ups]rang s[ 1

∣As∣∑a∈As qa]rang s

−1[qa1−qa2]

N cycles

Add memory to k most ambiguous states:

[MFI, 09]

slide-34
SLIDE 34

34/47

Preliminary experimentations

 Asynchronous learning of commands (requests)

(2008)

Learner agent

Explorer agent (twice slower)

commands No memory 1 slot memory 2 slots memory → no progress

slide-35
SLIDE 35

35/47

Preliminary experimentations

 Learning of interactions (requests & queries)

(2009)

Learner agent

random state change (depending on heater) heater

  • ff/low/high (requet)

stir/remove (request) / observe (query) more → no improvement 1 slot memory 0 slot memory no query

slide-36
SLIDE 36

36/47

Service composition Learning Interactions Semantic Heterogeneity

Introspection & MAS interactions for...

slide-37
SLIDE 37

37/47

Semantic heterogeneity

 Incomplete alignment

→ agent-agent interactions → human-agent interactions (ordinary users)

 Limited to requests  Architecture:

Laurent Mazuel (2005-2008)

OpenNLP WordNet Alignment Human user Agent event

VDL

  • ntology

code & context capacities generation capacities selection answer manager semantic relatedness measure

slide-38
SLIDE 38

38/47

Semantic relatedness measure

∑x ,r , y∈spc , c'  wx , y× pr 

pr× ∣pathrc ,c' ∣

∣pathrc ,c' ∣1

∑ p∈T min pathc , c ' W  p

For typeof/includes: ∣ICc−IC c ' ∣

Generalization to other Unique Type Pathes

Semantic similarity measure [Jiang & Conrath, 98] Patterns of valid pathes [Hirst & StOnge, 98]

min { p∈c , c '∨hso p=true }W  p

[ISWC, 08]

slide-39
SLIDE 39

39/47

Capacities scoring

appe req,ecap=Q ereq× max S∈Creq ,C cap∑cr , cc∈S relcr ,cc

∣Creq∣

capacities generation capacities selection answer manager semantic relatedness measure

 Concepts anchoring

Distance between clouds of concepts

→ Capacity scoring

evt(c1(val1),...cn(valn)) External event (aligned) er e

q

Internal capacity ec

a p

evt(c1(val1),...cn(valn)) Set of possible couples (filtered using the VDL structure) Quality of alignement or NL analysis

slide-40
SLIDE 40

40/47

Answer selection

E reqrcv ={ecap∈E rcv∨ pE−appereq ,e cap } F reqrcv={e cap∈F rcv∨ pF−appereq ,ecap}

 Build the set of best capacities  Two thresholds [Maes, 94]

[WIAS, 08]

slide-41
SLIDE 41

41/47

Example

 Cube-world based

 Two agents, shared world, 2 representations  Impossible/incomplete alignement

Take red polygon

slide-42
SLIDE 42

42/47

Example (cont.)

 Implemented on the VDL platform in 2007

slide-43
SLIDE 43

43/47

Conclusion & Prospects

slide-44
SLIDE 44

44/47

Conclusion

 Reasoning about actions and interactions

 Agent-Agent interactions  Human-Agent interactions

 Instrospection of agents' capacities

 Service composition  Learning interactions  Semantic heterogeneity

 Openness, heterogeneity, loosely couple,

distribution

slide-45
SLIDE 45

45/47

Future work

 Composition vs Semantic heterogeneity

 Message not understood → 2 possible methods  Heuristics to choose?

 Learning interactions

 Discover data unseen by request-impossible  New memory structure  Semantic interpretation

→ heuristics for relevant data/actions

slide-46
SLIDE 46

46/47

Future work

 Extend the current model

 Service composition with advanced constraints  Semantic heterogeneity for other performatives  Generalisation of learned behaviours

 Reasoning about time

 Past and future interactions  Other performatives

 Environment (Eric Platon)

 Unknown environment  Indirect interactions in the composition process

 Communicate about unknown actions and data

→ learning new behaviours!

slide-47
SLIDE 47

47/47

Thank you!

Eric Yasmine Laurent Shirley 2011