Distributed Coordination Strategies for Wide-Area Patrol

Authors:
Brandon J. Moore;Kevin M. Passino
Affiliations:
Department Electrical and Computer Engineering, The Ohio State University, Columbus, USA 43210;Department Electrical and Computer Engineering, The Ohio State University, Columbus, USA 43210
Venue:
Journal of Intelligent and Robotic Systems
Year:
2009

Citing 3
Cited 0

Parallel and Distributed Computation: Numerical Methods

Parallel and Distributed Computation: Numerical Methods
An asynchronous and iterative load balancing algorithm for discrete load model

Journal of Parallel and Distributed Computing
Load balancing of unit size tokens and expansion properties of graphs

Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the problem of enabling a group of autonomous vehicles to effectively patrol an environment significantly larger than their communication and sensing radii. The environment is divided into smaller areas and special coordinator vehicles are designated to control the transfer of the other vehicles from one area to another. Our past work showed that by organizing the areas and coordinators into a ring topology, we could design a control algorithm that globally balanced the number of vehicles in all areas within a bounded length of time. This paper extends those results to a much broader class of area-coordinator topologies and this added flexibility can be used in implementation to reduce the time it takes to attain the globally balanced state.