3 citations · 5 across the 5 of their papers we have counts for
6 papers
Dispersive Tree Agreements for Multi-Robot Coordination
Shashank A. Deshpande, Blake T. Edwards, Jonathan P. How
Multi-robot coordination of nonlinear systems is naturally formulated as joint-space optimal control subject to constraints over groups of robots. Existing methods that approach jo…
Dispersive Forward Tree Search for Optimal Control: Coverage, Complexity, and Computation
Shashank A. Deshpande, Jonathan P. How
Steering-based planners require solutions to state-to-state boundary value problems, which can be inaccessible for nonlinear platforms. Forward propagation evades the steering requ…
Characterizing Flow Complexity in Transportation Networks using Graph Homology
Shashank A Deshpande, Hamsa Balakrishnan
Series-parallel network topologies generally exhibit simplified dynamical behavior and avoid high combinatorial complexity. A comprehensive analysis of how flow complexity emerges…
The Quantum Advantage in Binary Teams and the Coordination Dilemma: Part I
Shashank A. Deshpande, Ankur A. Kulkarni
We have shown that entanglement assisted stochastic strategies allow access to strategic measures beyond the classically correlated measures accessible through passive common rando…
The Quantum Advantage in Binary Teams and the Coordination Dilemma: Supplementary
Shashank A. Deshpande, Ankur A. Kulkarni
This document contains supporting material for our paper ``The Quantum Advantage in Binary Teams and the Coordination Dilemma''
The Quantum Advantage in Decentralized Control
Shashank A. Deshpande, Ankur A. Kulkarni
It is known in the context of decentralised control that there exist control strategies consistent with the requirements of a given information structure, yet physically unimplemen…