Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
Routing algorithms can improve network performance by maximizing routing adaptiveness but can be problematic in the presence of endpoint congestion. Tree-saturation is a well-known behavior caused by endpoint congestion. Adaptive routing can, however, spread the congestion and result in thick branches of the congestion tree — creating Head-of-Line (HoL) blocking and degrading performance. In this...
Passive optical networks are the most promising solution for access networks. Nowadays, Gigabit passive optical networks are very popular for Internet services providers. These networks have currently been limited by transmission speeds (up to 2.5 Gbit/s in downstream) which is not sufficient for all services (such as 4k video transfer etc.) because this speed is shared with all users in the network...
This paper studies the average consensus problem for a discrete-time multi-agent system with first-order dynamics, we provide the sufficient and necessary stable condition that the step-size needs to satisfy for the multi-agent systems with an iterative method, and the cause of oscillation is investigated with use of matrix diagonal and eigenvalue analysis method. Some conclusions about the largest...
This paper studies the fully-distributed consensus problem for multi-agent systems with unknown dynamics and bounded external disturbances. The interaction topology of the multi-agent system is assumed to contain a directed spanning tree. Based on adaptive gains, we present the fully-distributed consensus protocol which can obtain consensus without using any global information. The simulation examples...
This paper has as a start point the metaheuristic Particle Swarm Optimization (PSO), which has very good abilities to solve many types of optimization problems. As a main contribution, this work proposes an intelligent algorithm derived from PSO. This algorithm has two main characteristics. The first one consists in the use of an improved version of PSO, namely Hybrid Topology Particle Swarm Optimization...
This paper proposes a distributed hierarchical control strategy for cooperative braking control of connected vehicle platoon with a focus on the car-following interactions between vehicles. To this end, a hierarchical control framework including the leader layer and follower layer is first proposed to illustrate the cooperative mechanism. Then, a distributed hierarchical control strategy is designed...
In this paper, a hybrid block Bregman projection iterative process is designed to seek a common fixed point about N Bregman quasi-strict pseudo-contractive operators. Furthermore, strong convergence results are given in some Banach space.
Average-consensus filter problem is investigated for a mixed-order multi-agent system, which consists of first-order and second-order agents, and the proportional-integral consensus filter algorithms are proposed for the agents with different constant inputs. Based on generalized Nyquist stability criterion, sufficient convergence conditions are obtained for the multiagent system under a fixed, symmetric...
A rapid growth in the internet network technologies claims for a better routing protocol in transmitting data. The network performance is evaluated to compare the two Link State (LS) routing protocols which are the Open Shortest Path First version3 (OSPFv3) and Intermediate System to Intermediate System (IS-IS). The evaluation is done in terms of the performance in the network convergence through...
Self — organizing natural systems are inspirational to swarm robotics. The applications include social insect systems and social behaviours. The multi — agent tree formation is one of the communication topologies of swarm robotic system. The agents are linked in a tree to communicate with each other through the hierarchy. The focus of this work is to form tree using Transfer Learning (TL) of Reinforcement...
The ring networks guarantee a high availability level, while limiting cabling costs. However, their performance analysis is still a relevant concern due to cyclic dependencies. In this paper, we handle this challenging issue based on Network Calculus formalism. We propose a new approach, Pay Multiplexing Only at Convergence points (PMOC), to compute accurate delay bounds while integrating the impact...
This paper focuses on the resource allocation problem with equality and inequality constraints in a fixed weight-balanced directed or undirected network. Moreover, we propose a fully decentralized subgradient algorithm with event-triggered for solving above resource allocation problem based on first-order discrete-time multi-agent systems. Where each agent only communicates with its neighbors and...
This paper studies the consensus problem of a first-order multi-agent system by using event-based strategy. For each agent, both of the control law and the triggering function utilize estimated combinational measurement, which is calculated based on the combinational measurement that sampled at the agent's event instant. The distributed triggering function is developed to compute these instants. Only...
This paper presents a hierarchical structure to solve the discrete time consensus problem for a group of agents. All the agents are divided into a couple of groups, and a new notation, called group information is proposed, which indicates all the agents' states inside one group. For each agent, it receives the information not only from the agent neighbors in the same group, but also the group information...
Distributed formation control of Unmanned Aerial Vehicle (UAV) in three-dimensional space is discussed in this paper. In order to achieve a faster consensus seeking, a consensus-based cooperative formation control strategy with the tow-hop relay protocol is proposed. UAV's nonlinear kinetic model is transformed into linear model by feedback linearization and the original control inputs are also transformed...
In this paper, the leader-following consensus problem of a class of fractional-order nonlinear multi-agent systems is considered. By using the algebraic graph theory, Lyapunov theory and LMI method of fractional-order systems, the control gain matrix is designed to achieve leader-following consensus under fixed and switching topologies respectively. Furthermore, the convergence rate of the controlled...
This paper designed a finite-time configuration control law that can weaken chattering under the directed communication topology. The leader information is available to only a portion of the followers and the existence of generalized disturbance in the dynamics model is considered. By defining the error function of relative configuration and selecting the appropriate variables of the finite-time high-order...
In this paper, we consider the privacy preserving problem of consensus protocol. First, we introduce a privacy preserving scheme, where each node produces and transmits a sequence of random values with their mean equaling to the node's initial state. We show that the network can reach average consensus with privacy preserving scheme, and provide a sufficient condition under which the initial state...
Competitive swarm optimizer (CSO) has shown promising results for solving large scale global optimization problems proposed recently. However, CSO shows insufficient exploitation of the population. In this paper, a competitive swarm optimizer integrated with Cauchy and Gaussian mutation (CGCSO) is proposed for large scale optimization. The new algorithm does not only update the losers' positions with...
This paper considers a central estimator design problem for stationary targets or moving targets based on weights assignment by a group of agents. A general form of estimator is first proposed. We then introduce the definitions of the converging central estimator. Then the central estimator is constructed by a new information assignment function and the information feedback function. Furthermore,...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.