The Nash Equilibrium Point of Dynamic Games Using Evolutionary Algorithms in Linear Dynamics and Quadratic System

In this paper, examining some games, we show that classical techniques are not always effective for games with not many stages and players and it can’t be claimed that these techniques of solution always obtain the optimal and actual Nash equilibrium point. For solving these problems, two evolutionary algorithms are then presented based on the population to solve general dynamic games. The first algorithm is based on the genetic algorithm and we use genetic algorithms to model the players' learning process in several models and evaluate them in terms of their convergence to the Nash Equilibrium. in the second algorithm, a Particle Swarm Intelligence Optimization (PSO) technique is presented to accelerate solutions’ convergence. It is claimed that both techniques can find the actual Nash equilibrium point of the game keeping the problem’s generality and without imposing any limitation on it and without being caught by the local Nash equilibrium point. The results clearly show the benefits of the proposed approach in terms of both the quality of solutions and efficiency.     

An efficient parallel algorithm for the longest path problem in meshes

The longest path problem is the problem of finding a simple path with the maximum number of vertices in a given graph, and so far it has been solved polynomially only for a few classes of graphs. This problem generalizes the well-known Hamiltonian path problem, hence it is NP-hard in general graphs. In this paper, first we give a sequential linear-time algorithm for the longest path problem in meshes. Then based on this algorithm, we present a constant-time parallel algorithm for the problem, which can be run on every parallel machine.     

Optimal design of laser solid freeform fabrication system and real-time prediction of melt pool geometry using intelligent evolutionary algorithms

With the rapid growth of laser applications and the introduction of high efficiency lasers (e.g. fiber lasers), laser material processing has gained increasing importance in a variety of industries. Among the applications of laser technology, laser cladding has received significant attention due to its high potential for material processing such as metallic coating, high value component repair, prototyping, and even low-volume manufacturing. In this paper, two optimization methods have been applied to obtain optimal operating parameters of Laser Solid Freeform Fabrication Process (LSFF) as a real world engineering problem. First, Particle Swarm Optimization (PSO) algorithm was implemented for real-time prediction of melt pool geometry. Then, a hybrid evolutionary algorithm called Self-organizing Pareto based Evolutionary Algorithm (SOPEA) was proposed to find the optimal process parameters. For further assurance on the performance of the proposed optimization technique, it was compared to some well-known vector optimization algorithms such as Non-dominated Sorting Genetic Algorithm (NSGA-II) and Strength Pareto Evolutionary Algorithm (SPEA 2). Thereafter, it was applied for simultaneous optimization of clad height and melt pool depth in LSFF process. Since there is no exact mathematical model for the clad height (deposited layer thickness) and the melt pool depth, the authors developed two Adaptive Neuro-Fuzzy Inference Systems (ANFIS) to estimate these two process parameters. Optimization procedure being done, the archived non-dominated solutions were surveyed to find the appropriate ranges of process parameters with acceptable dilutions. Finally, the selected optimal ranges were used to find a case with the minimum rapid prototyping time. The results indicate the acceptable potential of evolutionary strategies for controlling and optimization of LSFF process as a complicated engineering problem.     

Consistency of robust estimators in multi-structural visual data segmentation

A theoretical framework is presented to study the consistency of robust estimators used in vision problems involving extraction of fine details. A strong correlation between asymptotic performance of a robust estimator and the asymptotic bias of its scale estimate is mathematically demonstrated where the structures are assumed to be linear corrupted by Gaussian noise. A new measure for the inconsistency of scale estimators is defined and formulated by deriving the functional forms of four recent high-breakdown robust estimators. For each estimator, the inconsistency measures are numerically evaluated for a range of mutual distances between structures and inlier ratios, and the minimum mutual distance between the structures, for which each estimator returns a non-bridging fit, is calculated.     

THE EFFICIENCY CHALLENGES OF RESOURCE DISCOVERY IN GRID ENVIRONMENTS

Resource discovery is one of the most important services that significantly affects the efficiency of grid computing systems. The inherent dynamic and large-scale characteristics of grid environments make their resource discovery a challenging task. In recent years, different approaches have been proposed for resource discovery, attempting to tackle the challenges of grid environments and improve the efficiency. Being aware of these challenges and approaches is worthwhile in order to choose an appropriate approach according to the application in different organizations. This study reviews the most important factors that should be considered and challenges to be tackled in order to develop an efficient grid resource discovery system.     

A supervisory control policy over an acoustic communication network

This paper presents a supervisory multi-agent control policy over an acoustic communication network subject to imperfections (packet dropout and transmission delay) for localisation of an underwater flow source (e.g., source of chemical pollution, fresh water, etc.) with an unknown location at the bottom of the ocean. A two-loop control policy combined with a coding strategy for reliable communication is presented to perform the above task. A simulator is developed and used to evaluate the trade-offs between quality of communication, transmission delay and control for a fleet of autonomous underwater vehicles supervised over a noisy acoustic communication network by an autonomous surface vessel. It is illustrated that without compensation of the effects of severe random packet dropout, localisation of an unknown underwater flow source is not possible for the condition simulated just by implementing a two-loop control policy. But a two-loop control policy combined with a strategy for reliable communication locates the unknown location of flow source.     

Non-parametric statistical background modeling for efficient foreground region detection

Most methods for foreground region detection in videos are challenged by the presence of quasi-stationary backgrounds—flickering monitors, waving tree branches, moving water surfaces or rain. Additional difficulties are caused by camera shake or by the presence of moving objects in every image. The contribution of this paper is to propose a scene-independent and non-parametric modeling technique which covers most of the above scenarios. First, an adaptive statistical method, called adaptive kernel density estimation (AKDE), is proposed as a base-line system that addresses the scene dependence issue. After investigating its performance we introduce a novel general statistical technique, called recursive modeling (RM). The RM overcomes the weaknesses of the AKDE in modeling slow changes in the background. The performance of the RM is evaluated asymptotically and compared with the base-line system (AKDE). A wide range of quantitative and qualitative experiments is performed to compare the proposed RM with the base-line system and existing algorithms. Finally, a comparison of various background modeling systems is presented as well as a discussion on the suitability of each technique for different scenarios.