Dipraj Debnath
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
Research Subjects
Dipraj Debnath has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Felipe Gonzalez
School of Electrical Engineering and Robotics, Faculty of Engineering, Queensland University of Technology, Brisbane City, QLD 4000, Australia
4 shared publications - Fernando Vanegas
School of Electrical Engineering & Robotics, Queensland University of Technology (QUT), QUT S Block, 2 George Street, Brisbane City, QLD 4000, Australia
4 shared publications - Ahmad Faizul Hawary
Universiti Sains Malaysia
3 shared publications - Juan Sandino
School of Electrical Engineering and Robotics, Faculty of Engineering, Queensland University of Technology, Brisbane City, QLD 4000, Australia
2 shared publications F. Gonzalez
QUT Centre for Robotics (QCR), Queensland University of Technology,Brisbane City,QLD,Australia,4000
1 shared publicationF. Vanegas
QUT Centre for Robotics (QCR), Queensland University of Technology,Brisbane City,QLD,Australia,4000
1 shared publication
Latest Publications
- Open Access
Planning-to-Execution Evaluation of Multi-UAV Path Planning for Antarctic Remote Sensing
Multi-UAV missions for remote sensing and environmental monitoring under extreme conditions require task allocation and path optimisation to efficiently distribute goals across vehicles. These methods must also be executed reliably inside an autonomous robotics framework. Several methods for the multiple travelling salesman problem (mTSP) show robust offline routeing efficiency. However, system-level validation under realistic operational conditions including waypoint management and inter-UAV separation remains limited. This research transforms the previously proposed Distance Efficient Clustering Kmeans Genetic Algorithm (DECK_GA) from an offline model into a deployment-focused multi-UAV remote sensing framework implemented in ROS2, Aerostack2, and Gazebo. A uniform waypoint management interface integrates planning, Rviz visualisation, and autonomous execution. The system combines Dynamic Centroid Kmeans (DCKmeans) for spatially coherent waypoint allocation with a Distance Efficient Genetic Algorithm (DEGA) for individual UAV route optimisation. The evaluation is conducted in a high-fidelity Antarctic environment where waypoints represent survey desired objectives in moss regions, and altitude is managed using terrain-referenced control involving two to five UAVs and 30 to 120 waypoints. The framework was evaluated against two baselines under identical mission configurations, with 10 trial runs for each: a Traditional GA Divide & Conquer planner and a Classical Kmeans DEGA planner, which utilises the same route optimisation method and differentiates the outcomes of the allocation stage. DECK_GA showed reduced mean planned and executed distances compared to the Traditional GA Divide & Conquer baseline across all configurations, achieving planned distance reductions ranging from 15.99% to 75.36%. Additionally, it produced shorter path than Classical Kmeans DEGA in 14 out of 16 configurations. The average minimum inter-UAV separation was greater than the Traditional GA Divide & Conquer baseline in 15 of the 16 configurations and higher than Classical Kmeans DEGA in 14 of the 16, which demonstrates that the DCKmeans allocation improves spatial separation. This research focuses on the framework for planning to execution instead of the introduction of a new optimisation method, as DECK_GA was proposed in previous research and is now incorporated and tested within an autonomy framework. This evaluation is simulation only. Real world flying, hardware in the loop testing, wind, communication latency, and location error prediction tend to be future developments.
Open AccessPlanning-to-Execution Evaluation of Multi-UAV Path Planning for Antarctic Remote Sensing
Multi-UAV missions for remote sensing and environmental monitoring under extreme conditions require task allocation and path optimisation to efficiently distribute goals across vehicles. These methods must also be executed reliably inside an autonomous robotics framework. Several methods for the multiple travelling salesman problem (mTSP) show robust offline routeing efficiency. However, system-level validation under realistic operational conditions including waypoint management and inter-UAV separation remains limited. This research transforms the previously proposed Distance Efficient Clustering Kmeans Genetic Algorithm (DECK_GA) from an offline model into a deployment-focused multi-UAV remote sensing framework implemented in ROS2, Aerostack2, and Gazebo. A uniform waypoint management interface integrates planning, Rviz visualisation, and autonomous execution. The system combines Dynamic Centroid Kmeans (DCKmeans) for spatially coherent waypoint allocation with a Distance Efficient Genetic Algorithm (DEGA) for individual UAV route optimisation. The evaluation is conducted in a high-fidelity Antarctic environment where waypoints represent survey desired objectives in moss regions, and altitude is managed using terrain-referenced control involving two to five UAVs and 30 to 120 waypoints. The framework was evaluated against two baselines under identical mission configurations, with 10 trial runs for each: a Traditional GA Divide & Conquer planner and a Classical Kmeans DEGA planner, which utilises the same route optimisation method and differentiates the outcomes of the allocation stage. DECK_GA showed reduced mean planned and executed distances compared to the Traditional GA Divide & Conquer baseline across all configurations, achieving planned distance reductions ranging from 15.99% to 75.36%. Additionally, it produced shorter path than Classical Kmeans DEGA in 14 out of 16 configurations. The average minimum inter-UAV separation was greater than the Traditional GA Divide & Conquer baseline in 15 of the 16 configurations and higher than Classical Kmeans DEGA in 14 of the 16, which demonstrates that the DCKmeans allocation improves spatial separation. This research focuses on the framework for planning to execution instead of the introduction of a new optimisation method, as DECK_GA was proposed in previous research and is now incorporated and tested within an autonomy framework. This evaluation is simulation only. Real world flying, hardware in the loop testing, wind, communication latency, and location error prediction tend to be future developments.
- 14 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 301-308
DECK-GA: A Hybrid Clustering and Distance Efficient Genetic Algorithm for Scalable Multi-UAV Path Planning
The Multi-Travelling Salesman Problem (mTSP) provides a fundamental mathematical framework for modelling the complexities of effective and optimised multi-UAV path planning and for developing solution strategies. Different methodologies have been studied for multi-UAV path planning, such as clustering-based techniques for waypoint allocation. Despite classical Kmeans clustering being commonly employed for its efficiency, centroid instability produces an inefficient distribution of UAVs. Traditional Genetic Algorithms (GA) often encounter difficulties with premature convergence and ineffective crossover operations, leading to suboptimal paths. This paper presents DECK-GA, a hybrid framework that combines Dynamic Centroid Kmeans (DCKmeans) clustering with Distance Efficient Genetic Algorithm (DEGA) to address centroid instability, suboptimal UAV path distribution, and premature convergence. DECK-GA applies DCKmeans to improve centroid initialisation and integration, maintaining stable cluster formations; and DEGA to enhance path planning through fitness-proportionate selection and adaptive crossover mutation, increasing diversity and accelerating convergence. DECK-GA is tested in a simulated environment using 30 and 100 randomly distributed 3D waypoints, minimising travel distances by 56.06% and 69.03%, respectively. Computation times are reduced to 28.17 and 43.21 seconds, correspondingly surpassing classical Kmeans, GA, and other six additional clustering methods combined with traditional GAs and DEGA. The enhancements show the efficiency of DECK-GA in multi-UAV waypoint clustering and path planning for the mTSP, especially in applications that require efficient global path optimisation using GNSS waypoints.
- 14 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 301-308
DECK-GA: A Hybrid Clustering and Distance Efficient Genetic Algorithm for Scalable Multi-UAV Path Planning
The Multi-Travelling Salesman Problem (mTSP) provides a fundamental mathematical framework for modelling the complexities of effective and optimised multi-UAV path planning and for developing solution strategies. Different methodologies have been studied for multi-UAV path planning, such as clustering-based techniques for waypoint allocation. Despite classical Kmeans clustering being commonly employed for its efficiency, centroid instability produces an inefficient distribution of UAVs. Traditional Genetic Algorithms (GA) often encounter difficulties with premature convergence and ineffective crossover operations, leading to suboptimal paths. This paper presents DECK-GA, a hybrid framework that combines Dynamic Centroid Kmeans (DCKmeans) clustering with Distance Efficient Genetic Algorithm (DEGA) to address centroid instability, suboptimal UAV path distribution, and premature convergence. DECK-GA applies DCKmeans to improve centroid initialisation and integration, maintaining stable cluster formations; and DEGA to enhance path planning through fitness-proportionate selection and adaptive crossover mutation, increasing diversity and accelerating convergence. DECK-GA is tested in a simulated environment using 30 and 100 randomly distributed 3D waypoints, minimising travel distances by 56.06% and 69.03%, respectively. Computation times are reduced to 28.17 and 43.21 seconds, correspondingly surpassing classical Kmeans, GA, and other six additional clustering methods combined with traditional GAs and DEGA. The enhancements show the efficiency of DECK-GA in multi-UAV waypoint clustering and path planning for the mTSP, especially in applications that require efficient global path optimisation using GNSS waypoints.
- Top Cited PapersOpen Access
- 29 October 2024
- Published by MDPI AG in Remote Sensing
- Vol. 16 (21) , 4019
A Review of UAV Path-Planning Algorithms and Obstacle Avoidance Methods for Remote Sensing Applications
The rapid development of uncrewed aerial vehicles (UAVs) has significantly increased their usefulness in various fields, particularly in remote sensing. This paper provides a comprehensive review of UAV path planning, obstacle detection, and avoidance methods, with a focus on its utilisation in both single and multiple UAV platforms. The paper classifies the algorithms into two main categories: (1) global and local path-planning approaches in single UAVs; and (2) multi-UAV path-planning methods. It further analyses obstacle detection and avoidance methods, as well as their capacity to adapt, optimise, and compute efficiently in different operational environments. The outcomes highlight the advantages and limitations of each method, offering valuable information regarding their suitability for remote sensing applications, such as precision agriculture, urban mapping, and ecological surveillance. Additionally, this review also identifies limitations in the existing research, specifically in multi-UAV frameworks, and provides recommendations for future developments to improve the adaptability and effectiveness of UAV operations in dynamic and complex situations.
- 29 October 2024
- Published by MDPI AG in Remote Sensing
- Vol. 16 (21) , 4019
Top Cited PapersOpen AccessA Review of UAV Path-Planning Algorithms and Obstacle Avoidance Methods for Remote Sensing Applications
The rapid development of uncrewed aerial vehicles (UAVs) has significantly increased their usefulness in various fields, particularly in remote sensing. This paper provides a comprehensive review of UAV path planning, obstacle detection, and avoidance methods, with a focus on its utilisation in both single and multiple UAV platforms. The paper classifies the algorithms into two main categories: (1) global and local path-planning approaches in single UAVs; and (2) multi-UAV path-planning methods. It further analyses obstacle detection and avoidance methods, as well as their capacity to adapt, optimise, and compute efficiently in different operational environments. The outcomes highlight the advantages and limitations of each method, offering valuable information regarding their suitability for remote sensing applications, such as precision agriculture, urban mapping, and ecological surveillance. Additionally, this review also identifies limitations in the existing research, specifically in multi-UAV frameworks, and provides recommendations for future developments to improve the adaptability and effectiveness of UAV operations in dynamic and complex situations.
- Top Cited PapersOpen Access
An Integrated Geometric Obstacle Avoidance and Genetic Algorithm TSP Model for UAV Path Planning
In this paper, we propose an innovative approach for the path planning of Uninhabited Aerial Vehicles (UAVs) that combines an advanced Genetic Algorithm (GA) for optimising missions in advance and a geometrically based obstacle avoidance algorithm (QuickNav) for avoiding obstacles along the optimised path. The proposed approach addresses the key problem of determining an optimised trajectory for UAVs that covers multiple waypoints by enabling efficient obstacle avoidance, thus improving operational safety and efficiency. The study highlights the numerous challenges for UAV path planning by focusing on the importance of both global and local path planning approaches. To find the optimal routes, the GA utilises multiple methods of selection to optimise trajectories using the Cartesian Coordinate System (CCS) data transformed from a motion capture system. The QuickNav algorithm applies linear equations and geometric methods to detect obstacles, guaranteeing the safe navigation of UAVs and preventing real-time collisions. The proposed methodology has been proven useful in reducing the total distance travelled and computing times and successfully navigating UAVs across different scenarios with varying numbers of waypoints and obstacles, as demonstrated by simulations and real-world UAV flights. This comprehensive approach provides advantageous perspectives for real-world applications in a variety of operational situations and improves UAV autonomy, safety, and efficiency.
Top Cited PapersOpen AccessAn Integrated Geometric Obstacle Avoidance and Genetic Algorithm TSP Model for UAV Path Planning
In this paper, we propose an innovative approach for the path planning of Uninhabited Aerial Vehicles (UAVs) that combines an advanced Genetic Algorithm (GA) for optimising missions in advance and a geometrically based obstacle avoidance algorithm (QuickNav) for avoiding obstacles along the optimised path. The proposed approach addresses the key problem of determining an optimised trajectory for UAVs that covers multiple waypoints by enabling efficient obstacle avoidance, thus improving operational safety and efficiency. The study highlights the numerous challenges for UAV path planning by focusing on the importance of both global and local path planning approaches. To find the optimal routes, the GA utilises multiple methods of selection to optimise trajectories using the Cartesian Coordinate System (CCS) data transformed from a motion capture system. The QuickNav algorithm applies linear equations and geometric methods to detect obstacles, guaranteeing the safe navigation of UAVs and preventing real-time collisions. The proposed methodology has been proven useful in reducing the total distance travelled and computing times and successfully navigating UAVs across different scenarios with varying numbers of waypoints and obstacles, as demonstrated by simulations and real-world UAV flights. This comprehensive approach provides advantageous perspectives for real-world applications in a variety of operational situations and improves UAV autonomy, safety, and efficiency.
- Open Access
QuickNav: An Effective Collision Avoidance and Path-Planning Algorithm for UAS
Obstacle avoidance is a desirable capability for Unmanned Aerial Systems (UASs)/drones which prevents crashes and reduces pilot fatigue, particularly when operating in the Beyond Visual Line of Sight (BVLOS). In this paper, we present QuickNav, a solution for obstacle detection and avoidance designed to function as a pre-planned onboard navigation system for UAS flying in a known obstacle-cluttered environment. Our method uses a geometrical approach and a predefined safe perimeter (square area) based on Euclidean Geometry for the estimation of intercepting points, as a simple and efficient way to detect obstacles. The square region is treated as the restricted zone that the UAS must avoid entering, therefore providing a perimeter for manoeuvring and arriving at the next waypoints. The proposed algorithm is developed in a MATLAB environment and can be easily translated into other programming languages. The proposed algorithm is tested in scenarios with increasing levels of complexity, demonstrating that the QuickNav algorithm is able to successfully and efficiently generate a series of avoiding waypoints. Furthermore, QuickNav produces shorter distances as compared to those of the brute force method and is able to solve difficult obstacle avoidance problems in fractions of the time and distance required by the other methods. QuickNav can be used to improve the safety and efficiency of UAV missions and can be applied to the deployment of UAVs for surveillance, search and rescue, and delivery operations.
Open AccessQuickNav: An Effective Collision Avoidance and Path-Planning Algorithm for UAS
Obstacle avoidance is a desirable capability for Unmanned Aerial Systems (UASs)/drones which prevents crashes and reduces pilot fatigue, particularly when operating in the Beyond Visual Line of Sight (BVLOS). In this paper, we present QuickNav, a solution for obstacle detection and avoidance designed to function as a pre-planned onboard navigation system for UAS flying in a known obstacle-cluttered environment. Our method uses a geometrical approach and a predefined safe perimeter (square area) based on Euclidean Geometry for the estimation of intercepting points, as a simple and efficient way to detect obstacles. The square region is treated as the restricted zone that the UAS must avoid entering, therefore providing a perimeter for manoeuvring and arriving at the next waypoints. The proposed algorithm is developed in a MATLAB environment and can be easily translated into other programming languages. The proposed algorithm is tested in scenarios with increasing levels of complexity, demonstrating that the QuickNav algorithm is able to successfully and efficiently generate a series of avoiding waypoints. Furthermore, QuickNav produces shorter distances as compared to those of the brute force method and is able to solve difficult obstacle avoidance problems in fractions of the time and distance required by the other methods. QuickNav can be used to improve the safety and efficiency of UAV missions and can be applied to the deployment of UAVs for surveillance, search and rescue, and delivery operations.
- 20 June 2021
- Published by Springer Nature
- p. 151-163
Adapting Travelling Salesmen Problem for Real-Time UAS Path Planning Using Genetic Algorithm
- 20 June 2021
- Published by Springer Nature
- p. 151-163
Adapting Travelling Salesmen Problem for Real-Time UAS Path Planning Using Genetic Algorithm