arXiv subjects

Shantanu Das

Publications and source records attributed to Shantanu Das.

60 records · Page 4Linked to original sources

arXiv2012

Fractional Order Modeling of a PHWR Under Step-Back Condition and Control of Its Global Power with a Robust PIλDμ Controller

Bulk reduction of reactor power within a small finite time interval under abnormal conditions is referred to as step-back. In this paper, a 500MWe Canadian Deuterium Uranium (CANDU) type Pressurized Heavy Water Reactor (PHWR) is modeled using few variants of Least Square Estimator (LSE) from practical test data under a control rod drop scenario in order to design a control system to achieve a dead-beat response during a stepped reduction of its global power. A new fractional order (FO) model reduction technique is attempted which increases the parametric robustness of the control loop due to lesser modeling error and ensures iso-damped closed loop response with a PIλDμ or FOPID controller. Such a controller can, therefore, be used to achieve active step-back under varying load conditions for which the system dynamics change significantly. For closed loop active control of the reduced FO reactor models, the PIλDμ controller is shown to perform better than the classical integer order PID controllers and present operating Reactor Regulating System (RRS) due to its robustness against shift in system parameters.

eess.SY↗

arXiv2012

Simple Agents Learn to Find Their Way: An Introduction on Mapping Polygons

This paper gives an introduction to the problem of mapping simple polygons with autonomous agents. We focus on minimalistic agents that move from vertex to vertex along straight lines inside a polygon, using their sensors to gather local observations at each vertex. Our attention revolves around the question whether a given configuration of sensors and movement capabilities of the agents allows them to capture enough data in order to draw conclusions regarding the global layout of the polygon. In particular, we study the problem of reconstructing the visibility graph of a simple polygon by an agent moving either inside or on the boundary of the polygon. Our aim is to provide insight about the algorithmic challenges faced by an agent trying to map a polygon. We present an overview of techniques for solving this problem with agents that are equipped with simple sensorial capabilities. We illustrate these techniques on examples with sensors that mea- sure angles between lines of sight or identify the previous location. We give an overview over related problems in combinatorial geometry as well as graph exploration.

cs.CG↗

arXiv2011

Black Hole Search with Finite Automata Scattered in a Synchronous Torus

We consider the problem of locating a black hole in synchronous anonymous networks using finite state agents. A black hole is a harmful node in the network that destroys any agent visiting that node without leaving any trace. The objective is to locate the black hole without destroying too many agents. This is difficult to achieve when the agents are initially scattered in the network and are unaware of the location of each other. Previous studies for black hole search used more powerful models where the agents had non-constant memory, were labelled with distinct identifiers and could either write messages on the nodes of the network or mark the edges of the network. In contrast, we solve the problem using a small team of finite-state agents each carrying a constant number of identical tokens that could be placed on the nodes of the network. Thus, all resources used in our algorithms are independent of the network size. We restrict our attention to oriented torus networks and first show that no finite team of finite state agents can solve the problem in such networks, when the tokens are not movable. In case the agents are equipped with movable tokens, we determine lower bounds on the number of agents and tokens required for solving the problem in torus networks of arbitrary size. Further, we present a deterministic solution to the black hole search problem for oriented torus networks, using the minimum number of agents and tokens.

cs.DS↗

arXiv2011

Spreading of Non-Newtonian and Newtonian Fluids on a Solid Substrate under Pressure

Strongly non-Newtonian fluids namely, aqueous gels of starch, are shown to exhibit visco-elastic behavior, when subjected to a load. We study arrowroot and potato starch gels. When a droplet of the fluid is sandwiched between two glass plates and compressed, the area of contact between the fluid and plates increases in an oscillatory manner. This is unlike Newtonian fluids, where the area increases monotonically in a similar situation. The periphery moreover, develops an instability, which looks similar to Saffman Taylor fingers. This is not normally seen under compression. The loading history is also found to affect the manner of spreading. We attempt to describe the non-Newtonian nature of the fluid through a visco-elastic model incorporating generalized calculus. This is shown to reproduce qualitatively the oscillatory variation in the surface strain.

cond-mat.soft↗

arXiv2011

Tight Bounds for Black Hole Search with Scattered Agents in Synchronous Rings

We study the problem of locating a particularly dangerous node, the so-called black hole in a synchronous anonymous ring network with mobile agents. A black hole is a harmful stationary process residing in a node of the network and destroying destroys all mobile agents visiting that node without leaving any trace. We consider the more challenging scenario when the agents are identical and initially scattered within the network. Moreover, we solve the problem with agents that have constant-sized memory and carry a constant number of identical tokens, which can be placed at nodes of the network. In contrast, the only known solutions for the case of scattered agents searching for a black hole, use stronger models where the agents have non-constant memory, can write messages in whiteboards located at nodes or are allowed to mark both the edges and nodes of the network with tokens. This paper solves the problem for ring networks containing a single black hole. We are interested in the minimum resources (number of agents and tokens) necessary for locating all links incident to the black hole. We present deterministic algorithms for ring topologies and provide matching lower and upper bounds for the number of agents and the number of tokens required for deterministic solutions to the black hole search problem, in oriented or unoriented rings, using movable or unmovable tokens.

cs.MA↗

arXiv2010

Oscillatory Spreading and Surface Instability of a Non-Newtonian Fluid under Compression

Starch solutions, which are strongly non-Newtonian, show a surface instability, when subjected to a load. A droplet of the fluid is sandwiched between two glass plates and a weight varying from 1 to 5 kgs. is placed on the top plate. The area of contact between the fluid and plate increases in an oscillatory manner, unlike Newtonian fluids in a similar situation. The periphery moreover, develops a viscous fingering like instability, which is not expected under compression. We attempt to model the non-Newtonian nature of the fluid through a visco-elastic model incorporating generalized calculus. This is shown to exhibit a qualitatively similar oscillatory variation in the surface strain.

cond-mat.soft↗