.png){kind=icon}
.png){kind=icon}
Return
Distributed Optimization for Graph Matching
.png){kind=icon}
OA
AI
DOI：10.1109/TCYB.2022.3140338.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Graph matching, or the determination of the vertex correspondences between a pair of graphs, is a crucial task in various problems in different science and engineering disciplines. This article aims to propose a distributed optimization approach for graph matching (GM) between two isomorphic graphs over multiagent networks. For this, we first show that for a class of asymmetric graphs, GM of two isomorphic graphs is equivalent to a convex relaxation where the set of permutation matrices is replaced by the set of pseudostochastic matrices. Then, we formulate GM as a distributed convex optimization problem with equality constraints and a set constraint, over a network of multiple agents. For arbitrary labelings of the vertices, each agent only has information about just one vertex and its neighborhood, and can exchange information with its neighbors. A projected primal-dual gradient method is developed to solve the constrained optimization problem, and globally exponential convergence of the agents' states to the optimal permutation is achieved. Finally, we illustrate the effectiveness of the algorithm through simulation examples.
Keywords:
Optimization
Nonhomogeneous media
Task analysis
Labeling
Sun
Digital twin
Convergence
Cyber-physical systems
distributed optimization
graph matching (GM)
Journal
IF:
10.5
Papers:
1.1W
Citations:
5.0W