Finding an optimal path for a robot in a soccer field involves different parameters such as the positions of the robot, positions of the obstacles, etc. Due to simplicity and smoothness of Ferguson Spline, it has been employed for path planning between arbitrary points on the field in many research teams. In order to optimize the parameters of Ferguson Spline some evolutionary or intelligent al...

finding an optimal path for a robot in a soccer field involves different parameters such as the positions of the robot, positions of the obstacles, etc. due to simplicity and smoothness of ferguson spline, it has been employed for path planning between arbitrary points on the field in many research teams. in order to optimize the parameters of ferguson spline some evolutionary or intelligent al...

We propose GRASP with evolutionary path-relinking, a metaheuristic resulting from the hybridization of GRASP, path-relinking, and evolutionary path-relinking. This metaheuristic is applied to a network migration problem. Experiments show that a GRASP with evolutionary path-relinking heuristic finds solutions faster than a heuristic based on GRASP with path-relinking as well as one based on pure...

In this paper we give a nesessary and sufficient condition for a Choquet integral model to be decomposable into an equivalent hierarchical Choquet integral model constructed by hierarchical combinations of some ordinary Choquet integral models. The condition is obtained by Inclution-Exclusion Covering (IEC). Moreover we show some properties on the set of IECs.

Several evolutionary algorithms have been proposed for robot path planning. Most existing methods fo r evolutionary path planning require a number of generations for finding a satisfactory trajectory and thus are not e@cient enough for real-time applications. In this paper we present a new method for evolutionary path planning whach can be used on-line in real-time. We use an evolutionary algor...

Abstract This survey presents the rich history of Welch-Gong (WG) Stream cipher family. It has been a long journey that lead WG stream ciphers to become practical. The evolutionary path is combination mathematical endeavour and engineering striving transfer pure functions practical encryption algorithms for various applications. began as pioneering work on transformation sequences with 2-level ...

In literature, Clustered Shortest-Path Tree Problem (CluSPT) is an NP-hard problem. Previous studies focus on approximation algorithms which search for optimal solution in relatively large space. Thus, these consume a amount of computational resources while the quality obtained results lower than expected. order to enhance performance process, this paper proposes two different approaches are in...

This paper presents a novel evolutionary G–continuous (continuous-differentiable curvature) path planner for nonholonomic wheeled mobile robots. The evolutionary path planner generates intermediate configurations connected via η-splines that yields a collision-free G–continuous path, which each point on the path has a closed-form expression. The path planner is implemented as architecture of is...