This thesis addresses the problem of estimating the state in multi-agent decision and control systems. In particular, a novel approach to state estimation is developed that uses partial order theory in order to overcome some of the severe computational complexity issues arising in multi-agent systems. Within this approach, state estimation algorithms are developed that enjoy provable convergenc...

Modern multi-core systems have a large number of design parameters, most of which are discrete-valued, and this number is likely to keep increasing as chip complexity rises. Further, the accurate evaluation of a potential design choice is computationally expensive because it requires detailed cycleaccurate system simulation. If the discrete parameter space can be embedded into a larger continuo...

In this paper, a discrete-time multi-agent system is presented which is formulated in terms of the delta operator. The proposed multi-agent system can unify discrete-time and continuous-time multi-agent systems. In a multi-agent network, in practice, the communication among agents is acted upon by various factors. The communication network among faulty agents may cause link failures, which is m...

In this paper, the optimal adaptive leader-follower consensus of linear continuous time multi-agent systems is considered. The error dynamics of each player depends on its neighbors’ information. Detailed analysis of online optimal leader-follower consensus under known and unknown dynamics is presented. The introduced reinforcement learning-based algorithms learn online the approximate solution...

Mobile ad-hoc networks have attracted a great deal of attentions over the past few years. Considering their applications, the security issue has a great significance in them. Security scheme utilization that includes prevention and detection has the worth of consideration. In this paper, a method is presented that includes a multi-level security scheme to identify intrusion by sensors and authe...

A CSS1†is a system with the continues-state components. When a component has the ability to obtain all the situations from completely working to completely failed, it named continues-state component. In the real world, performance rate of elements are continuous and decrease by time. Continuity of components causes infinite working states and grows up the system states. In this paper we propose...

The task of continuous online unsupervised learning of streaming data in complex dynamic environments under conditions of uncertainty is an NP-hard optimization problem for general metric spaces. This paper describes a computationally efficient adaptive multi-agent approach to continuous online clustering of streaming data, which is originally sensitive to environmental variations and provides ...

Abstract Under a fourth-order moment condition on the branching and second-order immigration mechanisms, we show that an appropriately scaled projection of supercritical irreducible continuous-state continuous-time process with certain left non-Perron eigenvectors mean matrix is asymptotically mixed normal. With appropriate random scaling, under some conditional probability measure, prove asymp...

Bansal and Kianfar introduced continuous multi-mixing set where the coefficients satisfy the so-called n-step MIR conditions and developed facet-defining inequalities for this set. In this paper, we first generalize their inequalities for the continuous multi-mixing set with general coefficients (where no conditions are imposed on the coefficients) and show that they are facetdefining in many c...