Solmaz S. Kia

Learn More
This paper proposes a novel class of distributed continuous-time coordination algorithms to solve network optimization problems whose cost function is strictly convex and equal to a sum of local cost functions associated to the individual agents. We establish the exponential convergence of the proposed algorithm under (i) strongly connected and(More)
Digoxin is widely used as a cardiac glycoside drug in the treatment of various heart conditions. Because it is a toxic drug, it should be regularly monitored in the serum of patients under treatment. In this study, colloidal nanogold is synthesized and the preparation of nanogold-labeled monoclonal antibody probe to digoxin is described under optimal(More)
A rapid immunochromatography (ICG) assay based on antibody colloidal gold nanoparticles specific to human serum albumin (HSA) was developed, and its applications for primary screening of HSA in the urine were evaluated. A monoclonal antibody (MAb) specific to HSA was produced from cloned hybridoma cells (EMRC1) and used to develop an ICG strip. The(More)
We propose a distributed continuous-time algorithm to solve a network optimization problem where the global cost function is a strictly convex function composed of the sum of the local cost functions of the agents. We establish that our algorithm, when implemented over strongly connected and weight-balanced directed graph topologies, converges exponentially(More)
We present a novel decentralized cooperative localization algorithm for mobile robots. The proposed algorithm is a decentralized implementation of a centralized Extended Kalman Filter for cooperative localization. In this algorithm, instead of propagating cross-covariance terms, each robot propagates new intermediate local variables that can be used in an(More)
This paper presents distributed algorithmic solutions that employ opportunistic inter-agent communication to achieve dynamic average consensus. Our solutions endow individual agents with autonomous criteria that can be checked with the information available to them in order to determine whether to broadcast their state to their neighbors. Our starting point(More)
This paper analyzes distributed algorithmic solutions to dynamic average consensus implemented in continuous time and relying on communication at discrete instants of time. Our starting point is a distributed coordination strategy that, under continuous-time communication, achieves practical asymptotic tracking of the dynamic average of the time-varying(More)
Technological advances in ad-hoc networking and in miniaturization of electro-mechanical systems have enabled us to use large numbers of mobile agents (e.g., mobile robots, human agents, unmanned underwater vehicles or spacecraft) to perform surveillance, search and rescue, transport and delivery tasks—beyond the capabilities of a single device—in aerial,(More)
This paper proposes two continuous-time dynamic average consensus algorithms for networks with strongly connected and weight-balanced interaction topologies. The proposed algorithms, termed 1st-Order-Input Dynamic Consensus (FOI-DC ) and 2nd-Order-Input Dynamic Consensus (SOI-DC ), respectively, allow agents to track the average of their dynamic inputs(More)