Faculty Publications

Permanent URI for this communityhttps://idr.nitk.ac.in/handle/123456789/18736

Publications by NITK Faculty

Browse

Filters

20202

Settings

Author: search.filters.author.Nair, V.G.Subject: search.filters.subject.Coverage path planning

Search Results

Now showing 1 - 2 of 2
  • No Thumbnail Available
    Item
    Application of Coverage Path Planning Algorithm for Milling Operations
    (Springer, 2020) Kalburgi, S.; Nair, V.G.; Guruprasad, K.R.
    In this paper, we present an algorithm for automatic tool path generation for milling operations, where, the ‘cutter’ needs to pass through all the region that is required to be removed, without any gaps. We demonstrate the possibility of using mobile robot coverage path planning (CPP) algorithms for such applications. In the place of the robot footprint size that is used in a mobile robot CPP algorithm, here we use the size (diameter) of the tool as basis for the tool path generation. Here, we use a spanning tree-based competitive and truly complete robot coverage path planning algorithm, which is based on the approximate cellular decomposition. The proposed algorithm is first tested in V-Rep simulation environment with an arbitrary work piece and then real-time experiments were carried out on a CNC machine to demonstrate the proposed algorithm. © 2020, Springer Nature Singapore Pte Ltd.
  • No Thumbnail Available
    Item
    GM-VPC: An Algorithm for Multi-robot Coverage of Known Spaces Using Generalized Voronoi Partition
    (Cambridge University Press, 2020) Nair, V.G.; Guruprasad, K.R.
    SUMMARY In this paper we address the problem of coverage path planning (CPP) for multiple cooperating mobile robots. We use a 'partition and cover' approach using Voronoi partition to achieve natural passive cooperation between robots to avoid task duplicity. We combine two generalizations of Voronoi partition, namely geodesic-distance-based Voronoi partition and Manhattan-distance-based Voronoi partition, to address contiguity of partition in the presence of obstacles and to avoid partition-boundary-induced coverage gap. The region is divided into 2D×2D grids, where D is the size of the robot footprint. Individual robots can use any of the single-robot CPP algorithms. We show that with the proposed Geodesic-Manhattan Voronoi-partition-based coverage (GM-VPC), a complete and non-overlapping coverage can be achieved at grid level provided that the underlying single-robot CPP algorithm has similar property.We demonstrated using two representative single-robot coverage strategies, namely Boustrophedon-decomposition-based coverage and Spanning Tree coverage, first based on so-called exact cellular decomposition and second based on approximate cellular decomposition, that the proposed partitioning scheme completely eliminates coverage gaps and coverage overlaps. Simulation experiments using Matlab and V-rep robot simulator and experiments with Fire Bird V mobile robot are carried out to validate the proposed coverage strategy. © © Cambridge University Press 2019.