@conference {
	title = {Distributed hybrid consensus of second order dynamics over proximity nets*},
	author = {Liu, Zhixin., Wang, L., Baras, John S.},
	year = {2016},
	month = {12/2016},
	abstract = {In this paper, we consider the distributed consensus~problem of the second-order multi-agent system where the~agents are connected via distance-dependent networks. For the~feasibility of information processing, we introduce dwell times~which may be different at different sampling time instants. Each~agent can only receive the information and update its control~laws at discrete sampling time instants, which in combination~with the continuous-time dynamics yields the hybrid closed-loop~dynamics. By analyzing the discrete-time system at the sampling~instants and the continuous-time system between the sampling~instants, we establish the sufficient condition for consensus of~the hybrid second-order multi-agents system, without relying~on the properties of the dynamics of the neighbor graphs.},
	address = {Las Vegas, Nevada},
	booktitle = {55th IEEE Conference on Decision and Control },
	pages = {pp. 4273-4277}
}
@conference {
	title = {Optimal strategies for linear quadratic differential games with costly information},
	author = {Maity, Dipankar., Baras, John S.},
	year = {2016},
	month = {12/2016},
	abstract = {A two players stochastic differential game is considered~with a given cost function. The players engage in a~non-cooperative game where one tries to minimize the cost and~the other tries to maximize the same. The players are given a~dynamical system and their actions serve as the control inputs~to the dynamical system. Their job is to control the state of~this dynamical system to optimize the given objective function.~We use the term {\textquotedblleft}state of the game{\textquotedblright} to describe the state of~this dynamical system. The challenge being that none of the~players has access to the state of the game for all time, rather~they can access the state intermittently and only after paying~some information cost. Thus the cost structure is non-classical~for a linear-quadratic game and it incorporates the value of~information. We provide the Nash equilibrium strategy for the~players under full state information access at no cost, as well~as costly state information access. The optimal instances for~accessing the state information are also provided for the players.},
	address = {Las Vegas, Nevada},
	booktitle = {55th IEEE Conference on Decision and Control },
	pages = {pp. 276-282}
}
@conference {
	title = {Time varying Control set design for UAV Collision Avoidance Using Reachable Tubes},
	author = {Zhou, Yuchen., Raghavan, Aneesh., Baras, John S.},
	year = {2016},
	month = {12/2016},
	abstract = {In this paper, we propose a reachable set based~collision avoidance algorithm for unmanned aerial vehicles (UAVs). UAVs have been deployed for agriculture research and~management, surveillance and sensor coverage for threat detection~and disaster search and rescue operations. It is essential for~the aircraft to have on-board collision avoidance capability to~guarantee safety. Instead of the traditional approach of collision~avoidance between trajectories, we propose a collision avoidance~scheme based on reachable sets and tubes. We then formulate~the problem as a convex optimization problem seeking time~varying control sets for ego aircraft giving predicted intruder~reachable tube. We have applied the approach on a case study~of two quadrotors collision avoidance scenario.},
	address = {Las Vegas, Nevada},
	booktitle = {55th IEEE Conference on Decision and Control },
	pages = {pp. 6857-6862}
}
@conference {
	title = {Optimal Stationary Self-Triggered Sampling for Estimation},
	author = {Soleymani, Touraj., Hirche, Sandra., Baras, John S.},
	year = {2016},
	month = {12/2016},
	abstract = {In this paper, we study optimal stationary sampling~for transmission of measurements of a stochastic process~from a source encoder to a source decoder through a costly communication~channel. We measure information transferred over~a time interval by the change in the decoder{\textquoteright}s entropy regarding~the state of the process given the transmitted measurements.~In our setting, the encoder employs a sampler to control the~information flow in the channel. The problem is casted as a~discounted infinite horizon optimization problem that takes into~account the transferred information and the paid price. We~derive the optimal stationary sampling policy, and propose two~computational methods with convergence guarantees by using~techniques from approximate dynamic programing. In addition,~we introduce two triggering mechanisms based on the value of~information and on the covariance threshold that can generate~the optimal policy. Finally, we present some numerical and~simulation results.},
	address = {Las Vegas, Nevada},
	booktitle = {55th IEEE Conference on Decision and Control },
	pages = {pp. 3084-3089}
}
@conference {
	title = {Co-Active Learning to Adapt Humanoid Movement for Manipulation.},
	author = {Mao, Ren., Baras, John S., Yang, Yezhou., Fermuller, Cornelia.},
	year = {2016},
	month = {11/2016},
	abstract = {In this paper, we address the problem of interactive~robot movement adaptation under various environmental~constraints. A common approach is to adopt motion primitives~to generate target motions from demonstrations. However,~their generalization capability is weak for novel environments.
Additionally, traditional motion generation methods do not~consider versatile constraints from different users, tasks, and~environments. In this work, we propose a co-active learning~framework for learning to adapt the movement of robot end~effectors for manipulation tasks. It is designed to adapt the~original imitation trajectories, which are learned from demonstrations to novel situations with different constraints. The~framework also considers user feedback towards the adapted~trajectories, and it learns to adapt movement through human in-the-loop interactions. Experiments on a humanoid platform~validate the e effectiveness of our approach.},
	address = {The Westin Resort \& Spa},
	booktitle = {2016 IEEE-RAS International Conference on Humanoid Robots (Humanoids 2016)},
	pages = {pp. 372-378},
	organization = {Cancun, Mexico.}
}
@conference {
	title = {Systems Engineering and Healthcare},
	author = {Baras, John S.},
	year = {2016},
	month = {11/2016},
	address = {Baltimore, MD},
	organization = {Center for Critical Care and Trauma Education}
}
@conference {
	title = {On the Mitigation of Interference Imposed by Intruders in Passive RFID Networks},
	author = {Tsiropoulou, Eirini Eleni., Baras, John S., Papavassiliou, Symeon., Qu, G.},
	year = {2016},
	month = {11/2016},
	abstract = {RFID networks are becoming an integral part of the emerging Internet of Things (IoT) era. Within this paradigm passive RFID networks have emerged as low cost energy-efficient alternatives that find applicability in a wide range of applications. However, such RFID networks and devices, due to their limited capabilities, can easily become vulnerable to several intrusive actions. In this paper, the problem of proactively protecting a passive RFID network from security threats imposed by intruders that introduce high interference to the system resulting in the possible disruption of the network{\textquoteright}s proper operation is investigated. Passive RFID tags are associated with a well-designed utility function reflecting on one hand their goal to have their signal properly demodulated by the reader, and on the other hand their risk level of participating in the network, stemming from their hardware characteristics among others, thus characterizing them as normal or intruder tags. An interference mitigation risk aware (IMRA) problem is introduced aiming at maximizing each tag{\textquoteright}s utility function, thus implicitly enforcing tags to conform to a more social behavior. Due to its nature, the proposed problem is formulated as a non-cooperative game among all the tags (normal and intruders) and its Nash equilibrium point is determined via adopting the theory of supermodular games. Convergence of the game to its Nash equilibrium is also shown. A distributed iterative and low-complexity algorithm is proposed in order to obtain the Nash equilibrium point and the operational effectiveness of the proposed approach is evaluated through modeling and simulation.},
	address = {New York, NY},
	booktitle = {Conference on Decision and Game Theory for Security (GameSec 2016)}
}
@conference {
	title = {Reliable Attribute-Based Object Recognition Using High Predictive Value Classifiers},
	author = {Luan, Wentao., Yang, Yezhou., Fermuller, Cornelia., Baras, John S.},
	year = {2016},
	month = {10/2016},
	abstract = {We consider the problem of object recognition in 3D using an ensemble of attribute-based classifiers. We propose two new concepts to improve classification in practical situations, and show their implementation in an approach implemented for recognition from point-cloud data. First, the viewing conditions can have a strong influence on classification performance. We study the impact of the distance between the camera and the object and propose an approach to fusing multiple attribute classifiers, which incorporates distance into the decision making. Second, lack of representative training samples often makes it difficult to learn the optimal threshold value for best positive and negative detection rate. We address this issue, by setting in our attribute classifiers instead of just one threshold value, two threshold values to distinguish a positive, a negative and an uncertainty class, and we prove the theoretical correctness of this approach. Empirical studies demonstrate the effectiveness and feasibility of the proposed concepts.},
	address = {Amsterdam, Netherlands},
	booktitle = {4th European Conference on Computer Vision},
	pages = {pp. 801-815}
}
@conference {
	title = {Noncommutative Probability Models for Net-CPS and Net-CPSS},
	author = {Baras, John S., Raghavan, Aneesh.},
	year = {2016},
	month = {09/2016},
	address = {Garching, Munich},
	booktitle = {International Symposium on Networked Cyber-Physical Systems (NetCPS)}
}
@conference {
	title = {A Reputation based Trust Management System for the Internet of Things},
	author = {Papagianni, Chrysa. , Baras, John S., Papavassiliou, Symeon.},
	year = {2016},
	month = {09/2016},
	address = {Garching, Munich},
	booktitle = {International Symposium on Networked Cyber-Physical Systems (NetCPS)}
}
@conference {
	title = {Optimal Mission Planning under Logical Constraints with Safety Gaurantees: An Application for Robotic CPSs},
	author = {Maity, Dipankar., Zhou, Yuchen., Baras, John S.},
	year = {2016},
	month = {09/2016},
	address = {Garching, Munich},
	booktitle = {International Symposium on Networked Cyber-Physical Systems (NetCPS)}
}
@conference {
	title = {On the Mitigation of Interference Imposed by Intruders in Passive RFID Networks},
	author = {Tsiropoulou, Eirini Eleni., Baras, John S., Papavassiliou, Symeon., Qu, G.},
	year = {2016},
	month = {09/2016},
	address = {Garching, Munich},
	booktitle = {International Symposium on Networked Cyber-Physical Systems (NetCPS)}
}
@conference {
	title = {STAR : Semiring Trust Inference for Trust - Aware Social recommenders},
	author = {Gao, Peixin., Miao, Hui., Baras, John S., Golbeck, Jennifer.},
	year = {2016},
	month = {09/2016},
	abstract = {Social recommendation takes advantage of the influence of social relationships in decision making and the ready availability of social data through social networking systems. Trust relationships in particular can be exploited in such systems for rating prediction and recommendation, which has been shown to have the potential for improving the quality of the recommender and alleviating the issue of data sparsity, cold start, and adversarial attacks. An appropriate trust inference mechanism is necessary in extending the knowledge base of trust opinions and tackling the issue of limited trust information due to connection sparsity of social networks. In this work, we offer a new solution to trust inference in social networks to provide a better knowledge base for trust-aware recommender systems. We propose using a semiring framework as a nonlinear way to combine trust evidences for inferring trust, where trust relationships are represented by 2-D vectors. The trust propagation and aggregation rules, as the building blocks of our trust inference scheme, are based upon the properties of trust relationships. In our approach, both trust and distrust (i.e., positive and negative trust) are considered, and opinion conflict resolution is supported. We evaluate the proposed approach on real-world datasets, and show that our trust inference framework has high accuracy, and is capable of handling trust relationship in large networks. The inferred trust relationships can enlarge the knowledge base for trust information and improve the quality of trust-aware recommendation.},
	address = {Boston, Massachusetts},
	booktitle = {10th ACM Conference on Recommender Systems},
	pages = {pp. 301-308}
}
@conference {
	title = {Optimal Information Control in Cyber-Physical Systems},
	author = {Soleymani, Touraj., Hirche, Sandra., Baras, John S.},
	year = {2016},
	month = {09/2016},
	abstract = {In this paper, we address optimal information control in cyber-physical systems. In~particular, we study optimal closed-loop policies for transmission of measurements of a stochastic~dynamical system through a communication channel given estimation and communication~costs. We develop a framework for optimizing an aggregate cost function that incorporates~the estimation and the communication costs over a finite time horizon. We obtain the optimal~closed-loop policy, and show that it can be expressed directly in terms of the value of information.~In addition, we propose an approximation algorithm that yields a suboptimal closed-loop policy.~Numerical and simulation results are presented for a simple system.},
	address = {Tokyo, Japan},
	booktitle = {6th IFAC Workshop on Distributed Estimation and Control in Networked Systems},
	pages = {pp. 1-6}
}
@conference {
	title = {The Next Wonder -  MBSE/MBE: From Ideas to "Making Products and Services"},
	author = {Baras, John S.},
	year = {2016},
	month = {09/2016},
	abstract = {Advances in Information Technology have enabled the design of complex engineerd systems, with large number of heterogeneous components and capable of multiple complex functions, leading to the ubiquitious cyber-physical systems (CPS). These advances have at the same time increased the capabilities of such systems and have increased their complexity ~to such an extent that systematic design towards predictable performance is extremely ~challenging, if not infeasible with the current methodologies and tools. We first describe a rigorous framework we are developing for model-based systems engineering (MBSE), s system level deisgn methodology that addresses these challenges, which also incorporates manufacturing, operation and life cylce considerations. We describe the three fundemental components for MBSE within our framework: (a) An integrated systems modeling hub built around SysML, employing meta-modeling and tools; (b) Linking this modelling hub with tradeoff analysis tools for design space exploration, employing linkage with the parametric and requirements ~diagram of SysML, and integrated methods and tools from multi-criteria ~mixed ( integer and numerical variables and metrics) optimization and constrained based reasoning; (c) Representation and management of requirements, employing initial efforts towards an integration of methods ~and tools from model checking, contract based ~design and automatic theorem proving, and including finite time temporal logic ~specifications for system behaviour. We describe ~our results for conquering and managing the complexity of queries in design, manufacturing and operational space exploration. We provide a short description ~of such complex systems, a subject of rapindly increasing importance in view paradigms. We next describe applications of the framework to~several important ~current ~technological problems ( several major domains of CPS): power grids, automotive, aerospcae, energy efficient buildings, sensor and communication networks, smart manufacturing, robotics and UAV, health care, cyber-security. We close with a description of what is still lacking , research challenges and future promising research directions.},
	address = {Berlin, Germany},
	booktitle = {21st IEEE International Conference on Emerging Technologies and Factory Automation}
}
@conference {
	title = {Joint Optimization for Social Content Dissemination in Wireless Networks},
	author = {Weng, Xiangnan., Baras, John S.},
	year = {2016},
	month = {09/2016},
	abstract = {Over the last decade, success of social networks~has significantly reshaped how information disseminate among ~users in terms of scale, intensity and speed. Much effort, both~academic and industrial, has been dedicated to learning the~patterns of content dissemination to further facilitate it. ~However,~as users become dominantly mobile in this process, little is done~to consider the impact of the wireless environment, in particular,~how to optimize the system, in the presence of capacity shortage,~to better disseminate the contents. In this paper, we propose ~a novel method, utilizing: 1) hybrid systems to handle active~disseminating requests; and 2) predictions of dissemination dynamics~from the social network applications. This method could~mitigate the performance degradation for content dissemination~due to wireless delivery delay. Results indicate that predictions of
