4 Multi-Robot Systems: Taxonomy, Estimation, and Coordination

4.1.1 Three Independent Taxonomy Axes

These axes are independent. A heterogeneous team can still be centrally controlled. A decentralized team can use explicit radio messages. A homogeneous swarm can coordinate partly through observable motion.

4.1.2 Topology Shapes Coordination Risk

The goal of decentralization is to approach the performance of an ideal centralized system without inheriting its single point of failure. The costs are communication delay and overhead, asynchronous inputs, and solutions that may be temporarily sub-optimal. Some algorithms degrade gracefully under whatever communication is available, but that property must be demonstrated for the chosen algorithm and topology; it is not automatic.

4.2.1 Choose the Coordination Problem Before the Algorithm

Multi-robot coordination is several problem families, not one:

Do not choose consensus for a problem that is actually allocation, or use flocking rules where a coverage guarantee is required. First name the variable to coordinate: pose, velocity, role, resource, territory, estimate, or clock.

4.3.1 Flocking: Three Local Steering Rules

Reynolds’ boids model (1987) produces flock-level motion from three local rules:

Each robot reacts only to neighbors within a region of influence defined by distance and angle. Team behavior changes when that neighborhood graph disconnects, when sensing is asymmetric, or when delay makes neighbor velocity stale. The rule names do not guarantee collision freedom; gains, limits, update timing, and geometry still matter.

4.3.2 Consensus: State the Local Update Contract

The lecture closes with the general consensus update associated with Olfati-Saber, Fax, and Murray (2007):

The function $f$ is often an averaging rule. Robot $i$ updates from its current value and the values available from its neighbors. The intended outcome is decentralized agreement: all robots converge to the same value through local interactions. Motion coordination, cooperative estimation, and synchronization all fit this form once $x_i$ is chosen appropriately.

For a simple weighted average:

$x_i[t+1]=w_{ii}x_i[t]+\sum_{j\in\mathcal{N}_i}w_{ij}x_j[t],$

with non-negative weights summing to one. The update stays within the local convex hull of received values. Convergence claims still depend on the graph and update assumptions: the network must retain enough connectivity, weights must be well formed, and delays, packet loss, or adversarial values cannot be ignored.

4.3.3 Worked Agreement Trace

Three robots start with scalar values $0$, $6$, and $12$. On a fully connected graph, let every robot replace its value with the average of all three values:

$\bar{x}=\frac{0+6+12}{3}=6.$

All three reach $6$ in one update because every node sees the whole graph and uses identical weights. On a line graph, end robots see only the center and agreement takes multiple updates. On a disconnected graph, separate components can converge internally to different values; local agreement is not global agreement.

The source lecture states exponential-rate convergence as the consensus outcome. Treat that as a property of a qualifying algorithm under its stated graph and timing assumptions, not as a promise attached to any function named consensus.