scispace - formally typeset
Search or ask a question
Author

Buddhadeb Sau

Bio: Buddhadeb Sau is an academic researcher from Jadavpur University. The author has contributed to research in topics: Computer science & Robot. The author has an hindex of 8, co-authored 41 publications receiving 188 citations.

Papers published on a yearly basis

Papers
More filters
Proceedings ArticleDOI
01 Dec 2017
TL;DR: This work used two NodeMCU (ESP8266 WiFi module) which is a easily programmable which acts itself as a sensor node and used RSSI technique to determine the distance between two nodes.
Abstract: The use of WiFi is now a part of each human life. Airports, railways, bus-stand, home, markets everywhere now people uses WiFi because its reliability and low-cost. WiFi is also applicable in future tech of IoT (Internet of Things). In this work we used two NodeMCU (ESP8266 WiFi module) which is a easily programmable. NodeMCU which acts itself as a sensor node can be used as Access Point (AP) or as a STAtion (STA). We used one node as a AP and another as a STA. To locate a device distance measurement one of most important issue. There are lots of technique to find out the distance between two nodes (e.g. Time of Arrival (TOA), Time Difference of Arrival (TDOA) or Received Signal Strength (RSS) algorithms etc). In this work we use RSSI technique to determine the distance. First, we take around 300 sample data (RSSI values) and find the standard deviation to calculate how much the RSSI values are spread out and use curve fitting technique to find suitable equation for estimate distance. Then, we compared the estimated distance with actual distance to find the error level in percentage. We are success to reduce the average error level up to 8.32%.

79 citations

Posted Content
TL;DR: In this article, the authors investigated a discrete version of the Arbitrary Pattern Formation problem, where the robots are assumed to be autonomous, identical, anonymous and oblivious, and operate in Look-Compute-Move cycles under a fully asynchronous scheduler.
Abstract: The Arbitrary Pattern Formation problem asks to design a distributed algorithm that allows a set of autonomous mobile robots to form any specific but arbitrary geometric pattern given as input. The problem has been extensively studied in literature in continuous domains. This paper investigates a discrete version of the problem where the robots are operating on a two dimensional infinite grid. The robots are assumed to be autonomous, identical, anonymous and oblivious. They operate in Look-Compute-Move cycles under a fully asynchronous scheduler. The robots do not agree on any common global coordinate system or chirality. We have shown that a set of robots can form any arbitrary pattern, if their starting configuration is asymmetric.

27 citations

Book ChapterDOI
23 Aug 2018
TL;DR: This paper considers the luminous robots model, in which each robot is equipped with an externally visible light which can assume a constant number of predefined colors, and proposes a distributed algorithm which solves the Mutual Visibility problem in a grid based terrain.
Abstract: Consider a set of autonomous, identical, opaque point robots in the Euclidean plane. The Mutual Visibility problem asks the robots to reposition themselves, without colliding, to a configuration where they all see each other, i.e., no three of them are collinear. In this paper, we consider the problem in a grid based terrain where the movements of the robots are restricted only along grid lines and only by a unit distance in each step. We consider the luminous robots model, in which each robot is equipped with an externally visible light which can assume a constant number of predefined colors. These colors serve both as internal memory and as a form of communication. The robots operate in Look-Compute-Move cycles under a fully asynchronous scheduler. The robots do not have any common global coordinate system or chirality and do not have the knowledge of the total number of robots. Our proposed distributed algorithm solves the problem for any arbitrary initial configuration and guarantees collision-free movements.

26 citations

Journal ArticleDOI
TL;DR: A discrete version of the Arbitrary Pattern Formation problem where the robots are operating on a two dimensional infinite grid is investigated and it is shown that a set of robots can form any pattern, if their starting configuration is asymmetric.

24 citations

Book ChapterDOI
01 Jul 2019
TL;DR: In this paper, the authors considered the problem of arbitrary pattern formation in a more realistic obstructed visibility model, where the view of a robot can be obstructed by the presence of other robots.
Abstract: The Arbitrary Pattern Formation problem asks for a distributed algorithm that moves a set of autonomous mobile robots to form any arbitrary pattern given as input. The robots are assumed to be autonomous, anonymous and identical. They operate in Look-Compute-Move cycles under a fully asynchronous scheduler. The robots do not have access to any global coordinate system. The existing literature that investigates this problem, considers robots with unobstructed visibility. This work considers the problem in the more realistic obstructed visibility model, where the view of a robot can be obstructed by the presence of other robots. The robots are assumed to be punctiform and equipped with visible lights that can assume a constant number of predefined colors. We have studied the problem in two settings based on the level of consistency among the local coordinate systems of the robots: two axis agreement (they agree on the direction and orientation of both coordinate axes) and one axis agreement (they agree on the direction and orientation of only one coordinate axis). In both settings, we have provided a full characterization of initial configurations from where any arbitrary pattern can be formed.

