Target tracking in bearings-only sensor networks (BOSNs) has obtained distinct interest in the last decade. In this situation, the scalability of the tracking algorithm and robustness against network topologies due to moving platform or node/communication fault are two important issues. This motivates the present work on distributed bearings-only tracking in switching BOSNs adopting consensus-b...

This paper is devoted to the study of consensus tracking problems for multi-agent systems with nonlinear dynamics, in which dynamics of each follower consists of two terms: one is given by an inherent nonlinear dynamics and the other is a simple communication protocol relying only on the position of its neighbors. The consensus reference is taken as a virtual leader who gives only its position ...

The problem of consensus in the presence of misbehaving agents has increasingly attracted attention in the literature. Prior results have established algorithms and graph structures for multi-agent networks which guarantee the consensus of normally behaving agents in the presence of a bounded number of misbehaving agents. The final consensus value is guaranteed to fall within the convex hull of...

This paper proposes a novel event-triggered consensus tracking protocol for first-order multi-agent systems with a virtual leader. The event detector is designed based on the local sampled-data, and information exchange happens only at corresponding event instants. The Lyapunov function method is used to derive the sufficient conditions for consensus tracking. The bound of the inter-event time ...

A tracking algorithm based on consensus-robust estimators was implemented for the analysis of experiments with time-projection chambers. In this work, few algorithms beyond RANSAC were successfully tested using experimental data taken AT-TPC, ACTAR and TexAT detectors. The present has a better inlier-outlier detection than simple sequential routine. Modifications in random sampling clustering i...

This paper studies a distributed discrete-time coordinated tracking problem where a team of vehicles communicating with their local neighbors at discrete-time instants tracks a time-varying reference state available to only a subset of the team members. We propose a PD-like discrete-time consensus algorithm to address the problem under a fixed communication graph. We then study the condition on...