1 Introduction
1.1Motivation
1.2Identification of Set-Valued Systems
1.3Consensus Control of Multi-Agent Systems
1.4Outline of the Book
2Preliminaries
2.1Vectors and Norms
2.2Probability Theory
2.3Algebraic Graph Theory
2.4Some Other Concepts
2.5Notes
3Identification of Set-Valued Systems
3.1Problem Formulation
3.2Asymptotically Efficient Non-Truncated Identification Algorithm
3.2.1Identification for Single-Parameter Systems
3.2.2Identification for Multi-Parameter Systems
3.2.3Numerical Simulation
3.3Recursive Projection Identification Algorithm
3.3.1Algorithm Design
3.3.2Properties of the Algorithm
3.3.3Numerical Simulation
3.4Notes
4Consensus with Binary-Valued Measurements under Undirected Topology
4.1Problem Formulation
4.2Two-Time-Scale Consensus
4.2.1Estimation
4.2.2Consensus Control
4.2.3The Consensus Protocol
4.2.4Numerical Simulation
4.3Recursive Projection Consensus
4.3.1Consensus Algorithm
4.3.2Main Results
4.3.3Numerical Simulation
4.4Notes
5Consensus with Binary-Valued Measurements under Directed Topology
5.1Problem Formulation
5.2Control Algorithm
5.3Properties of the Algorithm
5.3.1Estimation
5.3.2Transportation Design
5.4Numerical Simulation
5.5Notes
6Consensus of Linear Multi-Agent Systems with Binary-Valued Measurements
6.1Problem Formulation
6.2Review on the Case of Precise Communication
6.3Case of Binary-Valued Communication
6.3.1Control Algorithm
6.3.2Main Results
6.4Numerical Simulation
6.5Notes
References