Uday Kumar Chakraborty

Learn More
Differential evolution (DE) is well known as a simple and efficient scheme for global optimization over continuous spaces. It has reportedly outperformed a few evolutionary algorithms (EAs) and other search heuristics like the particle swarm optimization (PSO) when tested over both benchmark and realworld problems. DE, however, is not completely free from(More)
Differential evolution (DE) is well known as a simple and efficient scheme for global optimization over continuous spaces. In this paper we present two new, improved variants of DE. Performance comparisons of the two proposed methods are provided against (a) the original DE, (b) the canonical particle swarm optimization (PSO), and (c) two PSO-variants. The(More)
This paper introduces a novel scheme of improving the performance of particle swarm optimization (PSO) by a vector differential operator borrowed from differential evolution (DE). Performance comparisons of the proposed method are provided against (a) the original DE, (b) the canonical PSO, and (c) three recent, high-performance PSO-variants. The new(More)
This paper presents an efficient technique of designing two-dimensional IIR digital filters using a new algorithm involving the tightly coupled synergism of particle swarm optimization and differential evolution. The design task is reformulated as a constrained minimization problem and is solved by our newly developed PSO-DV (Particle Swarm Optimizer with(More)
This paper presents a fuzzy relational approach to human emotion recognition from facial expressions and its control. The proposed scheme uses external stimulus to excite specific emotions in human subjects whose facial expressions are analyzed by segmenting and localizing the individual frames into regions of interest. Selected facial features such as eye(More)
This paper provides an alternative approach to the co-operative multi-robot path planning problem using parallel differential evolution algorithms. Both centralized and distributed realizations for multi-robot path planning have been studied, and the performances of the methods have been compared with respect to a few pre-defined yardsticks. The distributed(More)
Topological expansion of a computer network for enhancing its geographical coverage, survivability and routability frequently involves an optimization problem to select the best possible combination of links within a given budget limit. Since the problem is known to be NPcomplete, heuristics are usually employed to minimize the search of links that may be(More)