THE DESIGN AND ANALYSIS OF EXPERIMENTS. By Oscar Kempthorne. New York, John Wiley and Sons, Inc., 1952. 631 pp. $8.50. This book by a teacher of statistics (as well as a consultant for \"experimenters\") is a comprehensive study of the philosophical background for the statistical design of experiment. It is necessary to have some facility with algebraic notation and manipulation to be able to use the volume intelligently. The problems are presented from the theoretical point of view, without such practical examples as would be helpful for those not acquainted with mathematics. The mathematical justification for the techniques is given. As a somewhat advanced treatment of the design and analysis of experiments, this volume will be interesting and helpful for many who approach statistics theoretically as well as practically. With emphasis on the \"why,\" and with description given broadly, the author relates the subject matter to the general theory of statistics and to the general problem of experimental inference. MARGARET J. ROBERTSON

The Design and Analysis of Experiments

In this paper a novel nature-inspired optimization paradigm is proposed called Moth-Flame Optimization (MFO) algorithm. The main inspiration of this optimizer is the navigation method of moths in nature called transverse orientation. Moths fly in night by maintaining a fixed angle with respect to the moon, a very effective mechanism for travelling in a straight line for long distances. However, these fancy insects are trapped in a useless/deadly spiral path around artificial lights. This paper mathematically models this behaviour to perform optimization. The MFO algorithm is compared with other well-known nature-inspired algorithms on 29 benchmark and 7 real engineering problems. The statistical results on the benchmark functions show that this algorithm is able to provide very promising and competitive results. Additionally, the results of the real problems demonstrate the merits of this algorithm in solving challenging problems with constrained and unknown search spaces. The paper also considers the application of the proposed algorithm in the field of marine propeller design to further investigate its effectiveness in practice. Note that the source codes of the MFO algorithm are publicly available at http://www.alimirjalili.com/MFO.html.

Moth-flame optimization algorithm

http://romisatriawahono.net/lecture/rm/survey/softcomputing/Boussaid%20-%20Optimization%20Metaheuristics%20-%202013.pdf

A survey on optimization metaheuristics

http://sipi.usc.edu/~mendel/publications/Mendel%20INS%202007%20AT2.pdf

Advances in type-2 fuzzy sets and systems

Motion planning is a fundamental research area in robotics. Sampling-based methods offer an efficient solution for what is otherwise a rather challenging dilemma of path planning. Consequently, these methods have been extended further away from basic robot planning into further difficult scenarios and diverse applications. A comprehensive survey of the growing body of work in sampling-based planning is given here. Simulations are executed to evaluate some of the proposed planners and highlight some of the implementation details that are often left unspecified. An emphasis is placed on contemporary research directions in this field. We address planners that tackle current issues in robotics. For instance, real-life kinodynamic planning, optimal planning, replanning in dynamic environments, and planning under uncertainty are discussed. The aim of this paper is to survey the state of the art in motion planning and to assess selected planners, examine implementation details and above all shed a light on the current challenges in motion planning and the promising approaches that will potentially overcome those problems.

Sampling-Based Robot Motion Planning: A Review

In the Motion Planning research field, heuristic methods have demonstrated to outperform classical approaches gaining popularity in the last 35 years. Several ideas have been proposed to overcome the complex nature of this NP-Complete problem. Ant Colony Optimization algorithms are heuristic methods that have been successfully used to deal with this kind of problems. This paper presents a novel proposal to solve the problem of path planning for mobile robots based on Simple Ant Colony Optimization Meta-Heuristic (SACO-MH). The new method was named SACOdm, where d stands for distance and m for memory. In SACOdm, the decision making process is influenced by the existing distance between the source and target nodes; moreover the ants can remember the visited nodes. The new added features give a speed up around 10 in many cases. The selection of the optimal path relies in the criterion of a Fuzzy Inference System, which is adjusted using a Simple Tuning Algorithm. The path planner application has two operating modes, one is for virtual environments, and the second one works with a real mobile robot using wireless communication. Both operating modes are global planners for plain terrain and support static and dynamic obstacle avoidance.

/pdf/path-planning-for-autonomous-mobile-robot-navigation-with-2c2vm0ncqt.pdf

Path planning for autonomous mobile robot navigation with ant colony optimization and fuzzy cost function evaluation

The BPF proposal ensures a feasible, optimal and safe path for robot navigation.The results of BPF overcomes APF and other EAPF methods like those based in GAs.The BPF is quite faster in optimization leading to reduction in computation burden.The BPF running in parallel mode is the most suitable to fulfill local and global controllability.The BPF is capable to work in offline and online mode with static and dynamic obstacles. In this paper, optimal paths in environments with static and dynamic obstacles for a mobile robot (MR) are computed using a new method for path planning. The proposed method called Bacterial Potential Field (BPF) ensures a feasible, optimal and safe path. This novel proposal makes use of the Artificial Potential Field (APF) method with a Bacterial Evolutionary Algorithm (BEA) to obtain an enhanced flexible path planner method taking all the advantages of using the APF method, strongly reducing its disadvantages. Comparative experiments for sequential and parallel implementations of the BPF method against the classic APF method, as well as with the Pseudo-Bacterial Potential Field (PBPF) method, and with the Genetic Potential Field (GPF) method, all of them based on evolutionary computation to optimize the APF parameters, were achieved. A simulation platform that uses an MR realistic model was designed to test the path planning algorithms. In general terms, it was demonstrated that the BPF outperforms the APF, GPF, and the PBPF methods by reducing the computational time to find the optimal path at least by a factor of 1.59. These results have a positive impact in the ability of the BPF path planning method to satisfy local and global controllability in dynamic complex environments, avoiding collisions with objects that will interfere the navigation of the MR.

Path planning for mobile robots using Bacterial Potential Field for avoiding static and dynamic obstacles

In this paper, a membrane evolutionary artificial potential field (memEAPF) approach for solving the mobile robot path planning problem is proposed, which combines membrane computing with a genetic algorithm (membrane-inspired evolutionary algorithm with one-level membrane structure) and the artificial potential field method to find the parameters to generate a feasible and safe path. The memEAPF proposal consists of delimited compartments where multisets of parameters evolve according to rules of biochemical inspiration to minimize the path length. The proposed approach is compared with artificial potential field based path planning methods concerning to their planning performance on a set of twelve benchmark test environments, and it exhibits a better performance regarding path length. Experiments to demonstrate the statistical significance of the improvements achieved by the proposed approach in static and dynamic environments are shown. Moreover, the implementation results using parallel architectures proved the effectiveness and practicality of the proposal to obtain solutions in considerably less time.

Mobile robot path planning using membrane evolutionary artificial potential field

Experimental study of intelligent controllers under uncertainty using type-1 and type-2 fuzzy logic

A method for designing optimal interval type-2 fuzzy logic controllers using evolutionary algorithms is presented in this paper. Interval type-2 fuzzy controllers can outperform conventional type-1 fuzzy controllers when the problem has a high degree of uncertainty. However, designing interval type-2 fuzzy controllers is more difficult because there are more parameters involved. In this paper, interval type-2 fuzzy systems are approximated with the average of two type-1 fuzzy systems, which has been shown to give good results in control if the type-1 fuzzy systems can be obtained appropriately. An evolutionary algorithm is applied to find the optimal interval type-2 fuzzy system as mentioned above. The human evolutionary model is applied for optimizing the interval type-2 fuzzy controller for a particular non-linear plant and results are compared against an optimal type-1 fuzzy controller. A comparative study of simulation results of the type-2 and type-1 fuzzy controllers, under different noise levels, is also presented. Simulation results show that interval type-2 fuzzy controllers obtained with the evolutionary algorithm outperform type-1 fuzzy controllers.

Oscar Montiel

Papers

Path planning for autonomous mobile robot navigation with ant colony optimization and fuzzy cost function evaluation

Path planning for mobile robots using Bacterial Potential Field for avoiding static and dynamic obstacles

Mobile robot path planning using membrane evolutionary artificial potential field

Experimental study of intelligent controllers under uncertainty using type-1 and type-2 fuzzy logic

Optimization of interval type-2 fuzzy logic controllers using evolutionary algorithms