Results 31 to 40 of about 19,164 (129)
Solving for Blameless and Optimal Control Under Prioritized Safety Constraints
Summary of the proposed method for solving for blameless and optimal control sequences. ABSTRACT In many safety‐critical optimal control problems, users may request multiple safety constraints that are jointly infeasible due to external factors such as subsystem failures, unexpected disturbances, or fuel limitations.
Natalia Pavlasek +3 more
wiley +1 more source
ABSTRACT This paper develops a framework for designing output feedback controllers for constrained linear parameter‐varying systems that experience persistent disturbances. We specifically propose an incremental parameter‐varying output feedback control law to address control rate constraints, as well as state and control amplitude constraints.
Jackson G. Ernesto +2 more
wiley +1 more source
ABSTRACT This work proposes a new framework for stabilizing uncertain linear systems and for determining robust periodic invariant sets and their associated control laws for constrained uncertain linear systems. Necessary and sufficient conditions for stabilizability by periodic controllers are stated and proven using finite step Lyapunov functions for
Yehia Abdelsalam +2 more
wiley +1 more source
Combinatorial Space Tiling [PDF]
The present article studies combinatorial tilings of Euclidean or spherical spaces by polytopes, serving two main purposes: first, to survey some of the main developments in combinatorial space tiling; and second, to highlight some new and some old open ...
Schulte, Egon
core
UBVH: Unified Bounding Volume and Scene Geometry Representation for Ray Tracing
Abstract Bounding volume hierarchies (BVHs) are currently the most common data structure used to accelerate ray tracing. The existing BVH methods distinguish between the bounding volume representation associated with the interior BVH nodes and the scene geometry representation associated with leaf nodes.
M. Káčerik, J. Bittner
wiley +1 more source
Faces of Birkhoff Polytopes [PDF]
The Birkhoff polytope B(n) is the convex hull of all (n x n) permutation matrices, i.e., matrices where precisely one entry in each row and column is one, and zeros at all other places.
Paffenholz, Andreas
core
On positivity of Ehrhart polynomials
Ehrhart discovered that the function that counts the number of lattice points in dilations of an integral polytope is a polynomial. We call the coefficients of this polynomial Ehrhart coefficients, and say a polytope is Ehrhart positive if all Ehrhart ...
Alexander Postnikov +48 more
core +1 more source
Data‐Based Refinement of Parametric Uncertainty Descriptions
ABSTRACT We consider dynamical systems with a linear fractional representation involving parametric uncertainties which are either constant or varying with time. Given a finite‐horizon input‐state or input‐output trajectory of such a system, we propose a numerical scheme which iteratively improves the available knowledge about the involved constant ...
Tobias Holicki, Carsten W. Scherer
wiley +1 more source
Minimum energy configurations for interacting dipoles in simplex, orthoplex and hypercube crystals
Polytope structures composed by classical dipoles living on their vertices in Rd present a unique opportunity to venture beyond the conventional paradigm of crystalline many-body physics, as well as to discuss the energetics of the global minimum energy ...
Orion Ciftja +2 more
doaj +1 more source
Unimodality Problems in Ehrhart Theory
Ehrhart theory is the study of sequences recording the number of integer points in non-negative integral dilates of rational polytopes. For a given lattice polytope, this sequence is encoded in a finite vector called the Ehrhart $h^*$-vector. Ehrhart $h^*
A. Stapledon +45 more
core +1 more source

