@conference {
	title = {Delay-independent convergence for Linear Consensus Networks with Applications to Non-linear Flocking Systems},
	author = {Somarakis, Christoforos., Baras, John S.},
	year = {2015},
	month = {06/2015},
	abstract = {This work studies a class of linear first order and non-linear second order static distributed consensus networks with time-varying multiple propagation delays, in continuous~time. We provide conditions for convergence of to a common constant value, under an increased~connectivity condition. The results are delay-independent in the sense that they hold for~arbitrary bounded delays. Our approach makes use of fundamental concepts from the Non-Negative Matrix Theory in a fairly elementary way.},
	address = {Ann Arbor, MI},
	booktitle = {12th IFAC Workshop on Time Delay Systems (TDS 2015)},
	pages = {pp. 159-164}
}
@conference {
	title = {Event Based Control of Linear Systems with Stochastic Perturbations},
	author = {Maity, Dipankar., Baras, John S.},
	year = {2015},
	month = {06/2015},
	abstract = {In this paper, an event-based control strategy for~linear systems under disturbances is presented where the control~input generator generates a control which tries to mimic a state~feedback control between two successive events. The control input~is generated in such a way that the error between the state of~this system and the continuous state feedback system is bounded.~The event generator triggers an event based on this error and the~control input generator modifies its control function in such a way~that it makes sure that the error generated up to this triggering~instance is reduced to zero and thus it does not have any effect on~the future value of the state regardless of the stability of the plant.~It is also shown that under this event triggering mechanism, the~control input generator generates the control in such a way that~this error bound could be made arbitrarily small.~},
	address = {Krakow, Poland},
	booktitle = {1st IEEE International Conference on Event-Based Control, Communication, and Signal Processing (EBCCSP 2015)}
}
@conference {
	title = {Event Based Distributed Collaborative Control and the Value of Information},
	author = {Baras, John S.},
	year = {2015},
	month = {06/2015},
	address = {Krakow, Poland},
	booktitle = {First International Conference on Event-Based Control, Communication and Signal Processing}
}
@conference {
	title = {Motion Planning in Dynamic Environment with Bounded Time Temporal Logic Specifications},
	author = {Maity, Dipankar., Baras, John S.},
	year = {2015},
	month = {06/2015},
	abstract = {In this paper, we consider the problem of robotic~motion planning that satisfies some bounded time high-level~specifications. Although temporal logic can efficiently express~high-level specifications such as coverage, obstacle avoidance,~temporal ordering of tasks etc., it fails to address~problems~with explicit timing constraints. The inherent limitations of~Linear Temporal Logic (LTL) to address problems with explicit timing constraints have been overcome by translating the~planning problem from the workspace of the robot to a~higher dimensional space called spacetime where the existing~LTL semantics and grammar are sufficient to mathematically~formulate the bounded time high-level specifications. A discrete~path will be generated, that will meet the specifications with all~timing constraints and, at the same time, it will optimize some~cost function. A continuous trajectory satisfying the continuous~dynamics of the robot will be generated from the discrete path~using proper control laws.},
	address = {Torremolinos, Spain},
	booktitle = {23rd Mediterranean Conference on Control and Automoation (MED 2015)},
	pages = {pp. 973-979}
}
@conference {
	title = {Distributed Consensus Networks of Neutral Type},
	author = {Somarakis, Christoforos., Baras, John S.},
	year = {2015},
	month = {06/2015},
	abstract = {We propose and study a network of autonomous agents which evolve their state under a distributed consensus algorithm of non-linear neutral type. We provide sufficient conditions for convergence to a common consensus point, by means of a stability in variation argument and fixed point theory. Our approach provides both an estimation on the rate of convergence and an implicit expression for the consensus point.},
	address = {Torremolinos, Spain},
	booktitle = {23rd Mediterranean Conference on Control and Automoation (MED 2015)},
	pages = {pp. 1087-1092}
}
@conference {
	title = {Distributed Learning for Collaborative Inference and Decision Making in Multi-Agent Systems},
	author = {Baras, John S.},
	year = {2015},
	month = {06/2015},
	address = {Stuttgart, Germany},
	organization = {Institute for Systems Theory and Automatic Control, University of Stuttgart}
}
@conference {
	title = {Trust-Aware Optimal Crowdsourcing With Budget Contraint},
	author = {Liu, Xiangyang., He, He., Baras, John S.},
	year = {2015},
	month = {06/2015},
	abstract = {Crowdsourcing has been extensively used for aggregating data from a large pool of workers. In a real crowdsourcing market, each answer obtained from a worker incurs cost. The cost is associated with both the level of trustworthiness of workers and the difficulty of tasks. Typically, access to expert-level (more trustworthy) workers is more expensive than to average crowd and completion of a challenging task is more costly than a click-away question. In this paper, we address the problem of optimal assignment of heterogeneous tasks to workers of varying trust levels with budget constraint. Specifically, we design a trust-aware task allocation algorithm that takes as inputs the estimated trust of workers and pre-set budget and outputs the optimal assignment of tasks to workers. We derive the bound of total error probability that relates to budget, trustworthiness of crowds, and costs of obtaining labels from crowds naturally. Higher budget, more trustworthy crowds, and less costly jobs result in lower theoretical bound. Our allocation scheme does not depend on the specific design of the trust evaluation component. Therefore, it can be combined with generic trust evaluation algorithms. Our algorithm outperforms state-of-the-art by up to 30\% on real data.},
	address = {London, UK},
	booktitle = {IEEE International Conference on Communications (ICC 2015)},
	pages = {pp. 1176-1181}
}
@conference {
	title = {Modeling the Alzheimer{\textquoteright}s Disease Network},
	author = {Kyrtsos, C Rose., Baras, John S.},
	year = {2015},
	month = {06/2015},
	address = {Antibes - Juan les Pins France},
	booktitle = {1st International Conference on Mathematical NeuroScience (ICMNS 2015)}
}
