Virendra Singh Shekhawat
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Virendra Singh Shekhawat has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Ashish Verma
Department of Computer Science and Information Systems, Birla Institute of Technology and Science, Pilani, India
2 shared publications - Avinash Gautam
Department of Computer Science and Information Systems, Birla Institute of Technology and Science, Pilani, India
2 shared publications - Sudeept Mohan
Department of Computer Science and Information Systems, Birla Institute of Technology and Science, Pilani, Rajasthan, India
2 shared publications - Ajay Singh
Department of Mathematics, Birla Institute of Technology and Science, Pilani, India
1 shared publication Farhaan Firdous
1 shared publication- Pooja Yadav
Birla Institute of Technology and Science
1 shared publication
Latest Publications
- Open Access
- 26 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 171818-171830
Empirical Study on Multi-Robot Task Allocation Under Communication Range Restrictions
Efficient communication is vital for coordination in multi-robot systems and directly influences the overall performance of the system. However, many advanced approaches overlook the challenges of intermittent connectivity caused by communication range limitations. This paper addresses the assumption of global communication and instead assumes that robots have a predefined limited communication range, reflecting real-world conditions. This comparative empirical study evaluates the impact of limited communication range on three decentralized task allocation algorithms that typically assume continuous communication. Performance is analyzed by varying the communication model between—Bernoulli, Gilbert-Elliot, and Rayleigh Fading—and also the number of tasks in simulation. Each algorithm is assessed using four key metrics: (1) the total rejected tasks, (2) the cumulative penalty incurred by all robots, (3) the overall completion time, and (4) the cumulative energy consumption to execute all the accepted tasks. Finally, the study examines the impact of communication range constraints on the effectiveness of these approaches.
- 26 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 171818-171830
Open AccessEmpirical Study on Multi-Robot Task Allocation Under Communication Range Restrictions
Efficient communication is vital for coordination in multi-robot systems and directly influences the overall performance of the system. However, many advanced approaches overlook the challenges of intermittent connectivity caused by communication range limitations. This paper addresses the assumption of global communication and instead assumes that robots have a predefined limited communication range, reflecting real-world conditions. This comparative empirical study evaluates the impact of limited communication range on three decentralized task allocation algorithms that typically assume continuous communication. Performance is analyzed by varying the communication model between—Bernoulli, Gilbert-Elliot, and Rayleigh Fading—and also the number of tasks in simulation. Each algorithm is assessed using four key metrics: (1) the total rejected tasks, (2) the cumulative penalty incurred by all robots, (3) the overall completion time, and (4) the cumulative energy consumption to execute all the accepted tasks. Finally, the study examines the impact of communication range constraints on the effectiveness of these approaches.
- 6 May 2025
- Published by Elsevier in Computer Networks
- Vol. 266
Modeling and performance evaluation of OpenFlow switches using a MAP/PH/1/n queueing model
- 6 May 2025
- Published by Elsevier in Computer Networks
- Vol. 266
Modeling and performance evaluation of OpenFlow switches using a MAP/PH/1/n queueing model
- Open Access
- 25 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 177050-177063
DTA-HMR-TT: Dynamic Task Allocation for a Heterogeneous Team of Mobile Robots With Task Transfer
Managing time-sensitive deliveries in settings like hospitals is a challenging task, especially when multiple pickup and delivery requests need to be coordinated efficiently within strict time windows. This paper focuses on the Multi-Pickup and Delivery Problem with Time Windows (MPDPTW), where a fleet of autonomous mobile robots works together to fulfill client requests that involve picking up items from specified origins and delivering them to designated destinations. Our objective is to minimize penalties associated with late deliveries while maximizing the number of successfully completed requests. To address this, we introduce a novel approach using a heterogeneous team of robots equipped with an efficient and cost-effective scheduling algorithm. Users submit requests with specific time constraints, and our proposed decentralized algorithm—Dynamic Task Allocation for Heterogeneous Mobile Robots with Task Transfer (DTA-HMR-TT)—optimizes task sharing between robots, ensuring timely service. The algorithm dynamically adjusts to handle rejected or delayed tasks and manages the complex transfer of tasks between robots to improve delivery efficiency. Extensive simulations have demonstrated that our approach significantly outperforms state-of-the-art methods. For smaller task sets (50 to 150 tasks), penalties were reduced by 27%, while for larger sets (150 to 300 tasks), penalties were lowered by 36%. Our results highlight the effectiveness of DTA-HMR-TT in enhancing task scheduling and coordination in multi-robot systems, offering a promising solution for improving delivery performance in structured environments.
- 25 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 177050-177063
Open AccessDTA-HMR-TT: Dynamic Task Allocation for a Heterogeneous Team of Mobile Robots With Task Transfer
Managing time-sensitive deliveries in settings like hospitals is a challenging task, especially when multiple pickup and delivery requests need to be coordinated efficiently within strict time windows. This paper focuses on the Multi-Pickup and Delivery Problem with Time Windows (MPDPTW), where a fleet of autonomous mobile robots works together to fulfill client requests that involve picking up items from specified origins and delivering them to designated destinations. Our objective is to minimize penalties associated with late deliveries while maximizing the number of successfully completed requests. To address this, we introduce a novel approach using a heterogeneous team of robots equipped with an efficient and cost-effective scheduling algorithm. Users submit requests with specific time constraints, and our proposed decentralized algorithm—Dynamic Task Allocation for Heterogeneous Mobile Robots with Task Transfer (DTA-HMR-TT)—optimizes task sharing between robots, ensuring timely service. The algorithm dynamically adjusts to handle rejected or delayed tasks and manages the complex transfer of tasks between robots to improve delivery efficiency. Extensive simulations have demonstrated that our approach significantly outperforms state-of-the-art methods. For smaller task sets (50 to 150 tasks), penalties were reduced by 27%, while for larger sets (150 to 300 tasks), penalties were lowered by 36%. Our results highlight the effectiveness of DTA-HMR-TT in enhancing task scheduling and coordination in multi-robot systems, offering a promising solution for improving delivery performance in structured environments.