Changbin Yu

Changbin Yu
Are you Changbin Yu?

Claim your profile, edit publications, add additional information:

Contact Details

Name
Changbin Yu
Affiliation
Location

Pubs By Year

Pub Categories

 
Computer Science - Multiagent Systems (5)
 
Mathematics - Optimization and Control (4)
 
Computer Science - Discrete Mathematics (1)
 
General Relativity and Quantum Cosmology (1)
 
Computer Science - Distributed; Parallel; and Cluster Computing (1)
 
Physics - Physics and Society (1)

Publications Authored By Changbin Yu

This paper proposes three different distributed event-triggered control algorithms to achieve leader-follower consensus for a network of Euler-Lagrange agents. We firstly propose two model-independent algorithms for a subclass of Euler-Lagrange agents without the vector of gravitational potential forces. By model-independent, we mean that each agent can execute its algorithm with no knowledge of the agent self-dynamics. Read More

This paper analyses the DeGroot-Friedkin model for evolution of the individuals' social powers in a social network when the network topology varies dynamically (described by dynamic relative interaction matrices). The DeGroot-Friedkin model describes how individual social power (self-appraisal, self-weight) evolves as a network of individuals discuss a sequence of issues. We seek to study dynamically changing relative interactions because interactions may change depending on the issue being discussed. Read More

According to the DeGroot-Friedkin model of a social network, an individual's social power evolves as the network discusses individual opinions over a sequence of issues. Under mild assumptions on the connectivity of the network, the social power of every individual converges to a constant strictly positive value as the number of issues discussed increases. If the network has a special topology, termed "star topology", then all social power accumulates with the individual at the centre of the star. Read More

By the distributed averaging problem is meant the problem of computing the average value of a set of numbers possessed by the agents in a distributed network using only communication between neighboring agents. Gossiping is a well-known approach to the problem which seeks to iteratively arrive at a solution by allowing each agent to interchange information with at most one neighbor at each iterative step. Crafting a gossiping protocol which accomplishes this is challenging because gossiping is an inherently collaborative process which can lead to deadlocks unless careful precautions are taken to ensure that it does not. Read More

Inspired by the concept of network algebraic connectivity, we adopt an extended notion named rigidity preservation index to characterize the rigidity property for a formation framework. A gradient based controller is proposed to ensure the rigidity preservation of multi-robot networks in an unknown environment, while the rigidity metric can be maximized over time during robots' motions. In order to implement the controller in a distributed manner, a distributed inverse power iteration algorithm is developed which allows each robot to estimate the global rigidity index information. Read More

We study a new variant of consensus problems, termed `local average consensus', in networks of agents. We consider the task of using sensor networks to perform distributed measurement of a parameter which has both spatial (in this paper 1D) and temporal variations. Our idea is to maintain potentially useful local information regarding spatial variation, as contrasted with reaching a single, global consensus, as well as to mitigate the effect of measurement errors. Read More

A fundamental control problem for autonomous vehicle formations is formation shape control, in which the agents must maintain a prescribed formation shape using only information measured or communicated from neighboring agents. While a large and growing literature has recently emerged on distance-based formation shape control, global stability properties remain a significant open problem. Even in four-agent formations, the basic question of whether or not there can exist locally stable incorrect equilibrium shapes remains open. Read More

In this paper, we study performance limits of sensor localization from a novel perspective. Specifically, we consider the Cramer-Rao Lower Bound (CRLB) in single-hop sensor localization using measurements from received signal strength (RSS), time of arrival (TOA) and bearing, respectively, but differently from the existing work, we statistically analyze the trace of the associated CRLB matrix (i.e. Read More

This paper considers a novel problem of how to choose an appropriate geometry for a group of agents with only shape constraints but with a flexible scale. Instead of assigning the formation system with a specific geometry, here the only requirement on the desired geometry is a shape without any location, rotation and, most importantly, scale constraints. Optimal rigid transformation between two different geometries is discussed with especial focus on the scaling operation, and the cooperative performance of the system is evaluated by what we call the geometries degrees of similarity (DOS) with respect to the desired shape during the entire convergence process. Read More

In this paper we study the optimal formation control of multiple agents whose interaction parameters are adjusted upon a cost function consisting of both the control energy and the geometrical performance. By optimizing the interaction parameters and by the linear quadratic regulation(LQR) controllers, the upper bound of the cost function is minimized. For systems with homogeneous agents interconnected over sparse graphs, distributed controllers are proposed that inherit the same underlying graph as the one among agents. Read More

In complex electromagnetic environments it can often be difficult to determine whether signals received by an antenna array emanated from the same source. The failure to appropriately assign signal reception events to the correct emission event makes accurate localisation of the signal source impossible. In this paper we show that as the received signal events must lie on the light-cone of the emission event the Cayley-Menger determinate calculated from using the light-cone geodesic distances between received signals must be zero. Read More

This paper treats the problem of the merging of formations, where the underlying model of a formation is graphical. We first analyze the rigidity and persistence of meta-formations, which are formations obtained by connecting several rigid or persistent formations. Persistence is a generalization to directed graphs of the undirected notion of rigidity. Read More

In this paper, we study the construction and transformation of two-dimensional persistent graphs. Persistence is a generalization to directed graphs of the undirected notion of rigidity. In the context of moving autonomous agent formations, persistence characterizes the efficacy of a directed structure of unilateral distances constraints seeking to preserve a formation shape. Read More