output
19992026
most citedCellular-Connected UAVs over 5G: Deep Reinforcement Learning for Interference Management

464 citations

Showing math.OCShow all

41 papers · 1 filter

math.OC2026

Implementation of Time-Varying Controllers for a Nonholonomic Mobile Robot: Experimental Studies

Alexander Zuyev, Victoria Grushkovskaya, Sebastian Eisner

We consider a kinematic model of a wheeled mobile robot controlled by translational and angular velocities. For this class of nonholonomic systems, a family of time-varying feedbac…

math.OC2025★ 1 cited

Model-free source seeking of exponentially convergent unicycle: theoretical and robotic experimental results

Rohan Palanikumar, Ahmed A. Elgohary, Victoria Grushkovskaya +1

This paper introduces a novel model-free, real-time unicycle-based source seeking design. This design autonomously steers the unicycle dynamic system towards the extremum point of…

math.OC2025

A Model-Free Extremum Seeking Controller with Application to Tracking a Nonlinear Chemical Reaction

Alexander Zuyev, Victoria Grushkovska

In this paper, we develop the extremum-seeking approach to generate admissible trajectories in a neighborhood of a given reference curve in the state space. The cost function of th…

math.OC2025

The Augmented Mixing Method: Computing High-Accuracy Primal-Dual Solutions to Large-Scale SDPs via Column Updates

Daniel Brosch, Jan Schwiddessen, Angelika Wiegele

The Burer-Monteiro factorization has become a powerful tool for solving large-scale semidefinite programs (SDPs), enabling recently developed low-rank solvers to tackle problems pr…

math.OC2025★ 1 cited

On classical solutions in the stabilization problem for nonholonomic control systems with time-varying feedback laws

Alexander Zuyev, Victoria Grushkovskaya

We consider the stabilization problem for driftless control-affine systems under the bracket-generating condition. In our previous works, a class of time-varying feedback laws has…

math.OC2024

The exact subgraph hierarchy and its vertex-transitive variant for the stable set problem for Paley graphs

Elisabeth Gaar, Dunja Pucher

The stability number of a graph, defined as the cardinality of the largest set of pairwise non-adjacent vertices, is NP-hard to compute. The exact subgraph hierarchy (ESH) provides…