Using Rendezvous to Overcome Communication Limitations in Multirobot Exploration

被引:0
|
作者
Wellman, Briana Lowe [1 ]
Dawson, Shameka [1 ]
de Hoog, Julian [2 ]
Anderson, Monica [1 ]
机构
[1] Univ Alabama, Dept Comp Sci, Tuscaloosa, AL 35487 USA
[2] Univ Oxford, Dept Comp Sci, Oxford OX1 3QD, England
关键词
Multiagent Systems; Distributed Systems; Cooperation; Communication; SIMULTANEOUS LOCALIZATION;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In cooperative multirobot systems, communication can speed up completion, reduce redundancy, and prevent interference between robots. Typically, wireless point-to-point communication is used to coordinate robots. However, environmental interference, unpredictable network conditions, and distances between robots can affect the reliability of wireless communication. Therefore, approaches other than continuous message passing throughout exploration are useful. We consider the problem of coordinating a multirobot system to explore an unknown, large, open environment. An approach that uses sector search with rendezvous is presented. Robots explore an environment in sectors, or designated areas, and periodically meet to communicate map information of what they have explored. Our approach is compared to other communication paradigms in simulation. Results suggest that sector search with rendezvous is more efficient than having no communications. It further demonstrates advantages over scenarios in which robots communicate only with other robots in close proximity, and is comparable to a role-based approach with dynamic team hierarchies.
引用
下载
收藏
页码:2401 / 2406
页数:6
相关论文
共 50 条
  • [21] Distributed multirobot exploration, mapping, and task allocation
    Regis Vincent
    Dieter Fox
    Jonathan Ko
    Kurt Konolige
    Benson Limketkai
    Benoit Morisset
    Charles Ortiz
    Dirk Schulz
    Benjamin Stewart
    Annals of Mathematics and Artificial Intelligence, 2008, 52 : 229 - 255
  • [22] Distributed multirobot exploration maintaining a mobile network
    Vazquez, J
    Malcolm, C
    2004 2ND INTERNATIONAL IEEE CONFERENCE INTELLIGENT SYSTEMS, VOL 3, STUDENT SESSIONS, PROCEEDINGS, 2004, : 113 - 118
  • [23] Distributed multirobot exploration, mapping, and task allocation
    Vincent, Regis
    Fox, Dieter
    Ko, Jonathan
    Konolige, Kurt
    Limketkai, Benson
    Morisset, Benoit
    Ortiz, Charles
    Schulz, Dirk
    Stewart, Benjamin
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2008, 52 (2-4) : 229 - 255
  • [24] Robust Connectivity Preserving Rendezvous of Multirobot Systems Under Unknown Dynamics and Disturbances
    Feng, Zhi
    Sun, Chao
    Hu, Guoqiang
    IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS, 2017, 4 (04): : 725 - 735
  • [25] Preserving Multirobot Connectivity in Rendezvous Tasks in the Presence of Obstacles With Bounded Control Input
    Li, Xiangpeng
    Sun, Dong
    Yang, Jie
    IEEE TRANSACTIONS ON CONTROL SYSTEMS TECHNOLOGY, 2013, 21 (06) : 2306 - 2314
  • [26] Exploration of a two sided rendezvous search problem using genetic algorithms
    Truong, TQS
    Stacey, A
    GENETIC AND EVOLUTIONARY COMPUTATION - GECCO 2003, PT II, PROCEEDINGS, 2003, 2724 : 2422 - 2423
  • [27] AN IMPLEMENTATION MODEL OF RENDEZVOUS COMMUNICATION
    CARDELLI, L
    LECTURE NOTES IN COMPUTER SCIENCE, 1985, 197 : 449 - 457
  • [28] Concurrent Control of Mobility and Communication in Multirobot Systems
    Stephan, James
    Fink, Jonathan
    Kumar, Vijay
    Ribeiro, Alejandro
    IEEE TRANSACTIONS ON ROBOTICS, 2017, 33 (05) : 1248 - 1254
  • [29] Efficient strategy for co-ordinated multirobot exploration
    Soft Computing and Research Laboratory, Indian Institute of Information Technology and Management, Gwalior, Madhya Pradesh, India
    ACM Int. Conf. Proc. Ser., (105-111):
  • [30] Strategies for coordinated multirobot exploration with recurrent connectivity constraints
    Banfi, Jacopo
    Li, Alberto Quattrini
    Rekleitis, Ioannis
    Amigoni, Francesco
    Basilico, Nicola
    AUTONOMOUS ROBOTS, 2018, 42 (04) : 875 - 894