On the feasibility of gathering by autonomous mobile robots

被引：0
|
作者：
Prencipe, G [1 ]
机构：
[1] Dipartimento Informat, I-56100 Pisa, Italy
来源：
STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, PROCEEDINGS | 2005年 / 3499卷
关键词：
mobile robots; multiplicity detection; distributed coordination; distributed models; computability;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
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 of the plane not fixed in advance (GATHERING PROBLEM). The main research question we address in this paper is: under which conditions this task can 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 among each other. We show that this simple task cannot be in general accomplished by the considered system of robots.
引用
收藏
页码：246 / 261
页数：16
相关论文
共 50 条
  • [1] Impossibility of gathering by a set of autonomous mobile robots
    Prencipe, Giuseppe
    THEORETICAL COMPUTER SCIENCE, 2007, 384 (2-3) : 222 - 231
  • [2] Gathering problems for autonomous mobile robots with lights
    Terai, Satoshi
    Wada, Koichi
    Katayama, Yoshiaki
    THEORETICAL COMPUTER SCIENCE, 2023, 941 : 241 - 261
  • [3] Gathering problems for autonomous mobile robots with lights
    Terai, Satoshi
    Wada, Koichi
    Katayama, Yoshiaki
    THEORETICAL COMPUTER SCIENCE, 2023, 941 : 241 - 261
  • [4] Gathering of seven autonomous mobile robots on triangular grids
    Shibata, Masahiro
    Ohyabu, Masaki
    Sudo, Yuichi
    Nakamura, Junya
    Kim, Yonghwan
    Katayama, Yoshiaki
    2021 IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS (IPDPSW), 2021, : 566 - 575
  • [5] Gathering of Autonomous Mobile Robots Under Limited Sensing Ranges
    Chauhuri, Sruti Gan
    2018 INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTING, COMMUNICATIONS AND INFORMATICS (ICACCI), 2018, : 909 - 914
  • [6] Fault-tolerant gathering algorithms for autonomous mobile robots
    Agmon, Noa
    Peleg, David
    SIAM JOURNAL ON COMPUTING, 2006, 36 (01) : 56 - 82
  • [7] Gathering autonomous mobile robots with dynamic compasses: An optimal result
    Izumi, Taisuke
    Katayama, Yoshiaki
    Inuzuka, Nobuhiro
    Wada, Koichi
    DISTRIBUTED COMPUTING, PROCEEDINGS, 2007, 4731 : 298 - +
  • [8] Dynamic compass models and gathering algorithms for autonomous mobile robots
    Katayama, Yoshiaki
    Tomida, Yuichi
    Imazu, Hiroyuki
    Inuzuka, Nobuhiro
    Wada, Koichi
    STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, PROCEEDINGS, 2007, 4474 : 274 - +
  • [9] The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots
    Li, Shouwei
    Heide, Friedhelm Meyer auf der
    Podlipyan, Pavel
    THEORETICAL COMPUTER SCIENCE, 2021, 852 : 29 - 40
  • [10] The Impact of the Gabriel Subgraph of the Visibility Graph on the Gathering of Mobile Autonomous Robots
    Li, Shouwei
    Meyer, Friedhelm
    Podlipyan, Pavel
    ALGORITHMS FOR SENSOR SYSTEMS (ALGOSENSORS 2016), 2017, 10050 : 62 - 79
12345