@conference {
	title = {Average Consensus over Small World Networks: A Probabilistic Framework},
	author = {Hovareshti, Pedram., Baras, John S., Gupta, Vijay.},
	year = {2008},
	month = {12/2008},
	abstract = {It has been observed that adding a few long range edges to certain graph topologies can significantly increase the rate of convergence for consensus algorithms. A notable example is the class of ring-structured Watts-Strogatz small world graphs. Building on probabilistic methods for analyzing {\textquoteleft}small-world phenomena{\textquoteright}, developed in our earlier work, we provide here a probabilistic framework for analyzing this effect. We investigate what graph characteristics lead to such a significant improvement and develop bounds to analyze consensus problems on randomly varying graphs.},
	address = {Cancun, Mexico},
	booktitle = {47th IEEE Conference on Decision and Control},
	pages = {pp. 375-380}
}
@conference {
	title = {Observing a Linear Process over Analog Erasure Channels using Multiple Sensors: Necessary and Sufficient Conditions for Mean-square Stability},
	author = {Gupta, Vijay., Martins, Nuno C., Baras, John S.},
	year = {2007},
	month = {12/2007},
	abstract = {Consider a discrete-time linear time-invariant process being observed by two sensors, which are connected to an observer via links that can be modeled as erasure channels. If a link transmits successfully then a finite-dimensional vector of real numbers is conveyed from the sensor to the controller. If an erasure event occurs, then any information conveyed over the link is lost. This paper addresses the problem of designing the maps that specify the processing at the sensors and the observer to calculate the minimum mean square error estimate of the state of the process. We derive necessary and sufficient conditions for the existence of maps such that the estimate error is bounded in the second moment sense.},
	address = {New Orleans, Louisiana},
	booktitle = {46th IEEE Conference on Decision and Control},
	pages = {pp. 659-664}
}
@conference {
	title = {Sensor Scheduling using Smart Sensors},
	author = {Hovareshti, Pedram., Gupta, Vijay., Baras, John S.},
	year = {2007},
	month = {12/2007},
	abstract = {The sensor selection problem arises when multiple sensors are jointly trying to estimate a process but only a subset of them can take and/or use measurements at any time step. In a networked estimation situation, sensors are typically equipped with some memory and processing capabilities. We illustrate that utilization of these capabilities can lead to significant performance gains in the sensor selection problem for improved estimation performance. Further, it also leads to significant pruning of the search tree that yields the optimum sensor schedule. We also present a periodicity result for the case where the decision is whether the sensor should transmit or not.},
	address = {New Orleans, Louisiana},
	booktitle = {46th IEEE Conference on Decision and Control},
	pages = {pp. 494-499}
}
@conference {
	title = {Probabilistic Switching and Convergence Rate in Consensus Problems},
	author = {Hovareshti, Pedram., Baras, John S., Gupta, Vijay.},
	year = {2007},
	month = {09/2007},
	abstract = {We consider the convergence problem of consensus seeking agents and the effect of probabilistic switching on the convergence rate. Using a probabilistic setting, we develop a framework to study the convergence rate for different classes of graph topologies, including Small World networks. We show that by making the effective diameter of the underlying graph small, probabilistic switching can be helpful in the design of fast consensus algorithms.},
	address = {Chicago, Illinois},
	booktitle = {Allerton Conference on Communication, Control and Computing},
	pages = {pp. 423-430},
	organization = {Allerton House, UIUC}
}
@conference {
	title = {Stabilization Using Multiple Sensors over Analog Erasure Channels},
	author = {Gupta, Vijay., Martins, Nuno C., Baras, John S.},
	year = {2007},
	month = {04/2007},
	abstract = {Consider a discrete-time, linear time-invariant process,two sensors and one controller. The process is observed by the sensors, which are connected to the controller via links that can be modeled as erasure channels. If a link transmits successfully then a finite-dimensional vector of real numbers is conveyed from the sensor to the controller. If an erasure event occurs, then any information conveyed over the link is lost. This paper addresses the problem of designing the maps that specify the processing at the controller and at the sensors for stabilizing the process in the bounded second moment sense. When the information is lost over the links either in an independent and identically distributed (i.i.d.) or Markovian fashion over time,we derive necessary and sufficient conditions for the existence of maps such that the process is stabilized. Such conditions are expressed as inequalities involving the parameters of the plant and the probabilities of link fading. and provide the least conservative stabilization conditions. We also indicate how our approach can be used if more than two sensors are available,if the sensors can cooperate and if the acknowledgment signals are also transmitted over erasure channels. The analysis also carries over to the case when the single channels are replaced by networks of erasure channels.},
	address = {Limassol, Cyprus},
	booktitle = {Proceedings of the 2007 Control Over Communication Channels, co-located with IEEE WiOpt 2007 Conference},
	pages = {pp. 1-7}
}
@article {
	title = {Toward a Science of Cyber-Physical System Integration},
	author = {Sztipanovits, Janos., Koutsoukos, Xenofon., Karsai, Gabor., Kottenstette, Nicholas., Antsaklis, Panos., Gupta, Vijay., B. Goodwine, Baras, John S., Wang, Shige.},
	year = {2012},
	month = {01/2012},
	abstract = {| System integration is the elephant in the china store of large-scale cyber{\textendash}physical system (CPS) design. It would be hard to find any other technology that is more undervalued scientifically and at the same time has a bigger impact on the presence and future of engineered systems. The unique challenges in CPS integration emerge from the heterogeneity of components and interactions. This heterogeneity drives the need for modeling and analyzing cross-domain interactions among physical and computational/networking domains and demands a deep understanding of the effects of heterogeneous abstraction layers in the design flow. To address the challenges of CPS integration, significant progress needs to be made toward a new science and technology foundation that is model based, precise, and predictable. This paper presents a theory of composition for heterogeneous systems focusing on stability. Specifically, the paper presents a passivity-based design approach that decouples stability from timing uncertainties caused by networking and computation. In addition, the paper describes cross-domain abstractions that provide an effective solution for model-based fully automated software synthesis and high-fidelity performance analysis. The design objectives demonstrated using the techniques presented in the paper are group coordination for networked unmanned air vehicles (UAVs) and high-confidence embedded control software design for a quadrotor UAV. Open problems in the area are also discussed, including the extension of the theory of compositional design to guarantee properties beyond stability, such as safety and performance.},
	pages = {pp. 29-44},
	volume = {Vol. 100},
	number = {No. 1},
	journal = {Special Issue of the Proceedings of the IEEE}
}
@article {
	title = {Optimal Output Feedback Control Using Two remote Sensors Over Erasure Channels},
	author = {Gupta, Vijay., Martins, Nuno C., Baras, John S.},
	year = {2009},
	month = {07/2009},
	abstract = {Consider a discrete-time, linear time-invariant process, two sensors and one controller. The process is observed by the sensors, which are connected to the controller via links that can be modeled as erasure channels. If a link transmits successfully then a finite-dimensional vector of real numbers is conveyed from the sensor to the controller. If an erasure event occurs, then any information conveyed over the link is lost. This paper addresses the problem of designing the maps that specify the processing at the controller and at the sensors for stabilizing the process in the bounded second-moment sense. When the information is lost over the links either in an independent and identically distributed (i.i.d.) or Markovian fashion over time, we derive necessary and sufficient conditions for the existence of maps such that the process is stabilized. Such conditions are expressed as inequalities involving the parameters of the plant and the probabilities of link fading. and provide the least conservative stabilization conditions. We also indicate how our approach can be used if more than two sensors are available if the sensors can cooperate and if the acknowledgment signals are also transmitted over erasure channels. The analysis also carries over to the case when the single channels are replaced by networks of erasure channels.},
	pages = {pp. 1463-1476},
	volume = {Vol. 54},
	number = {Number 7},
	journal = {IEEE Transactions on Automatic Control.}
}
@techreport {
	title = {Sensor Scheduling using Smart Sensors},
	author = {Hovareshti, Pedram., Gupta, Vijay., Baras, John S.},
	year = {2007},
	month = {07/2007},
	abstract = {The sensor selection problem arises when multiple sensors are jointly trying to estimate a process but only a subset of them can take and/or use measurements at any time step. In a networked estimation situation, sensors are typically equipped with some memory and processing capabilities. We illustrate that utilization of these capabilities can lead to significant performance gains in the sensor selection problem for improved inference. Further, it also leads to significant pruning of the search tree that yields the optimum sensor schedule. We also present a periodicity result for the case where the decision is whether the sensor should transmit or not.}
}
