Results 201 to 210 of about 48,688 (228)
Some of the next articles are maybe not open access.
Related searches:
Related searches:
IEEE transactions on intelligent transportation systems (Print), 2022
Congestion recognition is necessary for vehicle routing, traffic control, and many other applications in intelligent transportation systems. Besides, traffic facilities in the three-dimensional road network, which contains the fundamental spatiotemporal ...
Guojiang Shen +3 more
semanticscholar +1 more source
Congestion recognition is necessary for vehicle routing, traffic control, and many other applications in intelligent transportation systems. Besides, traffic facilities in the three-dimensional road network, which contains the fundamental spatiotemporal ...
Guojiang Shen +3 more
semanticscholar +1 more source
Pinning Stabilizer Design for Probabilistic Boolean Control Networks via Condensation Digraph
IEEE Transactions on Neural Networks and Learning Systems, 2022This article investigates the design of pinning controllers for state feedback stabilization of probabilistic Boolean control networks (PBCNs), based on the condensation digraph method.
Lina Wang, Jia-Yue Liu, Yang Liu, W. Gui
semanticscholar +1 more source
Pinning Asymptotic Stabilization of Probabilistic Boolean Networks: A Digraph Approach
IEEE Transactions on Control of Network Systems, 2022This article investigates the pinning asymptotic stabilization of probabilistic Boolean networks (PBNs) by a digraph approach. In order to stabilize the PBN asymptotically, a mode-independent pinning control (MIPC) is designed to make the target state a ...
Bingquan Chen +4 more
semanticscholar +1 more source
Digraph Filter Design Based on Directed Laplacian Matrix and Least Squares Method
IEEE Transactions on Circuits and Systems Part 1: Regular Papers, 2022In this paper, the digraph filter design based on directed Laplacian matrix (DLM) and least squares method is presented. First, the eigen-decomposition of DLM is used to define the digraph Fourier transform (DGFT).
C. Tseng, Su-Ling Lee
semanticscholar +1 more source
Enumeration of connected components of acyclic digraph
Journal of Discrete Mathematical Sciences and Cryptography, 2021We established the concept of a binary reflexive relation of adjacency and determined the algebraic system consisting of all binary relations of set X and all unordered pairs of binary relations in terms of characteristic functions on the set of all ...
Kh. Sh. Al'Dzhabri
semanticscholar +1 more source
Leader-following consensus of nonlinear singular multi-agent systems under signed digraph
International Journal of Systems Science, 2020This paper investigates the leader-following consensus problem for a singular multi-agent system with nonlinear dynamics and signed digraph topology. Firstly, an algorithm is proposed to address the structural balance problem of the signed network, which
Jie Ren +4 more
semanticscholar +1 more source
Min-Consensus for Heterogeneous Higher-Order Integrators Under Switching Digraph
IEEE Control Systems Letters, 2020For a multi-agent system (MAS), researchers have explored min-consensus for single-integrators under uniformly strongly-connected digraph, and double-integrators under jointly-connected graphs.
Bhavana Singh, Arijit Sen, S. R. Sahoo
semanticscholar +1 more source
IEEE Transactions on Cybernetics, 2019
In this paper, some efficient criteria for finite-time consensus of a class of nonsmooth opinion dynamics over a digraph are established. The lower and upper bounds on the finite settling time are obtained based respectively on the maximal and minimal ...
Xinli Shi, Jinde Cao, G. Wen, M. Perc
semanticscholar +1 more source
In this paper, some efficient criteria for finite-time consensus of a class of nonsmooth opinion dynamics over a digraph are established. The lower and upper bounds on the finite settling time are obtained based respectively on the maximal and minimal ...
Xinli Shi, Jinde Cao, G. Wen, M. Perc
semanticscholar +1 more source

