@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 = {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 = {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 = {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 = {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}
}
