This paper shows that the problem of control under linear symmetrical input constraints of linear stabilizable systems can always be solved by restricting the set of admissible initial states to a polyhedral domain of the state space. This result can be obtained by an appropriate closed-loop eigenstructure assignment. Two subsequent problems are then addressed: the maximal size of the domain of...

In this paper, we propose a consensus algorithm with input constraints for traffic light signals in transit signal priority (TSP). TSP ensures control strategy of traffic light signals can be adjusted and applied according to the real-time traffic status, and provides priority for buses. We give the convergence conditions of the consensus algorithms with and without input constraints in TSP res...

Many CSPs can be effectively represented and efficiently solved using matrix models, in which the matrices may have symmetry between their rows and/or columns. Eliminating all such symmetry can be very costly as there are in general exponentially many symmetries. Cost-effective methods have been proposed to break much of the symmetry, if not all. In this paper, we continue with this line of res...

We review research on the ̄uency heuristic as a basis for the subjective experience of familiarity. Then, we explore the links between the construct of ̄uency and the automatic versus consciously controlled memory processes that are estimated using the process dissociation procedure, and the phenomenological experiences studied using ``Remember'' and ``Know'' judgements. Although the ̄uency tha...

This article considers the stochastic optimal control of discrete-time linear systems subject to (possibly) unbounded stochastic disturbances, hard constraints on the manipulated variables, and joint chance constraints on the states. A tractable convex second-order cone program (SOCP) is derived for calculating the receding-horizon control law at each time step. Feedback is incorporated during ...

This paper is concerned with the problem of design and implementation a robust adaptive control strategy for flexible joint electrically driven robots (FJEDR), while considering to the constraints on the actuator voltage input. The control design procedure is based on function approximation technique, to avoid saturation besides being robust against both structured and unstructured uncertaintie...

In this paper we express nonlinearity requirements in terms of soft global n-ary constraints. We describe a method to project global nonlinearity constraints into redundant lowerarity hard constraints. The nonlinearity constraints apply to the inputs and outputs of discrete functions f : Z2n → Z2m mapping n-bit inputs to m-bit outputs, n > m. No output bit (or linear function on a subset of out...

Rational choice when preferences are not required to be transitive and complete has been discussed in the literature for years. In this article transitivity and completeness of the preference relation is also not assumed. It will be shown that nevertheless the existence of a competitive equilibrium can be proven when those properties are replaced by a domination property which allows that there...

We present a comprehensive study of the use of value precedence constraints to break value symmetry. We first give a simple encoding of value precedence into ternary constraints that is both efficient and effective at breaking symmetry. We then extend value precedence to deal with a number of generalizations like wreath value and partial interchangeability. We also show that value precedence is...