• Sorted by Date • Classified by Publication Type • Sorted by First Author Last Name • Classified by Author Last Name •
Pooyan Fazli and Alan K. Mackworth. The Effects of Communication and Visual Range on Multi-Robot Repeated Boundary Coverage. In Proceedings of the IEEE International Symposium on Safety, Security, and Rescue Robotics, SSRR 2012, pp. 1–8, 2012.
We address the problem of repeated coverage by a team of robots of the boundaries of a target area and the structures inside it. The robots have limited visual and communication range. Events may occur on any parts of the boundaries and may have different importance weights. In addition, the boundaries of the area and the structures are heterogeneous, so that events may appear with varying probabilities on different parts of the boundary, and these probabilities may change over time. The goal is to maximize the reward by detecting the maximum number of events, weighted by their importance, in minimum time. The reward a robot receives for detecting an event depends on how early the event is detected. To this end, each robot autonomously and continuously learns the pattern of event occurrence on the boundaries over time, capturing the uncertainties in the target area. Based on the policy being learned to maximize the reward, each robot then plans in a decentralized manner to select the best path at that time in the target area to visit the most promising parts of the boundary. The performance of the learning algorithm is compared with a heuristic algorithm for the Travelling Salesman Problem, on the basis of the total reward collected by the team during a finite repeated boundary coverage mission. Moreover, the effects of robots’ visual range and communication among the robots on the performance of the proposed algorithms are also investigated.
@inproceedings{PooyanFazliSSRR2012,
author = {Pooyan Fazli and Alan K. Mackworth},
title = {The Effects of Communication and Visual Range on Multi-Robot Repeated Boundary Coverage},
booktitle = {Proceedings of the IEEE International Symposium on Safety, Security, and Rescue Robotics, SSRR 2012},
pages={1-8},
year = {2012},
location = {College Station, Texas, USA},
abstract={We address the problem of repeated coverage by
a team of robots of the boundaries of a target area and the
structures inside it. The robots have limited visual and communication range. Events may occur on any parts of the boundaries
and may have different importance weights. In addition, the
boundaries of the area and the structures are heterogeneous, so
that events may appear with varying probabilities on different
parts of the boundary, and these probabilities may change over
time. The goal is to maximize the reward by detecting the
maximum number of events, weighted by their importance, in
minimum time. The reward a robot receives for detecting an
event depends on how early the event is detected. To this end,
each robot autonomously and continuously learns the pattern
of event occurrence on the boundaries over time, capturing the
uncertainties in the target area. Based on the policy being learned
to maximize the reward, each robot then plans in a decentralized
manner to select the best path at that time in the target area to
visit the most promising parts of the boundary. The performance
of the learning algorithm is compared with a heuristic algorithm
for the Travelling Salesman Problem, on the basis of the total
reward collected by the team during a ï¬nite repeated boundary
coverage mission. Moreover, the effects of robots’ visual range
and communication among the robots on the performance of the
proposed algorithms are also investigated.},
bib2html_pubtype ={Refereed Conference Proceeding},
bib2html_rescat ={},
}
Generated by bib2html.pl (written by Patrick Riley ) on Wed Apr 23, 2014 19:08:35