Abstract
This paper introduces a consensus-based continuous-time distributed algorithm to find the least-squares solution to overdetermined systems of linear algebraic equations over directed multi-agent networks. It is assumed that each agent has only access to a subsystem of the algebraic equations, and the underlying communication network is strongly connected. We show that, along the flow of the proposed algorithm, the local estimate of each agent converges exponentially to the exact least-squares solution, provided that the aggregate system of linear equations has full column rank, and each agent knows an upper bound on the total number of the participating agents in the network.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
