Autonomous Robots

, Volume 37, Issue 1, pp 1–25

Online decentralized information gathering with spatial–temporal constraints

Article

DOI: 10.1007/s10514-013-9369-5

Cite this article as:
Gan, S.K., Fitch, R. & Sukkarieh, S. Auton Robot (2014) 37: 1. doi:10.1007/s10514-013-9369-5

Abstract

We are interested in coordinating a team of autonomous mobile sensor agents in performing a cooperative information gathering task while satisfying mission-critical spatial–temporal constraints. In particular, we present a novel set of constraint formulations that address inter-agent collisions, collisions with static obstacles, network connectivity maintenance, and temporal-coverage in a resource-efficient manner. These constraints are considered in the context of the target search problem, where the team plans trajectories that maximize the probability of target detection. We model constraints continuously along the agents’ trajectories and integrate these constraint models into decentralized team planning using a computationally efficient solution method based on the Lagrangian formulation and decentralized optimization. We validate our approach in simulation with five UAVs performing search, and through hardware experiments with four indoor mobile robots. Our results demonstrate team planning with spatial–temporal constraints that preserves the performance of unconstrained information gathering and is feasible to implement with reasonable computational and communication resources.

Keywords

Team planningDecentralized optimizationInformation gatheringSpatial–temporal constraintsCollision avoidanceNetwork connectivity Temporal-coverage

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  1. 1.Australian Centre for Field Robotics (ACFR)The University of SydneyDarlingtonAustralia