Abstract
This article explores a discrete-time multiagent system on a line. This requires the design of a control protocol providing equidistant agent deployment on a given segment of the line under the constraint that each agent receives information about distances to its neighbors via an auxiliary agent. An approach to the solution of the stated problem is developed. This proves that, under the proposed control protocol, neither communication delay nor switching of communication graph destroy convergence of agents to the equidistant distribution. The results of a numerical simulation confirming the obtained theoretical conclusions are presented.
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 callMore From: Vestnik of Saint Petersburg University. Applied Mathematics. Computer Science. Control Processes
Disclaimer: 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.
