This video shows how one can construct an admissible set for dual-mode algorithms which have time varying targets (notionally admissible sets assume a constant target). This video is more conceptual and hence uses an inefficient solver, but MATLAB code demonstrates the principle that suitable sets which include the d.o.f., target and system state as set 'state' variables are computable with a finite number of inequalities.