1,721,119 research outputs found

    Impossibility of Gathering By a Set of Autonomous Mobile Robots

    No full text
    Given a set of n autonomous mobile robots that can freely move on a two dimensional plane, they are required to gather in a position on the plane not fixed in advance (Gathering Problem). The main research question we address in this paper is: Under which conditions can this task be accomplished by the robots? The studied robots are quite simple: they are anonymous, totally asynchronous, they do not have any memory of past computations, they cannot explicitly communicate between each other. We show that this simple task cannot be in general accomplished by the considered system of robots

    The Effect of Synchronicity on the Behavior of Autonomous Mobile Robots

    No full text
    Over the past few years, the focus of robotic design has been moving from a scenario where a few specialized (and expensive) units were used to solve a variety of tasks, to a scenario where many general purpose (and cheap) units are used to achieve some common goal. Consequently, part of the focus has been to understand better how to coordinate and control a set of such “simpler” mobile units efficiently. Studies can be found in different disciplines, from engineering to artificial life: a shared feature of the majority of these works has been the design of algorithms based on heuristics, with no main concern on their correctness and termination. Few researchers have focused on trying to model formally an environment constituted by mobile units, analyzing which kind of capabilities they must have in order to achieve their goals; in other words, to study the problem from a computational point of view. In this paper we do a direct comparison between two models, ATOM and CORDA, introduced in two studies leading in this direction. First their main features are described, and then the main differences are highlighted, showing the relationship between the class of problems solvable in the two models

    Pattern formation

    Full text link
    The Pattern Formation problem is one of the most important coordination problem for robotic systems. Initially the entities are in arbitrary positions; within finite time they must arrange themselves in the space so to form a pattern given in input. In this chapter, we will mainly deal with the problem in the OBLOT model

    On the intelligent behaviour of stupid robots

    No full text
    It is well known that sophisticated behavior can be exhibited by systems (or communities) composed of simple elements (members), each of which has only very limited intelligence and exhibits only simple behavior. Exploiting this emergent behavior in robotic systems is particularly important, since systems built according to this principle tend to cost less and be more robust and efficient than systems composed by more complex, powerful, intelligent -- but less robust -- units
    corecore