A Distributed Computing Algorithm for Deployment of Mobile Robotic Agents with Limited Sensing Ranges

A Distributed Computing Algorithm for Deployment of Mobile Robotic Agents with Limited Sensing Ranges

Jing Wang, Christopher I. Smith
Copyright: © 2015 |Pages: 15
DOI: 10.4018/IJHCR.2015070104
OnDemand:
(Individual Articles)
Available
$37.50
Current Special Offers
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

In this paper, the authors present a distributed computing algorithm for an application of deploying a group of mobile robotic agents in a convex region. Each agent can be treated as an embedded system with its own sensors and actuators. Under the assumption that agents have limited sensing capabilities, the distributed computing algorithm is designed to make agents cover the convex region so that each member's individual region, the space around them, is optimized. Each agent must accommodate its kinematic constraints and can only exchange information locally based on the range of the sensors equipped. The proposed algorithm utilizes Voronoi partitions to create individual subregions and directs each member toward the centroid of their subregion. The Voronoi partitions are updated with each iteration of the algorithm. Simulation results are provided to validate the proposed algorithm.
Article Preview
Top

Problem Formulation

Considering a convex region IJHCR.2015070104.m01, the problem discussed will be the deployment of a fixed number of mobile robotic agents within this region. To solve the problem, the following three assumptions are made without the loss of generality:

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
Volume 8: 4 Issues (2017)
Volume 7: 4 Issues (2016)
Volume 6: 4 Issues (2015)
Volume 5: 4 Issues (2014)
Volume 4: 4 Issues (2013)
Volume 3: 4 Issues (2012)
Volume 2: 4 Issues (2011)
Volume 1: 4 Issues (2010)
View Complete Journal Contents Listing