AI-Augmented Density-Driven Optimal Control (D2OC) for Decentralized Environmental Mapping

• URL: http://arxiv.org/abs/2601.21126v1
• Date: Wed, 28 Jan 2026 23:55:02 GMT
• Title: AI-Augmented Density-Driven Optimal Control (D2OC) for Decentralized Environmental Mapping
• Abstract summary: This paper presents an AI-augmented decentralized framework for multi-agent (multi-robot) environmental mapping under limited sensing and communication.<n>The proposed method introduces an adaptive and self-correcting mechanism that enables agents to iteratively refine local density estimates.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper presents an AI-augmented decentralized framework for multi-agent (multi-robot) environmental mapping under limited sensing and communication. While conventional coverage formulations achieve effective spatial allocation when an accurate reference map is available, their performance deteriorates under uncertain or biased priors. The proposed method introduces an adaptive and self-correcting mechanism that enables agents to iteratively refine local density estimates within an optimal transport-based framework, ensuring theoretical consistency and scalability. A dual multilayer perceptron (MLP) module enhances adaptivity by inferring local mean-variance statistics and regulating virtual uncertainty for long-unvisited regions, mitigating stagnation around local minima. Theoretical analysis rigorously proves convergence under the Wasserstein metric, while simulation results demonstrate that the proposed AI-augmented Density-Driven Optimal Control consistently achieves robust and precise alignment with the ground-truth density, yielding substantially higher-fidelity reconstruction of complex multi-modal spatial distributions compared with conventional decentralized baselines.

Related papers

• Characterizing Heterogeneous Rates in Finite Mixture Estimation via Partial Optimal Transport [88.55403215843967]
  Voronoi-based partial optimal transport (VPOT) for obtaining refined local and global convergence guarantees for the maximum likelihood estimator of the mixing measure.<n>Results hold in arbitrary fixed dimension without requiring mixing proportions to be uniformly bounded away from zero or prior knowledge of the true number of mixture components.
  arXiv  Detail & Related papers  (2026-09-15T04:32:53Z)
• A Decentralized LiDAR-SLAM System with Certifiably Optimal Pose Graph Optimization [9.471365552299678]
  This paper presents the first decentralized LiDAR-SLAM system that integrates a state-of-the-art certifiably optimal Pose Graph Optimization (PGO) backend.<n>We show that the proposed framework achieves superior robustness, improving trajectory RMSE by up to 48.9% compared to the state-of-the-arto-SLAM.
  arXiv  Detail & Related papers  (2026-05-24T12:50:53Z)
• Environment-Adaptive Solid-State LiDAR-Inertial Odometry [4.423149595363559]
  Solid-state LiDAR-inertial SLAM has attracted significant attention due to its advantages in speed and robustness.<n> achieving accurate mapping in extreme environments remains challenging due to severe geometric degeneracy and unreliable observations.<n>We propose an environment-adaptive solid-state LiDAR-inertial odometry that integrates local normal-vector constraints with degeneracy-aware map maintenance.
  arXiv  Detail & Related papers  (2026-04-17T09:13:52Z)
• Density-Driven Optimal Control: Convergence Guarantees for Stochastic LTI Multi-Agent Systems [0.0]
  This paper addresses the decentralized non-uniform area coverage problem for multi-agent systems.<n>We propose Density-Driven Optimal Control (D$2$OC)<n>This is a rigorous Lagrangian framework that bridges the gap between individual agent dynamics and collective distribution matching.
  arXiv  Detail & Related papers  (2026-04-09T17:39:25Z)
• Computationally Efficient Density-Driven Optimal Control via Analytical KKT Reduction and Contractive MPC [0.0]
  Efficient coordination for collective spatial distribution is a fundamental challenge in multi-agent systems.<n>We propose an analytical structural reduction that transforms the T-horizon KKT system into a condensed quadratic program (QP)<n>This formulation achieves O(T) linear scalability, significantly reducing the online computational burden compared to conventional O(T3) approaches.
  arXiv  Detail & Related papers  (2026-03-19T05:23:21Z)
• Stability and Generalization of Push-Sum Based Decentralized Optimization over Directed Graphs [55.77845440440496]
  Push-based decentralized communication enables optimization over communication networks, where information exchange may be asymmetric.<n>We develop a unified uniform-stability framework for the Gradient Push (SGP) algorithm.<n>A key technical ingredient is an imbalance-aware generalization bound through two quantities.
  arXiv  Detail & Related papers  (2026-02-24T05:32:03Z)
