The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
DTN is a type of network with the routing strategy of storage and forward. Owing to the character of high latency, low transfer rate and intermittent connectivity, it is difficult to maintain the reliability of end to end paths. Hence the research of DTN protocol is meaningful and critical. In this paper, we assume a vehicle network scenario in the disaster. There exists significant performance degradation...
Motivated by the fact that the existing sampled-data consensus tracking protocols can only ensure that single-integrator multi-agent systems track a bounded-velocity reference state available to only a portion of agents in the continuous-time domain, this paper proposes an improved sampled-data consensus tracking protocol that can guarantee single-integrator multi-agent systems to track a bounded-acceleration...
This technical note proposes a general class of nonlinear protocols in the form of continuous state feedbacks for finite-time consensus in networks of integrator-like dynamic agents with directional link failure. These protocols, with adjustable terms, are applicable in a wide range of situations, such as with input saturation restrictions and with convergence rate constraints. Based on the assumption...
In line with traditional communication systems, more and more attention is given to autonomous, self-organized networks with no central infrastructure, based on peer-to-peer communication. Designing multihop broadcast protocols for these networks is a complex problem as the task of these protocols is to disseminate messages in a network effectively while avoiding unnecessary use of resources. The...
We consider the opinion consensus problem using a multi-agent setting based on the Hegselmann-Krause (H-K) Model. Firstly, we give a sufficient condition on the initial opinion distribution so that the system will converge to only one cluster. Then, modified models are proposed to guarantee convergence for more general initial conditions. The overall connectivity is maintained with these models, while...
We consider a flotilla composed of N autonomous mobile agents. Each agent ignores its absolute position but collects noisy measurements of the relative position of other agents. It has a convex utility function which depends on its control variables and on some global variables, typically, the average motion of all agents during a unit of time. The utility function of an agent is unknown by other...
This paper addresses formation control of singleintegrator modeled agents in the plane. It is assumed that the agents measure the relative-displacements of their neighbors with respect to their local reference frames, whose orientation are not necessarily aligned, and exchange local information through communication. For the agents, a formation control strategy is proposed. The control strategy consists...
In this paper we introduce and analyze $\lambda$-Alert problem: in the single hop radio network a subset of stations is being activated. The aim of the protocol is to decide if the number of activated stations is greater or equal to $\lambda$. This problem is similar to $k$-Selection problem. On the other hand, it can be seen as an extension of regular Alert problem. In our paper we consider the presented...
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...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.