In the present paper, a method for building a map of an unknown environment (SLAM) derived from the ICP algorithm using point-to-point metric is proposed. The polarscan matching technology is used for estimation of the robot location change between two scans in sequence estimate the correct position of the robot. Since map building is fairly timeconsuming, the algorithm of differential evolutio...

determining the optimal location of wells with the aid of an automated search algorithm is a significant and difficult step in the reservoir development process. it is a computationally intensive task due to the large number of simulation runs required. therefore,the key issue to such automatic optimization is development of algorithms that can find acceptable solutions with a minimum number of...

In this participation are discussed principles of bioinformatics, datamining, evolutionary computing and its mutual intersection. Datamining by means of selected evolutionary techniques are discussed with attention on protein structure, segmentation and state of art on the field of evolutionary algorithms use. Basic principles and terminology of evolutionary algorithms, as well as two evolution...

Evolutionary computation tools are able to process real valued numerical sets in order to extract suboptimal solution of designed problem. Data clustering algorithms have been intensively used for image segmentation in remote sensing applications. Despite of wide usage of evolutionary algorithms on data clustering, their clustering performances have been scarcely studied by using clustering val...

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...

The optimal dimensional synthesis for planar mechanisms using differential evolution (DE) is demonstrated. Four examples are included: in the first case, the synthesis of a mechanism for hybrid-tasks, considering path generation, function generation, and motion generation, is carried out. The second and third cases pertain to path generation, with and without prescribed timing. Finally, the syn...

Differential Evolution algorithm is a simple yet reliable and robust evolutionary algorithm for numeric optimization. However, fine-tuning control parameters of DE algorithm is a tedious and time-consuming task thus became a major challenge for its application. This paper introduces a novel self-adaptive method for tuning the amplification parameters F of DE dynamically. This method sampled app...