Related papers: Networked pointing system: Bearing-only target loc…

Given a network of multiple agents, the pointing consensus problem asks all agents to point toward a common target. This paper proposes a simple method to solve the pointing consensus problem in the plane. In our formulation, each agent…

Characterized by a cross-disciplinary nature, the bearing-based target localization task involves estimating the position of an entity of interest by a group of agents capable of collecting noisy bearing measurements. In this work, this…

Bearing--only estimation is one of the fundamental and challenging problems in target tracking. As in the case of radar tracking, the presence of offset or position biases can exacerbate the challenges in bearing--only estimation. Modeling…

This paper studies the distributed control and estimation of multi-agent systems based on bearing information. In particular, we consider two problems: (i) the distributed control of bearing-constrained formations using relative position…

This paper focuses on the problem of estimating bearing vectors between the agents in a two dimensional multi-agent network based on subtended angle measurements, called edge localization problem. We propose an edge localization graph to…

The problem of distributed control and estimation for multi-agent systems with limited sensing capabilities is a practical challenge motivated by incomplete and imperfect sensing. This article addresses an important case where each agent in…

This paper introduces a novel distributed consensus-based observer design that enables a group of agents in an undirected communication network to solve the problem of target tracking, where the target is modelled as a chain of integrators…

This paper investigates the problem of consensus tracking control of discrete time multi-agent systems under binary-valued communication. Different from most existing studies on consensus tracking, the transmitted information between agents…

This paper investigates the problem of controlling an autonomous agent to simultaneously localize and circumnavigate an unknown stationary target using bearing-only measurements (without explicit differentiation). To improve the convergence…

This paper presents novel algorithms for the Fermat-Weber Location Problem, guiding an autonomous agent to the point that minimizes the weighted sum of Euclidean distances to some beacons using only bearing measurements. The existing…

This letter studies the problem of cooperative nearest-neighbor control of multi-agent systems where each agent can only realize a finite set of control points. Under the assumption that the underlying graph representing the communication…

In its simplest form the well known consensus problem for a networked family of autonomous agents is to devise a set of protocols or update rules, one for each agent, which can enable all of the agents to adjust or tune their "agreement…

This paper studies the consensus problem for multiagent systems with transmission constraints. A novel model of multiagent systems is proposed where the information transmissions between agents are disturbed by irregular distortions or…

This paper presents a novel distributed algorithm for tracking a maneuvering target using bearing or direction of arrival measurements collected by a networked sensor array. The proposed approach is built on the dynamic average-consensus…

This paper considers a localized data-driven consensus problem for leader-follower multi-agent systems with unknown discrete-time agent dynamics, where each follower computes its local control gain using only their locally collected state…

The constrained consensus problem considered in this paper, denoted interval consensus, is characterized by the fact that each agent can impose a lower and upper bound on the achievable consensus value. Such constraints can be encoded in…

This paper addresses the distributed consensus problem for a linear multi-agent system with switching directed communication topologies. By appropriately introducing a linear transformation, the consensus problem is equivalently converted…

The growing need for accurate and reliable tracking systems has driven significant progress in sensor fusion and object tracking techniques. In this paper, we design two variational Bayesian trackers that effectively track multiple targets…

This paper fully studies distributed optimal consensus problem in non-directed dynamical networks. We consider a group of networked agents that are supposed to rendezvous at the optimal point of a collective convex objective function. Each…

In this paper, we investigate the problem of joint searching and tracking of multiple mobile targets by a group of mobile agents. The targets appear and disappear at random times inside a surveillance region and their positions are random…