ﻻ يوجد ملخص باللغة العربية
Multiagent systems consist of agents that locally exchange information through a physical network subject to a graph topology. Current control methods for networked multiagent systems assume the knowledge of graph topologies in order to design distributed control laws for achieving desired global system behaviors. However, this assumption may not be valid for situations where graph topologies are subject to uncertainties either due to changes in the physical network or the presence of modeling errors especially for multiagent systems involving a large number of interacting agents. Motivating from this standpoint, this paper studies distributed control of networked multiagent systems with uncertain graph topologies. The proposed framework involves a controller architecture that has an ability to adapt its feed- back gains in response to system variations. Specifically, we analytically show that the proposed controller drives the trajectories of a networked multiagent system subject to a graph topology with time-varying uncertainties to a close neighborhood of the trajectories of a given reference model having a desired graph topology. As a special case, we also show that a networked multi-agent system subject to a graph topology with constant uncertainties asymptotically converges to the trajectories of a given reference model. Although the main result of this paper is presented in the context of average consensus problem, the proposed framework can be used for many other problems related to networked multiagent systems with uncertain graph topologies.
In this paper, we investigate the role of a physical watermarking signal in quickest detection of a deception attack in a scalar linear control system where the sensor measurements can be replaced by an arbitrary stationary signal generated by an att
In this paper, we propose and analyze an attack detection scheme for securing the physical layer of a networked control system against attacks where the adversary replaces the true observations with stationary false data. An independent and identical
We derive an optimal control formulation for a nonholonomic mechanical system using the nonholonomic constraint itself as the control. We focus on Suslovs problem, which is defined as the motion of a rigid body with a vanishing projection of the body
Networked robotic systems, such as connected vehicle platoons, can improve the safety and efficiency of transportation networks by allowing for high-speed coordination. To enable such coordination, these systems rely on networked communications. This
In this paper the optimal control of alignment models composed by a large number of agents is investigated in presence of a selective action of a controller, acting in order to enhance consensus. Two types of selective controls have been presented: a