Shantanu Das

Saptarshi Das, Suman Saha, Shantanu Das et al.

In this paper, a comparative study is done on the time and frequency domain tuning strategies for fractional order (FO) PID controllers to handle higher order processes. A new fractional order template for reduced parameter modeling of stable minimum/non-minimum phase higher order processes is introduced and its advantage in frequency domain tuning of FOPID controllers is also presented. The time domain optimal tuning of FOPID controllers have also been carried out to handle these higher order processes by performing optimization with various integral performance indices. The paper highlights on the practical control system implementation issues like flexibility of online autotuning, reduced control signal and actuator size, capability of measurement noise filtration, load disturbance suppression, robustness against parameter uncertainties etc. in light of the above tuning methodologies.

Saptarshi Das, Indranil Pan, Shantanu Das et al.

A novel fractional order (FO) fuzzy Proportional-Integral-Derivative (PID) controller has been proposed in this paper which works on the closed loop error and its fractional derivative as the input and has a fractional integrator in its output. The fractional order differ-integrations in the proposed fuzzy logic controller (FLC) are kept as design variables along with the input-output scaling factors (SF) and are optimized with Genetic Algorithm (GA) while minimizing several integral error indices along with the control signal as the objective function. Simulations studies are carried out to control a delayed nonlinear process and an open loop unstable process with time delay. The closed loop performances and controller efforts in each case are compared with conventional PID, fuzzy PID and PIλDμ controller subjected to different integral performance indices. Simulation results show that the proposed fractional order fuzzy PID controller outperforms the others in most cases.

Anish Acharya, Saptarshi Das, Indranil Pan et al.

This paper proposes the design of Fractional Order (FO) Butterworth filter in complex w-plane (w=sq; q being any real number) considering the presence of under-damped, hyper-damped, ultra-damped poles. This is the first attempt to design such fractional Butterworth filters in complex w-plane instead of complex s-plane, as conventionally done for integer order filters. Firstly, the concept of fractional derivatives and w-plane stability of linear fractional order systems are discussed. Detailed mathematical formulation for the design of fractional Butterworth-like filter (FBWF) in w-plane is then presented. Simulation examples are given along with a practical example to design the FO Butterworth filter with given specifications in frequency domain to show the practicability of the proposed formulation.

Suman Saha, Saptarshi Das, Ratna Ghosh et al.

Phase shaping using fractional order (FO) phase shapers has been proposed by many contemporary researchers as a means of producing systems with iso-damped closed loop response due to a stepped variation in input. Such systems, with the closed loop damping remaining invariant to gain changes can be used to produce dead-beat step response with only rise time varying with gain. This technique is used to achieve an active step-back in a Pressurized Heavy Water Reactor (PHWR) where it is desired to change the reactor power to a pre-determined value within a short interval keeping the power undershoot as low as possible. This paper puts forward an approach as an alternative for the present day practice of a passive step-back mechanism where the control rods are allowed to drop during a step-back action by gravity, with release of electromagnetic clutches. The reactor under a step-back condition is identified as a system using practical test data and a suitable Proportional plus Integral plus Derivative (PID) controller is designed for it. Then the combined plant is augmented with a phase shaper to achieve a dead-beat response in terms of power drop. The fact that the identified static gain of the system depends on the initial power level at which a step-back is initiated, makes this application particularly suited for using a FO phase shaper. In this paper, a model of a nuclear reactor is developed for a control rod drop scenario involving rapid power reduction in a 500MWe Canadian Deuterium Uranium (CANDU) reactor using AutoRegressive Exogenous (ARX) algorithm. The system identification and reduced order modeling are developed from practical test data. For closed loop active control of the identified reactor model, the fractional order phase shaper along with a PID controller is shown to perform better than the present Reactor Regulating System (RRS) due to its iso-damped nature.

Saptarshi Das, Basudev Majumder, Anindya Pakhira et al.

Rational approximation of fractional order (FO) differ-integrators via Continued Fraction Expansion (CFE) is a well known technique. In this paper, the nominal structures of various generating functions are optimized using Genetic Algorithm (GA) to minimize the deviation in magnitude and phase response between the original FO element and the rationalized discrete time filter in Infinite Impulse Response (IIR) structure. The optimized filter based realizations show better approximation of the FO elements in comparison with the existing methods and is demonstrated by the frequency response of the IIR filters.

Saptarshi Das, Shantanu Das, Amitava Gupta

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.

Saptarshi Das, Indranil Pan, Shantanu Das et al.

Genetic Algorithm (GA) has been used in this paper for a new Nyquist based sub-optimal model reduction and optimal time domain tuning of PID and fractional order (FO) PIλDμ controllers. Comparative studies show that the new model reduction technique outperforms the conventional H2-norm based reduced order modeling techniques. Optimum tuning rule has been developed next with a test-bench of higher order processes via Genetic Programming (GP) with minimum value of weighted integral error index and control signal. From the Pareto optimal front which is a trade-off between the complexity of the formulae and control performance, an efficient set of tuning rules has been generated for time domain optimal PID and PIλDμ controllers.

