Adriano Fagiolini

Convergence Analysis of Extended Kalman Filter for Sensorless Control of Induction Motor

This paper deals with convergence analysis of the extended Kalman filters (EKFs) for sensorless motion control systems with induction motor (IM). An EKF is tuned according to a six-order discrete-time model of the IM, affected by system and measurement noises, obtained by applying a first-order Euler discretization to a six-order continuous-time model. Some properties of the discrete-time model have been explored. Among these properties, the observability property is relevant, which leads to conditions that can be directly linked with the working conditions of the machine. Starting from these properties, the convergence of the stochastic state estimation process, in mean square sense, has been shown. The convergence is also explored with reference to the difference between the samples of the state of the continuous-time model and that estimated by the EKF. The results theoretically achieved have been also validated by means of experimental tests carried out on an IM prototype.

Consensus-based distributed intrusion detection for multi-robot systems

This paper addresses a security problem in robotic multi-agent systems, where agents are supposed to cooperate according to a shared protocol. A distributed Intrusion Detection System (IDS) is proposed here, that detects possible non-cooperative agents. Previous work by the authors showed how single monitors embedded on-board the agents can detect non- cooperative behavior, using only locally available information. In this paper, we allow such monitors to share the collected information in order to overcome their sensing limitation. In this perspective, we show how an agreement on the type of behavior of a target-robot may be reached by the monitors, through execution of a suitable consensus algorithm. After formulating a consensus problem over non-scalar quantities, and with a generic update function, we provide conditions for the consensus convergence and an upper bound to its transient duration. Effectiveness of the proposed solution is finally shown through simulation of a case study.

Towards a Society of Robots

In this article, we consider how a very large numbers of robots, differing in their bodies, sensing, and intelligence, may be made to coexist, communicate, and compete fairly toward achieving their individual goals, i.e., to build a society of I robots. We discuss some characteristics that the rules defining acceptable social behaviors should possess. We consider threats that may be posed to such a society by the misbehaviors of some of its members, either due to faults or malice, and the possibility to detect and isolate them through cooperation of peers. The article presents examples of motion control protocols, for arbitrarily large groups of heterogeneous robots. We discuss intrusion detection algorithms, which allow detection of deviance from such rules, and algorithms to build a consensus view on the environment and on the integrity of peers, so as to improve the overall security of the society of robots.

On the robust synthesis of logical consensus algorithms for distributed intrusion detection

We introduce a novel consensus mechanism by which the agents of a network can reach an agreement on the value of a shared logical vector function depending on binary input events. Based on results on the convergence of finite-state iteration systems, we provide a technique to design logical consensus systems that minimizing the number of messages to be exchanged and the number of steps before consensus is reached, and tolerating a bounded number of failed or malicious agents. We provide sufficient joint conditions on the input visibility and the communication topology for the methods applicability. We describe the application of our method to two distributed network intrusion detection problems.

Logical consensus for distributed network agreement

In this paper we introduce a novel consensus mechanism where agents of a network are able to share logical values, or Booleans, representing their local opinions on e.g. the presence of an intruder or of a fire within an indoor environment. Under suitable joint conditions on agents¿ visibility and communication capability, we provide an algorithm generating a logical linear consensus system that is globally stable. The solution is optimal in terms of the number of messages to be exchanged and the time needed to reach a consensus. Moreover, to cope with possible sensor failure, we propose a second design approach that produces robust logical nonlinear consensus systems tolerating a maximum number of faults. Finally, we show applicability of the agreement mechanism to a distributed intrusion detection system (IDS).

Decentralized Coordination System for Multiple AGVs in a Structured Environment

Abstract In this paper, we propose a decentralized coordination algorithm for safe and efficient management of a group of mobile robots following predefined paths in a dynamic industrial environment. The proposed algorithm is based on shared resources and proved to guarantee ordered traffic flows avoiding collisions and deadlocks. In consistency with the model of distributed robotic systems (DRS), no centralized mechanism, synchronized clock, shared memory or ground support is needed. A local inter-robot communication is required among a small number of spatially adjacent robotic units.

Dynamic distributed intrusion detection for secure multi-robot systems

A general technique to build a dynamic and distributed intrusion detector for a class of multi-agent systems is proposed in this paper, by which misbehavior in the motion of one or more agents can be discovered. Previous work from the authors has focused on how to distinguish the behavior of a misbehaving agent in a completely distributed way, by developing a solution where agents act as local monitors of their neighbors and use locally sensed information as well as data received from other monitors at a particular time. In this work, we improve the system detection capability by allowing monitors to use information collected at different instants and thus realizing a dynamic state observer that is valid for any system in the considered class. Finally, we show through simulations the effectiveness of the proposed solution for a case study.

Visual-based feedback control of Casting Manipulation

In this paper, we present a method to control casting manipulation by means of real-time visual feedback. Casting manipulation is a technique to deploy a robotic end-effector at large distances from the robot’s base, by throwing the end-effector and controlling its ballistic flight using forces transmitted through a light tether connected to the end-effector itself. The tether cable can also be used to retrieve the end-effector and exert forces on the robot’s environment. Previous work has shown that casting manipulation is able to catch objects at a large distance, proving it viable for applications such as sample acquisition and return, rescue, etc. In previous experiments, the position of the target object was known exactly. In this paper, we present a first attempt at closing a real-time control loop on casting manipulation using visual feedback of moving targets. As accurate planning methods developed for off-line open-loop planning cannot be used in real-time, we develop a simplified model and control algorithm, whose effectiveness is demonstrated through experiments.

Set-valued consensus for distributed clock synchronization

This paper addresses the clock synchronization problem in a wireless sensor network (WSN) and proposes a distributed solution that consists of a form of consensus, where agents are able to exchange data representing intervals or sets. The solution is based on a centralized algorithm for clock synchronization, proposed by Marzullo, that determines the smallest interval that is in common with the maximum number of measured intervals. We first show how to convert such an algorithm into a problem involving only operations on sets, and then we convert it into a set-valued consensus. The solution is valid for more general scenarios where agents have uncertain measures of e.g. the position of an object detected by a vision system, a temperature in a room, but it will be applied to the case where a set of uncertain time values are propagated through a WSN. Under suitable joint conditions on the communication connectivity and bounded agent failure, we prove the correctness of the algorithm that indeed allows the network agents to consent on the value of a unique global time.

Distributed consensus on boolean information

Abstract In this paper we study the convergence towards consensus on information in a distributed system of agents communicating over a network. The particularity of this study is that the information on which the consensus is seeked is not represented by real numbers, rather by logical values or sets. Whereas the problems of allowing a network of agents to reach a consensus on logical functions of input events, and that of agreeing on set–valued information, have been separately addressed in previous work, in this paper we show that these problems can indeed be attacked in a unified way in the framework of Boolean distributed information systems. Based on a notion of contractivity for Boolean dynamical systems, a necessary and sufficient condition ensuring the global convergence toward a unique equilibrium point is presented. This result can be seen as a first step toward the definition of a unified framework to uniformly address all consensus problems on Boolean algebras.