Accelerated Decision Making for Distributed Network Estimation Problems

This paper presents an accelerated distributed receding horizon controller for cooperative network estimation problems using multiple autonomous agents. Our approach accelerates decision-making by integrating a novel heuristic-based ranking system, significantly reducing the dependency on computationally expensive Nonlinear Programs (NLPs). The reduction of computational complexity enables real-time responses and scalability to large systems while maintaining high levels of estimation accuracy. To mitigate the small loss of performance, we further introduce a method that aims at generating the best solution within a given computational time constraint by leveraging both the newly introduced ranking scheme and the traditional NLP solutions. Numerical simulations demonstrate competitive performance when benchmarked against data-driven offline policies (e.g., RL), showing that our methods achieve good results while having enhanced flexibility and robustness properties due to their online nature.

Authors

Institutions

Publication Details

Published
2025-06-24
DOI
https://doi.org/10.23919/ecc65951.2025.11187016
Primary Topic
Energy Efficient Wireless Sensor Networks
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Accelerated Decision Making for Distributed Network Estimation Problems

Jonas Håll, Christos G. Cassandras, Ruggero Carli, Alexander Wasilkoff et al.
Energy Efficient Wireless Sensor Networks
article

Accelerated Decision Making for Distributed Network Estimation Problems

Jonas Håll, Christos G. Cassandras, Ruggero Carli, Alexander Wasilkoff, Sean B. Andersson
article en

Abstract

This paper presents an accelerated distributed receding horizon controller for cooperative network estimation problems using multiple autonomous agents. Our approach accelerates decision-making by integrating a novel heuristic-based ranking system, significantly reducing the dependency on computationally expensive Nonlinear Programs (NLPs). The reduction of computational complexity enables real-time responses and scalability to large systems while maintaining high levels of estimation accuracy. To mitigate the small loss of performance, we further introduce a method that aims at generating the best solution within a given computational time constraint by leveraging both the newly introduced ranking scheme and the traditional NLP solutions. Numerical simulations demonstrate competitive performance when benchmarked against data-driven offline policies (e.g., RL), showing that our methods achieve good results while having enhanced flexibility and robustness properties due to their online nature.

Boston University (US), University of Padua (IT)
Openalex Percentile: Top 66%
Energy Efficient Wireless Sensor Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.