Searcharxiv⌕ Search

arXiv subjects

Panagiotis Tsiotras

Publications and source records attributed to Panagiotis Tsiotras.

At least 19 recordsLinked to original sources

Collaborative Navigation and Exploration with $β$-Sparse Gaussian Processes

Collaborative navigation of heterogeneous robots in unknown environments poses significant challenges due to sensing, communication, and computational limitations. In this work, a lead robot navigates toward a target with the assistance of a mobile sensor robot (e.g., an airborne drone), whose task is to explore the environment and communicate relevant map information under bandwidth constraints. We propose a framework in which the sensor determines both which map regions to transmit and which navigation action to execute online, while also predicting unexplored regions of the environment. To this end, we present $β$-Sparse Gaussian Processes, a variational sparse Gaussian Process (GP) model for task-aware inducing point selection under cardinality constraints. Furthermore, we develop an action-selection strategy that balances task relevance with exploration. Simulations on Mars and Earth maps show that the proposed framework outperforms all considered bandwidth-constrained baselines, reducing accumulated path cost by approximately 35% compared to no communication, while decreasing transmitted information by 94% relative to the full-information GP baseline. The results further highlight the benefits of GP-based map prediction over methods without prediction, as well as the advantages of navigation-aware region selection over approaches that do not prioritize task-relevant regions.

cs.RO↗

Lie Group Structure of Six Degree-of-Freedom Rigid-Body Uncertainty Representation and Propagation

For six-degree-of-freedom rigid-body motion, the choice of Lie-group structure affects both how well the group-theoretic mean and covariance represent the state distribution and how accurately these moments are propagated. A quaternion-based, left-trivialized semidirect-product formulation of the velocity phase space is developed for the actuated body-frame dynamics, with closed-form group operations and Jacobians that avoid matrix-group embeddings. We derive the controlled stochastic dynamics and establish that the direct- and semidirect-product formulations describe the same physical process under the specified noise model. Since the semidirect exponential coordinates account for frame changes between body twists at different poses, they capture pose--twist coupling more naturally. A lunar powered-descent experiment assesses low-order moment representations of uncertainty and propagation performance under the proposed group structure using two distinct algorithms. Compared with direct-product formulations and a linearized baseline, the proposed structure improves the representation of the banana-shaped body-velocity distribution using group-theoretic moments, yields more consistent propagated moments, and produces distribution approximations that agree more closely with the Monte Carlo reference. In this experiment, changing the group structure accounts for most of the observed improvement, highlighting the practical value of the proposed semidirect-product formulation.

eess.SY↗

DiSKO: Distribution Steering for Nonlinear Systems using the Koopman Operator

This paper studies the problem of data-driven covariance steering for stochastic, nonlinear dynamical systems. We utilize Koopman operator theory to learn, directly from data, an approximate linear representation of the nonlinear dynamics in a lifted space of observable functions of the state. By exploiting this linear model, we design controllers for the mean and covariance of the underlying nonlinear system by utilizing linear distribution steering algorithms. To account for approximation errors in the learned dynamics and the ambiguity in the disturbance distribution induced in the lifted space, we formulate the problem as a distributionally robust covariance steering problem. Furthermore, we leverage a deep neural network (DNN) to simultaneously learn the Koopman observables and the linear model parameters, thus eliminating the need for manual observables basis selection while also reducing the dimensionality of the lifted representation. Additionally, we can promote desirable model properties, such as stability, during DNN training. We demonstrate the effectiveness of the proposed framework via numerical simulations.

eess.SY↗

Nonlinear Stochastic Optimal Control and Optimal Stopping using the Fokker-Planck Transformation

In this paper, we develop a theoretical framework for nonlinear stochastic optimal control problems with optimal stopping by establishing a density-based deterministic representation of the underlying diffusion. For state-independent diffusion, we rewrite the controlled Fokker-Planck equation as a continuity equation driven by a score-corrected velocity field, yielding a deterministic characteristic dynamics that reproduces the marginal law of the stochastic system. Leveraging Stein-type identities, we show that the associated distributional dynamic programming equation admits the same second-order differential operator as the distributional stochastic Hamilton-Jacobi-Bellman formulation. Building on this representation, we formulate an optimal control problem with state-dependent terminal-time assignment and terminal distributional constraints and derive the first-order necessary conditions using variational analysis. We present the conditions both for a common terminal time and for the general case of state-dependent stopping.

math.OC↗

Lifted Schrödinger Bridges for Gaussian Mixture Endpoints: Projection Gaps and Path-Space Obstructions

