scispace - formally typeset
Search or ask a question
Topic

Aperiodic graph

About: Aperiodic graph is a research topic. Over the lifetime, 2105 publications have been published within this topic receiving 39134 citations.


Papers
More filters
Journal ArticleDOI
Hisaya Fujioka1
TL;DR: An algorithm for stability analysis is proposed for sampled-data feedback control systems with uncertainly time-varying sampling intervals based on the robustness of related discrete-time systems against perturbation caused by the variation of sampling intervals.
Abstract: Motivated by the widespread use of networked and embedded control systems, an algorithm for stability analysis is proposed for sampled-data feedback control systems with uncertainly time-varying sampling intervals. The algorithm is based on the robustness of related discrete-time systems against perturbation caused by the variation of sampling intervals. The validity of the algorithm is demonstrated by numerical examples.

232 citations

Journal ArticleDOI
TL;DR: A discontinuous Lyapunov functional approach is developed to derive a design criterion on the existence of an admissible sampled-data CFP for cluster formation control for a networked multi-agent system in the simultaneous presence of aperiodic sampling and communication delays.
Abstract: This paper addresses the problem of cluster formation control for a networked multi-agent system (MAS) in the simultaneous presence of aperiodic sampling and communication delays. First, to fulfill multiple formation tasks, a group of agents are decomposed into $M$ distinct and nonoverlapping clusters. The agents in each cluster are then driven to achieve a desired formation, whereas the MAS as a whole accomplishes $ M $ cluster formations. Second, by a proper modeling of aperiodic sampling and communication delays, an aperiodic sampled-data cluster formation protocol (CFP) is delicately constructed such that the information exchanges among neighboring agents only occur intermittently at discrete instants of time. Third, a detailed theoretical analysis of cluster formability is carried out and a sufficient and necessary condition is provided such that the system is $M$ -cluster formable. Furthermore, a discontinuous Lyapunov functional approach is developed to derive a design criterion on the existence of an admissible sampled-data CFP. Finally, numerical simulations on a team of nonholonomic mobile robots are given to illustrate the effectiveness of the obtained theoretical result.

230 citations

Journal ArticleDOI
TL;DR: This paper investigates a method of creating thinned aperiodic linear phased arrays through the application of genetic algorithms that will suppress the grating lobes with increased steering angles and place restrictions on the driving-point impedance of each element so that they are well behaved during scanning.
Abstract: The scan volume of a thinned periodic linear phased array is proportional to the spacing between array elements. As the spacing between elements increases beyond a half wavelength, the scan range of the array will be significantly reduced due to the appearance of grating lobes. This paper investigates a method of creating thinned aperiodic linear phased arrays through the application of genetic algorithms that will suppress the grating lobes with increased steering angles. In addition, the genetic algorithm will place restrictions on the driving-point impedance of each element so that they are well behaved during scanning. A genetic algorithm approach is also introduced for the purpose of evolving an optimal set of matching networks. Finally, an efficient technique for evaluating the directivity of an aperiodic array of half-wave dipoles is developed for use in conjunction with genetic algorithms.

228 citations

Journal ArticleDOI
TL;DR: An impulsive consensus algorithm is proposed for second-order continuous-time multi-agent networks with switching topology by using the property of stochastic matrices and algebraic graph theory to ensure the consensus of the controlled multi- agent network if the communication graph has a spanning tree jointly.
Abstract: In this technical note, an impulsive consensus algorithm is proposed for second-order continuous-time multi-agent networks with switching topology. The communication among agents occurs at sampling instants based on position only measurements. By using the property of stochastic matrices and algebraic graph theory, some sufficient conditions are obtained to ensure the consensus of the controlled multi-agent network if the communication graph has a spanning tree jointly. A numerical example is given to illustrate the effectiveness of the proposed algorithm.

224 citations

Journal ArticleDOI
TL;DR: A novel distributed output-feedback control strategy is proposed so that the controlled MAS achieves the objective of output consensus in spite of aperiodic sampling and random deny-of-service (DoS) attack.
Abstract: In this paper, the robust output consensus problem for a class of heterogeneous linear multiagent systems (MASs) in presence of aperiodic sampling and random deny-of-service (DoS) attack is investigated. A novel distributed output-feedback control strategy is proposed so that the controlled MAS achieves the objective of output consensus in spite of aperiodic sampling and DoS attack. By assuming that the sampling process is nonuniform and the consecutive attack duration is upper bounded, the closed-loop control system is first described as a discrete-time switched stochastic delay system. Some sufficient conditions are then obtained for the solvability of the secure consensus problem. Furthermore, a constructive design procedure for the proposed controller is then presented. Finally, a simulation example is introduced to illustrate the effectiveness of controller design.

221 citations


Network Information
Related Topics (5)
Nonlinear system
208.1K papers, 4M citations
84% related
Matrix (mathematics)
105.5K papers, 1.9M citations
82% related
Markov chain
51.9K papers, 1.3M citations
80% related
Differential equation
88K papers, 2M citations
80% related
Robustness (computer science)
94.7K papers, 1.6M citations
79% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
2023302
2022606
2021142
2020109
2019119
201894