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 Citation (Scopus)

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

Sonar
Robots
Computational geometry
Testbeds
Cost functions
Mobile robots
Scanning

All Science Journal Classification (ASJC) codes

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

Cite this

Robinson, Craig L. ; Block, Daniel ; Brennan, Sean ; Bullo, Francesco ; Cortés, Jorge. / Nonsmooth analysis and sonar-based implementation of distributed coordination algorithms. In: Proceedings - IEEE International Conference on Robotics and Automation. 2004 ; Vol. 2004, No. 3. pp. 3000-3005.
@article{9b05c858f04c41588c41168339b2320f,
title = "Nonsmooth analysis and sonar-based implementation of distributed coordination algorithms",
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.",
author = "Robinson, {Craig L.} and Daniel Block and Sean Brennan and Francesco Bullo and Jorge Cort{\'e}s",
year = "2004",
month = "7",
day = "5",
language = "English (US)",
volume = "2004",
pages = "3000--3005",
journal = "Proceedings - IEEE International Conference on Robotics and Automation",
issn = "1050-4729",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "3",

}

Nonsmooth analysis and sonar-based implementation of distributed coordination algorithms. / Robinson, Craig L.; Block, Daniel; Brennan, Sean; Bullo, Francesco; Cortés, Jorge.

In: Proceedings - IEEE International Conference on Robotics and Automation, Vol. 2004, No. 3, 05.07.2004, p. 3000-3005.

Research output: Contribution to journalConference article

TY - JOUR

T1 - Nonsmooth analysis and sonar-based implementation of distributed coordination algorithms

AU - Robinson, Craig L.

AU - Block, Daniel

AU - Brennan, Sean

AU - Bullo, Francesco

AU - Cortés, Jorge

PY - 2004/7/5

Y1 - 2004/7/5

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=3042534642&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=3042534642&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:3042534642

VL - 2004

SP - 3000

EP - 3005

JO - Proceedings - IEEE International Conference on Robotics and Automation

JF - Proceedings - IEEE International Conference on Robotics and Automation

SN - 1050-4729

IS - 3

ER -