Basudev Majumder, Saptarshi Das, Indranil Pan et al.

This paper analyzes a nuclear reactor power signal that suffers from network induced random delays in the shared data network while being fed-back to the Reactor Regulating System (RRS). A detailed study is carried out to investigate the self similarity of random delay dynamics due to the network traffic in shared medium. The fractionality or selfsimilarity in the network induced delay that corrupts the measured power signal coming from Self Powered Neutron Detectors (SPND) is estimated and analyzed. As any fractional order randomness is intrinsically different from conventional Gaussian kind of randomness, these delay dynamics need to be handled efficiently, before reaching the controller within the RRS. An attempt has been made to minimize the effect of the randomness in the reactor power transient data with few classes of smoothing filters. The performance measure of the smoothers with fractional order noise consideration is also investigated into.

Suman Saha, Saptarshi Das, Ratna Ghosh et al.

Phase curve of an open loop system is flat in nature if the derivative of phase with respect to frequency is zero. With a flat phase curve, the corresponding closed-loop system exhibits an iso-damped property i.e. maintains constant overshoot with the change of gain and with other parametric variations. In recent past application, fractional order (FO) phase shapers have been proposed by contemporary researchers to achieve enhanced parametric robustness. In this paper, a simple Routh tabulation based methodology is proposed to design an appropriate FO phase shaper to achieve phase flattening in a control loop, comprising a system, controlled by a classical PID controller. The method is demonstrated using MATLAB simulation of a second order DC motor plant and also a first order with time delay system.

Avyukta Manjunatha Vummintala, Shantanu Das, Sujit Gujar

This paper considers the problem of fair probabilistic binary classification with binary protected groups. The classifier assigns scores, and a practitioner predicts labels using a certain cut-off threshold based on the desired trade-off between false positives vs. false negatives. It derives these thresholds from the ROC of the classifier. The resultant classifier may be unfair to one of the two protected groups in the dataset. It is desirable that no matter what threshold the practitioner uses, the classifier should be fair to both the protected groups; that is, the $\mathcal{L}_p$ norm between FPRs and TPRs of both the protected groups should be at most $\varepsilon$. We call such fairness on ROCs of both the protected attributes $\varepsilon_p$-Equalized ROC. Given a classifier not satisfying $\varepsilon_1$-Equalized ROC, we aim to design a post-processing method to transform the given (potentially unfair) classifier's output (score) to a suitable randomized yet fair classifier. That is, the resultant classifier must satisfy $\varepsilon_1$-Equalized ROC. First, we introduce a threshold query model on the ROC curves for each protected group. The resulting classifier is bound to face a reduction in AUC. With the proposed query model, we provide a rigorous theoretical analysis of the minimal AUC loss to achieve $\varepsilon_1$-Equalized ROC. To achieve this, we design a linear time algorithm, namely \texttt{FROC}, to transform a given classifier's output to a probabilistic classifier that satisfies $\varepsilon_1$-Equalized ROC. We prove that under certain theoretical conditions, \texttt{FROC}\ achieves the theoretical optimal guarantees. We also study the performance of our \texttt{FROC}\ on multiple real-world datasets with many trained classifiers.

Krishn Vishwas Kher, Saksham Mittal, Aditya Varun et al.

One of the main concerns while deploying machine learning models in real-world applications is fairness. Counterfactual fairness has emerged as an intuitive and natural definition of fairness. However, existing methodologies for enforcing counterfactual fairness seem to have two limitations: (i) generating counterfactual samples faithful to the underlying causal graph, and (ii) as we argue in this paper, existing regularizers are mere proxies and do not directly enforce the exact definition of counterfactual fairness. In this work, our aim is to mitigate both issues. Firstly, we propose employing Neural Causal Models (NCMs) for generating the counterfactual samples. For implementing the abduction step in NCMs, the posteriors of the exogenous variables need to be estimated given a counterfactual query, as they are not readily available. As a consequence, $\mathcal{L}_3$ consistency with respect to the underlying causal graph cannot be guaranteed in practice due to the estimation errors involved. To mitigate this issue, we propose a novel kernel least squares loss term that enforces the $\mathcal{L}_3$ constraints explicitly. Thus, we obtain an improved counterfactual generation suitable for the counterfactual fairness task. Secondly, we propose a new MMD-based regularizer term that explicitly enforces the counterfactual fairness conditions into the base model while training. We show an improved trade-off between counterfactual fairness and generalization over existing baselines on synthetic and benchmark datasets.

Shantanu Das, Giuseppe A. Di Luna, Paola Flocchini et al.

