Securing multiagent systems against a sequence of intruder attacks

No abstract is available for this paper.

• Publication year

  2012

• Venue

  American Control Conference

• Publication date

  2012-06-27

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/ACC.2012.6315324
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Eternal 1-Security Number of the Corona and Cartesian Product of Graphs

  2011cited by this paper
• Distributed Function Calculation via Linear Iterative Strategies in the Presence of Malicious Agents

  2011cited by this paper
• Cooperative Minimum Time Surveillance With Multiple Ground Vehicles

  2010cited by this paper
• Independence polynomials of circulants with an application to music

  2009cited by this paper
• Dynamic distributed intrusion detection for secure multi-robot systems

  2009cited by this paper
• An annotated bibliography on guaranteed graph searching

  2008cited by this paper
• Distance paired domination numbers of graphs

  2008cited by this paper
• Distributed intrusion detection for secure consensus computations

  2007cited by this paper
• Decentralized intrusion detection for secure cooperative multi-agent systems

  2007cited by this paper
• Distributed deployment of asynchronous guards in art galleries

  2006cited by this paper
• Dynamic Sensor Planning and Control for Optimally Tracking Targets

  2003cited by this paper
• Infinite Order Domination in Graphs

  2003cited by this paper
• Cooperative Robotics for Multi-Target Observation

  1999cited by this paper
• Fundamentals of domination in graphs

  1998cited by this paper
• Graph Theory and Its Applications

  1998cited by this paper
• Cooperative multi-robot observation of multiple moving targets

  1997cited by this paper
• The square of every two-connected graph is Hamiltonian

  1974cited by this paper

• Differential Graphical Games

  2018cites this paper
• A secure finite-time consensus scheme for multi-agent systems via terminal iterative learning

  2016cites this paper
• A secure finite-time consensus scheme for multi-agent systems via terminal iterative learning

  2016cites this paper
• Guarding networks through heterogeneous mobile guards

  2015cites this paper
• Decentralized monitoring of leader-follower networks of uncertain nonlinear systems

  2015cites this paper
• On (t, r) broadcast domination numbers of grids

  2014cites this paper
• On Two Combinatorial Optimization Problems in Graphs: Grid Domination and Robustness

  2013cites this paper
• Distributed dominating sets on grids

  2013cites this paper
• ( 𝑡, 𝑟 ) -Broadcast Domination in Networks ⋆

  year unknowncites this paper