dissemination at social layer, even coarse ones, benefit the social dissemination, by improving scheduling at wireless layer, which~in turn improves the accuracy of the predictions with feedback.},
	address = {Valencia, Spain},
	booktitle = {2016 IEEE 27th Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)},
	pages = {pp. 1-7}
}
@conference {
	title = {Multi-Agent Collaborative Decision Making: Constrained Event Algebras, New Logics and Their Game Theoretic Semantics},
	author = {Baras, John S.},
	year = {2016},
	month = {07/2016},
	address = {Ann Arbor, MI},
	booktitle = {Workshop on Information, Decisions and Networks, in honor of D. Teneketzis{\textquoteright} 65th Birthday}
}
@conference {
	title = {Networked Cyber-Physical Systems (Net-CPS)},
	author = {Baras, John S.},
	year = {2016},
	month = {07/2016},
	abstract = {We describe recent results on foundational aspects of modeling, architecture and performance of networked~cyber-physical systems. These include: multi-layer multigraph models, constrained coalitional games, analysis of trust and~mistrust in collaboration, dynamics of signed graphs, distributed consensus with adversaries, new concepts of value of~information and event-driven inference and decision making, non-commutative probability models. We conclude with directions~for future research.},
	address = {Chengdu ,China},
	booktitle = {35th Chinese Control Conference}
}
@conference {
	title = {Attitude synchronisation of multiple rigid in SE(3) over proximity networks},
	author = {Deng, Juan., Wang, L., Liu, Z., Baras, John S.},
	year = {2016},
	month = {07/2016},
	abstract = {This paper investigates the attitude synchronization of a group of moving rigid bodies whose states including positions and rotation matrices evolve in the Lie group SE(3). The commonly used circular neighborhood is adopted, and the neighbor graphs are described by proximity networks. In order to avoid introducing discussions on the abrupt changes of neighbor graphs, a dwell time is introduced. The distributed sampled-data control law for the angular velocity is designed. Under the assumptions on the initial states, we provide sufficient conditions for the attitude synchronization of multiple rigid body system. Compared with the existing results, our condition depends only on the neighborhood radius, the moving velocity and the dwell time.},
	address = {Chengdu ,China},
	booktitle = {35th Chinese Control Conference},
	pages = {pp 8275-8280}
}
@conference {
	title = {Synchronization and Collision Avoidance in Non-Linear Flocking Networks of Autonomous Agents},
	author = {Somarakis, Christoforos., Paraskevas, Evripidis., Baras, John S., Motee, Nader.},
	year = {2016},
	month = {07/2016},
	abstract = {We introduce and discuss two novel second-order consensus networks with state-dependent couplings of CuckerSmale type. The first scheme models flocking to synchronization over a network of agents where the alignment of the agent{\textquoteright}s states occurs over a non-trivial limit orbit that is generated by the internal dynamics of each individual agent. The second scheme models the speed alignment of a group of agents which avoid approaching each other closer than a prescribed distance. While seemingly different, both of these systems can be analyzed using the same mathematical methods. We rigorously analyze both examples and reveal their striking similarities. We arrive at sufficient conditions that relate the initial configurations and the systems{\textquoteright} parameters that give rise to a collective common behavior. Simulation examples are presented to support our theoretical conclusions},
	address = {Athens, Greece},
	booktitle = {24th Mediterranean Conference on Control and Automation},
	pages = {pp. 1089-1094}
}
@conference {
	title = {Combining Greedy Hyperbolic Routing with Back - pressure Scheduling for Better Network Performance},
	author = {Rabieekenari, Ladan., Baras, John S.},
	year = {2016},
	month = {07/2016},
	abstract = {The back-pressure algorithm (BP) has received~much attention for jointly routing and scheduling over multihop~networks. The back-pressure algorithm is throughput optimal,~but it has poor delay performance. This is due to~selection of unnecessarily long paths and routing loops, as the~algorithm operates without accounting for the network topology.~In this paper, we propose a throughput-optimal routing~and scheduling algorithm that improves delay performance~by greedy embedding of the network in hyperbolic space. We~improve delay performance by solving an optimization problem,
which aims to send packets mostly to greedy neighbors, subject~to throughput-optimality constraints. The algorithm that solves~this optimization problem has a design parameter M. We study~the effect of M on delay performance analytically. We validate~our theoretical results via simulations and demonstrate that the~proposed algorithm improves the delay performance.},
	address = {Minneapolis, Minnesota},
	booktitle = {22nd International Symposium on Mathematical Theory of Networks and Systems},
	pages = {pp.698-705}
}
@conference {
	title = {Consensus and Synchronized Periodicity in Nonlinear Delayed Networks},
	author = {Somarakis, Christoforos., Baras, John S., Motee, Nader.},
	year = {2016},
	month = {07/2016},
	abstract = {In this paper, we investigate stability and convergence properties of a class of nonlinear delayed consensus networks. Using tools and techniques from functional differential equations, sufficient stability conditions with respect to a common state as well as estimates on the convergence rate are derived. We characterize the limit (consensus) state for time-invariant sub-classes of these networks. More importantly, we specify under what conditions a delayed network exhibits periodic synchronized solutions. We provide sufficient conditions for existence, uniqueness and stability of this interesting phenomenon that we illustrate with a simulation example.},
	address = {Minneapolis, Minnesota},
	booktitle = {22nd International Symposium on Mathematical Theory of Networks and Systems},
	pages = {pp. 823-829}
}
@conference {
	title = {Dynamic, Optimal Sensor Scheduling and Value of Information},
	author = {Maity, Dipankar., Baras, John S.},
	year = {2016},
	month = {07/2016},
	abstract = {In this paper, we present a method for the optimal state estimation of a linear system, observed by various dynamically schedulable and distributed sensors. We consider this problem to be a problem of information fusion, where the information is obtained from the sensors in exchange of scheduling and sensor operational costs. Sensors over a distributed network can work together efficiently in order to maximize the overall network performance. We consider several costs related to sensor scheduling such as the continuous cost for keeping the sensor on, and sensor switching cost for turning a sensor on from off state and vice versa. Our goal is to estimate the state as closely as possible while minimizing the scheduling cost. We incorporate the error in estimation as a cost in the optimization function. The resultant problem is then converted into an optimal control problem, where optimal scheduling is obtained by pointwise maximizing the Hamiltonian of the system.},
	address = {Washington DC},
	booktitle = {International Conference on Information Fusion (FUSION 2015)},
	pages = {pp. 239-244}
}
@conference {
	title = {The Effect of Delays in the Economic Dispatch Problem for Smart Grid Architectures},
	author = {Somarakis, Christoforos., Maity, Dipankar., Baras, John S.},
	year = {2016},
	month = {07/2016},
	abstract = {We consider the Economic Dispatch Problem~(EDP) in power systems for a smart-grid friendly environment.~We develop a consensus based decentralized optimization algorithm~that evolves in a time-varying communication network~that suffers from multiple propagation time-dependent delays.
This paper, being an improvisation of an earlier work of~ours, addresses the effects of time dependent delays in a fully~decentralized network. We show analytically and by simulation~that propagation delays may not only affect the performance~of the dynamic algorithm that solves the EDP but can ~also~destabilize the system.},
	address = {Boston, Massachusetts},
	booktitle = {2016 American Control Conference},
	pages = {pp. 3533-3538}
}
@conference {
	title = {Distributed Energy-Aware Mobile Sensor Coverage Game with Inter-Agent Communication},
	author = {Paraskevas, Evripidis., Maity, Dipankar., Baras, John S.},
	year = {2016},
	month = {07/2016},
	abstract = {Mobile Sensor Networks (MSN) are used to monitor large areas and collect measurements, e.g. temperature, humidity, or pressure data. Mobile sensors try to optimize their benefit from sensing a particular area, while keeping their energy consumption at the lowest possible level. We formulate this energy-aware sensor coverage problem as a potential game, where the mobile sensor nodes are considered as agents. The utility function of the game captures the trade-off between the benefit from coverage and the energy consumption. We also propose a distributed learning strategy for this potential game. The algorithm enables a bit-valued information exchange between the agents. Finally, it is proved that the learning rule converges to a Nash Equilibrium.},
	address = {Boston, Massachusetts},
	booktitle = {2016 American Control Conference},
	pages = {pp. 6259-6264}
}
@conference {
	title = {Active sampling exploiting detector response pattern for efficient target detection},
	author = {Luan, Wentao., Mao, Ren., Baras, John S.},
	year = {2016},
	month = {07/2016},
	abstract = {Detecting targets in an image is a fundamental task in computer vision and robotic system. When only a trained detector (binary classifier) is at hand, the target detection problem becomes localizing the correct windows containing targets in the image and can be considered as a sampling problem. Exhaustive sliding window method is a common approach, but it is usually computationally expensive especially when the detection algorithm is time-consuming. In this work, we observe that detector{\textquoteright}s response scores of sampling windows fade gradually from the peak response window in the detection area and we approximate this scoring pattern with an exponential decay function. By exploiting this property, we propose an active sampling method for efficient target detection to avoid exhaustively searching all the window space. The method estimates the probability of windows containing the target by fusing information from sampled windows and their detector{\textquoteright}s scores and then decides the next window to be observed. Experiments have shown that our proposed method improves efficiency in human detection applications as it requires fewer windows to achieve similar performance compared to sliding windows and multi-stage particle window (MS-PW) method.},
	address = {Heidelberg , Germany},
	booktitle = {19th Intenation Conference on Information Fusion},
	pages = {pp. 1916-1922}
}
@conference {
	title = {Maximization of Information in Energy Limited Directed Communication},
	author = {Soleymani, Touraj., Hirche, Sandra., Baras, John S.},
	year = {2016},
	month = {06/2016},
	abstract = {This study is concerned with an observer who~desires to inform optimally a distant agent regarding a physical~stochastic process in the environment. We consider that the~observer has a constraint on the energy resource for the directed~communication to the agent. The information we are interested~in is the change in the knowledge possessed by the agent about~the state of the process. We find the maximum information~that can be transferred from the observer to the agent over~a finite horizon subject to a bound on the total energy of the~observer.We show that the maximum information is the optimal~value of a mixed-integer nonlinear optimization problem. We~obtain lower and upper bounds on the maximum information~and also a suboptimal admissible solution based on a semidefinite~programming. Moreover, we propose an optimized~event-triggering mechanism based on a linear matrix inequality~which yields event-driven sampling. Numerical and simulation~results are presented for simple stable and unstable systems.},
	address = {Aalborg, DK},
	booktitle = {European Control Conference (ECC16)},
	pages = {pp. 1001-1006}
}
@conference {
	title = {Timed Automata Approach for Motion Planning Using Metric Interval Temporal Logic},
	author = {Zhou, Yuchen., Maity, Dipankar., Baras, John S.},
	year = {2016},
	month = {06/2016},
	abstract = {In this paper, we consider the robot motion (or~task) planning problem under some given bounded time high-level specifications. We use metric interval temporal logic~(MITL), a member of the temporal logic family, to represent~the task specification and then we provide a constructive way to~generate a timed automaton and methods to look for accepting~runs on the automaton to find a feasible motion (or path)~sequence for the robot to complete the task.~},
	address = {Aalborg, DK},
	booktitle = {European Control Conference (ECC16)},
	pages = {pp. 690-695}
}
@conference {
	title = {Dynamics of Collectives with Opinionated Agents: The Case of Scrambling Connectivity},
	author = {Somarakis, Christoforos., Hadadi, R., Baras, John S.},
	year = {2016},
	month = {06/2016},
	abstract = {We investigate the problem of social/opinion networks of autonomous agents, each of which has a personal view that follows an independent dynamic behavior and it communicates with their neighbors under a cooperative algorithm. We apply mathematics from non-negative matrix theory. We investigate agents with identical and non-identical views and we establish sufficient conditions for stability and convergence to a common synchronized opinion.},
	address = {Aalborg, DK},
	booktitle = {European Control Conference (ECC16)},
	pages = {pp. 1445-1450}
}
@conference {
	title = {Trust-Aware Network Utility Optimization in Multihop Wireless Networks with Delay Constraints},
	author = {Paraskevas, Evripidis., Jiang, Tao., Purkayastha, Punyaslok., Baras, John S.},
	year = {2016},
	month = {06/2016},
	abstract = {Many resource allocation problems can be formulated as a constrained maximization of a utility function. Network Utility Maximization (NUM) applies optimization techniques to achieve decomposition by duality or the primal dual method. Several important problems, for example, joint source rate control, routing, and scheduling design, can be optimized by using this framework. In this work, we introduce an important network security concept, {\textquotedblleft}trust{\textquotedblright}, into the NUM formulation and we integrate nodes{\textquoteright} trust values in the optimization framework. These trust values are based on the interaction history between network entities and community-based monitoring. Our objective is to avoid routing packets through paths with large percentage of malicious nodes. We also add end-to-end delay constraints for each of the traffic flows. The delay constraints are introduced to capture the imposed quality of service (QoS) requirements for each traffic flow.},
	address = {Athens, Greece},
	booktitle = {24th Mediterranean Conference on Control and Automation},
	pages = {pp. 593-598}
}
@conference {
	title = {Strategies for Two-Player Differential Games with Costly Information},
	author = {Maity, Dipankar., Baras, John S.},
	year = {2016},
	month = {05/2016},
	abstract = {In this work, a two players nonzero-sum differential game is considered, where one player tries to minimize some predefined cost and the other tries to maximize the same. The game is described by a stochastic differential system and the actions of the players serve as the control inputs to the dynamical system. The cost being a function of the actions chosen by the players and the state of the dynamical system, the players aim to control the state in order to optimize the cost functional. However in this problem, the players do not have the access to the states for every time, rather the states are available at discrete time instances after some finite costs are paid by the players. The inclusion of the information-cost makes the structure of the cost functional non-classical. The work presents the strategies for the players under no-cost information access as well as under costly information access. Explicit time instances for the information access are also derived by solving certain finite dimensional optimization problems.},
	address = {Xi{\textquoteright}an, China},
	booktitle = {13th International Workshop on Discrete Event Systems },
	pages = {pp . 211-216}
}
@conference {
	title = {Optimal Self-Driven Sampling for Estimation Based on Value of Information},
	author = {Soleymani, Touraj., Hirche, Sandra., Baras, John S.},
	year = {2016},
	month = {05/2016},
	abstract = {Consider an observer (reporter) who desires to inform optimally a distant agent regarding a physical stochastic process in the environment while the directed communication of the observer to the agent has a price. We define a metric, from a task-oriented perspective, for the information transferred from the observer to the agent. We develop a framework for optimizing an augmented cost function which is a convex combination of the transferred information and the paid price over a finite horizon. We suppose that the decision making takes place inside a source encoder, and that the sampling schedule is the decision variable. Moreover, we assume that no measurement at the current time is available to the observer for the decision making. We derive the optimal self-driven sampling policy using dynamic programming, and we show that this policy corresponds to a self-driven sampling policy based on a quantity that is, in fact, the value of information at each time instant. In addition, we use a semi-definite programming relaxation to provide a suboptimal sampling policy. Numerical and simulation results are presented for a simple unstable system},
	address = {Xi{\textquoteright}an, China},
	booktitle = {13th International Workshop on Discrete Event Systems },
	pages = {pp.183-188}
}
@conference {
	title = {Joint Optimization for Social Content Delivery in Wireless Networks},
	author = {Weng, Xiangnan., Baras, John S.},
	year = {2016},
	month = {05/2016},
	abstract = {Over the past decade, success of social networks has significantly reshaped how people consume information. Recommendation of contents based on user profiles is wellreceived. However, as users become dominantly mobile in content consumption, little is done to consider the optimization regarding the wireless environment. In this paper, we investigate a centralized wireless content delivery system with heterogeneous base stations, aiming to optimize overall user rewards given the capacity constraints of the wireless networks. We propose a scalable two-phase scheduling framework, consisting of: 1) distributed delivery decisions by each base station, and 2) resource consolidation by the system. Results indicate this novel joint optimization approach is both efficient and scalable},
	address = {Kuala lumpur, Malaysia},
	booktitle = {IEEE International Conference on Communications (ICC 2016)}
}
@conference {
	title = {Joint Optimization for Social Content Delivery in Heterogeneous Wireless Networks},
	author = {Weng, Xiangnan., Baras, John S.},
	year = {2016},
	month = {05/2016},
	abstract = {Over the past decade, success of social networks has significantly reshaped how people consume information. Recommendation of contents based on user profiles is well received. However, as users become dominantly mobile in content consumption, little is done to consider the optimization regarding the wireless environment. In this paper, we investigate a centralized wireless content delivery system with heterogeneous base stations, aiming to optimize overall user rewards given the capacity constraints of the wireless networks. We propose a scalable two-phase scheduling framework, consisting of: 1) distributed delivery decisions by each base station, and 2) resource consolidation by the system. Results indicate this novel joint optimization approach is both efficient and scalable.},
	address = {Tempe, Arizona},
	booktitle = {14th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks},
	pages = {pp. 155 - 162}
}
@conference {
	title = {Learning Through Direct and Indirect Communications for Distributed Control in Networked Systems},
	author = {Baras, John S.},
	year = {2016},
	month = {02/2016},
	address = {Zurich, Switzerland},
	organization = {Department of Automatic Control, ETH}
}