We consider a distributed system of n identical mobile robots operating in the two dimensional Euclidian plane. As in the previous studies, we consider the robots to be anonymous, oblivious, dis-oriented, and without any communication capabilities, operating based on the Look-Compute-Move model where the next location of a robot depends only on its view of the current configuration. Even in this seemingly weak model, most formation problems which require constructing specific configurations, can be solved quite easily when the robots are fully synchronized with each other. In this paper we introduce and study a new class of problems which, unlike the formation problems so far, cannot always be solved even in the fully synchronous model with atomic and rigid moves. This class of problems requires the robots to permute their locations in the plane. In particular, we are interested in implementing two special types of permutations -- permutations without any fixed points and permutations of order $n$. The former (called MOVE-ALL) requires each robot to visit at least two of the initial locations, while the latter (called VISIT-ALL) requires every robot to visit each of the initial locations in a periodic manner. We provide a characterization of the solvability of these problems, showing the main challenges in solving this class of problems for mobile robots. We also provide algorithms for the feasible cases, in particular distinguishing between one-step algorithms (where each configuration must be a permutation of the original configuration) and multi-step algorithms (which allow intermediate configurations). These results open a new research direction in mobile distributed robotics which has not been investigated before.

Indranil Pan, Saptarshi Das, Shantanu Das

In this paper, an active control policy design for a fractional order (FO) financial system is attempted, considering multiple conflicting objectives. An active control template as a nonlinear state feedback mechanism is developed and the controller gains are chosen within a multi-objective optimization (MOO) framework to satisfy the conditions of asymptotic stability, derived analytically. The MOO gives a set of solutions on the Pareto optimal front for the multiple conflicting objectives that are considered. It is shown that there is a trade-off between the multiple design objectives and a better performance in one objective can only be obtained at the cost of performance deterioration in the other objectives. The multi-objective controller design has been compared using three different MOO techniques viz. Non Dominated Sorting Genetic Algorithm-II (NSGA-II), epsilon variable Multi-Objective Genetic Algorithm (ev-MOGA), and Multi Objective Evolutionary Algorithm with Decomposition (MOEA/D). The robustness of the same control policy designed with the nominal system settings have been investigated also for gradual decrease in the commensurate and incommensurate fractional orders of the financial system.

Saptarshi Das, Indranil Pan, Khrist Sur et al.

This paper investigates typical behaviors like damped oscillations in fractional order (FO) dynamical systems. Such response occurs due to the presence of, what is conceived as, pseudo-damping and meta-damping in some special class of FO systems. Here, approximation of such damped oscillation in FO systems with the conventional notion of integer order damping and time constant has been carried out using Genetic Algorithm (GA). Next, a multilayer feed-forward Artificial Neural Network (ANN) has been trained using the GA based results to predict the optimal pseudo and meta-damping from knowledge of the maximum order or number of terms in the FO dynamical system.

Zohir Bouzid, Shantanu Das, Sébastien Tixeuil

The problem of gathering multiple mobile robots to a single location, is one of the fundamental problems in distributed coordination between autonomous robots. The problem has been studied and solved even for robots that are anonymous, disoriented, memoryless and operate in the semi-synchronous (ATOM) model. However all known solutions require the robots to be faulty-free except for the results of [Agmon and Peleg 2006] who solve the gathering problem in presence of one crash fault. This leaves open the question of whether gathering of correct robots can be achieved in the presence of multiple crash failures. We resolve the question in this paper and show how to solve gathering, when any number of robots may crash at any time during the algorithm, assuming strong multiplicity detection and chirality. In contrast it is known that for the more stronger byzantine faults, it is impossible to gather even in a 3-robot system if one robot is faulty. Our algorithm solves the gathering of correct robots in the semi-synchronous model where an adversary may stop any robot before reaching its desired destination. Further the algorithm is self-stabilizing as it achieves gathering starting from any configuration (except the bivalent configuration where deterministic gathering is impossible).

Saptarshi Das, Indranil Pan, Shantanu Das et al.

Genetic Algorithm (GA) has been used in this paper for a new approach of sub-optimal model reduction in the Nyquist plane and optimal time domain tuning of PID and fractional order (FO) PIλDμ controllers. Simulation studies show that the Nyquist based new model reduction technique outperforms the conventional H2 norm based reduced parameter modeling technique. With the tuned controller parameters and reduced order model parameter data-set, optimum tuning rules have been developed with a test-bench of higher order processes via Genetic Programming (GP). The GP performs a symbolic regression on the reduced process parameters to evolve a tuning rule which provides the best analytical expression to map the data. The tuning rules are developed for a minimum time domain integral performance index described by weighted sum of error index and controller effort. From the reported Pareto optimal front of GP based optimal rule extraction technique a trade-off can be made between the complexity of the tuning formulae and the control performance. The efficacy of the single-gene and multi-gene GP based tuning rules has been compared with original GA based control performance for the PID and PIλDμ controllers, handling four different class of representative higher order processes. These rules are very useful for process control engineers as they inherit the power of the GA based tuning methodology, but can be easily calculated without the requirement for running the computationally intensive GA every time. Three dimensional plots of the required variation in PID/FOPID controller parameters with reduced process parameters have been shown as a guideline for the operator. Parametric robustness of the reported GP based tuning rules has also been shown with credible simulation examples.