Showing papers on "Binary constraint published in 1979"
TL;DR: A method of synthesizing low-interaction controllers using function optimization is given, finding controllers found by minimizing an existing scalar measure of interaction subject to the constraint that the closed-loop system is decoupled in the steady-state.
Abstract: A method of synthesizing low-interaction controllers using function optimization is given. The controllers are found by minimizing an existing scalar measure of interaction subject to the constraint that the closed-loop system is decoupled in the steady-state. The constraint is incorporated in such a way that the resulting optimization problem is unconstrained. Numerical examples are included.
5 citations
1 Dec 1979
Proceedings Article•
20 Aug 1979TL;DR: Analytically and experimentally show that a lookahead procedure called forward checking which employs the most likely to fail principle performs better than standard backtracking, Ullman's, Waltz's, Mackworth's, and Haralick's discrete relaxation in all cases tested, and better than Gaschnig's backmarking in the larger problems.
Abstract: In this paper we explore the number of consistency checks made by a tree search in order to solve binary constraint satisfaction problems. We show analytically and experimentally that the two principles of first trying the places most likely to fail and remembering what has been done to avoid repeating the same mistake twice improve the standard backtracking search. We experimentally show that a lookahead procedure called forward checking (to remember the future) which employs the most likely to fail principle performs better than standard backtracking, Ullman's, Waltz's, Mackworth's, and Haralick's discrete relaxation in all cases tested, and better than Gaschnigs backmarking in the larger problems.