An approach to deal with interval linear equations is to reduce the problem into solving several linear (or nonlinear) equations (or inequalities). To obtain characterations of the equations the paper gives a necessar...
详细信息
ISBN:
(纸本)9783037853726
An approach to deal with interval linear equations is to reduce the problem into solving several linear (or nonlinear) equations (or inequalities). To obtain characterations of the equations the paper gives a necessary condition of tolerance solutions of interval linear equations by means of nonlinearinequalities. Based on the necessary condition, a sufficience condition for nonexistence of tolerance solutions of the equations is given by use of the well-known Farkas theorem.
Based on predictive control principle of receding optimization, the infinite time domain "min-max" optimization problems are converted into convex programming problems by Lyapunov stable theory and linear ma...
详细信息
ISBN:
(纸本)9783037853849
Based on predictive control principle of receding optimization, the infinite time domain "min-max" optimization problems are converted into convex programming problems by Lyapunov stable theory and linear matrix inequality (LMI). The sufficient conditions for the robust stability of the uncertain time-delay system are given. Finally, the simulation results illustrate the effectiveness of the proposed methods.
This paper presents conditions for design of observers for nonlinear systems represented by a Takagi-Sugeno-type model, whose state variables take only nonnegative values at all times t for any nonnegative initial sta...
详细信息
This paper presents conditions for design of observers for nonlinear systems represented by a Takagi-Sugeno-type model, whose state variables take only nonnegative values at all times t for any nonnegative initial state (positive systems). The derived observers have a Takagi-Sugeno structure and ensure the nonnegativity of the observed states. The conditions are derived as Linear programming and Linear Matrix inequalities, and tested on a simulated practical problem.
In this paper a filled function method is suggested for solving finite dimensional variational inequality problems over sets defined by systems of equalities and inequalities. Firstly, based on the Karush-Kuhn-Tucker ...
详细信息
In this paper a filled function method is suggested for solving finite dimensional variational inequality problems over sets defined by systems of equalities and inequalities. Firstly, based on the Karush-Kuhn-Tucker (KKT) conditions of the variational inequality problems, the original problem is converted into a corresponding constrained optimization problem. Subsequently, a new filled function with one parameter is proposed for solving the constrained optimization problem. Some properties of the filled function are studied and discussed. Finally, an algorithm based on the proposed filled function for solving variational inequality problems is presented. The implementation of the algorithm on several test problems is reported with numerical results.
This paper examines the problem of designing a nonlinear robust state feedback controller for uncertain polynomial discrete-time systems. In general, this is a challenging controller design problem due to the fact tha...
详细信息
This paper examines the problem of designing a nonlinear robust state feedback controller for uncertain polynomial discrete-time systems. In general, this is a challenging controller design problem due to the fact that the relation between Lyapunov function and the control input is not jointly convex, hence, this problem cannot be solved by a semidefinite programming (SDP). In this paper, a novel approach is proposed, where an integral action is incorporated into the controller design so that a convex solution to the problem can be rendered. Based on the sum of squares (SOS) approach, sufficient conditions for the existence of a nonlinear state feedback controller for polynomial discrete-time systems are given in terms of solvability of polynomial matrix inequalities (PMIs), which can be solved by the recently developed SOS solver. Numerical examples are provided to demonstrate the validity of this integral action approach.
In this paper, a numerical method (termed, E47 algorithm) based on linear variationalinequalities (LVI) is presented and investigated to solve quadratic programming (QP) problems which are simultaneously subject to l...
详细信息
In this paper, some properties of the filled function are given without Lipchitz continuity. Further, we propose a new algorithm by filled function method. The implementation of the algorithm on several test problems ...
详细信息
ISBN:
(纸本)9783642224171
In this paper, some properties of the filled function are given without Lipchitz continuity. Further, we propose a new algorithm by filled function method. The implementation of the algorithm on several test problems is reported with numerical results.
This paper presents the latest result that the minimum-effort redundancy resolution of robot manipulators with joint physical limits is unified into a quadratic-programming (QP) problem formulation with different coef...
详细信息
This paper deals with multi-robots grasping problem. We present an optimal force distribution strategy for holding and manipulating objects by multiples manipulators. The force distribution issue is formulated in term...
详细信息
ISBN:
(纸本)9788890372476
This paper deals with multi-robots grasping problem. We present an optimal force distribution strategy for holding and manipulating objects by multiples manipulators. The force distribution issue is formulated in terms of a nonlinearprogramming problem under equality and inequality constraints. In particular, the friction constrains are transformed from non linear inequalities into a combination of linear equalities and linear inequalities. As a result, the original nonlinear constrained programming problem is then transformed into a quadratic optimization problem. The dynamical model of multi-robot cooperation has been used for determining force control distribution through proportional derivative (PD) controller. Simulation has been performed and some results are presented and discussed.
The paper treats the Multi-Objective programming problem with a large composite set of (linear and nonlinear) objective functions, the domain of feasible solutions being defined by a set of linear equalities/inequalit...
详细信息
ISBN:
(纸本)9783642184659
The paper treats the Multi-Objective programming problem with a large composite set of (linear and nonlinear) objective functions, the domain of feasible solutions being defined by a set of linear equalities/inequalities representing a large scale problem. One constructs a preferred solution i.e. a non-dominated solution chosen via extending the decision-making framework. A feasible approach, for this class of problems, is to use a solver for the Linear programming problems and a solver for Multiple Attribute Decision Making problems in combination with Parallel and Distributed Computing techniques based on a GRID configuration.
暂无评论