summary of work done in niiresearch.nii.ac.jp/il/web/10years-symposium/slides/maximec.pdf ·...
TRANSCRIPT
Summary of work done in NII
Maxime Clement
National Institute of Informatics
March 18, 2014
1 / 19
History
September 2011 - September 2013 : Master student (Paris 6).March 2013 - September 2013 : Internship student.January 2014 - April 2014 : Assistant professor.October 2014 - October 2017 : PhD student.
2 / 19
Summary
1 Main research topicsDistributed Constraint OptimizationMulti-ObjectiveDynamic
2 Past works
3 Current worksApproximation algorithms for MO-DCOPsDynamic DCOP
3 / 19
Distributed Constraint Optimization Problems
Popular framework to model multi-agent coordination problems.
Figure : distributed coordination problems
4 / 19
Distributed Constraint Optimization ProblemsExample of DCOP
X1
X2
X4X3
fij(di , dj)di dj
00
01
01
1 1 0
122
Figure : A mono-objective problem5 / 19
Distributed Constraint Optimization ProblemsExample of DCOP
X1
X2
X4X3
fij(di , dj)di dj
00
01
01
1 1 0
122
0
0 0
1
Figure : A mono-objective problem6 / 19
Distributed Constraint Optimization ProblemsExample of DCOP
X1
X2
X4X3
fij(di , dj)di dj
00
01
01
1 1 0
122
0
2
0
1
0
2 2
Figure : A mono-objective problem7 / 19
Multi-objective caseSeveral objectives to consider separately but to optimizesimultaneously.
8 / 19
Multi-Objective DCOPExample of MODCOP
X1
X2
X4X3
fij(di , dj)di dj
00
01
01
1 1 (0, 2)
(1, 0)(2, 1)(2, 1)
Figure : A multi-objective problem9 / 19
Multi-Objective DCOPExample of MODCOP
X1
X2
X4X3
fij(di , dj)di dj
00
01
01
1 1 (0, 2)
(1, 0)(2, 1)(2, 1)
0
0 0
1
Pareto front :
(2,1)
(2,1) (2,1)
(6,3)
S∗ =< {0, 1, 0, 0} >
Figure : A multi-objective problem10 / 19
Multi-Objective DCOPExample of MODCOP
X1
X2
X4X3
fij(di , dj)di dj
00
01
01
1 1 (0, 2)
(1, 0)(2, 1)(2, 1)
1
1 1
1
Pareto front :
(0, 2)
(0, 2) (0, 2)
(6,3)(0,6)
S∗ =< {0, 1, 0, 0},{1, 1, 1, 1} >
Figure : A multi-objective problem11 / 19
Multi-Objective DCOPExample of MODCOP
X1
X2
X4X3
fij(di , dj)di dj
00
01
01
1 1 (0, 2)
(1, 0)(2, 1)(2, 1)
0
1 0
1
Pareto front :
(2,1)
(0,2) (2,1)
(6,3)(0,6)(4,4)
S∗ =< {0, 1, 0, 0},{1, 1, 1, 1},{0, 1, 1, 0} >
Figure : A multi-objective problem12 / 19
Dynamic problems
Many real-life problems are dynamic, they change at runtime.
X1
X2
X4X3
X1
X2
X4X3
X1
X2
X4
Figure : Dynamic DCOP
13 / 19
Applications
DCOP :Multi-agent coordination.Sensor networks.Meeting scheduling.
MO-DCOP :Cybersecurity (privacy, cost, security).
Dynamic DCOP :Dynamic environment.
14 / 19
Dynamic MO-DCOP
Short paper at PRIMA 2013.Only the number of objectives changes.A problem in the sequence is known only once the previousone is solved (Reactive approach).Complete algorithm.
Focusing on a change of objectives still make the problem hard tosolve.
15 / 19
Dynamic MO-DCOP
Submitted to ECAI 2014.Everything can change.Reactive approach.Consider decision change cost.Adjustable parameter to limit the new cost.Approximation algorithm.
The new cost can be used to implement heuristics to find goodsolutions in a reduced runtime.
16 / 19
Approximation Algorithms for MO-DCOP
The state of the art approximation algorithm :The Bounded Multi-Objective Max-Sum Algorithm(B-MOMS).Find a solution with a guarantee on its quality.Good quality for low density graphs.
A complete MO-DCOP algorithm :The Two Phase algorithm (Medi and al, JAWS 2013).First phase uses local search to compute initial bounds onthe solutions.
The goal is to show that First phase is faster and gives bettersolutions than B-MOMS.
17 / 19
Dynamic-DCOP
Uses Dynamic Programming.Compile changes that occurred to compute the new optimalsolution.Should be very efficient for small changes.
Can be used to design an approximation algorithm whose qualityincreases overtime until reaching exactness.
18 / 19
Merci !I hope to be back soon.
19 / 19