Intelligent Distributed Control

Abstract

Here is a listing some of what this project has accomplished. We ve given a probabilistic explanation of why a previously proposed accelerated gossip algorithm works. We ve resolved the problem of automatically localizing a mobile autonomous agent using range-only measurements. We invented new tools for analyzing convergence rates for consensus and gossiping algorithms. We derived a complete solution to the problem of controlling a directed formation of triangular shape. We proved that for communication graphs which are trees, the rate at which periodic gossiping distributed algorithms converge does not depend on the order in which the individual gossips occur. We developed a new algorithm maintaining formations of mobile autonomous agents with cycle-free graphs. We developed request-based deterministic gossip protocols which are guaranteed not to deadlock.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 10, 2012
Accession Number
ADA567139

Entities

People

  • A. Stephen Morse

Organizations

  • Yale University

Tags

Communities of Interest

  • Autonomy
  • Materials and Manufacturing Processes
  • Sensors

DTIC Thesaurus Topics

  • Algorithms
  • Autonomous Agents
  • Communication Networks
  • Control Theory
  • Convergence
  • Department Of Defense
  • Detectors
  • Dwell Time
  • Markov Chains
  • Measurement
  • Networks
  • Political Movements
  • Rigidity
  • Sensor Networks
  • Sequences
  • Social Networks
  • Switching

Fields of Study

  • Computer science

Readers

  • Agent-Based Social Robotics and Mobile-Assisted Learning in Virtual Environments.
  • Computer Networking
  • Graph Algorithms and Convex Optimization.