Searcharxiv⌕ Search

arXiv subjects

Ruchika Singh

Publications and source records attributed to Ruchika Singh.

3 recordsLinked to original sources

Real-Time Air Pollution Monitoring and Tracking via Adaptive Density-Driven Multi-UAV Coordination

Accurate and timely air pollution monitoring and tracking are critical for protecting public health and supporting effective environmental management. This paper presents an adaptive Density-Driven Control (D$^2$C) framework for coordinating multiple unmanned aerial vehicles (UAVs) to track and map dynamically evolving pollutant distributions. The proposed framework extends the D$^2$C strategy to guide UAV trajectories based on predictive pollutant propagation and dynamically updated reference densities. A sensor-driven surrogate plume update mechanism is employed, in which reference samples are propagated using locally sensed concentration gradients and wind estimates through gradient attraction, wind advection, inter-sample repulsion, and stochastic diffusion, enabling UAVs to maintain an accurate spatio-temporal representation of the pollution field. The framework utilizes a coordinated structure where individual UAVs share their local measurements with a central coordinator to maintain a unified set of reference samples, facilitating systematic target allocation and trajectory planning. Simulation results under both mild and strong wind conditions demonstrate that the proposed method significantly outperforms state-of-the-art baselines in terms of Sinkhorn distance. Specifically, in scenarios where the plume drifts beyond a fixed monitoring domain under high-velocity, time-varying wind fields, the tested baseline methods fail to maintain tracking, whereas the proposed D$^2$C framework successfully adapts to the evolving distribution. These findings highlight D$^2$C as an efficient and resilient solution for atmospheric monitoring in dynamic environments.

cs.RO↗

Fast and Scalable Multi-Agent Distribution Matching via Partitioned Optimal Transport

This paper presents a scalable optimal-transport-based framework for terminal distribution matching in multi-agent systems. While optimal transport provides a natural way to measure distributional mismatch and assign agents to a desired spatial distribution, global discrete transport can become computationally expensive for large-scale systems. We address this bottleneck by partitioning agents and target samples into spatially corresponding blocks and solving smaller local transport problems. Under a mass-balance condition, the resulting restricted coupling remains feasible for the global problem and provides an upper bound on the Wasserstein cost. The local assignments generate target locations for finite-horizon agent control, applicable to both linear and nonlinear dynamics. By alternating local assignment and control, we establish a cycle-to-cycle descent guarantee for the resulting transport surrogate. The proposed framework therefore enables scalable terminal distribution matching while retaining a rigorous connection to the Wasserstein objective. The technical soundness of the proposed results is validated through simulations.

cs.MA↗

Riemannian Density-Driven Optimal Control: Tangent-Space LQR for Second-Order Multi-Agent Systems on Curved Manifolds

Density-Driven Optimal Control (D2OC) provides an effective framework for steering multi-agent systems toward prescribed spatial distributions. However, existing D2OC formulations are primarily developed for Euclidean domains and do not directly account for intrinsic manifold geometry. This paper extends D2OC to second-order multi-agent systems evolving on Riemannian manifolds. The proposed Riemannian D2OC (R-D2OC) constructs a local distribution objective in the tangent space of each agent through logarithmic maps and uses its weighted center as the reference for a finite-horizon LQR. The resulting control is executed on the manifold through intrinsic second-order dynamics and parallel transport within a receding-horizon scheme. We establish local curvature-dependent bounds that quantify the approximation introduced by the tangent-space reduction and characterize the resulting target bias. Furthermore, we derive a conditional discrete-descent result showing that the closed-loop objective decreases when a local velocity-alignment condition is satisfied. Numerical simulations on a 3D ellipsoidal manifold demonstrate distribution-level control and empirically support the proposed approximation and descent results.

math.OC↗