3 Classical Control Architectures for Mobile Robots

robotics

control

physical-world

3.1 Overview: Put Every Controller on Two Axes

You already know one classical robot controller. A Braitenberg vehicle wires sensed intensity to motor response, producing behavior without a map or explicit plan. This chapter does not re-teach that mature treatment. It places Braitenberg’s proximal, reactive design inside a wider architecture map and then compares the paradigms around it.

The source lecture classifies robot control along two axes:

Sensing distance: proximal versus distal. A proximal controller operates close to sensor input. A distal controller assembles named behavioral blocks such as avoid-obstacle, follow-wall, or move-to-goal.
Planning horizon: reactive versus deliberative. A reactive controller applies time-invariant rules to its current world estimate. A deliberative controller predicts future states and plans an action sequence that minimizes a metric such as collision risk, energy, or path length.

Architecture

Reactive

Deliberative

Proximal

Direct sensor-to-motor transforms, Braitenberg wiring, or a small neural controller. Fast and local; difficult to inspect as named behaviors.

A learned or optimized low-level policy with internal state and a predictive horizon. Possible, but no longer the simple classical reflex case.

Distal

Rules, motor schemas, or behavior layers composed from named blocks. Easy to connect to operational intent.

A planner selects and sequences behaviors using a model of possible future states.

The axes are independent. “Reactive” does not mean “unstructured,” and “distal” does not automatically mean “deliberative.” A motor-schema controller can combine named behaviors at every cycle without planning minutes ahead.

3.1.1 Architecture Is a Latency and Evidence Decision

Choose the architecture from the control contract:

How quickly must a hazard change the motor command?
Which internal decisions must an operator be able to inspect?
Does success depend on predicting a future sequence, or only on responding safely now?
What happens when two behaviors disagree?
Which sensor failures can make the command unsafe?

These questions are more useful than asking which paradigm is “most intelligent.” A controller that cannot meet the stopping-time budget is wrong even if it produces a sophisticated plan.

3.2 Practitioner: Build Behaviors, Then Define Their Arbitration

The simplest inspectable reactive controller is a rule set:

if left proximity sensors are active:  turn right
if right proximity sensors are active: turn left
if no proximity sensors are active:    move forward

The pseudocode hides the most important implementation question: what happens if both left and right sensors are active? Production rules need explicit priority, mutual exclusion, timeouts, and a safe default. Otherwise source order becomes accidental arbitration.

3.2.1 Potential Fields: Add Local Forces

In the potential-field paradigm associated with Khatib (1986), the goal contributes an attractive vector and obstacles contribute repulsive vectors. The command follows their sum:

$\mathbf{v}_{cmd}=\mathbf{v}_{goal}+\sum_k\mathbf{v}_{obstacle,k}.$

The method is compact and naturally reactive. Its characteristic failure is a local minimum: forces can cancel at a point that is not the goal. Narrow passages can also make repulsion dominate the useful forward component. A defensible implementation records a stuck detector and an escape policy instead of treating the summed vector as guaranteed progress.

3.2.2 Motor Schemas: Compose Named Behaviors

Motor schemas, associated with Arkin (1989), turn behaviors into modules with explicit meanings. A warehouse robot might combine:

move-to-pickup: points toward the task goal;
avoid-obstacle: pushes away from range detections;
keep-clearance: maintains aisle-wall distance;
stop-on-stale-perception: overrides motion when evidence expires.

Composition can be weighted, gated, or priority based. Whatever the mechanism, the weights and overrides are part of the safety argument. A silent numeric sum is not an operational policy until you can explain which behavior wins and why.

3.2.3 Subsumption: Let Higher Layers Suppress Lower Ones

Subsumption architecture, associated with Brooks (1986), stacks behaviors so a higher layer can suppress or inhibit a lower layer while preserving the lower layer as a working fallback.

Explore

Select new space to visit when lower-level safety and motion remain available.

Avoid obstacles

Suppress forward exploration when clearance evidence crosses the hazard threshold.

Maintain motion safety

Stop or limit actuators when perception is stale, drivers saturate, or a hard limit opens.

The stack makes priority visible. It also creates a test obligation: verify every suppression edge, including recovery when the higher-priority condition clears.

3.3 Under the Hood: From Weighted Neurons to Safe Arbitration

A small neural reactive controller maps sensor inputs $I_j$ into each neuron’s activation:

$$x_i=\sum_{j=1}^{m}w_{ij}I_j+I_0,\qquad O_i=f(x_i).$$

The source example uses $f(x)=\tanh(x)$ and connects eight sensor inputs to two motor outputs. The architecture is proximal: learned or selected weights operate close to readings. It is reactive when the current input vector alone determines the current output.

The transfer function bounds each neuron output, but it does not by itself bound the physical command. A safe deployment still needs output scaling, rate limits, saturation handling, stale-input behavior, and tests at the corners of the sensor domain.

3.3.1 One Corridor, Four Architectures

Consider a robot moving toward a loading bay while a pallet blocks part of the aisle.

Neural reactive

Range readings pass through weighted connections to left and right motor outputs. Inspect the domain coverage and command bounds.

Rule based

Named sensor conditions select turn or stop actions. Inspect overlap, priority, and hysteresis.

Potential field

Goal attraction and pallet repulsion produce a direction vector. Inspect local minima and narrow-passage behavior.

Subsumption

Obstacle avoidance suppresses goal seeking while the hazard exists. Inspect suppression, release, and fallback transitions.

The scenario has not changed; only the controller’s representation and arbitration have. That makes cross-architecture tests possible: run the same sensor traces and physical limits through each design, then compare stopping distance, command continuity, recoverability, and evidence clarity.

3.3.2 Failure Contracts by Architecture

Architecture	Evidence to log	Characteristic failure to test	Safe response
Neural reactive	normalized inputs, output activation, saturation flags	unseen or extreme input combinations	clamp command and fall back to a bounded behavior
Rule based	matched rules and winning priority	overlapping or uncovered conditions	deterministic safe default
Potential field	component vectors and summed magnitude	local minimum or oscillation	stuck detector and escape mode
Motor schema	behavior outputs, weights, gates	unsafe weight interaction	safety schema override
Subsumption	active layer and suppression edges	layer that never releases or suppresses incorrectly	timeout, explicit reset, lower-layer fallback

Architecture selection is therefore an observability decision too. If an incident review cannot reconstruct why the controller issued a command, the system lacks a usable control record even when the motion looked correct.

3.4 Summary

Proximal versus distal describes distance from raw sensing; reactive versus deliberative describes planning horizon.
Neural and Braitenberg controllers can create fast proximal reactions, while rules and motor schemas expose named behaviors.
Potential fields compose attractive and repulsive vectors but can become trapped in local minima.
Subsumption makes behavioral priority explicit through suppression and inhibition between layers.
Every architecture needs a physical command envelope, observable arbitration, and tested failure recovery.

3.5 Key Takeaway

The best control architecture is the one whose latency, arbitration, and failure behavior you can state and test. Name how sensing becomes action, how conflicts are resolved, and what takes control when the evidence is unsafe.

3.6 See Also

Mobile Robot Kinematics and the Perception-Action Loop — the motion and feedback contract these architectures control.
Braitenberg Vehicles — a mature proximal/reactive controller with hands-on examples.
Braitenberg Transfer Functions — how sensor-to-motor mappings change emergent behavior.
PID Control Theory — classical closed-loop feedback at the actuator/process level.
Multi-Robot Systems: Taxonomy, Estimation, and Coordination — the next chapter extends control from one robot to a networked team.