Subramanian Ramasamy

Mr. Subramanian Ramasamy

orcid

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
17 September 2022 in Journal of Intelligent & Robotic Systems
Verified
Journal Article
Closed access
PDF file
SRSubramanian Ramasamy
Subramanian Ramasamy
JRJean-Paul F. Reddinger
Jean-Paul F. Reddinger
JDJames M. Dotterweich
James M. Dotterweich
MCMarshal A. Childers
Marshal A. Childers
PBPranav Bhounsule
Pranav Bhounsule

9 January 2025 in Journal of Intelligent & Robotic Systems
Verified
Journal Article
Open access
PDF file
SMSafwan Mondal
Safwan Mondal
SRSubramanian Ramasamy
Subramanian Ramasamy
JHJames D. Humann
James D. Humann
JDJames M. Dotterweich
James M. Dotterweich
JRJean-Paul F. Reddinger
Jean-Paul F. Reddinger
PBPranav Bhounsule
Pranav Bhounsule
Unmanned Aerial Vehicles (UAVs), adept at aerial surveillance, are often constrained by their limited battery capacity. Refueling on slow-moving Unmanned Ground Vehicles (UGVs) can significantly enhance UAVs’ operational endurance. This paper explores the computationally complex problem of cooperative UAV-UGV routing for vast area surveillance, considering speed and fuel constraints. It presents a sequential multi-agent planning framework aimed at achieving feasible and optimally satisfactory solutions. By considering the UAV fuel limit and utilizing a minimum set cover algorithm, we determine UGV refueling stops. This, in turn, facilitates UGV route planning as the first step. Through a task allocation technique and energy-constrained vehicle routing problem modeling with time windows (E-VRPTW), we then achieve the UAV route in the second step of the framework. The effectiveness of our multi-agent strategy is demonstrated through the implementation on 30 different task scenarios across three different scales. This work provides significant insight into the collaborative advantages of UAV-UGV systems and introduces heuristic approaches to bypass computational challenges and swiftly reach high-quality solutions.

7 September 2023 in arXiv
Verified
Preprint
Open access
PDF file
SMSafwan Mondal
Safwan Mondal
SRSubramanian Ramasamy
Subramanian Ramasamy
JHJames D. Humann
James D. Humann
JRJean-Paul F. Reddinger
Jean-Paul F. Reddinger
JDJames M. Dotterweich
James M. Dotterweich
PBPranav Bhounsule
Pranav Bhounsule
Unmanned Aerial Vehicles (UAVs), although adept at aerial surveillance, are often constrained by limited battery capacity. By refueling on slow-moving Unmanned Ground Vehicles (UGVs), their operational endurance can be significantly enhanced. This paper explores the computationally complex problem of cooperative UAV-UGV routing for vast area surveillance within the speed and fuel constraints, presenting a sequential multi-agent planning framework for achieving feasible and optimally satisfactory solutions. By considering the UAV fuel limits and utilizing a minimum set cover algorithm, we determine UGV refueling stops, which in turn facilitate UGV route planning at the first step and through a task allocation technique and energy constrained vehicle routing problem modeling with time windows (E-VRPTW) we achieve the UAV route at the second step of the framework. The effectiveness of our multi-agent strategy is demonstrated through the implementation on 30 different task scenarios across 3 different scales. This work offers significant insight into the collaborative advantages of UAV-UGV systems and introduces heuristic approaches to bypass computational challenges and swiftly reach high-quality solutions.

26 May 2026 in IEEE Transactions on Intelligent Vehicles
Verified
Journal Article
Open access
MMMd Safwan Mondal
Md Safwan Mondal
SRSubramanian Ramasamy
Subramanian Ramasamy
JHJames D. Humann
James D. Humann
JDJames M. Dotterweich
James M. Dotterweich
PBPranav Bhounsule
Pranav Bhounsule
Integrating Unmanned Aerial Vehicles (UAVs) with Unmanned Ground Vehicles (UGVs) provides an effective solution for persistent surveillance in disaster management. UAVs excel at covering large areas rapidly, but their range is limited by battery capacity. UGVs, though slower, can carry larger batteries for extended missions. By using UGVs as mobile recharging stations, UAVs can extend mission duration through periodic refueling, leveraging the complementary strengths of both systems. To optimize this energy-aware UAV-UGV cooperative routing problem, we propose a planning framework that determines optimal routes and recharging points between a UAV and a UGV. Our solution employs a deep reinforcement learning (DRL) framework built on an encoder-decoder transformer architecture with multi-head attention mechanisms. This architecture enables the model to sequentially select actions for visiting mission points and coordinating recharging rendezvous between the UAV and UGV. The DRL model is trained to minimize the age periods (the time gap between consecutive visits) of mission points, ensuring effective surveillance. We evaluate the framework across various problem sizes and distributions, comparing its performance against heuristic methods and an existing learning-based model. Results show that our approach consistently outperforms these baselines in both solution quality and runtime. Additionally, we demonstrate the DRL policy's applicability in a real-world disaster scenario as a case study and explore its potential for online mission planning to handle dynamic changes. Adapting the DRL policy for priority-driven surveillance highlights the model's generalizability for real-time disaster response. More details are available on our website: https://sites.google.com/view/ecucps.

7 July 2023 in arXiv
Verified
Preprint
Open access
PDF file
SMSafwan Mondal
Safwan Mondal
SRSubramanian Ramasamy
Subramanian Ramasamy
PBPranav Bhounsule
Pranav Bhounsule
Fast moving unmanned aerial vehicles (UAVs) are well suited for aerial surveillance, but are limited by their battery capacity. To increase their endurance UAVs can be refueled on slow moving unmanned ground vehicles (UGVs). The cooperative routing of UAV-UGV multi-agent system to survey vast regions within their speed and fuel constraints is a computationally challenging problem, but can be simplified with heuristics. Here we present multiple heuristics to enable feasible and sufficiently optimal solutions to the problem. Using the UAV fuel limits and the minimum set cover algorithm, the UGV refueling stops are determined. These refueling stops enable the allocation of mission points to the UAV and UGV. A standard traveling salesman formulation and a vehicle routing formulation with time windows, dropped visits, and capacity constraints is used to solve for the UGV and UAV route, respectively. Experimental validation on a small-scale testbed (http://tiny.cc/8or8vz) underscores the effectiveness of our multi-agent approach.

18 September 2023 in arXiv
Verified
Preprint
Open access
PDF file
SMSafwan Mondal
Safwan Mondal
SRSubramanian Ramasamy
Subramanian Ramasamy
PBPranav Bhounsule
Pranav Bhounsule
Unmanned aerial vehicles (UAVs) are capable of surveying expansive areas, but their operational range is constrained by limited battery capacity. The deployment of mobile recharging stations using unmanned ground vehicles (UGVs) significantly extends the endurance and effectiveness of UAVs. However, optimizing the routes of both UAVs and UGVs, known as the UAV-UGV cooperative routing problem, poses substantial challenges, particularly with respect to the selection of recharging locations. Here in this paper, we leverage reinforcement learning (RL) for the purpose of identifying optimal recharging locations while employing constraint programming to determine cooperative routes for the UAV and UGV. Our proposed framework is then benchmarked against a baseline solution that employs Genetic Algorithms (GA) to select rendezvous points. Our findings reveal that RL surpasses GA in terms of reducing overall mission time, minimizing UAV-UGV idle time, and mitigating energy consumption for both the UAV and UGV. These results underscore the efficacy of incorporating heuristics to assist RL, a method we refer to as heuristics-assisted RL, in generating high-quality solutions for intricate routing problems.