Dynamic asymmetric assignment problem in open multi-agent systems
The purpose of the work is to develop models and algorithms for optimizing matching in dynamically generated graphs of asymmetric relations in coordinated open systems of interacting agents with centralized and collective control. The dynamic asymmetric matching optimization problem arises here as a...
Saved in:
| Main Authors: | M. P. Revotjuk, N. V. Khajynova, A. P. Kuznetsov, L. Y. Shilin |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
Educational institution «Belarusian State University of Informatics and Radioelectronics»
2020-09-01
|
| Series: | Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioèlektroniki |
| Subjects: | |
| Online Access: | https://doklady.bsuir.by/jour/article/view/2720 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Observer of changes in the forest of the shortest paths on dynamic graphs of transport networks
by: N. V. Khajynova, et al.
Published: (2020-09-01) -
A Rank-Based Assignment Lottery for an Assignment Problem
by: Claudia Meo
Published: (2025-06-01) -
Efficient Pathfinding on Grid Maps: Comparative Analysis of Classical Algorithms and Incremental Line Search
by: Amr Elshahed, et al.
Published: (2025-01-01) -
A New Heuristic Procedure for Quadratic Assignment Problems
by: Najla Al-Saati
Published: (2004-12-01) -
Applying the Node Combination Algorithm to the Shortest Path Problem for a Logistics Firm
by: Kevser Arman, et al.
Published: (2022-12-01)