Distributed algorithms for autonomous mobile robots: Invited talk

4Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The distributed coordination and control of a team of autonomous mobile robots is a problem widely studied in a variety of fields, such as engineering, artificial intelligence, artificial life, robotics. Generally, in these areas, the problem is studied mostly from an empirical point of view. Recently, a significant research effort has been and continues to be spent on understanding the fundamental algorithmic limitations on what a set of autonomous mobile robots can achieve. In particular, the focus is to identify the minimal robot capabilities (sensorial, motorial, computational) that allow a problem to be solvable and a task to be performed. In this talk we describe the current investigations on the inter-play between robots capabilities, computability, and algorithmic solutions of coordination problems by autonomous mobile robots. © 2006 International Federation for Information Processing.

Cite

CITATION STYLE

APA

Santoro, N. (2006). Distributed algorithms for autonomous mobile robots: Invited talk. IFIP International Federation for Information Processing, 209, 11. https://doi.org/10.1007/978-0-387-34735-6_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free