Solving the Team Coordination on Graphs With Risky Edges problem for nonzero self-loop weights

Izsó, András and Harmati, István (2025) Solving the Team Coordination on Graphs With Risky Edges problem for nonzero self-loop weights. ANNALES MATHEMATICAE ET INFORMATICAE, 61. pp. 118-128. ISSN 1787-6117

Preview

Text 118_128_izsó.pdf - Published Version Download (1MB) | Preview

Abstract

Multiagent system control is a well-researched area of recent years, since the cooperation of multiple agents opens up the possibility to tackle more complicated problems and create finer scaling systems. Team Coordination on Graphs with Risky Edges has been recently proposed and provides a framework to model such systems. In this problem, multiple agents traverse through a graph. Apart from the ordinary nodes and edges, the graph also contains support nodes, where an agent can choose to support another agent that is moving through a so-called risky edge, associated with the support node. Some solutions have already been proposed; however, all of them assume zero cost of waiting, which is restrictive in many real-world problems. In this paper, we generalize the problem, allowing non-zero cost of waiting, make a solution proposal, and present our comprehensive simulation results.

Actions (login required)

Edit Item