paper-with-me

Papers

DARRMS -- An Efficient Algorithm for Dynamic Attention Radius in Resource-Constrained Multi-Agent Systems

2026-06-10 · Benjamin Alcorn, Eman Hammad arxiv

Multi-agent systems are integral tools for various domains such as robotics, cybersecurity, and autonomous vehicle planning. These types of systems often have constraints on the computational resources, leading to a need for efficient lightweight algorithms. Traditional decision making frameworks often assume ideal conditions, such as full observability and unlimited computational capacity, which do not align with real-world challenges. In this paper, we introduce a new algorithm that allows for reduced demand on computational resources without a large cost of other performance metrics. Agents will limit their observability to some attention radius, which intentionally allows them to ignore parts of the environment that might be unnecessary for action planning. By optimizing both the attention radius and decision-making, our approach enhances coordination and scalability in uncertain environments. Through both theoretical analysis and empirical validation, we demonstrate the effectiveness of adaptive observation in improving system performance and maintaining robust decision-making strategies in resource-constrained systems.

📄 PDF Abstract BibTeX arXiv:2606.12614

Code (0)

등록된 구현이 없습니다.

Tasks

Decision Making

Similar Papers 제목 키워드 기반

Dynamic Adjustment of Matching Radii under the Broadcasting Mode: A Novel Multitask Learning Strategy and Temporal Modeling Approach

2023-12-09 · Taijie Chen, Zijian Shen, Siyuan Feng, Linchuan Yang 외

As ride-hailing services have experienced significant growth, the majority of research has concentrated on the dispatching mode, where drivers must adhere to the platform's assigned routes. However, the broadcasting mode…

Multi-Task Learning

Convergence radius and sample complexity of ITKM algorithms for dictionary learning

2015-03-24 · Karin Schnass

In this work we show that iterative thresholding and K-means (ITKM) algorithms can recover a generating dictionary with K atoms from noisy $S$ sparse signals up to an error $\tilde \varepsilon$ as long as the initialisat…

Dictionary Learningvalid

A Radius of Robust Feasibility Approach to Directional Sensors in Uncertain Terrain

2025-10-22 · Vanshika Datta, C. Nahak arxiv

A sensor has the ability to probe its surroundings. However, uncertainties in its exact location can significantly compromise its sensing performance. The radius of robust feasibility defines the maximum range within whi…

Approximate Stability Radius Analysis and Design in Linear Systems

2024-03-18 · Ananta Kant Rai, Vaibhav Katewa

The robustness of the stability properties of dynamical systems in the presence of unknown/adversarial perturbations to system parameters is a desirable property. In this paper, we present methods to efficiently compute …

Spectral Filtering for General Linear Dynamical Systems

2018-02-12 · NeurIPS 2018 12 · Elad Hazan, Holden Lee, Karan Singh, Cyril Zhang 외

We give a polynomial-time algorithm for learning latent-state linear dynamical systems without system identification, and without assumptions on the spectral radius of the system's transition matrix. The algorithm extend…