Mobile Robotics · Study deck
Multi-Robot Systems: Taxonomy, Estimation, and Coordination
Robot teams, swarms, and robot networks address problems whose work or geography is distributed.
Motor Max is your guide for this deck.
After studying this chapter
Learning objectives
You will be able to:
- Classify a robot team by architecture, communication, and heterogeneity
- Explain how dependent relative observations cause rumor propagation in distributed estimation
- Compare coordinated motion, task allocation, coverage, flocking, and consensus mechanisms
- State a consensus update as a local-neighbor contract and identify the assumptions its convergence claim needs
Major section
Overview: A Team Adds Information Paths, Not Just Robots
Robot teams, swarms, and robot networks address problems whose work or geography is distributed.
- A team can cover more space, divide roles, continue after one unit fails, and sometimes produce performance greater than isolated individual efforts.
- Communication Explicit communication sends state that teammates cannot directly observe.
- Heterogeneity Homogeneous teams share capabilities.
Major section
Overview: A Team Adds Information Paths, Not Just Robots (continued)
A heterogeneous team can still be centrally controlled.
- An estimate made on one robot can influence another robot's estimate, a delayed message can arrive after the state it describes, and a coordinator can become a single point of failure.
- These axes are independent.
- A decentralized team can use explicit radio messages.
Major section
Overview: A Team Adds Information Paths, Not Just Robots (continued)
Implicit communication occurs when robots infer information from observable motion or environment changes.
- A homogeneous swarm can coordinate partly through observable motion.
- Information paths are short, but message count and dependency management grow quickly.
- Coordination is simple to inspect, but the center and its links become critical dependencies.
Major section
Overview: A Team Adds Information Paths, Not Just Robots (continued)
Random Mesh Each robot communicates with a changing neighborhood.
- The topology tolerates some failures but makes connectivity and convergence time-dependent.
- 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.
Major section
Practitioner: Share Relative Observations Without Counting Them Twice
Kalman filters and particle filters can be distributed by fusing relative observations of teammates with communicated position beliefs.
- Observe Robot 1 measures relative range and bearing to Robot 2.
- Exchange Robot 2 communicates its position estimate and uncertainty.
- A Kalman-filter version can perform the same conceptual fusion when its model assumptions fit.
Major section
Under the Hood: Neighbor Rules Become Team-Level Behavior
Robot $i$ has a neighbor set $\mathcal{N}_i$ determined by the current topology or a proximity rule.
- The controller then uses local states from that set rather than assuming global access.
- Separation Steer away from nearby neighbors to prevent crowding or collision.
- The function $f$ is often an averaging rule.
Major section
Under the Hood: Neighbor Rules Become Team-Level Behavior (continued)
Cohesion Steer toward the local center of neighboring positions so the group remains together.
- 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.
- Motion coordination, cooperative estimation, and synchronization all fit this form once $x_i$ is chosen appropriately.
Major section
Under the Hood: Neighbor Rules Become Team-Level Behavior (continued)
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.
- 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.
- All three reach $6$ in one update because every node sees the whole graph and uses identical weights.
Major section
Summary
The central lesson is that agreement is never created by the update equation alone.
- Multi-robot architecture, communication mode, and heterogeneity are independent taxonomy axes.
- Decentralization removes one central failure point but introduces asynchronous information, delay, overhead, and temporary sub-optimality.
- Consensus turns local-neighbor updates into agreement only when topology, weighting, timing, and integrity assumptions support convergence.
Deck summary
Key takeaways
Robot teams, swarms, and robot networks address problems whose work or geography is distributed.
- A heterogeneous team can still be centrally controlled.
- Implicit communication occurs when robots infer information from observable motion or environment changes.
- Random Mesh Each robot communicates with a changing neighborhood.
- Kalman filters and particle filters can be distributed by fusing relative observations of teammates with communicated position beliefs.
Retrieval practice
Recall check 1 of 3
Motor Max says: answer from memory, then check your reasoning.
Q1A mixed team of ground robots and drones exchanges its private battery estimates directly with nearby teammates, and each robot computes its own task choice. Which taxonomy fits?
Show answer
Answer: A Architecture, communication mode, and heterogeneity describe separate design choices and should be classified independently.
Retrieval practice
Recall check 2 of 3
Motor Max says: answer from memory, then check your reasoning.
Q2Robot A's position estimate already contains a measurement from Robot B. Later B receives A's estimate and treats it as independent new evidence. What is the principal failure?
Show answer
Answer: A Distributed estimates need lineage.
Retrieval practice
Recall check 3 of 3
Motor Max says: answer from memory, then check your reasoning.
Q3A consensus update works within two disconnected groups, but no messages ever cross between them. What outcome is possible?
Show answer
Answer: A Consensus is an information-flow result.
Print reference
Answers
Answer key.
- A · Architecture, communication mode, and heterogeneity describe separate design choices and should be classified independently.
- A · Distributed estimates need lineage.
- A · Consensus is an information-flow result.