21 citations


Cited by
More filters
Book ChapterDOI
01 Jan 2009
TL;DR: This chapter familiarizes the reader with the fact that the conditional distribution of the signal can be viewed as a stochastic process with values in the space of probability measures.
Abstract: The principal aim of this chapter is to familiarize the reader with the fact that the conditional distribution of the signal can be viewed as a stochastic process with values in the space of probability measures. While it is true that this chapter sets the scene for the subsequent chapters, it can be skipped by those readers whose interests are biased towards the applied aspects of the subject. The gist of the chapter can be summarized by the following.

276 citations

Journal Article
TL;DR: In this paper, the rendezvous search problem for k > 2 mobile agents in an n node ring was studied and the conditions under which identical stationary tokens can be used to break symmetry were derived.
Abstract: We study the rendezvous search problem for k > 2 mobile agents in an n node ring. Rather than using randomized algorithms or different deterministic algorithms to break the symmetry that often arises in this problem, we investigate how the mobile agents can use identical stationary tokens to break symmetry and solve the rendezvous problem. After deriving the conditions under which identical stationary tokens can be used to break symmetry, we present several solutions to the rendezvous search problem. We derive the lower bounds of the memory required for mobile agent rendezvous and discuss the relationship between rendezvous and leader election for mobile agents.

73 citations

Journal Article
TL;DR: This work considers the problem of gathering identical, memoryless, mobile robots in one node of an anonymous unoriented ring, and provides gathering algorithms for initial configurations proved to be gatherable.
Abstract: We consider the problem of gathering identical, memoryless, mobile robots in one node of an anonymous unoriented ring. Robots start from different nodes of the ring. They operate in Look-Compute-Move cycles and have to end up in the same node. In one cycle, a robot takes a snapshot of the current configuration (Look), makes a decision to stay idle or to move to one of its adjacent nodes (Compute), and in the latter case makes an instantaneous move to this neighbor (Move). Cycles are performed asynchronously for each robot. For an odd number of robots we prove that gathering is feasible if and only if the initial configuration is not periodic, and we provide a gathering algorithm for any such configuration. For an even number of robots we decide feasibility of gathering except for one type of symmetric initial configurations, and provide gathering algorithms for initial configurations proved to be gatherable.

60 citations

Journal ArticleDOI
TL;DR: The surveying of recent research in this area can support a better understanding of smart-city solutions based on popular platforms such as Raspberry Pi, BeagleBoard and Arduino, as presented in this article.
Abstract: With the increasing availability of affordable open-source embedded hardware platforms, the development of low-cost programmable devices for uncountable tasks has accelerated in recent years. In this sense, the large development community that is being created around popular platforms is also contributing to the construction of Internet of Things applications, which can ultimately support the maturation of the smart-cities era. Popular platforms such as Raspberry Pi, BeagleBoard and Arduino come as single-board open-source platforms that have enough computational power for different types of smart-city applications, while keeping affordable prices and encompassing many programming libraries and useful hardware extensions. As a result, smart-city solutions based on such platforms are becoming common and the surveying of recent research in this area can support a better understanding of this scenario, as presented in this article. Moreover, discussions about the continuous developments in these platforms can also indicate promising perspectives when using these boards as key elements to build smart cities.

40 citations

Journal ArticleDOI
TL;DR: This paper presents an overview on mobile sensor networks in robotics and vice versa and robotic sensor network applications and enables new applications.
Abstract: The interaction of distributed robotics and wireless sensor networks has led to the creation of mobile sensor networks. There has been an increasing interest in building mobile sensor networks and they are the favored class of WSNs in which mobility plays a key role in the execution of an application. More and more researches focus on development of mobile wireless sensor networks (MWSNs) due to its favorable advantages and applications. In WSNs robotics can play a crucial role, and integrating static nodes with mobile robots enhances the capabilities of both types of devices and enables new applications. In this paper we present an overview on mobile sensor networks in robotics and vice versa and robotic sensor network applications.

34 citations