Finding the optimal location and allocation of relay robots for building a rapid end-to-end wireless communication
  • Min, Byung-Cheol
  • Kim, Yongho
  • Lee, Sangjun
  • Jung, Jin-Woo
  • Matson, Eric T.
Citations

WEB OF SCIENCE

15
Citations

SCOPUS

19

초록

This paper addresses the fundamental problem of finding an optimal location and allocation of relay robots to establish an immediate end-to-end wireless communication in an inaccessible or dangerous area. We first formulate an end-to-end communication problem in a general optimization form with constraints for the operation of robots and antenna performance. Specifically, the constraints on the propagation of radio signals and infeasible locations of robots within physical obstacles are considered in case of a dense space. In order to solve the formulated problem, we present two optimization techniques such as Genetic Algorithm (GA) and Particle Swarm Optimization (PSO). Finally, the feasibility and effectiveness of the proposed methods are demonstrated by conducting several simulations, proof-of-concept study, and field experiments. We expect that our novel approach can be applied in a variety of rescue, disaster, and emergency scenarios where quick and long-distance communications are needed. (c) 2015 Elsevier B.V. All rights reserved.

키워드

End-to-end communicationCommunication chainsRelay robotsMulti robot systemEvolutionary algorithmSafety, security and rescue robotics (SSRR)DEPLOYMENTPLACEMENTNETWORKS
제목
Finding the optimal location and allocation of relay robots for building a rapid end-to-end wireless communication
저자
Min, Byung-CheolKim, YonghoLee, SangjunJung, Jin-WooMatson, Eric T.
DOI
10.1016/j.adhoc.2015.12.001
발행일
2016-03
유형
Article
저널명
Ad Hoc Networks
39
페이지
23 ~ 44