Sub‐optimal switching in anti‐lock brake systems using approximate dynamic programming

Abstract

Optimal scheduling in an anti-lock brake system of ground vehicles is performed through approximate dynamic programming for reducing the stopping distance in severe braking. The proposed optimal scheduler explicitly incorporates the hybrid nature of the anti-lock brake system and provides a feedback solution with a negligible computational burden in control calculation. To this goal, an iterative scheme, called the value iteration algorithm, is used to derive the infinite horizon solution to the underlying Hamilton–Jacobi–Bellman equation. Performance of the proposed method in control of the brake system is illustrated using both linear-in-parameter neural networks and multi-layer perceptrons. Simulation results demonstrate potentials of the method.