30 results on '"Yu, Changbin"'
Search Results
2. A predictive study of the efficacy of transcutaneous auricular vagus nerve stimulation in the treatment of major depressive disorder: An fMRI-based machine learning analysis
- Author
-
Sun, Jifei, Sun, Kai, Chen, Limei, Li, Xiaojiao, Xu, Ke, Guo, Chunlei, Ma, Yue, Cao, Jiudong, Zhang, Guolei, Hong, Yang, Wang, Zhi, Gao, Shanshan, Luo, Yi, Chen, Qingyan, Ye, Weiyi, Yu, Xue, Xiao, Xue, Rong, Peijing, Yu, Changbin, and Fang, Jiliang
- Published
- 2024
- Full Text
- View/download PDF
3. Effects of calcium glycerophosphate concentration on micro-arc oxidation coating of Mg alloy
- Author
-
Xu, Wenshuo, Li, Zhou, Wang, Hongwei, Li, Huancai, Chen, Chuanzhong, Liu, Xuchang, Kuang, Mingjie, Dou, Jinhe, and Yu, Changbin
- Published
- 2023
- Full Text
- View/download PDF
4. Opinion formation with zealots on temporal network
- Author
-
Luo, Yun, Cheng, Chun, Li, Yuke, and Yu, Changbin
- Published
- 2021
- Full Text
- View/download PDF
5. Dynamic mechanism of social bots interfering with public opinion in network
- Author
-
Cheng, Chun, Luo, Yun, and Yu, Changbin
- Published
- 2020
- Full Text
- View/download PDF
6. Opinion dynamics with bounded confidence and group pressure
- Author
-
Cheng, Chun and Yu, Changbin
- Published
- 2019
- Full Text
- View/download PDF
7. Synchronization of identical linear dynamic systems subject to input saturation
- Author
-
Wang, Qingling, Yu, Changbin, and Gao, Huijun
- Published
- 2014
- Full Text
- View/download PDF
8. Unit dual quaternion-based feedback linearization tracking problem for attitude and position dynamics
- Author
-
Wang, Xiangke and Yu, Changbin
- Published
- 2013
- Full Text
- View/download PDF
9. Control of a three-coleader formation in the plane
- Author
-
Anderson, Brian D.O., Yu, Changbin, Dasgupta, Soura, and Stephen Morse, A.
- Published
- 2007
- Full Text
- View/download PDF
10. Tuning function design for nonlinear adaptive control systems with multiple unknown control directions.
- Author
-
Huang, Chao and Yu, Changbin (brad)
- Subjects
- *
ADAPTIVE control systems , *GLOBAL asymptotic stability , *TRACKING control systems , *ELECTRONIC equipment , *FREQUENCY tuning , *DIRECTION field (Mathematics) - Abstract
To overcome the drawback of overparametrization in existing nonlinear adaptive control design with multiple unknown control directions, we propose a new algorithm which combines nonlinear integrator backstepping, tuning function design and a logic-based switching mechanism that tunes the control directions online in a switching manner. Global asymptotic tracking control is achieved for parametric-strict-feedback systems without overparametrization. The logic-based switching criterion is based on monitoring incremental errors caused during two consecutive switching moments, and thus can identify the true control direction quickly. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
11. LADM-based modeling of the unified registration of immovable property in China.
- Author
-
Yu, Changbin, Li, Lin, He, Biao, Zhao, Zhigang, and Li, Xiaoming
- Subjects
REAL property ,PROPERTY rights ,FORESTS & forestry ,INFORMATION resources management ,THREE-dimensional modeling - Abstract
In China, the types of immovable property objects cover not only land (a typical immovable property object) but also buildings, sea areas, forests, etc., and the general idea of unified registration of immovables (as the newest development and hottest topic in field of land administration in China) proposed by Property Law of the People’s Republic of China (2007) is not detailed until 2014 when “ Interim Regulations on Real Estate Registration ” was enacted and would come into force in 2015. This paper focuses on modeling of unified registration of immovables in China whose cores rely on “4 unifications” (i.e., unification of registering basis, unification of registering authorities, unification of information management platform, unification of registering books) using the world-wide advanced standard LADM (Land Administration Domain Model). In detail, the typical 8 immovable property rights ( right to use construction land/forest land/sea area, ownership of houses/forests/marine structures, right to contractual management of arable land/grass land ) are firstly introduced; then change of register types before and after unified registration (as one important component of “unification of registering basis”) is described; later, comparison of register procedures reflecting “unification of authorities”, “unification of information management platform” and “unification of registering books” is modeled using LADM where parties, 3R, spatial units package are greatly referenced which is followed by elaboration of a newly proposed URDMIPO (Unified Registration Data Model for Immovable Property Object). However, the complete implementation of unified registration in China will still take a long time. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
12. On leaderless and leader-following consensus for interacting clusters of second-order multi-agent systems.
- Author
-
Qin, Jiahu, Yu, Changbin, and Anderson, Brian D.O.
- Subjects
- *
MULTIAGENT systems , *COMBINATORIAL topology , *GRAPH theory , *MATHEMATICAL bounds , *CLUSTER analysis (Statistics) - Abstract
This paper investigates the group consensus phenomenon for multiple interacting clusters of double-integrator agents in the presence of both cooperative and competitive inter-cluster couplings under two different frameworks, viz., the framework that all agents share the same position and velocity interaction topology and the framework that the position and velocity topologies are modeled by totally independent graphs. Both the case without leaders and the leader-following (meaning there is a single leader for each cluster of agents) case are systematically investigated. Different systems models are systematically analyzed accordingly using various different techniques. Theoretical analysis shows that for most cases, there holds a consistent structural result that group consensus can be achieved if the underlying topology for each cluster of agents satisfies certain connectivity assumptions and further, the intra-cluster couplings are sufficiently strong. Some lower bounds for such strengths are explicitly specified as well. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
13. Uniform upper bound of the second largest eigenvalue of stochastic matrices with equal-neighbor rule.
- Author
-
Huang, Chao and Yu, Changbin
- Subjects
- *
STOCHASTIC matrices , *EIGENVALUES , *GRAPH theory , *PARAMETER estimation , *STOCHASTIC convergence - Abstract
Given the number of vertices only, we provide a uniform upper bound of the second largest eigenvalue (SLE) of stochastic matrices induced from rooted graphs under the equal-neighbor rule, by acquiring a tight upper bound of its scrambling constant (SC). Furthermore, with the concept of canonical form of rooted graphs, we find the least connective topology of rooted graphs in the sense of SC. When more information on the graph topology is available, a more accurate bound is also provided. Our result is applied to estimate the convergence rate of consensus protocols studied in system and control literature. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
14. Translation and attitude synchronization for multiple rigid bodies using dual quaternions.
- Author
-
Wang, Yinqiu and (Brad) Yu, Changbin
- Subjects
- *
SYNCHRONIZATION , *RIGID bodies , *MATHEMATICAL models , *QUATERNIONS , *TELECOMMUNICATION systems - Abstract
In this paper, we investigate two attitude and translation synchronization problems for multiple fully actuated rigid bodies. A receiving little attention mathematical tool–dual quaternion is employed to design synchronization control laws. And the analysis based on dual quaternion is a unified solution for attitude and translation simultaneously. The definition and some properties about dual quaternion are introduced firstly. Then, a leaderless distributed control law is proposed for the attitude and translation synchronization of these rigid bodies with notion concision and non-singularity. Moreover, the final angular velocities and linear velocities are nonzero under the proposed control law if the synchronization is achieved. Next, we address the tracking synchronization for a group of rigid bodies with a time-varying leader. In addition, not only the synchronization performances under the acyclic communication topology are investigated, but the performances under the communication topology containing cycles are also analyzed. Finally, two examples are given to validate the effectiveness of the theoretical results. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
15. Design of delta–sigma modulators via generalized Kalman–Yakubovich–Popov lemma.
- Author
-
Li, Xianwei, Yu, Changbin (Brad), and Gao, Huijun
- Subjects
- *
DELTA-sigma modulation , *GENERALIZATION , *KALMAN filtering , *TRANSFER functions , *PROBLEM solving - Abstract
This paper is concerned with the design of delta–sigma modulators via the generalized Kalman–Yakubovich–Popov lemma. The shaped noise transfer function (NTF) is assumed to have infinite impulse response, and the optimization objective is minimizing the maximum magnitude of the NTF over the signal frequency band. By virtue of the GKYP lemma, the optimization of an NTF is converted into a minimization problem subject to quadratic matrix inequalities, and then an iterative algorithm is proposed to solve this alternative minimization problem. Each iteration of the algorithm contains linear matrix inequality constraints only and can be effectively solved by the existing numerical software packages. Moreover, specifications on the NTF zeros are also integrated in the design method. A design example demonstrates that the proposed design method has an advantage over the benchmark one in improving the signal-to-noise ratio. [ABSTRACT FROM AUTHOR]
- Published
- 2014
- Full Text
- View/download PDF
16. Cluster synchronization in directed networks of partial-state coupled linear systems under pinning control.
- Author
-
Yu, Changbin (Brad), Qin, Jiahu, and Gao, Huijun
- Subjects
- *
LINEAR systems , *CLUSTER analysis (Statistics) , *SYNCHRONIZATION , *AUTOMATIC control systems , *COUPLED structural systems , *FEEDBACK control systems , *ELECTRIC network topology - Abstract
This paper investigates the cluster synchronization for network of linear systems via a generalized pinning control strategy which allows the network of each cluster to take relaxed topological structure. For the case with fixed topology, it is shown that a feasible feedback controller can be designed to achieve the given cluster synchronization pattern if the induced network topology of each cluster has a directed spanning tree and further compared to the couplings among different clusters, the couplings within the each cluster are sufficiently strong. An extra balanced condition is imposed on the network topology of each cluster to allow for the cluster synchronization under arbitrary switching network topologies. Such a balanced condition can be removed via the use of dwell-time technique. For all the cases, the lower bounds for such strengths of couplings within each cluster that secure the synchronization as well as cluster synchronization rate are explicitly specified. Finally, some illustrative examples are provided to demonstrate the effectiveness of the theoretical findings. [ABSTRACT FROM AUTHOR]
- Published
- 2014
- Full Text
- View/download PDF
17. Exponential consensus of general linear multi-agent systems under directed dynamic topology.
- Author
-
Qin, Jiahu and Yu, Changbin (Brad)
- Subjects
- *
MULTIAGENT systems , *EXPONENTIAL functions , *LINEAR systems , *TOPOLOGY , *MATRICES (Mathematics) , *STOCHASTIC convergence , *INTEGRATORS - Abstract
This paper aims to investigate the consensus control of generic linear multi-agent systems (MASs) under directed dynamic topology. Nonnegative matrix theory, in particular the product properties of infinite row-stochastic matrices, which are widely used for multiple integrator agents, is explored to deal with the convergence analysis of generic linear MASs. It is finally shown that the exponential consensus can be reached under very relaxed conditions, i.e., the directed interaction topology is only required to be repeatedly jointly rooted and the exponentially unstable mode of each individual system is weak enough. Moreover, a least convergence rate and a bound for the unstable mode of the individual agent system, both of which are independent of the switching mode, can be explicitly specified. [ABSTRACT FROM AUTHOR]
- Published
- 2014
- Full Text
- View/download PDF
18. Cluster consensus control of generic linear multi-agent systems under directed topology with acyclic partition.
- Author
-
Qin, Jiahu and Yu, Changbin
- Subjects
- *
MULTIAGENT systems , *LINEAR systems , *CLUSTER analysis (Statistics) , *TOPOLOGY , *PARTITIONS (Mathematics) , *FEEDBACK control systems - Abstract
Abstract: This paper investigates the cluster consensus control for generic linear multi-agent systems (MASs) under directed interaction topology via distributed feedback controller. Focus of this paper is particularly on addressing the following problem which is of both theoretical and practical interests but have not been considered in the existing literature: under what kind of interaction among the clusters can the cluster consensus control be achieved regardless of the magnitudes of the coupling strengths among the agents? Directed acyclic interaction topology among the clusters is proved to have this property. As opposed to the algebraic conditions provided in the existing literature, conditions for guaranteeing the cluster consensus control in this paper are presented in terms of purely the graphic topology conditions and thus are very easy to be verified. [Copyright &y& Elsevier]
- Published
- 2013
- Full Text
- View/download PDF
19. Analyzing localization errors in one-dimensional sensor networks
- Author
-
Huang, Baoqi, Yu, Changbin, and Anderson, Brian D.O.
- Subjects
- *
SENSOR networks , *ALGORITHMS , *ESTIMATION theory , *SIGNAL detection , *SIGNAL processing , *INFORMATION technology - Abstract
Abstract: One-dimensional sensor networks can be found in many fields and demand node location information for various applications. Developing localization algorithms in one-dimensional sensor networks is trivial, due to the fact that existing localization algorithms developed for two- and three-dimensional sensor networks are applicable; nevertheless, analyzing the corresponding localization errors is non-trivial at all, because it is helpful to improving localization accuracy and designing sensor network applications. This paper deals with localization errors in distance-based multi-hop localization procedures of one-dimensional sensor networks through the Cramér–Rao lower bound (CRLB). We analyze the fundamental behaviors of localization errors and show that the localization error for a sensor is locally determined by network elements within a certain range of this sensor. Moreover, we break down the analysis of localization errors in a large-scale sensor network into the analysis in small-scale sensor networks, termed unit networks, in which tight upper and lower bounds on the CRLB can be established. Finally, we investigate two practical issues: the applicability of the analysis based on the CRLB and the optimal anchor placement. [Copyright &y& Elsevier]
- Published
- 2012
- Full Text
- View/download PDF
20. Formation control using range-only measurements
- Author
-
Cao, Ming, Yu, Changbin, and Anderson, Brian D.O.
- Subjects
- *
DISCRETE-time systems , *ALGORITHMS , *COORDINATES , *MOBILE agent systems , *MULTIAGENT systems , *DISTANCES - Abstract
Abstract: This paper proposes algorithms to coordinate a formation of mobile agents when the agents are not able to measure the relative positions of their neighbors, but only the distances to their respective neighbors. In this sense, less information is available to agents than is normally assumed in formation stabilization or station keeping problems. To control the shape of the formation, the solution advanced in the paper involves subsets of non-neighbor agents cyclically localizing the relative positions of their respective neighbor agents while these are held stationary, and then moving to reduce the value of a cost function which is nonnegative and assumes the zero value precisely when the formation has correct distances. The movement schedule is obtained by a novel vertex-coloring algorithm whose computation time is linear in the number of agents when implemented on the graphs of minimally rigid formations. Since in some formations, it may be that an agent is never allowed to be stationary (e.g. it is a fixed-wing aircraft), or because formations may be required to move as a whole in a certain direction, the results are extended to allow for cyclic localization of agents in this case. The tool used is the Cayley–Menger determinant. [Copyright &y& Elsevier]
- Published
- 2011
- Full Text
- View/download PDF
21. Three and higher dimensional autonomous formations: Rigidity, persistence and structural persistence
- Author
-
Yu, Changbin, Hendrickx, Julien M., Fidan, Barış, Anderson, Brian D.O., and Blondel, Vincent D.
- Subjects
- *
COMPUTER science , *GRAPH theory , *DIRECTED graphs , *AUTOMATION - Abstract
Abstract: In this paper, we generalize the notion of persistence, which has been originally introduced for two-dimensional formations, to for , seeking to provide a theoretical framework for real world applications, which often are in three-dimensional space as opposed to the plane. Persistence captures the desirable property that a formation moves as a cohesive whole when certain agents maintain their distances from certain other agents. We verify that many of the properties of rigid and/or persistent formations established in are also valid for higher dimensions. Analysing the closed subgraphs and directed paths in persistent graphs, we derive some further properties of persistent formations. We also provide an easily checkable necessary condition for persistence. We then turn our attention to consider some practical issues raised in multi-agent formation control in three-dimensional space. We display a new phenomenon, not present in , whereby subsets of agents can behave in a problematic way. When this behaviour is precluded, we say that the graph depicting the multi-agent formation has structural persistence. In real deployment of controlled multi-agent systems, formations with underlying structurally persistent graphs are of interest. We analyse the characteristics of structurally persistent graphs and provide a streamlined test for structural persistence. We study the connections between the allocation of degrees of freedom (DOFs) across agents and the characteristics of persistence and/or structural persistence of a directed graph. We also show how to transfer DOFs among agents, when the formation changes with new agent(s) added, to preserve persistence and/or structural persistence. [Copyright &y& Elsevier]
- Published
- 2007
- Full Text
- View/download PDF
22. A novel model reduction method and its application to a pilot distillation column
- Author
-
Chu, Jian, Yu, Changbin, and Wang, Jicheng
- Published
- 1986
- Full Text
- View/download PDF
23. Event-based agreement protocols for complex networks with time delays under pinning control.
- Author
-
Liu, Qingchen, Qin, Jiahu, and Yu, Changbin
- Subjects
- *
SYNCHRONIZATION , *POWER resources , *LINEAR systems , *BINOMIAL distribution , *LINEAR matrix inequalities - Abstract
Most pinning synchronization schemes for complex networks with or without time delays reported in the literature require continuous state measurements and control updates, which are not suitable for implementation on digital platforms. In this paper, we first establish some pinning synchronization criteria for complex networks modeled by directed graphs with both internal and coupling delays based on an event-triggered mechanism. We also propose the design method for control gains under some mild assumptions. The piecewise constant nature of control law can help reduce the number of updates significantly, thereby saving energy resources. Moreover, by obtaining an explicit lower bound on the inter-event time interval, we prove that Zeno behavior does not exist in the evolution of each node of the complex network. At last, simulations are provided which verify the effectiveness of the proposed controllers. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
24. Local average consensus in distributed measurement of spatial–temporal varying parameters: 1D case.
- Author
-
Cai, Kai, Anderson, Brian D.O., Yu, Changbin, and Mao, Guoqiang
- Subjects
- *
DISTRIBUTED computing , *SPATIOTEMPORAL processes , *PARAMETERS (Statistics) , *SENSOR networks , *INFORMATION theory , *MEASUREMENT errors - Abstract
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. We employ two schemes for computation of local average consensus: exponential weighting and uniform finite window. In both schemes, we design local average consensus algorithms to address first the case where the measured parameter has spatial variation but is constant in time, and then the case where the measured parameter has both spatial and temporal variations. Our designed algorithms are distributed, in that information is exchanged only among neighbors. Moreover, we analyze both spatial and temporal frequency responses and noise propagation associated with the algorithms. The tradeoffs of using local consensus, as compared to standard global consensus, include higher memory requirement and degraded noise performance. Arbitrary updating weights and random spacing between sensors are also analyzed in the proposed algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
25. Request-based gossiping without deadlocks.
- Author
-
Liu, Ji, Mou, Shaoshuai, Morse, A. Stephen, Anderson, Brian D.O., and Yu, Changbin (Brad)
- Subjects
- *
ITERATIVE methods (Mathematics) , *STOCHASTIC convergence , *MATHEMATICAL bounds , *QUEUING theory , *DISTRIBUTED network protocols - Abstract
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. Many gossiping protocols are request-based which means simply that a gossip between two agents will occur whenever one of the two agents accepts a request to gossip placed by the other. In this paper, we present three deterministic request-based protocols. We show by example that the first can deadlock. The second is guaranteed to avoid deadlocks by exploiting the idea of local ordering together with the notion of an agent’s neighbor queue; the protocol requires the simplest queue updates, which provides an in-depth understanding of how local ordering and queue updates avoid deadlocks. It is shown that a third protocol which uses a slightly more complicated queue update rule can lead to significantly faster convergence; a worst case bound on convergence rate is provided. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
26. Conservation and decay laws in distributed coordination control systems.
- Author
-
Sun, Zhiyong, Mou, Shaoshuai, Anderson, Brian D.O., and Yu, Changbin
- Subjects
- *
CONSERVATION laws (Mathematics) , *MULTIAGENT systems , *ANGULAR momentum (Mechanics) , *CONTROL theory (Engineering) , *NOETHER'S theorem , *INTEGRATORS - Abstract
In this paper we discuss and discover several conservation and associated decay laws in distributed coordination control systems, in particular in formation shape control systems. Specifically, we reveal conservations of linear momentum and angular momentum for gradient-based multi-agent formation systems modelled by single integrators, and show several corresponding conservation/decay laws for double-integrator formation stabilization systems and double-integrator flocking systems, respectively. By exploiting translation and rotation symmetry properties and insights from Noether’s theorem, we further establish a multi-agent version of the relation between symmetry and conservation laws for gradient-based coordination systems derived from general potential functions, from which we generalize the conservation/decay laws to more general networked coordination control systems. The results hold in ambient spaces of any dimensions, and we focus on the 2-D and 3-D cases due to their natural interpretation as positions of agents. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
27. Distributed localization with mixed measurements under switching topologies.
- Author
-
Lin, Zhiyun, Han, Tingrui, Zheng, Ronghao, and Yu, Changbin
- Subjects
- *
DISTRIBUTED computing , *TOPOLOGY , *COMPUTER algorithms , *WIRELESS sensor nodes , *STOCHASTIC convergence - Abstract
This paper investigates the distributed localization problem of sensor networks with mixed measurements. Each node holds a local coordinate system without a common orientation and is capable of measuring only one type of information (either distance, bearing, or relative position) to near-by nodes. Thus, three types of measurements are mixed in the sensor networks. Moreover, the communication topologies in the sensor networks may be time-varying due to unreliable communications. This paper develops a fully distributed algorithm called BCDL (Barycentric Coordinate based Distributed Localization) where each node starts from a random initial guess about its true coordinate and converges to the true coordinate via only local node interactions. The key idea in BCDL is to establish a unified linear equation constraints for the sensor coordinates by using the barycentric coordinates of each node with respect to its neighbors though the sensor nodes may have different types of measurements. Then a distributed iterative algorithm is proposed to solve the linear equations under time-varying communication networks. A necessary and sufficient graphical condition is obtained to ensure global convergence of the distributed algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
28. Reach almost sure consensus with only group information.
- Author
-
Lin, Zhiyun, Hou, Jian, Yan, Gangfeng, and (Brad) Yu, Changbin
- Subjects
- *
GROUP theory , *INFORMATION theory , *PROBLEM solving , *SCHEMES (Algebraic geometry) , *PARTITIONS (Mathematics) , *MULTIAGENT systems - Abstract
This brief presents a new distributed scheme to solve the consensus problem for a group of agents if neither their absolute states nor inter-agent relative states are available. The new scheme considers a random partition of agents into two subgroups at each step and then uses the relative group representative state as feedback information for the consensus purpose. It is then shown that almost sure consensus can be achieved under the proposed scheme in both discrete time and continuous time. For the discrete time case, almost sure consensus is achieved if and only if the weighting parameter for state update is greater than one. For the continuous time case, almost sure consensus is realized when the weighting parameter is positive. Moreover, it is shown that if a uniform probability is considered for group selection, then the group of agents can reach average consensus in mean. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
29. Leader–follower formation via complex Laplacian.
- Author
-
Lin, Zhiyun, Ding, Wei, Yan, Gangfeng, Yu, Changbin, and Giua, Alessandro
- Subjects
- *
LAPLACIAN matrices , *GRAPH theory , *EQUILIBRIUM , *ALGORITHMS , *INTEGRATORS , *PROBLEM solving - Abstract
Abstract: The paper introduces complex-valued Laplacians for graphs whose edges are attributed with complex weights and studies the leader–follower formation problem based on complex Laplacians. The main goal is to control the shape of a planar formation of point agents in the plane using simple and linear interaction rules related to complex Laplacians. We present a characterization of complex Laplacians that preserve a specific planar formation as an equilibrium solution for both single integrator kinematics and double integrator dynamics. Planar formations under study are subject to translation, rotation, and scaling in the plane, but can be determined by two co-leaders in leader–follower networks. Furthermore, when a complex Laplacian does not result in an asymptotically stable behavior of the multi-agent system, we show that a stabilizing matrix, which updates the complex weights, exists to asymptotically stabilize the system while preserving the equilibrium formation. Also, algorithms are provided to find stabilizing matrices. Finally, simulations are presented to illustrate our results. [Copyright &y& Elsevier]
- Published
- 2013
- Full Text
- View/download PDF
30. Performance limits in sensor localization
- Author
-
Huang, Baoqi, Li, Tao, Anderson, Brian D.O., and Yu, Changbin
- Subjects
- *
DETECTORS , *PERFORMANCE evaluation , *SIGNAL theory , *STATISTICS , *GEOMETRIC analysis , *ASYMPTOTIC distribution - Abstract
Abstract: In this paper, we study the Cramér–Rao Lower Bound (CRLB) in single-hop sensor localization using measurements derived from received signal strength (RSS), time of arrival (TOA) and bearing, respectively, from a novel perspective. Differently from the existing work, we use a statistical sensor–anchor geometry modeling method, with the result that the trace of the associated CRLB matrix, as a scalar metric for performance limits of sensor localization, becomes a random variable. Given a probability measure for the sensor–anchor geometry, the statistical properties of the metric are analyzed to demonstrate properties of sensor localization. Using the Central Limit Theorems for -statistics, we show that as the number of anchors increases, the metric is asymptotically normal in the RSS/bearing case, and converges to a random variable which is an affine transformation of a chi-square random variable of degree 2 in the TOA case. We provide formulas quantitatively describing the relationship among the mean and standard deviation of the metric, the number of the anchors, the parameters of communication channels, the noise statistics in measurements and the spatial distribution of the anchors. These formulas, though asymptotic in the number of the anchors, in many cases turn out to be remarkably accurate in predicting performance limits, even if the number is small. Simulations are carried out to confirm our results. [Copyright &y& Elsevier]
- Published
- 2013
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.