We study stochastic density control between Gaussian-mixture endpoint distributions under Brownian prior dynamics. Since the direct Schrödinger bridge between Gaussian mixtures is generally not available in closed form, we introduce a lifted path-space construction in which each trajectory is augmented with a source--target component label. Consequently, the problem decomposes into Gaussian component-to-component Schrödinger bridges with explicit marginal, drift, and cost formulas, while the mixture-level assignment reduces to a finite-dimensional entropic coupling problem with a Sinkhorn scaling form. We then analyze the projection obtained by discarding or forgetting the label. By construction, the projected law satisfies the original Gaussian-mixture endpoint constraints, but its relative entropy generally differs from the lifted relative entropy by a nonnegative conditional label-information gap. This gap reveals a path-space obstruction: the lifted optimizer cannot, in general, be identified with the direct unlabeled Schrödinger bridge after projection. We also derive the posterior-averaged Markov drift associated with the projected marginal flow, prove a kinetic-energy upper bound, and identify a common path-potential condition under which the projection gap vanishes. Several numerical illustrations showing density and shape control are recorded for a self-contained exposition.

math.OC↗

State estimation for a hybrid rigid-continuum space manipulator system

Spacecraft-mounted robotic manipulators can support long-term operability of orbiting assets by conducting tasks such as on-orbit assembly, repair, upgrade, and refueling. In this context, the integration of continuum/soft robotic mechanisms into space manipulator designs promises to reduce stowage volume and mass, as well as to improve operational safety through the inherent mechanical compliance of soft structures. This work presents a novel state reconstruction pipeline for a hybrid soft-rigid space manipulator, in which the distal link is a tendon-driven continuum robot. The estimation problem is formulated as a maximum a posteriori (MAP) inference problem over the hybrid manipulator's configuration, conditioned on discrete, noisy measurements from joint encoders and a vision-based sensing pipeline. The resulting soft-constrained optimization problem is transcribed as a factor graph, providing a compact representation for fusing heterogeneous measurements with the rigid-soft kinematic model. Furthermore, the adoption of the Geometric Variable Strain (GVS) approach yields a minimum-order parameterization of the configuration, a property expected to facilitate model-based feedback control design in future work. The proposed implementation is validated in simulation on a closed-loop trajectory where, for better realism, position measurements for the continuum link are obtained by means of a simulated visual pipeline leveraging synthetic photorealistic images. The state reconstruction accuracy and computational performance confirm the potential of the proposed framework for hybrid soft-rigid robotic applications in orbit.

cs.RO↗

Asymmetric-Information Resource Allocation Games: An LP Approach to Purposeful Deception

In this work, we introduce the Deceptive Resource Allocation Game (DRAG), which studies purposeful deception within a Bayesian game framework. In DRAG, a Defender allocates resources across the true asset and several decoys to influence an Attacker's beliefs and actions, with the goal of diverting the Attacker away from the true asset. We seek to characterize purposeful deception, whereby the Defender deceives only when doing so improves its performance. To this end, we solve for the Perfect Bayesian Nash Equilibrium (PBNE) of the corresponding game. We show that, despite the coupled belief-policy interdependence, the problem admits an efficient, non-iterative linear programming formulation. Numerical results demonstrate that the resulting policies naturally balance effective allocation and belief manipulation, giving rise to purposeful and emergent deceptive behaviors.

cs.GT↗

Factor Graph-Based Continuum Robot State Estimation with Magnus Expansion Priors

Reconstructing the shape of continuum manipulators from sparse, noisy sensor data is a challenging task, owing to the infinite-dimensional nature of such systems. Existing approaches broadly trade off between parametric methods that yield compact state representations but lack probabilistic structure, and Cosserat rod inference on factor graphs, which provides principled uncertainty quantification at the cost of a state dimension that grows with the spatial discretization. This letter combines the strengths of both these approaches by estimating the coefficients of a compact Geometric Variable Strain (GVS) parameterization within a factor graph framework. A novel kinematic factor, derived from the Magnus expansion of the strain field, encodes the closed-form rod geometry as a prior constraint linking the GVS strain coefficients to the backbone pose variables. The resulting formulation yields a compact state vector, is directly amenable to model-based control, and it retains the modularity, probabilistic treatment, and computational efficiency of factor graph inference. The proposed method is evaluated on both simulated and experimental data and compared against a Gaussian Process (GP) regression baseline, demonstrating increased accuracy in partial and sparse measurement scenarios while preserving computational efficiency.

cs.RO↗

Learning Large-Scale Competitive Team Behaviors with Mean-Field Interactions

