IK-FA, a new heuristic inverse kinematics solver using firefly algorithm

In this paper, a heuristic method based on Firefly Algorithm is proposed for inverse kinematics problems in articulated robotics. The proposal is called, IK-FA. Solving inverse kinematics, IK, consists in finding a set of joint-positions allowing a specific point of the system to achieve a target position. In IK-FA, the Fireflies positions are assumed to be a possible solution for joints elementary motions. For a robotic system with a known forward kinematic model, IK-Fireflies, is used to generate iteratively a set of joint motions, then the forward kinematic model of the system is used to compute the relative Cartesian positions of a specific end-segment, and to compare it to the needed target position. This is a heuristic approach for solving inverse kinematics without computing the inverse model. IK-FA tends to minimize the distance to a target position, the fitness function could be established as the distance between the obtained forward positions and the desired one, it is subject to minimization. In this paper IK-FA is tested over a 3 links articulated planar system, the evaluation is based on statistical analysis of the convergence and the solution quality for 100 tests. The impact of key FA parameters is also investigated with a focus on the impact of the number of fireflies, the impact of the maximum iteration number and also the impact of (a, ß, ¿, d) parameters. For a given set of valuable parameters, the heuristic converges to a static fitness value within a fix maximum number of iterations. IK-FA has a fair convergence time, for the tested configuration, the average was about 2.3394 × 10-3 seconds with a position error fitness around 3.116 × 10-8 for 100 tests. The algorithm showed also evidence of robustness over the target position, since for all conducted tests with a random target position IK-FA achieved a solution with a position error lower or equal to 5.4722 × 10-9.Peer ReviewedPostprint (author's final draft

A new initialization technique in polar coordinates for Particle Swarm Optimization and Polar PSO

Particle Swarm Optimization (PSO) is one of the famous algorithms inspired by the natural behavior of a swarm (particles). However, it is used to solve n-dimensional problems in search space. One of its modified versions a Polar Particle Swarm Optimizer, was operated in polar coordinates by using an appropriate mapping function introduced based on polar coordinates. The modified algorithm faced some problems, such as generating a distorted search space, which may have been caused by the method of randomization. This paper introduces an initialization technique that operates entirely in polar coordinates. Moreover, an investigation based on standard PSO was done to test the proposed technique. The second part was to use the new initialization technique to enhance the polar PSO performance. In addition, the proposed techniques show evenly distributed points in the polar search space. Furthermore, experimental results were obtained by using various benchmark test functions on different settings of dimensions. While its shows a little enhancement in some benchmark test functions in both PSO and polar PSO, statistically there are no significant differences by using the analysis of variance (ANOVA)

Optimal design for a NEO tracking spacecraft formation

The following paper presents the design and methodology for developing an optimal set of spacecraft orbits for a NEO tracking mission. The spacecraft is designed to fly in close formation with the asteroid, avoiding the nonlinear gravity field produced by the asteroid. A periodic orbit is developed, and the initial conditions are optimized by use of a global optimizer for constrained nonlinear problems. The asteroid Apophis (NEO 2004 MN4) was used as the case study due the potential impact with Earth in 2036, and the need for more accurate ephemerides

Random Actuation Pattern Optimization by Genetic Algorithm for Ultrasonic Structural Health Monitoring of Plates

The objective of this research is to investigate an optimized two-dimensional random pattern of uniformly excited points using the Genetic Algorithm (GA) technique for structural health monitoring. The point excitations generate ultrasonic waves in both isotropic and anisotropic materials that can be effective in diagnosing structural defects. The formed ultrasonic waves can constructively interfere and send out an intense wave beam to a predetermined target. The constructed wave beams can be steered to different directions with variable target distances. In the GA, the cost function is constructed to reduce main lobe beamwidth, eliminate grating lobes and suppress sidelobes’ levels. Mathematical modelling, finite element simulations, and optimizations are successively performed to achieve the objectives. Secondly Firstly, a mathematical beamforming model is developed to describe the excitation pattern of which each point is excited at the same time delay with a uniform weighting factor. The derived methodology accounts for enclosing all excitations within a certain aperture. The centroid of the emitting sources is also kept at the origin of the Cartesian coordinate within a slight tolerance range. For the near field, in isotropic materials, the excitation points lay on equally spaced circular arcs centered at the target point. In anisotropic materials, such as composites, the wave amplitude and phase velocity are highly dependent on fiber directions. Because of anisotropic nature, the excitation geometry becomes quite complicated. Secondly, finite element models for aluminum and composite plates are simulated to extract wave characteristics, such as displacement amplitudes, phase velocity profiles and slowness curves. These data are implemented later in the optimization algorithm. A quarter plate of radius 150mm and 1.125mm thickness is modelled as a three-dimensional solid part. A concentrated force with a 2.5 cycle-Hanning window sinusoidal signal is applied at the center of the plate and the boundaries are chosen to be symmetrical. Radial sensors at 5 degrees increments are positioned at 50mm from the excitation source to measure wave properties. The simulation results show that the amplitude and velocity are uniform for isotropic materials whereas the waves propagate rapidly with higher amplitudes along the fibers in anisotropic materials. Thirdly, after collecting all the required information, a GA optimization technique is applied to generate the excitation population of x- and y-coordinates. The pre-determined population is permutated, cross-overed and mutated so that additional possibilities are produced. The same process is repeated for many generations until the local optimum result is obtained. Finally, the near field beamforming is plotted in MATLAB at different actuation point numbers for the isotropic and anisotropic materials. The results are then compared to other linear, circular and planar patterns found in literature

Firefly Algorithms for Multimodal Optimization

Nature-inspired algorithms are among the most powerful algorithms for optimization. This paper intends to provide a detailed description of a new Firefly Algorithm (FA) for multimodal optimization applications. We will compare the proposed firefly algorithm with other metaheuristic algorithms such as particle swarm optimization (PSO). Simulations and results indicate that the proposed firefly algorithm is superior to existing metaheuristic algorithms. Finally we will discuss its applications and implications for further research

Global satellite triangulation and trilateration for the National Geodetic Satellite Program (solutions WN 12, 14 and 16)

A multi-year study and analysis of data from satellites launched specifically for geodetic purposes and from other satellites useful in geodetic studies was conducted. The program of work included theoretical studies and analysis for the geometric determination of station positions derived from photographic observations of both passive and active satellites and from range observations. The current status of data analysis, processing and results are examined

Efficiency Analysis of Swarm Intelligence and Randomization Techniques

Swarm intelligence has becoming a powerful technique in solving design and scheduling tasks. Metaheuristic algorithms are an integrated part of this paradigm, and particle swarm optimization is often viewed as an important landmark. The outstanding performance and efficiency of swarm-based algorithms inspired many new developments, though mathematical understanding of metaheuristics remains partly a mystery. In contrast to the classic deterministic algorithms, metaheuristics such as PSO always use some form of randomness, and such randomization now employs various techniques. This paper intends to review and analyze some of the convergence and efficiency associated with metaheuristics such as firefly algorithm, random walks, and L\'evy flights. We will discuss how these techniques are used and their implications for further research.Comment: 10 pages. arXiv admin note: substantial text overlap with arXiv:1212.0220, arXiv:1208.0527, arXiv:1003.146