@conference {
	title = {Coalition Formation and Trust in Collaborative Control},
	author = {Baras, John S., Jiang, Tao., Hovareshti, Pedram.},
	year = {2009},
	month = {08/2009},
	abstract = {We consider the collaboration of autonomous agents as a coalitional game subject to constraints, like communication, trust or reputation. We analyze the tradeoff between the benefits of collaboration and these constraints (or costs of collaboration) via dynamic, iterative stochastic games. The agents can observe locally the actions of other agents in their neighborhood and decide whether to collaborate or not in a distributed asynchronous manner. Trust values are taken into consideration when agents act and collaborate. Specifically they affect the selection of agents to collaborate with. We consider only problems where the information used for either estimating reputations or deciding on strategies is mostly local; i.e. from the neighbors of each agent. We show that randomized algorithms emerge as the agents try to reach the maximum payoff. We also investigate the topology of the formed network by studying the second largest eigenvalue of the corresponding graph, and describe its effects on control performance.},
	address = {Budapest, Hungary},
	booktitle = {European Control Conference 2009 (ECC {\textquoteright}09)},
	pages = {pp.1197-1202}
}
@conference {
	title = {Event Triggered Distributed Collaborative Control},
	author = {Baras, John S., Hovareshti, Pedram., Perumal, Senni.},
	year = {2009},
	month = {08/2009},
	abstract = {We consider the collaborative control of a group of autonomous mobile agents (e.g. vehicles, robots). The agents collaborate to achieve a common goal or objective, like to move in a particular area and cover it, while avoiding obstacles and collisions. Building upon our earlier work on deterministic, randomized and hybrid distributed coordination algorithms we consider the communication needs of the agents, and in particular, the connectivity of their communication network as they move. We develop algorithms that automatically sense the possibility or inset of loss of connectivity among the agents. We also consider the automatic detection of path disconnection when more than one paths need to be maintained between pairs of agents. Using local probing schemes we formulate such problems as event-triggered control problems. We develop distributed algorithms that automatically select some agents and move them appropriately so as to maintain a~certain degree of desired connectivity among the moving agents. We characterize the trade-off between the gain from maintaining a certain degree of connectivity vs the combined cost of communications and the associated dynamic re-positioning of agents. The results illustrate the efficiency achieved by the~event-triggered control in such problems. We also describe the resulting communication topologies and in particular their similarity to dynamic small-world topologies.},
	address = {Budapest, Hungary},
	booktitle = {European Control Conference 2009 (ECC {\textquoteright}09)},
	pages = {pp.3797-3802}
}
