Multi-agent transformer-accelerated RL for satisfaction of STL specifications
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909148154691584 |
|---|---|
| author | Forsberg, Albin Larsson Nikou, Alexandros Feljan, Aneta Vulgarakis Tumova, Jana |
| author_facet | Forsberg, Albin Larsson Nikou, Alexandros Feljan, Aneta Vulgarakis Tumova, Jana |
| contents | One of the main challenges in multi-agent reinforcement learning is scalability as the number of agents increases. This issue is further exacerbated if the problem considered is temporally dependent. State-of-the-art solutions today mainly follow centralized training with decentralized execution paradigm in order to handle the scalability concerns. In this paper, we propose time-dependent multi-agent transformers which can solve the temporally dependent multi-agent problem efficiently with a centralized approach via the use of transformers that proficiently handle the large input. We highlight the efficacy of this method on two problems and use tools from statistics to verify the probability that the trajectories generated under the policy satisfy the task. The experiments show that our approach has superior performance against the literature baseline algorithms in both cases. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_15916 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Multi-agent transformer-accelerated RL for satisfaction of STL specifications Forsberg, Albin Larsson Nikou, Alexandros Feljan, Aneta Vulgarakis Tumova, Jana Artificial Intelligence One of the main challenges in multi-agent reinforcement learning is scalability as the number of agents increases. This issue is further exacerbated if the problem considered is temporally dependent. State-of-the-art solutions today mainly follow centralized training with decentralized execution paradigm in order to handle the scalability concerns. In this paper, we propose time-dependent multi-agent transformers which can solve the temporally dependent multi-agent problem efficiently with a centralized approach via the use of transformers that proficiently handle the large input. We highlight the efficacy of this method on two problems and use tools from statistics to verify the probability that the trajectories generated under the policy satisfy the task. The experiments show that our approach has superior performance against the literature baseline algorithms in both cases. |
| title | Multi-agent transformer-accelerated RL for satisfaction of STL specifications |
| topic | Artificial Intelligence |
| url | https://arxiv.org/abs/2403.15916 |