In this paper the robust motion control systems in the sliding mode framework are discussed. Due to the fact that a motion control system with n d.o.f may be mathematically formulated in a unique way as a system composed of n second order systems, design of such a system may be formulated in a unique way as a requirement that the generalized coordinates must satisfy certain algebraic constraint...

In this paper, we state the positive real lemma and the strictly positive real lemma (KYP lemma) for non-minimal realization systems. First we show the positive real lemma for stabilizable and observable systems under only the constraint on the regularity of the systems, by using the generalized algebraic Riccati equation. Moreover we show that the solution of the Lyapunov equation in the posit...

CHR is a committed-choice language consisting of guarded rules that rewrite constraints into simpler ones until they are solved. CHR can de-ne both simpliication of and propagation over user-deened constraints. Simpliication replaces constraints by simpler constraints while preserving logical equivalence. Propagation adds new constraints which are logically redundant but may cause further simpl...

In this paper we investigate methods for selecting the best algorithms in classic distributed constraint optimization problems. While these are NP-complete problems, many heuristics have nonetheless been proposed. We found that the best method to use can change radically based on the specifics of a given problem instance. Thus, dynamic methods are needed that can choose the best approach for a ...

High speed Viterbi decoder design for trellis coded modulation (TCM) is presented in this paper. It is well known that the Viterbi decoder (VD) is the dominant module for determining shortest path. We propose a pre-computation architecture incorporated with T-algorithm for VD, which can find the shortest path without degrading the decoding speed much. A general solution to derive the optimal pr...

As a NP-Complete problem, multicast routing with delay constraint is a research difficulty in routing problem. Tabu Search is artificial intelligence algorithm, which is an extension of local search algorithm and has simple realization and well properties. In this paper, an efficient algorithm based on Tabu Search for Delay-Constrained Low-Cost Multicast Routing is proposed to solve delay-const...

This letter introduces an add-on, supervisory scheme, referred to as Action Governor (AG), for discrete-time linear systems enforce exclusion-zone avoidance requirements. It does so by monitoring, and minimally modifying when necessary, the nominal control signal a constraint-admissible one. The AG operates based on set-theoretic techniques online optimization. establishes its theoretical found...

Dedicated to my long-time friend and colleague, Paul Fuhrmann, on the occasion of his 60 th birthday Abstract We show how a certain class of Hamiltonian systems give rise to diierential equations on spaces of matrices whose elements are rational functions. In particular, we reinterpret the results of Kac and van Moerbeke on the periodic Toda lattice in terms of such diierential equations and re...

this paper presents a theoretical approach to implementation of the “multi-realization of nonlinear mimo systems”. this method aims to find state-variable realization for a set of systems, sharing as many parameters as possible. in this paper a special nonlinear multi-realization problem, namely the multi-realization of feedback linearizable nonlinear systems is considered and an algorithm for ...

The general version of the bosonic harmonic oscillator realisation of bosonic q-oscillators is given. It is shown that the currently known realisation is a special case of our general solution. The investigation has been performed at the Laboratory of Theoretical Physics, JINR.