While multi-agent reinforcement learning (MARL) has been proven effective across both collaborative and competitive tasks, existing algorithms often struggle to scale to large populations of agents. Recent advancements in mean-field (MF) theory provide scalable solutions by approximating population interactions as a continuum, yet most existing frameworks focus exclusively on either fully cooperative or purely competitive settings. To bridge this gap, we introduce MF-MAPPO, a mean-field extension of PPO designed for zero-sum team games that integrate intra-team cooperation with inter-team competition. MF-MAPPO employs a shared actor and a minimally informed critic per team and is trained directly on finite-population simulators, thereby enabling deployment to realistic scenarios with thousands of agents. We further show that MF-MAPPO naturally extends to partially observable settings through a simple gradient-regularized training scheme. Our evaluation utilizes large-scale benchmark scenarios using our own testing simulation platform for MF team games (MFEnv), including offense-defense battlefield tasks as well as variants of population-based rock-paper-scissors games that admit analytical solutions, for benchmarking. Across these benchmarks, MF-MAPPO outperforms existing methods and exhibits complex, heterogeneous behaviors, demonstrating the effectiveness of combining mean-field theory and MARL techniques at scale.

cs.MA↗

ATOM: Abstract Transition and Option Modeling - Experience-Informed Hierarchical Navigation

We propose ATOM (Abstract Transition and Option Modeling), a hierarchical navigation framework that combines higher-level graph planning with reusable lower-level option policies for efficient repeated navigation in large-scale 3D environments represented by hierarchical structures such as 3D scene graphs (3DSGs). ATOM operates on a hierarchical graph representation, implemented using, for instance, the Rooms and Places layers of a 3DSG, where each directed abstract transition is associated with a navigation option. For each transition, ATOM computes and stores a reusable option policy along with its state-dependent cost-to-go. Across repeated navigation tasks, ATOM maintains a smoothed empirical distribution over option initiation states and uses it to progressively refine the corresponding abstract transition cost. Ablation studies show that ATOM reduces cumulative repeated-planning time by 97.5% relative to a monolithic MDP baseline while maintaining trajectories within approximately 7% of a Global Places A* shortest-path reference. Experience-informed refinement further reduces abstract transition-cost estimation error by 10.3%. Physical experiments validate ATOM on an F1Tenth vehicle, successfully completing all five navigation queries with 43% of inter-region option executions reusing previously generated solutions.

cs.RO↗

Mobility-Budget-Constrained Submodular Maximization for Distributed Semantic Multi-Robot Exploration

Multi-robot exploration under communication and mobility constraints requires balancing information gain with reachability. We present a distributed semantic exploration framework that combines Dirichlet mapping, budget-constrained trajectory selection, and Resource-Aware distributed Greedy (RAG) coordination. Each robot clusters frontiers, computes terrain- and heading-aware least-cost paths with a single budget-limited Dijkstra search, and selects feasible paths by marginal information gain, represented by the expected reduction in Dirichlet entropy. Each robot's per-round selection is exact, the team's joint per-round information gain is at least half the centralized optimum, and the bound degrades gracefully under limited communication. Ten-run gridworld ablations show improved coverage, semantic mIoU, and map certainty with lower entropy and traversal cost per unit distance than shortest-distance frontier selection. Budget-sensitivity experiments show that an intermediate budget best balances path reach and receding-horizon execution. In photorealistic full-system simulation against five coordination rules run in their native published forms, the proposed method attains the highest mean coverage and semantic accuracy while being the only one that respects the per-trajectory mobility budget.

cs.RO↗

Beyond Nominal Equilibria: Risk-Averse Multi-Population Mean-Field Games

Recent advances in mean-field games and its multi-population variants enable large-scale heterogeneous multi-agent systems to be modeled through representative agents and their associated mean-field distributions. However, existing approaches do not explicitly account for uncertainty in the behavior of other populations. To this end, we introduce a new paradigm: risk-averse multi-population mean-field games, where each population optimizes a worst-case expected reward over dynamically feasible ambiguity sets of mean-field flows of a subset of the other populations. Employing an occupation-measure formulation along with tools from set-valued analysis, we establish, under mild assumptions, several theoretical properties of the multi-population game, including the geometric properties of the ambiguity sets and the existence of a novel risk-averse multi-population mean-field equilibrium. Further, we derive contractivity results of the fixed-point operator under entropy regularization and show that it can be utilized to learn the equilibrium. Finally, we propose a risk-averse fictitious-play scheme and show that exploitability decays to zero, despite the additional nonlinearity introduced by the worst-case objective. We report several numerical experiments to illustrate convergence and risk-averse behavior.

math.OC↗

Feedback Dominance Analysis for Pursuit-Evasion Games on Graphs

This work identifies the dominance regions for discrete, simultaneous-move pursuit-evasion games on graphs. Existing geometric approaches provide efficient characterizations of winning regions, but typically provide only sufficient conditions and rely on open-loop strategies. To address these challenges, we develop a set-based dynamic programming approach to characterize the pursuer's winning and losing regions, providing necessary and sufficient winning conditions under worst-case behavior. The reachability analysis admits a set-chasing interpretation, allowing translation of dominance sets to feedback strategies that adapt to the players' positions in real time. For states where neither player can guarantee victory, we introduce an instantaneous matrix-game formulation and establish upper and lower bounds on the pursuer's winning probability. Simulation results validate the correctness of the dominance-region characterization and the proposed bounds.

