Decentralized Searching of Multiple Unknown and Transient Radio Sources with Paired Robots

In this paper, we develop a decentralized algorithm to coordinate a group of mobile robots to search for unknown and transient radio sources. In addition to limited mobility and ranges of communication and sensing, the robot team has to deal with challenges from signal source anonymity, short transm...

Full description

Bibliographic Details
Main Authors: Chang-Young Kim, Dezhen Song, Jingang Yi, Xinyu Wu
Format: Article
Language:English
Published: Elsevier 2015-03-01
Series:Engineering
Subjects:
Online Access:http://www.sciencedirect.com/science/article/pii/S2095809916300455
id doaj-80666e981ed948458a9d5b47f2367947
record_format Article
spelling doaj-80666e981ed948458a9d5b47f23679472020-11-24T23:42:20ZengElsevierEngineering2095-80992015-03-011105806510.15302/J-ENG-2015010Decentralized Searching of Multiple Unknown and Transient Radio Sources with Paired RobotsChang-Young Kim0Dezhen Song1Jingang Yi2Xinyu Wu3Kespry, Inc., Menlo Park, CA 94025, USACSE Department, Texas A&M University, College Station, TX 77843, USAMAE Department, Rutgers University, Piscataway, NJ 08854, USAShenzhen Institute of Advanced Technology, Chinese Academy of Science, Shenzhen 518055, ChinaIn this paper, we develop a decentralized algorithm to coordinate a group of mobile robots to search for unknown and transient radio sources. In addition to limited mobility and ranges of communication and sensing, the robot team has to deal with challenges from signal source anonymity, short transmission duration, and variable transmission power. We propose a two-step approach: First, we decentralize belief functions that robots use to track source locations using checkpoint-based synchronization, and second, we propose a decentralized planning strategy to coordinate robots to ensure the existence of checkpoints. We analyze memory usage, data amount in communication, and searching time for the proposed algorithm. We have implemented the proposed algorithm and compared it with two heuristics. The experimental results show that our algorithm successfully trades a modest amount of memory for the fastest searching time among the three methods.http://www.sciencedirect.com/science/article/pii/S2095809916300455wireless localizationnetworked robotstransient targets
collection DOAJ
language English
format Article
sources DOAJ
author Chang-Young Kim
Dezhen Song
Jingang Yi
Xinyu Wu
spellingShingle Chang-Young Kim
Dezhen Song
Jingang Yi
Xinyu Wu
Decentralized Searching of Multiple Unknown and Transient Radio Sources with Paired Robots
Engineering
wireless localization
networked robots
transient targets
author_facet Chang-Young Kim
Dezhen Song
Jingang Yi
Xinyu Wu
author_sort Chang-Young Kim
title Decentralized Searching of Multiple Unknown and Transient Radio Sources with Paired Robots
title_short Decentralized Searching of Multiple Unknown and Transient Radio Sources with Paired Robots
title_full Decentralized Searching of Multiple Unknown and Transient Radio Sources with Paired Robots
title_fullStr Decentralized Searching of Multiple Unknown and Transient Radio Sources with Paired Robots
title_full_unstemmed Decentralized Searching of Multiple Unknown and Transient Radio Sources with Paired Robots
title_sort decentralized searching of multiple unknown and transient radio sources with paired robots
publisher Elsevier
series Engineering
issn 2095-8099
publishDate 2015-03-01
description In this paper, we develop a decentralized algorithm to coordinate a group of mobile robots to search for unknown and transient radio sources. In addition to limited mobility and ranges of communication and sensing, the robot team has to deal with challenges from signal source anonymity, short transmission duration, and variable transmission power. We propose a two-step approach: First, we decentralize belief functions that robots use to track source locations using checkpoint-based synchronization, and second, we propose a decentralized planning strategy to coordinate robots to ensure the existence of checkpoints. We analyze memory usage, data amount in communication, and searching time for the proposed algorithm. We have implemented the proposed algorithm and compared it with two heuristics. The experimental results show that our algorithm successfully trades a modest amount of memory for the fastest searching time among the three methods.
topic wireless localization
networked robots
transient targets
url http://www.sciencedirect.com/science/article/pii/S2095809916300455
work_keys_str_mv AT changyoungkim decentralizedsearchingofmultipleunknownandtransientradiosourceswithpairedrobots
AT dezhensong decentralizedsearchingofmultipleunknownandtransientradiosourceswithpairedrobots
AT jingangyi decentralizedsearchingofmultipleunknownandtransientradiosourceswithpairedrobots
AT xinyuwu decentralizedsearchingofmultipleunknownandtransientradiosourceswithpairedrobots
_version_ 1725504974800027648