Rajib Kumar Das
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Rajib Kumar Das has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Sunirmal Khatua
University of Calcutta, Kolkata, India
13 shared publications - Kamalesh Karmakar
Techno International New Town
5 shared publications - Anurina Tarafdar
Department of Computer Science and Engineering, University of Calcutta, Kolkata, India
4 shared publications - Biplab Kanti Sen
University of Calcutta
1 shared publication - Giridhar Maji
Department of Electrical Engineering, Raghunathpur Government Polytechnic, Purulia, India
1 shared publication - Mukta Debnath
University of Calcutta India
1 shared publication
Latest Publications
- 11 May 2026
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 82 (7) , 410
Trajectory planning for target sweep coverage with mobile sensors
- 11 May 2026
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 82 (7) , 410
Trajectory planning for target sweep coverage with mobile sensors
- 2 January 2026
- Published by Springer Nature
- p. 207-220
Flight Path Constrained Last-Mile Parcel Delivery Using Drone
- 2 January 2026
- Published by Springer Nature
- p. 207-220
Flight Path Constrained Last-Mile Parcel Delivery Using Drone
- Open Access
- 8 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 155-161
Parcel Delivery Using Drones in the Presence of Obstacles
To tackle the challenges of last-mile logistics, drone delivery of parcels has emerged as an efficient and fast solution. However, deploying drone delivery systems in urban environments requires robust obstacle-avoidance capabilities to ensure safe and reliable operations. This study focuses on two critical aspects of parcel delivery via drones: first, how to plan the drone’s trajectory while avoiding obstacles, and second, how to find the optimal position of the source (distribution point) that minimizes the drone’s total movement while delivering parcels. We consider two versions of the problem. In one, the drone can carry only one parcel at a time, and in the other, it can carry up to k parcels. For the first version, our strategy finds the shortest paths from the source position to the customer locations or targets while avoiding obstacles. For the second version, we construct a graph representing all targets, and the edge weights are the shortest path distances considering obstacles. We divide the targets into clusters of size at most k and find a TSP tour for each cluster using Christofide’s algorithm. Experiments have been conducted on problem sets in a simulated urban environment to analyze the proposed solution and determine the effect of k on the cost of solutions.
- 8 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 155-161
Open AccessParcel Delivery Using Drones in the Presence of Obstacles
To tackle the challenges of last-mile logistics, drone delivery of parcels has emerged as an efficient and fast solution. However, deploying drone delivery systems in urban environments requires robust obstacle-avoidance capabilities to ensure safe and reliable operations. This study focuses on two critical aspects of parcel delivery via drones: first, how to plan the drone’s trajectory while avoiding obstacles, and second, how to find the optimal position of the source (distribution point) that minimizes the drone’s total movement while delivering parcels. We consider two versions of the problem. In one, the drone can carry only one parcel at a time, and in the other, it can carry up to k parcels. For the first version, our strategy finds the shortest paths from the source position to the customer locations or targets while avoiding obstacles. For the second version, we construct a graph representing all targets, and the edge weights are the shortest path distances considering obstacles. We divide the targets into clusters of size at most k and find a TSP tour for each cluster using Christofide’s algorithm. Experiments have been conducted on problem sets in a simulated urban environment to analyze the proposed solution and determine the effect of k on the cost of solutions.
- Open Access
- 8 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 618-627
Cost Efficient Mobile Trajectory Planning in Barrier Sweep Coverage
The problem of detecting intrusion over a curved barrier by deploying sensors is called the barrier coverage problem. In the barrier sweep coverage problem, the objective is to visit every point on the curve at intervals of no more than a given period t called the sweep period. This is a challenging problem, requiring the determination of a tour plan for mobile devices moving at a given speed to ensure sweep coverage within the given sweep period. This paper proposes an algorithm to solve this problem, where we divide the curve C into N small segments of almost equal length. The proposed algorithm has a time complexity of O(N2) and an approximate ratio of 2, which is better than the previous best ratio of Math 1. Additionally, we presented an Integer Linear Program (ILP) formulation of the problem and conducted experiments to compare the proposed algorithm with the optimal solution obtained from ILP. The results indicate that our algorithm provides solutions very close to the optimal solution obtained from ILP, thereby establishing its effectiveness for solving the barrier sweep coverage problem.
- 8 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 618-627
Open AccessCost Efficient Mobile Trajectory Planning in Barrier Sweep Coverage
The problem of detecting intrusion over a curved barrier by deploying sensors is called the barrier coverage problem. In the barrier sweep coverage problem, the objective is to visit every point on the curve at intervals of no more than a given period t called the sweep period. This is a challenging problem, requiring the determination of a tour plan for mobile devices moving at a given speed to ensure sweep coverage within the given sweep period. This paper proposes an algorithm to solve this problem, where we divide the curve C into N small segments of almost equal length. The proposed algorithm has a time complexity of O(N2) and an approximate ratio of 2, which is better than the previous best ratio of Math 1. Additionally, we presented an Integer Linear Program (ILP) formulation of the problem and conducted experiments to compare the proposed algorithm with the optimal solution obtained from ILP. The results indicate that our algorithm provides solutions very close to the optimal solution obtained from ILP, thereby establishing its effectiveness for solving the barrier sweep coverage problem.
- 11 March 2024
- Published by Springer Nature in Journal of Grid Computing
- Vol. 22 (1) , 1-21
Cost-efficient Workflow as a Service using Containers
- 11 March 2024
- Published by Springer Nature in Journal of Grid Computing
- Vol. 22 (1) , 1-21
Cost-efficient Workflow as a Service using Containers
- 28 November 2023
- Published by Springer Nature in Mobile Networks and Applications
- Vol. 29 (5) , 1646-1662
Multichannel Pipelined Scheduling for Raw Data Convergecast in Sensor-Cloud
- 28 November 2023
- Published by Springer Nature in Mobile Networks and Applications
- Vol. 29 (5) , 1646-1662
Multichannel Pipelined Scheduling for Raw Data Convergecast in Sensor-Cloud
- 13 February 2023
- Published by Springer Nature in Journal of Grid Computing
- Vol. 21 (1) , 1-29
Power Modeling for Energy-Efficient Resource Management in a Cloud Data Center
- 13 February 2023
- Published by Springer Nature in Journal of Grid Computing
- Vol. 21 (1) , 1-29
Power Modeling for Energy-Efficient Resource Management in a Cloud Data Center
- 22 November 2022
- Published by Elsevier in Computers and Electrical Engineering
- Vol. 105
Multi-criteria scheduling of scientific workflows in the Workflow as a Service platform
- 22 November 2022
- Published by Elsevier in Computers and Electrical Engineering
- Vol. 105
Multi-criteria scheduling of scientific workflows in the Workflow as a Service platform
- 17 June 2022
- Published by Elsevier in Journal of Network and Computer Applications
- Vol. 205
Utilization aware and network I/O intensive virtual machine placement policies for cloud data center
- 17 June 2022
- Published by Elsevier in Journal of Network and Computer Applications
- Vol. 205
Utilization aware and network I/O intensive virtual machine placement policies for cloud data center
- 10 February 2022
- Published by Springer Nature in Microsystem Technologies
- Vol. 28 (12) , 2593-2610
Energy efficient algorithms for enhancing lifetime in wireless sensor networks
- 10 February 2022
- Published by Springer Nature in Microsystem Technologies
- Vol. 28 (12) , 2593-2610
Energy efficient algorithms for enhancing lifetime in wireless sensor networks