Conference Paper

Entrapment/escorting and patrolling missions in multi-robot cluster space control

Robotic Syst. Lab., Santa Clara Univ., Santa Clara, CA, USA
DOI: 10.1109/IROS.2009.5354815 Conference: Intelligent Robots and Systems, 2009. IROS 2009. IEEE/RSJ International Conference on
Source: IEEE Xplore

ABSTRACT The tasks of entrapping/escorting and patrolling around an autonomous target are presented making use of the multi-robot cluster space control approach. The cluster space control technique promotes simplified specification and monitoring of the motion of mobile multi-robot systems of limited size. Previous work has established the conceptual foundation of this approach and has experimentally verified and validated its use for 2-robot, 3-robot and 4-robot systems, with varying implementations ranging from automated trajectory control to human-in-the-loop piloting. In this publication, we show that the problem of entrapping/escorting/patrolling is trivial to define and manage from a cluster space perspective. Using a 3-robot experimental testbed, results are shown for the given tasks. We also revise the definition of the cluster space framework for a three-robot formation and incorporate a robot-level obstacle avoidance functionality.

  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper we address the entrapment problem for a multi-robot system under the assumption of uncertainty in the knowledge of the target position. More precisely, we assume each robot models its knowledge of the location of the target through a Gaussian distribution, that is, with an expected value of the target location and the related covariance matrix. Motivated by this probabilistic modeling of the knowledge of the target location, we propose a novel algorithm where elliptical orbits are considered for the entrapment rather than circular ones, as in a classical entrapment formulation. A theoretical analysis of the entrapment algorithm properties is provided. In particular, we show this formulation to be a generalization of the classical entrapment scenarios. Simulation results are proposed to corroborate the theoretical analysis.
    2013 IEEE 52nd Annual Conference on Decision and Control (CDC); 12/2013
  • Source
  • [Show abstract] [Hide abstract]
    ABSTRACT: Motivated by the strong influence network rigidity has on collaborative systems, in this paper, we consider the problem of partitioning a multiagent network into two sub-teams, a bipartition, such that the resulting sub-teams are topologically rigid. In this direction, we determine the existence conditions for rigidity-preserving bipartitions, and provide an iterative algorithm that identifies such partitions in polynomial time. In particular, the relationship between rigid graph partitions and the previously identified Z-link edge structure is given, yielding a feasible direction for graph search. Adapting a supergraph search mechanism, we then detail a methodology for discerning graphs cuts that represent valid rigid bipartitions. Next, we extend our methods to a decentralized context by exploiting leader election and an improved graph search to evaluate feasible cuts using only local agent-to-agent communication. Finally, full algorithm details and pseudocode are provided, together with simulation results that verify correctness and demonstrate complexity.
    12/2014; DOI:10.1109/TCYB.2014.2378552

Full-text (2 Sources)

Available from
Nov 18, 2014