Results 21 to 30 of about 181 (122)
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
Dynamic Event‐Triggered Robust Model Predictive Control for Quadrotor Trajectory Tracking
ABSTRACT This paper addresses the trajectory tracking problem for a full‐state quadrotor subject to physical model constraints and unknown external disturbances. A robust tube‐based model predictive control (MPC) approach is successfully applied to the system, which is subject to bounded disturbances and hard constraints.
Ali Can Erüst +2 more
wiley +1 more source
ABSTRACT This study presents a novel Distributed Robust Adaptive Model Predictive Control (DRAMPC) for tracking in multi‐agent systems. The framework is designed to work with dynamically coupled subsystems and limited communication, which is restricted to local neighborhoods.
Fabio Faliero +2 more
wiley +1 more source
Equivariant toric geometry and Euler–Maclaurin formulae
Abstract We first investigate torus‐equivariant motivic characteristic classes of toric varieties, and then apply them via the equivariant Riemann–Roch formalism to prove very general Euler–Maclaurin‐type formulae for full‐dimensional simple lattice polytopes.
Sylvain E. Cappell +3 more
wiley +1 more source
The DNA of Calabi–Yau Hypersurfaces
Abstract Genetic Algorithms are implemented for triangulations of four‐dimensional reflexive polytopes, which induce Calabi–Yau threefold hypersurfaces via Batyrev's construction. These algorithms are shown to efficiently optimize physical observables such as axion decay constants or axion–photon couplings in string theory compactifications.
Nate MacFadden +2 more
wiley +1 more source
A tropical approach to rigidity: Counting realisations of frameworks
Abstract A realisation of a graph in the plane as a bar‐joint framework is rigid if there are finitely many other realisations, up to isometries, with the same edge lengths. Each of these finitely many realisations can be seen as a solution to a system of quadratic equations prescribing the distances between pairs of points.
Oliver Clarke +6 more
wiley +1 more source
Recognising polytopical cell complexes and constructing projection polyhedra
A cell complex \(C\) in Euclidean \(d\)-space \(E^d\) is a face-to-face partition of \(E^d\) into finitely many convex \(j\)-dimensional polyhedra, called the \(j\)-faces of \(C\). The problems of deciding whether \(C\) is the vertical projection of the set of faces bounding a convex polyhedron \(P(C)\) in \(E^{d+1}\), resp.
openaire +2 more sources
Toric amplitudes and universal adjoints
Abstract A toric amplitude is a rational function associated with a simplicial polyhedral fan. The definition is inspired by scattering amplitudes in particle physics. We prove algebraic properties of such amplitudes and study the geometry of their zero loci. These hypersurfaces play the role of Warren's adjoint via a dual volume interpretation.
Simon Telen
wiley +1 more source
Additive Manufacturing of Negative Thermal Expansion Metamaterials Using Steels
Architected lattices with tunable negative thermal expansion are fabricated from common steels using laser powder bed fusion metal additive manufacturing. Optimized multimaterial interfaces and geometry‐driven design produce robust, defect‐minimized structures that remain dimensionally stable up to 300 °C, enabling scalable solutions for thermal ...
Devashish Dubey +4 more
wiley +1 more source
Benchmarking Contact Detection Algorithms Used in Polyhedral Particle System
ABSTRACT A critical assessment of contact detection algorithms routinely used for simulating convex polyhedra in the Discrete Element Method is presented herein. Specifically, we focus on accuracy and computational efficiency and discuss the advantages and limitations of four different algorithms: the coupled Gilbert–Johnson–Keerthi – Expanding ...
Yuval Keissar +2 more
wiley +1 more source

