Rabiul Hasan Kabir

Mr. Rabiul Hasan Kabir


Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
29 April 2021 in Applied Sciences
Verified
Journal Article
Open access
PDF file
RKRabiul Hasan Kabir
Rabiul Hasan Kabir
Kooktae LeeKooktae Lee
Kooktae Lee
This paper addresses a wildlife monitoring problem using a team of unmanned aerial vehicles (UAVs) with the optimal transport theory. The state-of-the-art technology using UAVs has been an increasingly popular tool to monitor wildlife compared to the traditional methods such as satellite imagery-based sensing or GPS trackers. However, there still exist unsolved problems as to how the UAVs need to cover a spacious domain to detect animals as many as possible. In this paper, we propose the optimal transport-based wildlife monitoring strategy for a multi-UAV system, to prioritize monitoring areas while incorporating complementary information such as GPS trackers and satellite-based sensing. Through the proposed scheme, the UAVs can explore the large-size domain effectively and collaboratively with a given priority. The time-varying nature of wildlife due to their movements is modeled as a stochastic process, which is included in the proposed work to reflect the spatio-temporal evolution of their position estimation. In this way, the proposed monitoring plan can lead to wildlife monitoring with a high detection rate. Various simulation results including statistical data are provided to validate the proposed work. In all different simulations, it is shown that the proposed scheme significantly outperforms other UAV-based wildlife monitoring strategies in terms of the target detection rate up to 3.6 times.

30 September 2021 in International Journal of Systems Science
Verified
Journal Article
Closed access
Kooktae LeeKooktae Lee
Kooktae Lee
RKRabiul Hasan Kabir
Rabiul Hasan Kabir
This paper addresses a density-aware multi-agent exploration problem based on an Optimal Transport (OT) theory while considering energy constraints of a multi-agent system. The density-aware exploration means how a team of agents (robots) cover a given domain, reflecting a priority of areas of interest represented by a density distribution, rather than simply following a preset of uniform patterns. To achieve the density-aware multi-agent exploration, the optimal transport theory that quantifies a distance between two density distributions is employed as a tool, which also serves as a means of similarity measure. Energy constraints for a multi-agent system are then incorporated into the OT-based density-aware multi-agent exploration scheme. The proposed method is developed targeting a decentralised control to cope with more realistic scenarios such as communication range limits between agents. To measure the exploration efficiency, the upper bound of the similarity measure is proposed, which is computationally tractable. The developed multi-agent exploration scheme is applicable to a time-varying distribution as well, where a spatio-temporal evolution of the given reference distribution is desired. To validate the proposed method, multiple simulation results are provided.

22 March 2021 in Preprints.org
Verified
Preprint
Open access
PDF file
RKRabiul Hasan Kabir
Rabiul Hasan Kabir
Kooktae LeeKooktae Lee
Kooktae Lee
This paper addresses a wildlife monitoring problem using a team of UAVs for efficient monitoring of wildlife. The state-of-the-art technology using UAVs has been an increasingly popular tool to monitor wildlife compared to the traditional methods such as satellite imagery-based sensing or GPS trackers. However, there still exist unsolved problems as to how the UAVs need to cover a spacious domain to detect animals as many as possible. In this paper, we propose the optimal transport-based wildlife monitoring strategy for a multi-UAV system, to prioritize monitoring areas while incorporating complementary information such as GPS trackers and satellite-based sensing. Through the proposed scheme, the UAVs can explore the large-size domain effectively and collaboratively with a given priority. The time-varying nature of wildlife due to their movements is modeled as a stochastic process, which is included in the proposed work to reflect the spatio-temporal evolution of their position estimation. In this way, the proposed monitoring plan can lead to efficient wildlife monitoring with a high detection rate. Various simulation results including statistical data are provided to validate the proposed work.

6 April 2023 in Acta Astronautica
Verified
Journal Article
Closed access
RKRabiul Hasan Kabir
Rabiul Hasan Kabir
HPHao Peng
Hao Peng
XBXiaoli Bai
Xiaoli Bai

22 January 2025 in Sensors
Verified
Journal Article
Open access
PDF file
RKRabiul Hasan Kabir
Rabiul Hasan Kabir
XBXiaoli Bai
Xiaoli Bai
This study addresses the motion and inertia parameter estimation problem of a torque-free, tumbling, non-cooperative space object (target) under long-term occlusions. To solve this problem, we employ a data-driven Gaussian process (GP) to simulate sensor measurements. In particular, we implement the multi-output GP to predict the projection measurements of a stereo-camera system onboard a chaser spacecraft. A product kernel, consisting of two periodic kernels, is used in the GP models to capture the periodic trends from non-periodic projection data. The initial guesses for the periodicity hyper-parameters of the GP models are intelligently derived from fast Fourier transform (FFT) analysis of the projection data. Additionally, we propose an unscented Kalman filter–Gaussian process (UKF-GP) fusion algorithm for target motion and inertia parameter estimation. The predicted projections from the GP models and their derivatives are used as the pseudo-measurements for UKF-GP during long-term occlusion. Results from Monte Carlo (MC) simulations demonstrate that, for varying tumbling frequencies, the UKF-GP can accurately estimate the target’s motion variables over hundreds of seconds, a capability the conventional UKF algorithm lacks.