A Decentralised Coordination Algorithm for Mobile Sensors
description
Transcript of A Decentralised Coordination Algorithm for Mobile Sensors
![Page 1: A Decentralised Coordination Algorithm for Mobile Sensors](https://reader030.fdocuments.us/reader030/viewer/2022013101/5681592a550346895dc653e0/html5/thumbnails/1.jpg)
A Decentralised Coordination Algorithm for Mobile Sensors
School of Electronics and Computer ScienceUniversity of Southampton{rs06r2, fmdf08r, acr, nrj}@ecs.soton.ac.uk
Ruben Stranders, Francesco Delle Fave, Alex Rogers, Nick Jennings
![Page 2: A Decentralised Coordination Algorithm for Mobile Sensors](https://reader030.fdocuments.us/reader030/viewer/2022013101/5681592a550346895dc653e0/html5/thumbnails/2.jpg)
2
This presentation focuses on coordinating mobile sensors for information gathering tasks
Sensor Architecture
Decentralised Control using Max-Sum
Model
Value
Coordinate
Problem Formulation
![Page 3: A Decentralised Coordination Algorithm for Mobile Sensors](https://reader030.fdocuments.us/reader030/viewer/2022013101/5681592a550346895dc653e0/html5/thumbnails/3.jpg)
The key challenge is to coordinate a team of sensors to gather information about some features of an environment
Sensors
Feature:• moving target• spatial phenomena (e.g. temperature) (previous work)
![Page 4: A Decentralised Coordination Algorithm for Mobile Sensors](https://reader030.fdocuments.us/reader030/viewer/2022013101/5681592a550346895dc653e0/html5/thumbnails/4.jpg)
We focus on two well known information gathering domains: (1) Pursuit Evasion
![Page 5: A Decentralised Coordination Algorithm for Mobile Sensors](https://reader030.fdocuments.us/reader030/viewer/2022013101/5681592a550346895dc653e0/html5/thumbnails/5.jpg)
We focus on two well known information gathering domains: (2) Patrolling
![Page 6: A Decentralised Coordination Algorithm for Mobile Sensors](https://reader030.fdocuments.us/reader030/viewer/2022013101/5681592a550346895dc653e0/html5/thumbnails/6.jpg)
The sensors operate in a constrained environment
No centralised control
![Page 7: A Decentralised Coordination Algorithm for Mobile Sensors](https://reader030.fdocuments.us/reader030/viewer/2022013101/5681592a550346895dc653e0/html5/thumbnails/7.jpg)
The sensors operate in a constrained environment
LimitedCommunication
![Page 8: A Decentralised Coordination Algorithm for Mobile Sensors](https://reader030.fdocuments.us/reader030/viewer/2022013101/5681592a550346895dc653e0/html5/thumbnails/8.jpg)
The aim of the sensors is to collectively maximise the value of the observations they take
Paths leading to areas already explored- Low value
![Page 9: A Decentralised Coordination Algorithm for Mobile Sensors](https://reader030.fdocuments.us/reader030/viewer/2022013101/5681592a550346895dc653e0/html5/thumbnails/9.jpg)
The aim of the sensors is to collectively maximise the value of the observations they take
Paths leading to unexplored areas- High value
![Page 10: A Decentralised Coordination Algorithm for Mobile Sensors](https://reader030.fdocuments.us/reader030/viewer/2022013101/5681592a550346895dc653e0/html5/thumbnails/10.jpg)
The aim of the sensors is to collectively maximise the value of the observations they take
As a result, the target is detected faster
![Page 11: A Decentralised Coordination Algorithm for Mobile Sensors](https://reader030.fdocuments.us/reader030/viewer/2022013101/5681592a550346895dc653e0/html5/thumbnails/11.jpg)
To solve this coordination problem, we had to address three challenges
1. How to model the problem?2. How to value potential samples?3. How to coordinate to gather
samples of highest value?
![Page 12: A Decentralised Coordination Algorithm for Mobile Sensors](https://reader030.fdocuments.us/reader030/viewer/2022013101/5681592a550346895dc653e0/html5/thumbnails/12.jpg)
The three central challenges are clearly reflected in the architecture of our sensing agents
Samples sent toneighbouring agents
Samples received fromneighbouring agents
Information processing
Model of Environment
Outgoing negotiation messages
Incomingnegotiation messages
Value of potential samples Action
Selection
Move
Samples from own sensor
SensingAgent
Rawsamples
Model
Value
Coordinate
![Page 13: A Decentralised Coordination Algorithm for Mobile Sensors](https://reader030.fdocuments.us/reader030/viewer/2022013101/5681592a550346895dc653e0/html5/thumbnails/13.jpg)
Samples sent toneighbouring agents
Samples received fromneighbouring agents
Information processing
Model of Environment
Outgoing negotiation messages
Incomingnegotiation messages
Value of potential samples Action
Selection
Move
Samples from own sensor
SensingAgent
Rawsamples
Model
![Page 14: A Decentralised Coordination Algorithm for Mobile Sensors](https://reader030.fdocuments.us/reader030/viewer/2022013101/5681592a550346895dc653e0/html5/thumbnails/14.jpg)
Each sensor builds its own belief map containing all the information gathered about the target
Map of the probability distribution over the target’s position
The map is dynamically updated by fusing the new observation gathered
![Page 15: A Decentralised Coordination Algorithm for Mobile Sensors](https://reader030.fdocuments.us/reader030/viewer/2022013101/5681592a550346895dc653e0/html5/thumbnails/15.jpg)
Samples sent toneighbouring agents
Samples received fromneighbouring agents
Information processing
Model of Environment
Outgoing negotiation messages
Incomingnegotiation messages
Value of potential samples Action
Selection
Move
Samples from own sensor
SensingAgent
Rawsamples
Value
![Page 16: A Decentralised Coordination Algorithm for Mobile Sensors](https://reader030.fdocuments.us/reader030/viewer/2022013101/5681592a550346895dc653e0/html5/thumbnails/16.jpg)
We value a set of observations by measuring how much they reduce the probability of detecting the target
High probability
Low probability
High value: - target might be there
Low value:-Target is probably somewhere else
![Page 17: A Decentralised Coordination Algorithm for Mobile Sensors](https://reader030.fdocuments.us/reader030/viewer/2022013101/5681592a550346895dc653e0/html5/thumbnails/17.jpg)
The sensor agents coordinate using the Max-Sum algorithm
Samples sent toneighbouring agents
Samples received fromneighbouring agents
Information processing
Model of Environment
Outgoing negotiation messages
Incomingnegotiation messages
Value of potential samples Action
Selection
Move
Samples from own sensor
SensingAgent
Rawsamples
Coordinate
![Page 18: A Decentralised Coordination Algorithm for Mobile Sensors](https://reader030.fdocuments.us/reader030/viewer/2022013101/5681592a550346895dc653e0/html5/thumbnails/18.jpg)
To decompose the utility function we use the concept of incremental utility value
)(1Y )( 12
YY )( 213YYY
1U 2U 3U
)()()(),,( 211321 321YYYYYYf YYY
)(1
1i
jjY Y
i
![Page 19: A Decentralised Coordination Algorithm for Mobile Sensors](https://reader030.fdocuments.us/reader030/viewer/2022013101/5681592a550346895dc653e0/html5/thumbnails/19.jpg)
The key problem is to maximise the social welfare of the team of sensors in a decentralised way
M
iYi
1
1-i
1jj)Y(maxarg
xSocial welfare:
Mobile Sensors
![Page 20: A Decentralised Coordination Algorithm for Mobile Sensors](https://reader030.fdocuments.us/reader030/viewer/2022013101/5681592a550346895dc653e0/html5/thumbnails/20.jpg)
The key problem is to maximise the social welfare of the team of sensors in a decentralised way
),,( 3211 pppU
),( 212 ppU
),( 323 ppU
Variable encode paths
![Page 21: A Decentralised Coordination Algorithm for Mobile Sensors](https://reader030.fdocuments.us/reader030/viewer/2022013101/5681592a550346895dc653e0/html5/thumbnails/21.jpg)
),,( 3211 pppU
),( 212 ppU
),( 323 ppU
Variable encode paths
Coordinating over all paths is infeasible: it results in a combinatorial explosion for increasing path length
![Page 22: A Decentralised Coordination Algorithm for Mobile Sensors](https://reader030.fdocuments.us/reader030/viewer/2022013101/5681592a550346895dc653e0/html5/thumbnails/22.jpg)
),,( 3211 pppU
),( 212 ppU
),( 323 ppU
Clusters
Our solution: we cluster the neighborhood of each sensor
(now each variable represent a path to the Center of each cluster) Most informative is chosen!
![Page 23: A Decentralised Coordination Algorithm for Mobile Sensors](https://reader030.fdocuments.us/reader030/viewer/2022013101/5681592a550346895dc653e0/html5/thumbnails/23.jpg)
23
We can now use Max-Sum to solve the social welfare maximisation problem
Complete Algorithms
DPOPOptAPOADOPT
Communication Cost
Iterative Algorithms
Best Response (BR)Distributed Stochastic
Algorithm (DSA) Fictitious Play (FP)
Max-SumAlgorithm
Optimality
![Page 24: A Decentralised Coordination Algorithm for Mobile Sensors](https://reader030.fdocuments.us/reader030/viewer/2022013101/5681592a550346895dc653e0/html5/thumbnails/24.jpg)
The input for the Max-Sum algorithm is a graphical representation of the problem: a Factor Graph
Variable nodes Function nodes
1p
2p
3p
1U
2U
3U
Agent 1Agent 2
Agent 3
![Page 25: A Decentralised Coordination Algorithm for Mobile Sensors](https://reader030.fdocuments.us/reader030/viewer/2022013101/5681592a550346895dc653e0/html5/thumbnails/25.jpg)
Max-Sum solves the social welfare maximisation problem by local computation and message passing
1p
2p
3p
1U
2U
3U
Variable nodes Function nodes
Agent 1Agent 2
Agent 3
![Page 26: A Decentralised Coordination Algorithm for Mobile Sensors](https://reader030.fdocuments.us/reader030/viewer/2022013101/5681592a550346895dc653e0/html5/thumbnails/26.jpg)
Max-Sum solves the social welfare maximisation problem by local computation and message passing
jiadjk
iikiji prpq\)(
)()(
ijadjk
kjkjji
iij pqUprj \)(\p
)()p(max)(
From variable i to function j
From function j to variable i
![Page 27: A Decentralised Coordination Algorithm for Mobile Sensors](https://reader030.fdocuments.us/reader030/viewer/2022013101/5681592a550346895dc653e0/html5/thumbnails/27.jpg)
To use Max-Sum, we encode the mobile sensor coordination problem as a factor graph
1p
2p
3p
1U
2U
3U
Sensor 1Sensor 2
Sensor 3
Sensor 1
Sensor 2
Sensor 3
![Page 28: A Decentralised Coordination Algorithm for Mobile Sensors](https://reader030.fdocuments.us/reader030/viewer/2022013101/5681592a550346895dc653e0/html5/thumbnails/28.jpg)
To use Max-Sum, we encode the mobile sensor coordination problem as a factor graph
1p
2p
3p
1U
2U
3U
Sensor 1Sensor 2
Sensor 3
Sensor 1
Sensor 2
Sensor 3
Paths to the most informativepositions
![Page 29: A Decentralised Coordination Algorithm for Mobile Sensors](https://reader030.fdocuments.us/reader030/viewer/2022013101/5681592a550346895dc653e0/html5/thumbnails/29.jpg)
To use Max-Sum, we encode the mobile sensor coordination problem as a factor graph
1p
2p
3p
1U
2U
3U
Sensor 1Sensor 2
Sensor 3
Sensor 1
Sensor 2
Sensor 3
Local Utility Functions•Measure value of observations along paths
![Page 30: A Decentralised Coordination Algorithm for Mobile Sensors](https://reader030.fdocuments.us/reader030/viewer/2022013101/5681592a550346895dc653e0/html5/thumbnails/30.jpg)
Our Algorithm outperforms state-of-the-art approaches by up to 52% for Pursuit Evasion
![Page 31: A Decentralised Coordination Algorithm for Mobile Sensors](https://reader030.fdocuments.us/reader030/viewer/2022013101/5681592a550346895dc653e0/html5/thumbnails/31.jpg)
Our Algorithm outperforms state-of-the-art approaches by up to 44% for Patrolling
![Page 32: A Decentralised Coordination Algorithm for Mobile Sensors](https://reader030.fdocuments.us/reader030/viewer/2022013101/5681592a550346895dc653e0/html5/thumbnails/32.jpg)
In conclusion, we show that our algorithm is effective for a broad range of information gathering problems
1. Decentralised
2. General
3. Effective
![Page 33: A Decentralised Coordination Algorithm for Mobile Sensors](https://reader030.fdocuments.us/reader030/viewer/2022013101/5681592a550346895dc653e0/html5/thumbnails/33.jpg)
For future work, we wish to extend our approach to compute solutions with a guaranteed approximation ratio for any planning horizon
![Page 34: A Decentralised Coordination Algorithm for Mobile Sensors](https://reader030.fdocuments.us/reader030/viewer/2022013101/5681592a550346895dc653e0/html5/thumbnails/34.jpg)
In conclusion, we show that our algorithm is effective for a broad range of information gathering problems
1. Decentralised
2. General
3. Effective
QUESTIONS?