Sciweavers

16 search results - page 1 / 4
» Describing convex semialgebraic sets by linear matrix inequa...
Sort
View
SAS
2005
Springer
132views Formal Methods» more  SAS 2005»
13 years 11 months ago
Generation of Basic Semi-algebraic Invariants Using Convex Polyhedra
A technique for generating invariant polynomial inequalities of bounded degree is presented using the abstract interpretation framework. It is based on overapproximating basic semi...
Roberto Bagnara, Enric Rodríguez-Carbonell,...
AUTOMATICA
2011
12 years 9 months ago
A hierarchy of LMI inner approximations of the set of stable polynomials
Exploiting spectral properties of symmetric banded Toeplitz matrices, we describe simple sufficient conditions for positivity of a trigonometric polynomial formulated as linear ma...
Mustapha Ait Rami, Didier Henrion
CDC
2008
IEEE
291views Control Systems» more  CDC 2008»
13 years 7 months ago
Structured semidefinite representation of some convex sets
Linear matrix Inequalities (LMIs) have had a major impact on control but formulating a problem as an LMI is an art. Recently there is the beginnings of a theory of which problems ...
J. William Helton, Jiawang Nie
ICRA
1999
IEEE
186views Robotics» more  ICRA 1999»
13 years 10 months ago
Grasp Analysis as Linear Matrix Inequality Problems
Three fundamental problems in the study of grasping and dextrous manipulation with multifingered robotic hands are as follows. a) Given a robotic hand and a grasp characterized by ...
Li Han, Jeffrey C. Trinkle, Zexiang Li