Subhrajit Bhattacharya
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Subhrajit Bhattacharya has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
- Vijay Kumar
University of Pennsylvania
3 shared publications - Xiaolong Wang
Department of Mechanical Engineering and Mechanic, Lehigh University, Bethlehem, USA
3 shared publications - Alp Sahin
Department of Mechanical Engineering and Mechanics, Lehigh University, Bethlehem, PA, USA
2 shared publications Robert Ghrist
University of Pennsylvania
2 shared publicationsAlp Sahin
Department of Mechanical Engineering and Mechanics, Lehigh University, Bethlehem, PA, United States
1 shared publicationAmanda Prorok
Department of Mechanical Engineering and Mechanics, Lehigh University, Bethlehem, PA, United States
1 shared publication
Latest Publications
- 24 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Robotics
- Vol. 42 (15523098) , 1769-1783
From Hitch to Lift: Autonomous Cable Interlacing by Multi-UAV Teams for Aerial Grasping and Transportation
The use of cables in aerial manipulation offers a lightweight and flexible alternative to rigid grasping mechanisms. However, achieving autonomous tying and secure transportation of objects with cables remains a significant challenge. In this work, we present a novel method for autonomously securing and transporting objects using multi-layer hitches formed in midair by a team of aerial robots. Building upon prior work on polygonal hitch formation, we extend the framework to include layered cable interlacing that increases frictional grip and enables secure object grasping. We introduce two new manipulation actions: multi-layer tying and autonomous object release, completing the pipeline for aerial grasping and transportation. We develop a capstan-based analytical model that establishes an exponential scaling law for the effect of cable layers and provides a conservative guideline. The formation algorithm operates in parallel, ensuring scalability to large teams with constant execution time. We validate our system through simulation and hardware experiments, demonstrating fully autonomous object tying, lifting, and releasing using cables alone without human intervention.
- 24 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Robotics
- Vol. 42 (15523098) , 1769-1783
From Hitch to Lift: Autonomous Cable Interlacing by Multi-UAV Teams for Aerial Grasping and Transportation
The use of cables in aerial manipulation offers a lightweight and flexible alternative to rigid grasping mechanisms. However, achieving autonomous tying and secure transportation of objects with cables remains a significant challenge. In this work, we present a novel method for autonomously securing and transporting objects using multi-layer hitches formed in midair by a team of aerial robots. Building upon prior work on polygonal hitch formation, we extend the framework to include layered cable interlacing that increases frictional grip and enables secure object grasping. We introduce two new manipulation actions: multi-layer tying and autonomous object release, completing the pipeline for aerial grasping and transportation. We develop a capstan-based analytical model that establishes an exponential scaling law for the effect of cable layers and provides a conservative guideline. The formation algorithm operates in parallel, ensuring scalability to large teams with constant execution time. We validate our system through simulation and hardware experiments, demonstrating fully autonomous object tying, lifting, and releasing using cables alone without human intervention.
- Open Access
- 30 May 2025
- Published by Frontiers Media SA in Frontiers in Complex Systems
- Vol. 3, 1575210
Spectrum optimization of dynamic networks for reduction of vulnerability against adversarial resonance attacks
Resonance is a well-known phenomenon that happens in systems with second order dynamics. In this paper, we address the fundamental question of making a network robust to signal being periodically pumped into it at or near a resonant frequency by an adversarial agent with the aim of saturating the network with the signal. Toward this goal, we develop the notion of network vulnerability, which is measured by the expected resonance amplitude on the network under a stochastically modeled adversarial attack. Assuming a second order dynamics model based on the network graph Laplacian and a known stochastic model for the adversarial attack, we propose two methods for minimizing the network vulnerability–one through direct optimization of the spectrum of the network graph, and another through optimization of an auxiliary network graph attached to the main network. We provide theoretical foundations for these methods as well as extensive numerical results analyzing the effectiveness of both methods in reducing the network vulnerability.
- 30 May 2025
- Published by Frontiers Media SA in Frontiers in Complex Systems
- Vol. 3, 1575210
Open AccessSpectrum optimization of dynamic networks for reduction of vulnerability against adversarial resonance attacks
Resonance is a well-known phenomenon that happens in systems with second order dynamics. In this paper, we address the fundamental question of making a network robust to signal being periodically pumped into it at or near a resonant frequency by an adversarial agent with the aim of saturating the network with the signal. Toward this goal, we develop the notion of network vulnerability, which is measured by the expected resonance amplitude on the network under a stochastically modeled adversarial attack. Assuming a second order dynamics model based on the network graph Laplacian and a known stochastic model for the adversarial attack, we propose two methods for minimizing the network vulnerability–one through direct optimization of the spectrum of the network graph, and another through optimization of an auxiliary network graph attached to the main network. We provide theoretical foundations for these methods as well as extensive numerical results analyzing the effectiveness of both methods in reducing the network vulnerability.
- Open Access
Trace of Multi-variable Matrix Functions and its Application to Functions of Graph Spectrum
Matrix extension of a scalar function of a single variable is well-studied in literature. Of particular interest is the trace of such functions. It is known that for diagonalizable matrices, $M$, the function $g(M) = \text{Tr}(f(M)) = \sum_{j=1}^n f(μ_j)$ (where $\{μ_j\}_{j=1,2,\cdots,n}$ are the eigenvalues of $M$) inherits the monotonocity and convexity properties of $f$ (i.e., for $g$ to be convex, $f$ need not be operator convex -- convexity is sufficient). In this paper we formalize the idea of matrix extension of a function of multiple variables, study the monotonicity and convexity properties of the trace, and thus show that a function of form $g(M) = \sum_{j_1=1}^n \sum_{j_2=1}^n \cdots \sum_{j_m=1}^n f(μ_{j_1}, μ_{j_2},\cdots, μ_{j_m})$ also inherits the monotonocity and convexity properties of the multi-variable function, $f$. We apply these results to functions of the spectrum of the weighted Laplacian matrix of undirected, simple graphs.Open AccessTrace of Multi-variable Matrix Functions and its Application to Functions of Graph Spectrum
Matrix extension of a scalar function of a single variable is well-studied in literature. Of particular interest is the trace of such functions. It is known that for diagonalizable matrices, $M$, the function $g(M) = \text{Tr}(f(M)) = \sum_{j=1}^n f(μ_j)$ (where $\{μ_j\}_{j=1,2,\cdots,n}$ are the eigenvalues of $M$) inherits the monotonocity and convexity properties of $f$ (i.e., for $g$ to be convex, $f$ need not be operator convex -- convexity is sufficient). In this paper we formalize the idea of matrix extension of a function of multiple variables, study the monotonicity and convexity properties of the trace, and thus show that a function of form $g(M) = \sum_{j_1=1}^n \sum_{j_2=1}^n \cdots \sum_{j_m=1}^n f(μ_{j_1}, μ_{j_2},\cdots, μ_{j_m})$ also inherits the monotonocity and convexity properties of the multi-variable function, $f$. We apply these results to functions of the spectrum of the weighted Laplacian matrix of undirected, simple graphs. - Open Access
- 6 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Robotics
- Vol. 41 (15523098) , 20-41
Topo-Geometrically Distinct Path Computation Using Neighborhood-Augmented Graph, and Its Application to Path Planning for a Tethered Robot in 3-D
Many robotics applications benefit from being able to compute multiple geodesic paths in a given configuration space. Existing paradigm is to use topological path planning, which can compute optimal paths in distinct topological classes. However, these methods usually require nontrivial geometric constructions, which are prohibitively expensive in 3-D, and are unable to distinguish between distinct topologically equivalent geodesics that are created due to high-cost/curvature regions or prismatic obstacles in 3-D. In this article, we propose an approach to compute $k$ geodesic paths using the concept of a novel neighborhood-augmented graph, on which graph search algorithms can compute multiple optimal paths that are topo-geometrically distinct. Our approach does not require complex geometric constructions, and the resulting paths are not restricted to distinct topological classes, making the algorithm suitable for problems where finding and distinguishing between geodesic paths are of interest. We demonstrate the application of our algorithm to planning shortest traversible paths for a tethered robot in 3-D with cable-length constraint.
- 6 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Robotics
- Vol. 41 (15523098) , 20-41
Open AccessTopo-Geometrically Distinct Path Computation Using Neighborhood-Augmented Graph, and Its Application to Path Planning for a Tethered Robot in 3-D
Many robotics applications benefit from being able to compute multiple geodesic paths in a given configuration space. Existing paradigm is to use topological path planning, which can compute optimal paths in distinct topological classes. However, these methods usually require nontrivial geometric constructions, which are prohibitively expensive in 3-D, and are unable to distinguish between distinct topologically equivalent geodesics that are created due to high-cost/curvature regions or prismatic obstacles in 3-D. In this article, we propose an approach to compute $k$ geodesic paths using the concept of a novel neighborhood-augmented graph, on which graph search algorithms can compute multiple optimal paths that are topo-geometrically distinct. Our approach does not require complex geometric constructions, and the resulting paths are not restricted to distinct topological classes, making the algorithm suitable for problems where finding and distinguishing between geodesic paths are of interest. We demonstrate the application of our algorithm to planning shortest traversible paths for a tethered robot in 3-D with cable-length constraint.
- Open Access
- 19 February 2024
- Published by Springer Nature in Autonomous Agents and Multi-Agent Systems
- Vol. 38 (1) , 1-43
Landmark-based distributed topological mapping and navigation in GPS-denied urban environments using teams of low-cost robots
In this paper, we address the problem of autonomous multi-robot mapping, exploration and navigation in unknown, GPS-denied indoor or urban environments using a team of robots equipped with directional sensors with limited sensing capabilities and limited computational resources. The robots have no a priori knowledge of the environment and need to rapidly explore and construct a map in a distributed manner using existing landmarks, the presence of which can be detected using onboard senors, although little to no metric information (distance or bearing to the landmarks) is available. In order to correctly and effectively achieve this, the presence of a necessary density/distribution of landmarks is ensured by design of the urban/indoor environment. We thus address this problem in two phases: (1) During the design/construction of the urban/indoor environment we can ensure that sufficient landmarks are placed within the environment. To that end we develop a filtration-based approach for designing strategic placement of landmarks in an environment. (2) We develop a distributed algorithm which a team of robots, with no a priori knowledge of the environment, can use to explore such an environment, construct a topological map requiring no metric/distance information, and use that map to navigate within the environment. This is achieved using a topological representation of the environment (called a Landmark Complex), instead of constructing a complete metric/pixel map. The representation is built by the robot as well as used by them for navigation through a balanced strategy involving exploration and exploitation. We use tools from homology theory for identifying “holes” in the coverage/exploration of the unknown environment and hence guide the robots towards achieving a complete exploration and mapping of the environment. Our simulation results demonstrate the effectiveness of the proposed metric-free topological (simplicial complex) representation in achieving exploration, localization and navigation within the environment.
- 19 February 2024
- Published by Springer Nature in Autonomous Agents and Multi-Agent Systems
- Vol. 38 (1) , 1-43
Open AccessLandmark-based distributed topological mapping and navigation in GPS-denied urban environments using teams of low-cost robots
In this paper, we address the problem of autonomous multi-robot mapping, exploration and navigation in unknown, GPS-denied indoor or urban environments using a team of robots equipped with directional sensors with limited sensing capabilities and limited computational resources. The robots have no a priori knowledge of the environment and need to rapidly explore and construct a map in a distributed manner using existing landmarks, the presence of which can be detected using onboard senors, although little to no metric information (distance or bearing to the landmarks) is available. In order to correctly and effectively achieve this, the presence of a necessary density/distribution of landmarks is ensured by design of the urban/indoor environment. We thus address this problem in two phases: (1) During the design/construction of the urban/indoor environment we can ensure that sufficient landmarks are placed within the environment. To that end we develop a filtration-based approach for designing strategic placement of landmarks in an environment. (2) We develop a distributed algorithm which a team of robots, with no a priori knowledge of the environment, can use to explore such an environment, construct a topological map requiring no metric/distance information, and use that map to navigate within the environment. This is achieved using a topological representation of the environment (called a Landmark Complex), instead of constructing a complete metric/pixel map. The representation is built by the robot as well as used by them for navigation through a balanced strategy involving exploration and exploitation. We use tools from homology theory for identifying “holes” in the coverage/exploration of the unknown environment and hence guide the robots towards achieving a complete exploration and mapping of the environment. Our simulation results demonstrate the effectiveness of the proposed metric-free topological (simplicial complex) representation in achieving exploration, localization and navigation within the environment.
- Open Access
- 10 July 2023
- Published by Springer Nature in Journal of Intelligent & Robotic Systems
- Vol. 108 (3) , 1-19
Coordination-free Multi-robot Path Planning for Congestion Reduction Using Topological Reasoning
We consider the problem of multi-robot path planning in a complex, cluttered environment with the aim of reducing overall congestion in the environment, while avoiding any inter-robot communication or coordination. Such limitations may exist due to lack of communication or due to privacy restrictions (for example, autonomous vehicles may not want to share their locations or intents with other vehicles or even to a central server). The key insight that allows us to solve this problem is to stochastically distribute the robots across different routes in the environment by assigning them paths in different topologically distinct classes, so as to lower congestion and the overall travel time for all robots in the environment. We outline the computation of topologically distinct paths in a spatio-temporal configuration space and propose methods for the stochastic assignment of paths to the robots. A fast replanning algorithm and a potential field based controller allow robots to avoid collision with nearby agents while following the assigned path. Our simulation and experiment results show a significant advantage over shortest path following under such a coordination-free setup.
- 10 July 2023
- Published by Springer Nature in Journal of Intelligent & Robotic Systems
- Vol. 108 (3) , 1-19
Open AccessCoordination-free Multi-robot Path Planning for Congestion Reduction Using Topological Reasoning
We consider the problem of multi-robot path planning in a complex, cluttered environment with the aim of reducing overall congestion in the environment, while avoiding any inter-robot communication or coordination. Such limitations may exist due to lack of communication or due to privacy restrictions (for example, autonomous vehicles may not want to share their locations or intents with other vehicles or even to a central server). The key insight that allows us to solve this problem is to stochastically distribute the robots across different routes in the environment by assigning them paths in different topologically distinct classes, so as to lower congestion and the overall travel time for all robots in the environment. We outline the computation of topologically distinct paths in a spatio-temporal configuration space and propose methods for the stochastic assignment of paths to the robots. A fast replanning algorithm and a potential field based controller allow robots to avoid collision with nearby agents while following the assigned path. Our simulation and experiment results show a significant advantage over shortest path following under such a coordination-free setup.
- Open Access
Multi-Agent Exploration of an Unknown Sparse Landmark Complex via Deep Reinforcement Learning
In recent years Landmark Complexes have been successfully employed for localization-free and metric-free autonomous exploration using a group of sensing-limited and communication-limited robots in a GPS-denied environment. To ensure rapid and complete exploration, existing works make assumptions on the density and distribution of landmarks in the environment. These assumptions may be overly restrictive, especially in hazardous environments where landmarks may be destroyed or completely missing. In this paper, we first propose a deep reinforcement learning framework for multi-agent cooperative exploration in environments with sparse landmarks while reducing client-server communication. By leveraging recent development on partial observability and credit assignment, our framework can train the exploration policy efficiently for multi-robot systems. The policy receives individual rewards from actions based on a proximity sensor with limited range and resolution, which is combined with group rewards to encourage collaborative exploration and construction of the Landmark Complex through observation of 0-, 1- and 2-dimensional simplices. In addition, we employ a three-stage curriculum learning strategy to mitigate the reward sparsity by gradually adding random obstacles and destroying random landmarks. Experiments in simulation demonstrate that our method outperforms the state-of-the-art landmark complex exploration method in efficiency among different environments with sparse landmarks.
Open AccessMulti-Agent Exploration of an Unknown Sparse Landmark Complex via Deep Reinforcement Learning
In recent years Landmark Complexes have been successfully employed for localization-free and metric-free autonomous exploration using a group of sensing-limited and communication-limited robots in a GPS-denied environment. To ensure rapid and complete exploration, existing works make assumptions on the density and distribution of landmarks in the environment. These assumptions may be overly restrictive, especially in hazardous environments where landmarks may be destroyed or completely missing. In this paper, we first propose a deep reinforcement learning framework for multi-agent cooperative exploration in environments with sparse landmarks while reducing client-server communication. By leveraging recent development on partial observability and credit assignment, our framework can train the exploration policy efficiently for multi-robot systems. The policy receives individual rewards from actions based on a proximity sensor with limited range and resolution, which is combined with group rewards to encourage collaborative exploration and construction of the Landmark Complex through observation of 0-, 1- and 2-dimensional simplices. In addition, we employ a three-stage curriculum learning strategy to mitigate the reward sparsity by gradually adding random obstacles and destroying random landmarks. Experiments in simulation demonstrate that our method outperforms the state-of-the-art landmark complex exploration method in efficiency among different environments with sparse landmarks.
- Open Access
- 4 June 2022
- Published by Springer Nature in Journal of Inequalities and Applications
- Vol. 2022 (1) , 1-31
On some bounds on the perturbation of invariant subspaces of normal matrices with application to a graph connection problem
We provide upper bounds on the perturbation of invariant subspaces of normal matrices measured using a metric on the space of vector subspaces of $\mathbb{C}^{n}$ C n in terms of the spectrum of both unperturbed and perturbed matrices as well as the spectrum of the unperturbed matrix only. The results presented give tighter bounds than the Davis–Kahan sinΘ theorem. We apply the result to a graph perturbation problem.
- 4 June 2022
- Published by Springer Nature in Journal of Inequalities and Applications
- Vol. 2022 (1) , 1-31
Open AccessOn some bounds on the perturbation of invariant subspaces of normal matrices with application to a graph connection problem
We provide upper bounds on the perturbation of invariant subspaces of normal matrices measured using a metric on the space of vector subspaces of $\mathbb{C}^{n}$ C n in terms of the spectrum of both unperturbed and perturbed matrices as well as the spectrum of the unperturbed matrix only. The results presented give tighter bounds than the Davis–Kahan sinΘ theorem. We apply the result to a graph perturbation problem.
- 24 September 2021
- Published by Springer Nature in Autonomous Robots
- Vol. 45 (8) , 1047-1076
Search-based configuration planning and motion control algorithms for a snake-like robot performing load-intensive operations
- 24 September 2021
- Published by Springer Nature in Autonomous Robots
- Vol. 45 (8) , 1047-1076
Search-based configuration planning and motion control algorithms for a snake-like robot performing load-intensive operations
- Open Access
- 17 August 2021
- Published by Frontiers Media SA in Frontiers in Robotics and AI
- Vol. 8
Pursuer Assignment and Control Strategies in Multi-Agent Pursuit-Evasion Under Uncertainties
We consider a pursuit-evasion problem with a heterogeneous team of multiple pursuers and multiple evaders. Although both the pursuers and the evaders are aware of each others’ control and assignment strategies, they do not have exact information about the other type of agents’ location or action. Using only noisy on-board sensors the pursuers (or evaders) make probabilistic estimation of positions of the evaders (or pursuers). Each type of agent use Markov localization to update the probability distribution of the other type. A search-based control strategy is developed for the pursuers that intrinsically takes the probability distribution of the evaders into account. Pursuers are assigned using an assignment algorithm that takes redundancy (i.e., an excess in the number of pursuers than the number of evaders) into account, such that the total or maximum estimated time to capture the evaders is minimized. In this respect we assume the pursuers to have clear advantage over the evaders. However, the objective of this work is to use assignment strategies that minimize the capture time. This assignment strategy is based on a modified Hungarian algorithm as well as a novel algorithm for determining assignment of redundant pursuers. The evaders, in order to effectively avoid the pursuers, predict the assignment based on their probabilistic knowledge of the pursuers and use a control strategy to actively move away from those pursues. Our experimental evaluation shows that the redundant assignment algorithm performs better than an alternative nearest-neighbor based assignment algorithm1.
- 17 August 2021
- Published by Frontiers Media SA in Frontiers in Robotics and AI
- Vol. 8
Open AccessPursuer Assignment and Control Strategies in Multi-Agent Pursuit-Evasion Under Uncertainties
We consider a pursuit-evasion problem with a heterogeneous team of multiple pursuers and multiple evaders. Although both the pursuers and the evaders are aware of each others’ control and assignment strategies, they do not have exact information about the other type of agents’ location or action. Using only noisy on-board sensors the pursuers (or evaders) make probabilistic estimation of positions of the evaders (or pursuers). Each type of agent use Markov localization to update the probability distribution of the other type. A search-based control strategy is developed for the pursuers that intrinsically takes the probability distribution of the evaders into account. Pursuers are assigned using an assignment algorithm that takes redundancy (i.e., an excess in the number of pursuers than the number of evaders) into account, such that the total or maximum estimated time to capture the evaders is minimized. In this respect we assume the pursuers to have clear advantage over the evaders. However, the objective of this work is to use assignment strategies that minimize the capture time. This assignment strategy is based on a modified Hungarian algorithm as well as a novel algorithm for determining assignment of redundant pursuers. The evaders, in order to effectively avoid the pursuers, predict the assignment based on their probabilistic knowledge of the pursuers and use a control strategy to actively move away from those pursues. Our experimental evaluation shows that the redundant assignment algorithm performs better than an alternative nearest-neighbor based assignment algorithm1.