Results 61 to 70 of about 979 (179)
Dynamic Event‐Triggered Robust Model Predictive Control for Quadrotor Trajectory Tracking
International Journal of Robust and Nonlinear Control, Volume 36, Issue 6, Page 3676-3688, April 2026.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
International Journal of Robust and Nonlinear Control, Volume 36, Issue 5, Page 2907-2926, 25 March 2026.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
Event‐Triggered Saturating Control for Synchronization of Lur'e Type Complex Dynamic Networks
International Journal of Robust and Nonlinear Control, Volume 36, Issue 4, Page 2184-2198, 10 March 2026.ABSTRACT This article addresses the problem of synchronizing discrete‐time Lur'e type complex dynamic networks (CDNs) via dynamic event‐triggered control. In particular, it is considered that the control signal of each node is subject to input saturation. Using the Lyapunov Stability Theory, properties of slope‐restricted nonlinearities, and the linear
C. Lisbôa +3 more
wiley +1 more source
International Journal for Numerical Methods in Biomedical Engineering, Volume 42, Issue 3, March 2026.The haemodynamic environment of generic calcific and rheumatic aortic valves of various severities is analysed through the use of 3D FSI modelling techniques. For the same severity and similar flow rates, the rheumatic valves offer higher resistance to the flow of blood compared to the calcific valves.
Lindi Grobler Kock +5 more
wiley +1 more source
Equivariant toric geometry and Euler–Maclaurin formulae
Communications on Pure and Applied Mathematics, Volume 79, Issue 3, Page 451-557, March 2026.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
Journal of Morphology, Volume 287, Issue 3, March 2026.1. The skull features a broad, dorsoventrally flattened frontal region articulating with an elongated upper jaw that is complemented by the mandible's downward bend along its proximal half. 2. The low mechanical advantage in the mandible is attributed to the reduced and shallow insertion areas of the adductor muscles, which are positioned close to the ...
Oscar Aldana Ardila, Caio J. Carlos
wiley +1 more source
A convex polyhedron without Rupert's property
A three-dimensional convex body is said to have Rupert's property if its copy can be passed through a straight hole inside that body. In this work we construct a polyhedron which is provably not Rupert, thus we disprove a conjecture from 2017. We also find a polyhedron that is Rupert but not locally Rupert.
Steininger, Jakob, Yurkevich, Sergey
openaire +2 more sources
The convex hull of a convex space curve with four vertices
Bulletin of the London Mathematical Society, Volume 58, Issue 3, March 2026.Abstract We obtain an upper bound for the volume of the convex hull of a simple closed Frenet curve with exactly four vertices, that is, four points of vanishing torsion, and lying on the boundary of its convex hull. Moreover, we show that the upper bound is attained when the curve intersects every plane in at most four points, a condition studied by ...
Jakob Bohr +2 more
wiley +1 more source
Experimental Behavior of Jurik's Nearest Point Approach Algorithm for Linear Programming
Communications, 2010 T. Jurik recently proposed a new algorithm for solving linear programming problems. The algorithm is iterative, finding points on the boundary of the problem's convex polyhedron. Global convergence of the algorithm is an open question.
Ondrej Such
doaj +1 more source
Volume-Increasing Inextensional Deformations of Platonic Polyhedra
MathematicsIt is known that the volume of a convex polyhedron can be increased by suitable isometric deformation of its surface resulting in a non-convex shape. Deformation patterns and the associated enclosed volumes of the Platonic polyhedra were theoretically ...
András Lengyel
doaj +1 more source