cs.GT↗

Game-Theoretic Control with Constrained Potential Surgery

Constrained general-sum dynamic games are a popular formulation for highly interactive multi-agent planning problems. In recent years, Generalized Nash Equilibrium (GNE) solvers have achieved real-time performance for small dynamic games. However, solution speed still remains a bottleneck, and controlling even a small number of agents (e.g., more than four) in a dynamic task remains elusive. In addition, Newton solvers that focus on the first-order conditions are vulnerable to non-Nash saddle points, limiting the usefulness of the provided solution. In this work, we propose a fast and versatile interior point solver for constrained dynamic games, along with a computationally efficient second-order correction that increases the probability of converging to a local GNE solution in constrained dynamic games. The performance of the proposed method is evaluated on numerical benchmarks and a physical experiment involving scaled race cars.

cs.RO↗

Inertia-Corrected Newton Method For Generalized Nash Equilibria in Dynamic Games with Optimality Verification

Newton methods efficiently find Generalized Nash Equilibria (GNE) in dynamic games by solving for the KKT necessary conditions. These methods are fast and can support multi-agent Model Predictive Control (MPC) for highly dynamic robots. However, a small KKT residual alone does not certify that the returned solution satisfies the second-order sufficient conditions for a local GNE. In this paper, we propose an efficient numerical method to verify the second-order sufficient conditions (SOSC) for a local GNE. We connect the inertia of the agent KKT matrix with the positive definiteness of the reduced Hessian of the cost function, projected onto the null space of the constraints. Furthermore, we introduce an inertia-corrected update step that improves convergence to local GNEs by destabilizing strict saddle points with weak cross-agent coupling. Our main contribution is a fast Newton solver for Constrained Dynamic Games that provides efficient optimality checking. Through numerical benchmarks, we demonstrate the proposed solver's runtime and convergence performance in practical multi-agent planning problems. We also validate the solver's real-time capabilities in physical experiments using a platform of miniature autonomous race cars.

cs.RO↗

PDO-Split: A Real-Time Solver for Constrained Potential-Dominant Games

We present Potential-Dominant Operator Splitting (PDO-Split), a real-time generalized Nash equilibrium solver for constrained dynamic multi-agent problems with potential-dominant structure. PDO-Split targets the computational bottleneck in game-theoretic model predictive control, where repeatedly solving the equilibrium KKT system becomes costly as the number of agents increases. We introduce a class of gamma-potential-dominant games, in which the potential (or cooperative) structure dominates the competitive interactions between the agents. We show that this structure allows PDO-Split to use the potential component as a preconditioner while incorporating the competitive component through iterative refinement. We establish convergence guarantees and exploit the symmetry of the potential component through a reusable LDL^T factorization to accelerate the linear solvers. We evaluate PDO-Split across several practical multi-agent planning problems, including eight-car racing and six-vehicle ramp merging, achieving substantially improved runtime and convergence rate over existing DDP-based and Newton-based methods, especially with a larger number of agents. The algorithm is also experimentally validated on miniature autonomous race car platforms, demonstrating the approach's real-time capability.

cs.GT↗

Distributed Event-Triggered Distance-Based Formation Control for Multi-Agent Systems

This paper addresses collaborative formation control for multi-agent systems with limited resources. We consider a team of robots tasked with achieving a desired formation from an arbitrary initial configuration. To reduce unnecessary control updates and conserve resources, we propose a distributed event-triggered formation controller. Unlike the well-studied linear formation controllers, the proposed controller is nonlinear and relies on inter-agent distance measurements. Control updates are triggered only when the measurement error exceeds a state-dependent threshold, ensuring system stability while reducing actuation effort. We also employ a distributed control barrier function to guarantee inter-agent collision avoidance. The proposed controller is validated through simulations and real-world experiments involving different communication topologies, scalability tests, and variations in design parameters, and is also compared to periodic triggering strategies. Results demonstrate that the event-triggered approach significantly reduces control effort while preserving formation performance.

cs.RO↗

Data-Driven Covariance Steering with Output Feedback

This paper addresses output-feedback covariance steering for stochastic discrete-time linear time-invariant systems with unknown dynamics. We construct a controllable non-minimal state representation from past inputs and outputs, allowing the problem to be formulated in a standard state-feedback setting. The induced disturbance, however, is temporally correlated, requiring propagation of the state-disturbance cross-covariance. Using persistently exciting offline data, we employ an indirect approach for mean steering and a direct approach for covariance steering. The indirect formulation requires estimation of the mean dynamics, whereas the direct formulation requires estimation of the noise realization. We develop estimation methods suitable for temporally correlated noise and formulate the resulting covariance steering problem as a convex semidefinite program. Numerical simulations demonstrate the effectiveness of the proposed framework.

eess.SY↗