Nonsmooth analysis and sonar-based implementation of distributed coordination algorithms

Craig L. Robinson, Daniel Block, Sean Brennan, Francesco Bullo, Jorge Cortés

Research output: Contribution to journalConference article

1 Scopus citations

Abstract

This paper investigates the behavior of a group of autonomous robots evolving in a polygonal environment according to a "move away from the closest neighbor" heuristic. We demonstrate that this distributed coordination algorithm optimizes an aggregate cost function that measures how uniformly distributed are the robots in their environment. Our technical approach based on non-smooth analysis and computational geometry unveils a sphere-packing problem. The algorithm is implemented in a testbed of indoor mobile robots equipped with sonar. We develop novel approaches for improving single point sonar scan performance. These algorithms are then shown to have improved reliability, resolution and speed in distributed environments as compared to other scanning methods.

Original languageEnglish (US)
Pages (from-to)3000-3005
Number of pages6
JournalProceedings - IEEE International Conference on Robotics and Automation
Volume2004
Issue number3
StatePublished - Jul 5 2004
EventProceedings- 2004 IEEE International Conference on Robotics and Automation - New Orleans, LA, United States
Duration: Apr 26 2004May 1 2004

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Software
  • Control and Systems Engineering
  • Artificial Intelligence
  • Electrical and Electronic Engineering

Cite this