By Topic

Nonsmooth analysis and sonar-based implementation of distributed coordination algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Robinson, C.L. ; Gen. Eng. & Coordinated Sci. Lab., Illinois Univ., Urbana, IL, USA ; Block, D. ; Brennan, S. ; Bullo, F.
more authors

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.

Published in:

Robotics and Automation, 2004. Proceedings. ICRA '04. 2004 IEEE International Conference on  (Volume:3 )

Date of Conference:

26 April-1 May 2004