View in EDS

Partial gathering of mobile agents in dynamic tori.

Saved in:
Bibliographic Details
Title: Partial gathering of mobile agents in dynamic tori.
Authors: Shibata, Masahiro1 (AUTHOR), Kitamura, Naoki2 (AUTHOR), Eguchi, Ryota3 (AUTHOR), Sudo, Yuichi4 (AUTHOR), Nakamura, Junya5 (AUTHOR), Kim, Yonghwan6 (AUTHOR)
Source: Computer Journal. Oct2025, Vol. 68 Issue 10, p1485-1501. 17p.
Subjects: Mobile agent systems, Computational complexity
Abstract: In this paper, we consider the partial gathering problem of mobile agents in dynamic tori. This problem requires |$k$| agents distributed in the network to reach a configuration such that either at least |$g$| agents or no agent exists at each node. Thus far, in dynamic graphs, partial gathering is considered in 1-interval connected rings, where one of the links in the ring may be missing at each time step. In this paper, we consider another dynamic topology. Concretely, we consider partial gathering in |$n\times n$| dynamic tori such that each of the row and column rings is represented as a 1-interval connected ring. In such networks, when |$k = O(gn)$|⁠ , focusing on the relationship between the values of |$k, n$|⁠ , and |$g$|⁠ , we characterize the solvability of the problem and analyze the move complexity. First, we show that agents cannot solve the problem when |$k = o(gn)$|⁠. Second, we show that agents can achieve partial gathering with a total number of |$O(gn^{3})$| moves when |$2gn+2n-1\le k \le 2gn + 6n +16g -12$|⁠. Finally, we show that agents can achieve partial gathering with a total number of |$\Theta (gn^{2})$| moves when |$k\ge 2gn + 6n +16g -11$|⁠. [ABSTRACT FROM AUTHOR]
Copyright of Computer Journal is the property of Oxford University Press / USA and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:In this paper, we consider the partial gathering problem of mobile agents in dynamic tori. This problem requires |$k$| agents distributed in the network to reach a configuration such that either at least |$g$| agents or no agent exists at each node. Thus far, in dynamic graphs, partial gathering is considered in 1-interval connected rings, where one of the links in the ring may be missing at each time step. In this paper, we consider another dynamic topology. Concretely, we consider partial gathering in |$n\times n$| dynamic tori such that each of the row and column rings is represented as a 1-interval connected ring. In such networks, when |$k = O(gn)$|⁠ , focusing on the relationship between the values of |$k, n$|⁠ , and |$g$|⁠ , we characterize the solvability of the problem and analyze the move complexity. First, we show that agents cannot solve the problem when |$k = o(gn)$|⁠. Second, we show that agents can achieve partial gathering with a total number of |$O(gn^{3})$| moves when |$2gn+2n-1\le k \le 2gn + 6n +16g -12$|⁠. Finally, we show that agents can achieve partial gathering with a total number of |$\Theta (gn^{2})$| moves when |$k\ge 2gn + 6n +16g -11$|⁠. [ABSTRACT FROM AUTHOR]
ISSN:00104620
DOI:10.1093/comjnl/bxaf052