Terrain surveying using unmanned aerial vehicles (UAV) is being applied to many areas such as precision agriculture or battlefield surveillance. A core problem of the surveying task is the coverage path planning problem (CPP); it is defined as the task of determining a path for an unmanned aerial vehicle so that it observes all points of a target area. State-of-the-art planners solve the problem for a unique region. However, in some operations, for example search and rescue, it is important to plan a path that covers more than a single area. We propose a method for solving the CPP for disjoint areas. The general problem is modeled as a rural postman problem which has been demonstrated to be NP-Hard. Our solution relies on dividing the problem into two steps: optimization of the visiting order and optimization of the flight lines orientation. The method is validated through several simulations using real parameters. In addition, it is fast enough for being implemented onboard.
1 December 2012 in IEEE Latin America Transactions
Robotics is a fast developing and exciting field with multiple applications which span from robot manipulators to mobile robots. This paper presents a literature review on wheeled mobile robots. We point out the main considerations to be taken into account when designing this class of robots. The main control problems are recalled as well as the corresponding solutions. Finally, we summarize the most important approaches used to render mobile robots autonomous.
1 December 2009 in Journal of Applied Research and Technology
The Particle Swarm Optimization (PSO) algorithm is a well known alternative for global optimization based on a bio‐inspired heuristic. PSO has good performance, low computational complexity and few parameters. Heuristic techniques have been widely studied in the last twenty years and the scientific community is still interested in technological alternatives that accelerate these algorithms in order to apply them to bigger and more complex problems. This article presents an empirical study of some parallel variants for a PSO algorithm, implemented on a Graphic Process Unit (GPU) device with multi‐thread support and using the most recent model of parallel programming for these cases. The main idea is to show that, with the help of a multithreading GPU, it is possible to significantly improve the PSO algorithm performance by means of a simple and almost straightforward parallel programming, getting the computing power of cluster in a conventional personal computer.
Reduced population algorithms have proven to be efficient for solving optimization problems in the past. In this paper, we incorporate a local search procedure into a micro differential evolution algorithm (DE) with the aim of tackling high dimensional problems. Our main purpose is to find out if our proposal is more competitive in these problems than a canonical differential evolution algorithm. In relation to the state of the art techniques, the results our micro-DELS are comparable (or better) with the reference algorithms DECC-G and MLCC. This empirical analysis supports our conjecture that a reduced population DE hybridized with local search (our microDELS) is a key combination in dealing with functions having high dimensionality at a low computational cost.
In this paper, we incorporate a local search procedure into a micro differential evolution algorithm MED with the aim of solving the HappyCat function. Our purpose is to find out if our proposal is more competitive than a Ray-ES algorithm. We test our micro Differential Evolution algorithm (µDE) on HappyCat and HGBat functions. The results that we obtained with micro-DE are better compared with the results the original RayES reference algorithm. This analysis supports our conjecture that a reduced population DE hybridized with a local search (Ray search) is a key combination in dealing with this function. Our results support the hypothesis that a well-focused micro population is more accurate and efficient than existing techniques, representing (that of micro-algorithms) a serious competitor because of its efficiency and accuracy. In fact, the proposed (but never solved) HGBat function can be dealt with, showing the scalability and potential future uses of our technique.
A new bio-inspired meta-heuristic, called the micro artificial immune system (MAIS), has been developed in order to reduce the rates of pollution for a specific region of Mexico City through the optimization of vehicular flow. Simulation of urban mobility (SUMO) was used to simulate the effects of the programming of the traffic lights obtained by the MAIS. Currently, pollution and travel times from one place to another are increasing due to the number of inhabitants that live in big cities, which has generated a decrease in people’s quality of life. Hence, we propose the optimization of the programming of the sequences of traffic lights through this bio-inspired meta-heuristic. The obtained results show that the MAIS outperforms most of the algorithms tested in this research.