• MMP-A*: Multimodal Perception Enhanced Incremental Heuristic Search on Path Planning [8.522882937983972]
  MMP-A* is a multimodal framework that integrates the spatial grounding capabilities of vision-language models with a novel adaptive decay mechanism.<n>We show that MMP-A* achieves near-optimal trajectories with significantly reduced operational costs.
  arXiv  Detail & Related papers  (2026-01-05T08:55:27Z)
• AIMS: An Adaptive Integration of Multi-Sensor Measurements for Quadrupedal Robot Localization [13.338971590090898]
  AIMS is an adaptive LiDAR-IMU-leg odometry fusion method for robust quadrupedal robot localization in degenerate environments.<n>Results obtained in narrow corridor environments demonstrate that the proposed method improves localization accuracy and robustness compared with state-of-the-art approaches.
  arXiv  Detail & Related papers  (2026-01-04T15:21:52Z)
• Adaptive Dual Uncertainty Optimization: Boosting Monocular 3D Object Detection under Test-Time Shifts [80.32933059529135]
  Test-Time Adaptation (TTA) methods have emerged to adapt to target distributions during inference.<n>We propose Dual Uncertainty Optimization (DUO), the first TTA framework designed to jointly minimize both uncertainties for robust M3OD.<n>In parallel, we design a semantic-aware normal field constraint that preserves geometric coherence in regions with clear semantic cues.
  arXiv  Detail & Related papers  (2025-08-28T07:09:21Z)
• What Makes Local Updates Effective: The Role of Data Heterogeneity and Smoothness [5.357435119431715]
  The thesis contributes to a self-contained guide for analyzing Local SGD in heterogeneous environments.<n>The thesis also extends to online learning, providing fundamental bounds under both first-order and bandit feedback.
  arXiv  Detail & Related papers  (2025-06-30T19:06:02Z)
• Latent Diffusion Model Based Denoising Receiver for 6G Semantic Communication: From Stochastic Differential Theory to Application [11.385703484113552]
  We propose a novel semantic communication framework empowered by generative artificial intelligence (GAI)<n>A latent diffusion model (LDM)-based semantic communication framework is proposed that combines a variational autoencoder for semantic features extraction.<n>The proposed system is a training-free framework that supports zero-shot generalization, and achieves superior performance under low-SNR and out-of-distribution conditions.
  arXiv  Detail & Related papers  (2025-06-06T03:20:32Z)
• Sparse Optimization for Transfer Learning: A L0-Regularized Framework for Multi-Source Domain Adaptation [9.605924781372849]
  We propose a Sparse Optimization for Transfer Learning framework based on L0-regularization.<n> Simulations show that SOTL significantly improves both estimation accuracy and computational speed.<n> Empirical validation on the Community and Crime benchmarks demonstrates the statistical robustness of the SOTL method in cross-domain transfer.
  arXiv  Detail & Related papers  (2025-04-07T08:06:16Z)
• Decentralized Inference for Spatial Data Using Low-Rank Models [4.168323530566095]
  This paper presents a decentralized framework tailored for parameter inference in spatial low-rank models.<n>A key obstacle arises from the spatial dependence among observations, which prevents the log-likelihood from being expressed as a summation.<n>Our approach employs a block descent method integrated with multi-consensus and dynamic consensus averaging for effective parameter optimization.
  arXiv  Detail & Related papers  (2025-02-01T04:17:01Z)
• Stability and Generalization for Distributed SGDA [70.97400503482353]
  We propose the stability-based generalization analytical framework for Distributed-SGDA. We conduct a comprehensive analysis of stability error, generalization gap, and population risk across different metrics. Our theoretical results reveal the trade-off between the generalization gap and optimization error.
  arXiv  Detail & Related papers  (2024-11-14T11:16:32Z)
• Distributed Markov Chain Monte Carlo Sampling based on the Alternating Direction Method of Multipliers [143.6249073384419]
  In this paper, we propose a distributed sampling scheme based on the alternating direction method of multipliers. We provide both theoretical guarantees of our algorithm's convergence and experimental evidence of its superiority to the state-of-the-art. In simulation, we deploy our algorithm on linear and logistic regression tasks and illustrate its fast convergence compared to existing gradient-based methods.
  arXiv  Detail & Related papers  (2024-01-29T02:08:40Z)
• Optimal Scaling for Locally Balanced Proposals in Discrete Spaces [65.14092237705476]
  We show that efficiency of Metropolis-Hastings (M-H) algorithms in discrete spaces can be characterized by an acceptance rate that is independent of the target distribution. Knowledge of the optimal acceptance rate allows one to automatically tune the neighborhood size of a proposal distribution in a discrete space, directly analogous to step-size control in continuous spaces.
  arXiv  Detail & Related papers  (2022-09-16T22:09:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.