Avinash Gautam

Avinash Gautam

Auto-generated profile, based on publicly available information

Avinash Gautam

Department of Computer Science and Information Systems, Birla Institute of Technology and Science, Pilani, India

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

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

Representative Publications

View All Publications
1 August 2012
Verified
Conference Paper
Closed access
AGAvinash Gautam
Avinash Gautam
SMSudeept Mohan
Sudeept Mohan
Formally, a collection of two or more autonomous mobile robots working together are termed as teams or societies of mobile robots. In multi robot systems simple robots are allowed to coordinate with each other to achieve some well defined goals. In these kinds of systems robots are far less capable as an entity, but the real power lies in cooperation of multiple robots. The simplicity of multi-robots have produced a potentially wide set of applications such as military missions (battlefield surveillance), searching for survivors in disaster hit areas, parallel and simultaneous transportation of vehicles, and delivery of payloads. Although the research on multi-robot systems has attracted considerable attention worldwide in the past decade, the research in this area is still in its infancy. This paper surveys various interaction techniques in multi robot systems which are important with respect to goal attainment and task completion.

1 December 2018
Verified
Conference Paper
Closed access
VSVirendra Singh Shekhawat
Virendra Singh Shekhawat
AGAvinash Gautam
Avinash Gautam
ATAshish Thakrar
Ashish Thakrar
Datacenter traffic has increased significantly due to rising number of web applications on Internet. These applications have diverse Quality of Service (QoS) requirements making datacenter management a complex task. For a datacenter the amount of resources required for a given resource type (computing, memory, network and storage) is termed as workload. In cloud datacenters, workload classification and characterization is used for resource management, application performance management, capacity sizing, and for estimating the future resource demand. An accurate estimation of future resource demand helps in meeting QoS requirements and ensure efficient resource utilization. Thus modeling and characterization of datacenter workloads becomes necessary to meet performance requirements of applications in a cost-efficient manner. In this paper, a methodology to classify datacenter workloads and characterize them based on resource usage is proposed. Two different workloads have been used, one is Google Cluster Trace (GCT) dataset and other is Bit Brains Trace (BBT) dataset. Seven different machine learning algorithms for workload classification have been used. Workload distribution is estimated in a mix of heterogeneous applications for both GCT and BBT. The seven machine learning algorithms have been compared on the basis of their classification accuracy. Finally, an algorithm to estimate the importance of different attributes for classification is proposed in this paper.

17 September 2016 in Journal of Intelligent & Robotic Systems
Verified
Journal Article
Closed access
PDF file
AGAvinash Gautam
Avinash Gautam
BJBhargav Jha
Bhargav Jha
GKGourav Kumar
Gourav Kumar
JMJ. Krishna Murthy
J. Krishna Murthy
SRSp Arjun Ram
Sp Arjun Ram
SMSudeept Mohan
Sudeept Mohan

1 October 2015
Verified
Conference Paper
Closed access
AGAvinash Gautam
Avinash Gautam
JMJ. Krishna Murthy
J. Krishna Murthy
GKGourav Kumar
Gourav Kumar
SRS. P. Arjun Ram
S. P. Arjun Ram
BJBhargav Jha
Bhargav Jha
SMSudeept Mohan
Sudeept Mohan
This article presents an algorithm for online multirobot coverage that proceeds with minimal knowledge of the already explored region and the frontier cells. It creates clusters of frontier cells which are designated to robots using an optimal assignment scheme. Coverage is then performed using a novel path planning technique. Many approaches that use clustering for multi-robot coverage do not specify strict time criteria for re-clustering. Moreover, the motion plans they use result in redundant coverage. To overcome these limitations, an appropriate motion plan for the robots is chosen based on the context of already covered frontiers. Dispersion of robots is vital for efficient coverage and is an emergent behavior in our approach. The efficacy of the proposed approach is tested in simulation and on a multi-robot test-bed. The algorithm performs better than some state of the art approaches.

25 November 2024 in IEEE Access
Verified
Journal Article
Open access
AVAshish Verma
Ashish Verma
AGAvinash Gautam
Avinash Gautam
VSVirendra Singh Shekhawat
Virendra Singh Shekhawat
SMSudeept Mohan
Sudeept Mohan
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.

23 July 2025 in Journal of Intelligent & Robotic Systems
Verified
Journal Article
Open access
PDF file
AVAshish Verma
Ashish Verma
AGAvinash Gautam
Avinash Gautam
ADAyan Dutta
Ayan Dutta
VSVirendra Singh Shekhawat
Virendra Singh Shekhawat
SMSudeept Mohan
Sudeept Mohan
This paper introduces a novel approach, Coalition Formation for Heterogeneous Multi-Robot Task Allocation (CF-HMRTA), to address the challenge of multi-robot task allocation. The problem, inherently NP-Hard, is tackled using bipartite graph matching. CF-HMRTA forms heterogeneous robot coalitions with unique service skills to complete tasks collaboratively, using a heuristic algorithm for optimal robot-task pairing while preventing task overlap. Recent research work using bipartite graph matching for multi-robot coalition formation and task allocation often assumes homogeneity across tasks and robots, where any robot can be assigned to any task. In contrast, the solution proposed in this paper explicitly considers the diversity of robots with varying service skills. Additionally, tasks demand different sets of skills, such as sensing, monitoring, and data collection, making certain tasks unsuitable for some robots due to hardware constraints. For instance, tasks requiring aerial footage are assigned to drones, while ground robots handle close-ground monitoring. Furthermore, we incorporate task-specific time constraints into our problem formulation, enhancing its realism. Considerably less research has been conducted on heterogeneous robot teams solving tasks that require multiple service skills and temporal constraints, making our work a significant contribution to the field. The algorithm achieves a worst-case time complexity of $$ O(|E|) $$ O ( | E | ) , where $$ E $$ E represents the edges in the bipartite graph, and guarantees perfect matching. Simulation results highlight its scalability, successfully allocating up to 2000 robots to 400 tasks in approximately 11 seconds.