| | |
| | |
Stat |
Members: 3667 Articles: 2'599'751 Articles rated: 2609
07 February 2025 |
|
| | | |
|
Article overview
| |
|
Task-Effective Compression of Observations for the Centralized Control of a Multi-agent System Over Bit-Budgeted Channels | Arsham Mostaani
; Thang X. Vu
; Symeon Chatzinotas
; Bjorn Ottersten
; | Date: |
4 Jan 2023 | Abstract: | We consider a task-effective quantization problem that arises when multiple
agents are controlled via a centralized controller (CC). While agents have to
communicate their observations to the CC for decision-making, the bit-budgeted
communications of agent-CC links may limit the task-effectiveness of the system
which is measured by the system’s average sum of stage costs/rewards. As a
result, each agent should compress/quantize its observation such that the
average sum of stage costs/rewards of the control task is minimally impacted.
We address the problem of maximizing the average sum of stage rewards by
proposing two different Action-Based State Aggregation (ABSA) algorithms that
carry out the indirect and joint design of control and communication policies
in the multi-agent system. While the applicability of ABSA-1 is limited to
single-agent systems, it provides an analytical framework that acts as a
stepping stone to the design of ABSA-2. ABSA-2 carries out the joint design of
control and communication for a multi-agent system. We evaluate the algorithms
- with average return as the performance metric - using numerical experiments
performed to solve a multi-agent geometric consensus problem. The numerical
results are concluded by introducing a new metric that measures the
effectiveness of communications in a multi-agent system. | Source: | arXiv, 2301.01628 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
|
| |
|
|
|