Analyzing the performance of randomized information sharing under noise and dynamics
Download
1 / 25

Analyzing the Performance of Randomized Information Sharing under Noise and Dynamics - PowerPoint PPT Presentation


  • 63 Views
  • Uploaded on

Analyzing the Performance of Randomized Information Sharing under Noise and Dynamics. Paul Scerri , Prasanna Velagapudi , Katia Sycara Robotics Institute Carnegie Mellon University. Large Multiagent Teams. 1000s of robots, agents, and people Must collaborate to complete complex tasks

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about ' Analyzing the Performance of Randomized Information Sharing under Noise and Dynamics ' - mirra


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
Analyzing the performance of randomized information sharing under noise and dynamics

Analyzing the Performance of Randomized Information Sharing under Noise and Dynamics

Paul Scerri,

PrasannaVelagapudi,

KatiaSycara

Robotics Institute

Carnegie Mellon University


Large multiagent teams
Large Multiagent Teams under Noise and Dynamics

  • 1000s of robots, agents, and people

  • Must collaborate to complete complex tasks

  • Necessitate distributed algorithms

  • Assuming peer-to-peer communication model

Search

and

Rescue

Disaster

Response

UAV

Surveillance


Information sharing
Information Sharing under Noise and Dynamics

  • How do we deliver information efficiently?

    • Get to the people that need it most

    • Don’t waste communication bandwidth

  • Key Idea:

    Different agents have different utility for a single piece of information!


Information sharing1
Information Sharing under Noise and Dynamics

  • How do we measure information need?

    • “Need” is domain-specific

    • Define a utility function for each agent which is maximized when it receives the information it needs


Existing approaches
Existing Approaches under Noise and Dynamics

  • Simple

    • Flooding

    • Gossip

    • Tokens

  • Intelligent

    • STEAM

    • Channel Filtering

    • Particle Filter exchange


Classical flooding
Classical Flooding under Noise and Dynamics

  • Agent pushes information to every neighbor

Info

Info

Info

Info

Info


Gossip
Gossip under Noise and Dynamics

  • Agent pushes information probabilistically to subset of neighbors

Info

Info

Info


Random token routing
Random Token Routing under Noise and Dynamics

  • Agent pushes information to a single random neighbor

Info


Problem
Problem under Noise and Dynamics

  • When are intelligent strategies necessary?

    • Complexity adds overhead

    • In many simple domains, random policies work

  • Is there a set of problem characteristics that can predict algorithm performance?


Optimal performance
“Optimal” performance under Noise and Dynamics

  • Simplest case:

    • Single piece of information

    • Static network

  • Optimal algorithm for a fully connected network:

    • Use first transmission to get to agent with the highest utility for the information

    • Use second transmission to get to agent with second highest utility, etc.

[Velagapudi et al., AAMAS 2009]


Optimal performance1
“Optimal” performance under Noise and Dynamics

  • Suppose distribution of utility over network can be approximated by a well-known distribution

    • Expected utility of the optimal algorithm for k transmissions is sum of k highest order statistics

    • Forms upper bound on performance for partially connected networks with same utility distribution

[Velagapudi et al., AAMAS 2009]


Optimal performance2
“Optimal” performance under Noise and Dynamics

  • In partially connected networks, analytic expression for optimality is much harder to compute

  • For the class of token algorithms, approximate the optimal token policy using an n-step lookahead policy:

    • Assume we have some estimate of utility for every other node (possibly with noise)

    • Exhaustively search all n-length paths from current node

    • Send information along best path

    • Repeat until TTL reaches 0

[Velagapudi et al., AAMAS 2009]


Optimality of n step lookahead
Optimality of n-step lookahead under Noise and Dynamics

2-step lookahead: pathological case?

[Velagapudi et al., AAMAS 2009]


Experimental setup
Experimental Setup under Noise and Dynamics

  • Objective:

    • Study effects of network properties on optimality of random token routing

  • Single piece of information (token)

  • Static networks

    • Scale-Free, Small Worlds, Hierarchical, Lattice, Random

  • Agents’ utilities sampled from utility distribution

    • Normal, Exponential

[Velagapudi et al., AAMAS 2009]


Experimental setup1
Experimental Setup under Noise and Dynamics

  • Algorithms:

    • Random:

      • Send to random neighbor each time step

    • RandomSelfAvoid

      • Send to random neighbor that has not already been visited

    • RandomTrails

      • Send to random neighbor using an edge that was not previously used

    • Lookahead

      • 4-step lookahead policy (as previously described)

[Velagapudi et al., AAMAS 2009]


Normal distribution performance
Normal distribution performance under Noise and Dynamics

[Velagapudi et al., AAMAS 2009]


Exponential distribution performance
Exponential distribution performance under Noise and Dynamics

[Velagapudi et al., AAMAS 2009]


Noise effects on lookahead policy
Noise effects on lookahead policy under Noise and Dynamics

[Velagapudi et al., AAMAS 2009]


Network density effects
Network Density Effects under Noise and Dynamics

[Velagapudi et al., AAMAS 2009]


Summary of previous work
Summary of Previous Work under Noise and Dynamics

  • Random policies perform reasonably under certain utility distributions

  • Adding simple heuristics significantly improves performance

  • Certain networks are more conducive to randomized methods

  • As noise is added, gap between random and optimal policies closes


Multiple token interaction
Multiple token interaction under Noise and Dynamics

  • How does performance change when systems are generating many tokens with redundant information?

  • If noise is added, are dynamic systems affected differently than static systems?


Experimental setup2
Experimental Setup under Noise and Dynamics

  • Scale-free network of 50 agents

  • Token time-to-live (TTL) of 20

  • Objective: minimize variance

    • Cost modeled as sum of “covariance” over time

    • “Covariance” update rules approximate 1D Kalman filter update


Dynamic effects
Dynamic Effects under Noise and Dynamics


Noise effects
Noise Effects under Noise and Dynamics


Discussion
Discussion under Noise and Dynamics

  • Significant difference in performance between random and lookahead policies

  • Intelligent heuristics may be able to help in dynamic and noisy situations


ad