Indian Institute of Technology Madras

About: Indian Institute of Technology Madras is a facility organization based out in Chennai, Tamil Nadu, India. It is known for research contribution in the topics: Catalysis & Heat transfer. The organization has 20118 authors who have published 36499 publications receiving 590447 citations.

Control Loop Performance Assessment. 2. Hammerstein Model Approach for Stiction Diagnosis

Abstract: In part 2 of this two-part series, an approach for diagnosis and quantification of stiction using a simple single-parameter model is proposed. The stiction model, in conjunction with an identified process model from routine operating data, is shown to successfully facilitate stiction diagnosis. An optimization approach is used to jointly identify the process model and the stiction parameter. This approach is based on the identification of a Hammerstein model of the system comprising the sticky valve and the process. In this work, a new identification procedure for Hammerstein systems that supports stiction diagnosis is proposed. Industrial and simulation case studies are shown to demonstrate the application of the proposed approach for diagnosing stiction.

Collision free path planning of cooperative crane manipulators using genetic algorithm

Abstract: This paper presents a new approach for automated path planning of cooperative crane manipulators using a genetic algorithm (GA). The inverse kinematic problem, i.e., determining the joint angle configuration for the cooperative crane manipulator system in moving the object from pick location to place location, is defined as an optimization problem and solved using GA. For generating the collision-free path, GA with an interference detection algorithm is employed and search is made in the manipulator joint angle space (configuration space). The effectiveness of the proposed approach for automated path planning is demonstrated by comparing the performance of the present approach with the earlier heuristic search proposed by Sivakumar et al. The GA approach finds a near-optimal path with lower path cost and less computational time than earlier heuristic searches.