Sciweavers

85 search results - page 2 / 17
» Feasible Region Approximation Using Convex Polytopes
Sort
View
ICRA
2006
IEEE
141views Robotics» more  ICRA 2006»
15 years 5 months ago
Computing 3-legged Equilibrium Stances in Three-dimensional Gravitational Environments
— Quasistatic multi-legged locomotion consists of a sequence of equilibrium postures where the mechanism supports itself against gravity while moving free limbs to new positions....
Yizhar Or, Elon Rimon
FOCM
2010
97views more  FOCM 2010»
14 years 10 months ago
Self-Concordant Barriers for Convex Approximations of Structured Convex Sets
We show how to approximate the feasible region of structured convex optimization problems by a family of convex sets with explicitly given and efficient (if the accuracy of the ap...
Levent Tunçel, Arkadi Nemirovski
AUTOMATICA
2007
129views more  AUTOMATICA 2007»
14 years 11 months ago
Robust control of polytopic systems by convex optimization
— Robust control synthesis of linear time-invariant SISO polytopic systems is investigated using the polynomial approach. A convex set of all stabilizing controllers for a polyto...
Alireza Karimi, Hamid Khatibi, Roland Longchamp
81
Voted
APPROX
2004
Springer
113views Algorithms» more  APPROX 2004»
15 years 5 months ago
Computationally-Feasible Truthful Auctions for Convex Bundles
In many economic settings, convex figures on the plane are for sale. For example, one might want to sell advertising space on a newspaper page. Selfish agents must be motivated ...
Moshe Babaioff, Liad Blumrosen
FSS
2010
111views more  FSS 2010»
14 years 10 months ago
The geometry of consonant belief functions: Simplicial complexes of necessity measures
In this paper we extend the geometric approach to the theory of evidence in order to include the class of necessity measures, represented on a finite domain of “frame” by con...
Fabio Cuzzolin