Results 51 to 60 of about 6,671 (260)
Equivariant Semidefinite Lifts of Regular Polygons [PDF]
Mathematics of Operations Research, 2017 Given a polytope P ⊂ ℝn, we say that P has a positive semidefinite lift (psd lift) of size d if one can express P as the projection of an affine slice of the d × d positive semidefinite cone. Such a representation allows us to solve linear optimization problems over P using a semidefinite program of size d and can be useful in practice when d is much ...
Hamza Fawzi +2 more
openaire +4 more sources
Advanced Materials Technologies, EarlyView.A patient‐specific, imaging‐guided aid enables precise and reproducible drug delivery to the inner ear. By guiding therapeutic agents directly to the round window niche, this approach reduces variability in drug localization, improves delivery safety, and addresses a critical bottleneck in inner ear therapy, offering a scalable strategy for precision ...
Yanjing Luo +4 more
wiley +1 more source
Nonlocomotory Robotic Strategies for Dynamic Rotation Control in Terrestrial Robots: A Review
Advanced Robotics Research, EarlyView.Terrestrial robots increasingly require rapid body rotation to maintain stability and agility in complex environments. This review shows nonlocomotory rotational control strategies that operate without ground contact, including reaction wheels, tails, bars, limbs, and thrusters.
Y. Liang +14 more
wiley +1 more source
Edge-weighted contact representations of planar graphs
Journal of Graph Algorithms and Applications, 2013 We study contact representations of edge-weighted planar graphs, where vertices are represented as interior-disjoint rectangles or rectilinear polygons and edges are represented as contacts of vertex boundaries whose contact lengths represent the edge ...
Martin Nöllenburg +2 more
doaj +1 more source
Packing ovals in optimized regular polygons [PDF]
Journal of Global Optimization, 2019 Submitted for publication November ...
Frank J. Kampas +2 more
openaire +2 more sources
Advanced Robotics Research, EarlyView.Visual teach‐and‐repeat (VTR) navigation allows robots to learn and follow routes without building a full metric map. We show that navigation accuracy for VTR can be improved by integrating a topological map with error‐drift correction based on stereo vision.
Fuhai Ling, Ze Huang, Tony J. Prescott
wiley +1 more source
When is a polygon circumscribing a regular polygon again regular?
, 1993 Let \({\mathcal A}\) be a regular \(n\)-gon with vertices \(A_ 1,A_ 2,\ldots,A_ n\) and edge-length =1, which is inscribed in \({\mathcal P}\), an \(n\)-gon with vertices \(P_ 1,P_ 2,\ldots,P_ n\), in such a way that \(A_ 1P_ 1=A_ 2P_ 2=\cdots=A_ nP_ n\). The main results of this paper are given in the following theorem. Theorem 1. If \(n=3\) or 4 or \(
Bennish, J., Gau, Y.D.
openaire +2 more sources
Compliant Pneumatic Feet with Real‐Time Stiffness Adaptation for Humanoid Locomotion
Advanced Robotics Research, EarlyView.A compliant pneumatic foot with real‐time variable stiffness enables humanoid robots to adapt to changing terrains. Using onboard vision and pressure control, the foot modulates stiffness within each gait cycle, reducing impact forces and improving balance. The design, cast in soft silicone with embedded air chambers and Kevlar wrapping, offers durable,
Irene Frizza +3 more
wiley +1 more source
Efficient and Robust Standing Postures of Quadruped Robots
Advanced Robotics Research, EarlyView.A calibrated static framework estimates load, optimizes torques, and adapts posture so quadruped robots stand efficiently and robustly under external payloads, achieving up to 50% lower torque demand. Inspired by the natural posture adjustments of animals under external loading, this article presents an optimization‐based framework for minimizing joint
Mohamad Kanaan +5 more
wiley +1 more source
An inequality for regular near polygons
European Journal of Combinatorics, 2005 Let $G$ denote a near-polygon distance-regular graph with diameter $d\geq 3$, valency $k$ and intersection numbers $a_1>0$, $c_2>1$. Let $θ_1$ denote the second largest eigenvalue for the adjacency matrix of $G$. We show $θ_1$ is at most $(k-a_1-c_2)/(c_2-1)$.
Paul M. Terwilliger, Chih-Wen Weng
openaire +2 more sources