This paper proposes a continuous-time distributed algorithm for multiagent networks to achieve a solution with the minimum l 1 -norm to underdetermined linear equations. The proposed algorithm comes from a combination of the Filippov set-valued map with the projection-consensus flow. Given the underlying network is undirected and fixed, it is shown that the proposed algorithm drives all agents' individual states to converge in finite time to a common value, which is the minimum l 1 -norm solution.

中文翻译：

---

具有最小 $l_1$-范数解的有限时间分布式线性方程求解器


本文提出了一种多智能体网络的连续时间分布式算法，以实现欠定线性方程组的最小 l 1 范数解。所提出的算法来自 Filippov 集值图与投影共识流的组合。假设底层网络是无向且固定的，结果表明，所提出的算法驱动所有智能体的个体状态在有限时间内收敛到一个共同值，即最小 l 1 -范数解。