Gokarna Sharma

Dr. Gokarna Sharma

Department of Computer Science, Kent State University, Kent, OH 44242, USA
orcid

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

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

Representative Publications

View All Publications
5 November 2019
Verified
Book Chapter
Closed access
PDF file
AKAjay D. Kshemkalyani
Ajay D. Kshemkalyani
AMAnisur Rahaman Molla
Anisur Rahaman Molla
GSGokarna Sharma
Gokarna Sharma

1 March 2022 in Journal of Parallel and Distributed Computing
Verified
Journal Article
Closed access
AKAjay Kshemkalyani
Ajay Kshemkalyani
AMAnisur Rahaman Molla
Anisur Rahaman Molla
GSGokarna Sharma
Gokarna Sharma

3 November 2016
Verified
Book Chapter
Closed access
PDF file
GSGokarna Sharma
Gokarna Sharma
RVRamachandran Vaidyanathan
Ramachandran Vaidyanathan
JTJerry L. Trahan
Jerry L. Trahan
CBCostas Busch
Costas Busch
SRSuresh Rai
Suresh Rai

1 January 2015
Verified
Book Chapter
Closed access
PDF file
GSGokarna Sharma
Gokarna Sharma
CBCostas Busch
Costas Busch
SMSupratik Mukhopadhyay
Supratik Mukhopadhyay

27 October 2021 in Information
Verified
Journal Article
Open access
PDF file
Pavan PoudelPavan Poudel
Pavan Poudel
GSGokarna Sharma
Gokarna Sharma
We consider the distributed setting of N autonomous mobile robots that operate in Look-Compute-Move (LCM) cycles following the well-celebrated classic oblivious robots model. We study the fundamental problem of gathering N autonomous robots on a plane, which requires all robots to meet at a single point (or to position within a small area) that is not known beforehand. We consider limited visibility under which robots are only able to see other robots up to a constant Euclidean distance and focus on the time complexity of gathering by robots under limited visibility. There exists an O(DG) time algorithm for this problem in the fully synchronous setting, assuming that the robots agree on one coordinate axis (say north), where DG is the diameter of the visibility graph of the initial configuration. In this article, we provide the first O(DE) time algorithm for this problem in the asynchronous setting under the same assumption of robots’ agreement with one coordinate axis, where DE is the Euclidean distance between farthest-pair of robots in the initial configuration. The runtime of our algorithm is a significant improvement since for any initial configuration of N≥1 robots, DE≤DG, and there exist initial configurations for which DG can be quadratic on DE, i.e., DG=Θ(DE2). Moreover, our algorithm is asymptotically time-optimal since the trivial time lower bound for this problem is Ω(DE).

7 October 2017
Verified
Book Chapter
Closed access
PDF file
GSGokarna Sharma
Gokarna Sharma
RVRamachandran Vaidyanathan
Ramachandran Vaidyanathan
JTJerry L. Trahan
Jerry L. Trahan