Information-Theoretic Motion Planning for Constrained Sensor Networks

This paper considers the problem of online informative motion planning for a network of heterogeneous sensing agents, each subject to dynamic constraints, environmental constraints, and sensor limitations. Prior work has not yielded algorithms that are amenable to such general constraint characterizations. In this paper, we propose the Information-rich Rapidly-exploring Random Tree (IRRT) algorithm as a solution to the constrained informative motion planning problem that embeds metrics on uncertainty reduction at both the tree growth and path selection levels. IRRT possesses a number of beneficial properties, chief among them being the ability to find dynamically feasible, informative paths on short timescales, even subject to the aforementioned constraints. The utility of IRRT in efficiently localizing stationary targets is demonstrated in a progression of simulation results with both single-agent and multiagent networks. These results show that IRRT can be used in real-time to generate and execute information-rich paths in tightly constrained environments.AFOSR and USAF under grant (FA9550-08-1-0086

A Comprehensive Survey on Particle Swarm Optimization Algorithm and Its Applications

Particle swarm optimization (PSO) is a heuristic global optimization method, proposed originally by Kennedy and Eberhart in 1995. It is now one of the most commonly used optimization techniques. This survey presented a comprehensive investigation of PSO. On one hand, we provided advances with PSO, including its modifications (including quantum-behaved PSO, bare-bones PSO, chaotic PSO, and fuzzy PSO), population topology (as fully connected, von Neumann, ring, star, random, etc.), hybridization (with genetic algorithm, simulated annealing, Tabu search, artificial immune system, ant colony algorithm, artificial bee colony, differential evolution, harmonic search, and biogeography-based optimization), extensions (to multiobjective, constrained, discrete, and binary optimization), theoretical analysis (parameter selection and tuning, and convergence analysis), and parallel implementation (in multicore, multiprocessor, GPU, and cloud computing forms). On the other hand, we offered a survey on applications of PSO to the following eight fields: electrical and electronic engineering, automation control systems, communication theory, operations research, mechanical engineering, fuel and energy, medicine, chemistry, and biology. It is hoped that this survey would be beneficial for the researchers studying PSO algorithms

Optimisation of the VARTM process

This study focuses on the development of a multi-objective optimisation methodology for the vacuum assisted resin transfer moulding composite processing route. Simulations of the cure and filling stages of the process have been implemented and the corresponding heat transfer and flow through porous media problems solved by means of finite element analysis. The simulations involved material sub-models to describe thermal properties, cure kinetics and viscosity evolution. A Genetic algorithm which constitutes the foundation for the development of the optimisation has been adapted, implemented and tested in terms of its effectiveness using four benchmark problems. Two methodologies suitable for multi-objective optimisation of the cure and filling stages have been specified and successfully implemented. In the case of the curing stage the optimisation aims at finding a cure profile minimising both process time and temperature overshoot within the part. In the case of the filling stage the thermal profile during filling, gate locations and initial resin temperature are optimised to minimise filling time and final degree of cure at the end of the filling stage. Investigations of the design landscape for both curing and filling stage have indicated the complex nature of the problems under investigation justifying the choice for using a Genetic algorithm. Application of the two methodologies showed that they are highly efficient in identifying appropriate process designs and significant improvements compared to standard conditions are feasible. In the cure process an overshoot temperature reduction up to 75% in the case of thick component can be achieved whilst for a thin part a 60% reduction in process time can be accomplished. In the filling process a 42% filling time reduction and 14% reduction of degree of cure at the end of the filling can be achieved using the optimisation methodology. Stability analysis of the set of solutions for the curing stage has shown that different degrees of robustness are present among the individuals in the Pareto front. The optimisation methodology has also been integrated with an existing cost model that allowed consideration of process cost in the optimisation of the cure stage. The optimisation resulted in process designs that involve 500 € reduction in process cost. An inverse scheme has been developed based on the optimisation methodology aiming at combining simulation and monitoring of the filling stage for the identification of on-line permeability during an infusion. The methodology was tested using artificial data and it was demonstrated that the methodology is able to handle levels of noise from the measurements up to 5 s per sensor without affecting the quality of the outcome

Spacecraft/Rover Hybrids for the Exploration of Small Solar System Bodies

This study investigated a mission architecture that allows the systematic and affordable in-situ exploration of small solar system bodies, such as asteroids, comets, and Martian moons (Figure 1). The architecture relies on the novel concept of spacecraft/rover hybrids,which are surface mobility platforms capable of achieving large surface coverage (by attitude controlled hops, akin to spacecraft flight), fine mobility (by tumbling), and coarse instrument pointing (by changing orientation relative to the ground) in the low-gravity environments(micro-g to milli-g) of small bodies. The actuation of the hybrids relies on spinning three internal flywheels. Using a combination of torques, the three flywheel motors can produce a reaction torque in any orientation without additional moving parts. This mobility concept allows all subsystems to be packaged in one sealed enclosure and enables the platforms to be minimalistic. The hybrids would be deployed from a mother spacecraft, which would act as a communication relay to Earth and would aid the in-situ assets with tasks such as localization and navigation (Figure 1). The hybrids are expected to be more capable and affordable than wheeled or legged rovers, due to their multiple modes of mobility (both hopping and tumbling), and have simpler environmental sealing and thermal management (since all components are sealed in one enclosure, assuming non-deployable science instruments). In summary, this NIAC Phase II study has significantly increased the TRL (Technology Readiness Level) of the mobility and autonomy subsystems of spacecraft/rover hybrids, and characterized system engineering aspects in the context of a reference mission to Phobos. Future studies should focus on improving the robustness of the autonomy module and further refine system engineering aspects, in view of opportunities for technology infusion

Manipulating Objects using Compliant, Unactuated Tails: Modeling and Planning

Ropes and rope-like objects (e.g., chains, cords, lines, whips, or lassos) are comparatively cheap, simple, and useful in daily life. For a long time, humans have used such structures for manipulation tasks in a qualitatively different ways such as pulling, fastening, attaching, tying, knotting, and whipping. Nevertheless, these structures have received little attention in robotics. Because they are unactuated, such structures are regarded as difficult to model, plan and control. In this dissertation, we are interested in a mobile robot system using a flexible rope-like structure attached to its end akin to a ‘tail’. Our goal is to investigate how mobile robots can use compliant, unactuated structures for various manipulation tasks. Robots that use a tail to manipulate objects face challenges in modeling and planning of behaviors, dynamics, and combinatorial optimization. In this dissertation, we propose several methods to deal with the difficulties of modeling and planning. In addition, we solve variants of object manipulation problems wherein multiple classes of objects are to be transported by multiple cooperative robots using ropes. Firstly, we examine motion primitives, where the primitives are designed to simplify modeling and planning issues. We explore several sets of motion primitive where each primitive contributes some aspect lacking in the others. These primitives are forward models of the system’s behavior that predict the position and orientation of the object being manipulated within the workspace. Then, to solve manipulation problems, we design a planner that seeks a sequence of motion primitives by using a sampling-based motion planning approach coupled with a particle-based representation to treat error propagation of the motions. Our proposed planner is used to optimize motion sequences based on a specified preference over a set of objectives, such as execution time, navigation cost, or collision likelihood. The solutions deal with different preferences effectively, and we analyze the complementary nature of dynamic and quasi-static motions, showing that there exist regimes where transitions among them are indeed desirable, as reflected in the plans produced. Secondly, we explore a variety of interesting primitives that result in new approaches for object manipulation problems. We examine ways two robots can join the ends of their tails so that a pair of conjoined robots can encircle objects leading to the advantage of greater towing capacity if they work cooperatively. However, individual robots possess the advantage of allowing for greater concurrency if objects are distant from one another. We solve a new manipulation problem for the scenarios of moving a collection of objects to goal locations with multiple robots that may form conjoined pairs. To maximize efficiency, the robots balance working as a tightly-knit sub-team with individual operation. We develop heuristics that give satisfactory solutions in reasonable time. The results we report include data from physical robots executing plans produced by our planner, collecting objects both by individual action and by a coupled pair operation. We expect that our research results will help to understand how a flexible compliant appendage when added to a robot can be useful for more than just agility. The proposed techniques using simple motion models for characterizing the complicated system dynamics can be used to robotics research: motion planning, minimalist manipulators, behavior-based control, and multi-robot coordination. In addition, we expect that the proposed methods can enhance the performance of various manipulation tasks, efficient search, adaptive sampling or coverage in unknown, unstructured environments

Information-rich path planning under general constraints using Rapidly-exploring Random Trees

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2010.Cataloged from PDF version of thesis.Includes bibliographical references (p. 99-104).This thesis introduces the Information-rich Rapidly-exploring Random Tree (IRRT), an extension of the RRT algorithm that embeds information collection as predicted using Fisher information matrices. The primary contribution of this trajectory generation algorithm is target-based information maximization in general (possibly heavily constrained) environments, with complex vehicle dynamic constraints and sensor limitations, including limited resolution and narrow field-of-view. Extensions of IRRT both for decentralized, multiagent missions and for information-rich planning with multimodal distributions are presented. IRRT is distinguished from previous solution strategies by its computational tractability and general constraint characterization. A progression of simulation results demonstrates that this implementation can generate complex target-tracking behaviors from a simple model of the trade-off between information gathering and goal arrival.by Daniel S. Levine.S.M

Control, estimation, and planning algorithms for aggressive flight using onboard sensing

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2012.Cataloged from PDF version of thesis.Includes bibliographical references (p. 107-111).This thesis is motivated by the problem of fixed-wing flight through obstacles using only on-board sensing. To that end, we propose novel algorithms in trajectory generation for fixed-wing vehicles, state estimation in unstructured 3D environments, and planning under uncertainty. Aggressive flight through obstacles using on-board sensing involves nontrivial dynamics, spatially varying measurement properties, and obstacle constraints. To make the planning problem tractable, we restrict the motion plan to a nominal trajectory stabilized with an approximately linear estimator and controller. This restriction allows us to predict distributions over future states given a candidate nominal trajectory. Using these distributions to ensure a bounded probability of collision, the algorithm incrementally constructs a graph of trajectories through state space, while efficiently searching over candidate paths through the graph at each iteration. This process results in a search tree in belief space that provably converges to the optimal path. We analyze the algorithm theoretically and also provide simulation results demonstrating its utility for balancing information gathering to reduce uncertainty and finding low cost paths. Our state estimation method is driven by an inertial measurement unit (IMU) and a planar laser range finder and is suitable for use in real-time on a fixed-wing micro air vehicle (MAV). The algorithm is capable of maintaining accurate state estimates during aggressive flight in unstructured 3D environments without the use of an external positioning system. The localization algorithm is based on an extension of the Gaussian Particle Filter. We partition the state according to measurement independence relationships and then calculate a pseudo-linear update which allows us to use 25x fewer particles than a naive implementation to achieve similar accuracy in the state estimate. Using a multi-step forward fitting method we are able to identify the noise parameters of the IMU leading to high quality predictions of the uncertainty associated with the process model. Our process and measurement models integrate naturally with an exponential coordinates representation of the attitude uncertainty. We demonstrate our algorithms experimentally on a fixed-wing vehicle flying in a challenging indoor environment. The algorithm for generating the trajectories used in the planning process computes a transverse polynomial offset from a nominal Dubins path. The polynomial offset allows us to explicitly specify transverse derivatives in terms of linear equality constraints on the coefficients of the polynomial, and minimize transverse derivatives by using a Quadratic Program (QP) on the polynomial coefficients. This results in a computationally cheap method for generating paths with continuous heading, roll angle, and roll rate for the fixed-wing vehicle, which is fast enough to run in the inner loop of the RRBT.by Adam Parker Bry.S.M

Development of a multi-objective optimization algorithm based on lichtenberg figures

This doctoral dissertation presents the most important concepts of multi-objective optimization and a systematic review of the most cited articles in the last years of this subject in mechanical engineering. The State of the Art shows a trend towards the use of metaheuristics and the use of a posteriori decision-making techniques to solve engineering problems. This fact increases the demand for algorithms, which compete to deliver the most accurate answers at the lowest possible computational cost. In this context, a new hybrid multi-objective metaheuristic inspired by lightning and Linchtenberg Figures is proposed. The Multi-objective Lichtenberg Algorithm (MOLA) is tested using complex test functions and explicit contrainted engineering problems and compared with other metaheuristics. MOLA outperformed the most used algorithms in the literature: NSGA-II, MOPSO, MOEA/D, MOGWO, and MOGOA. After initial validation, it was applied to two complex and impossible to be analytically evaluated problems. The first was a design case: the multi-objective optimization of CFRP isogrid tubes using the finite element method. The optimizations were made considering two methodologies: i) using a metamodel, and ii) the finite element updating. The last proved to be the best methodology, finding solutions that reduced at least 45.69% of the mass, 18.4% of the instability coefficient, 61.76% of the Tsai-Wu failure index and increased by at least 52.57% the natural frequency. In the second application, MOLA was internally modified and associated with feature selection techniques to become the Multi-objective Sensor Selection and Placement Optimization based on the Lichtenberg Algorithm (MOSSPOLA), an unprecedented Sensor Placement Optimization (SPO) algorithm that maximizes the acquired modal response and minimizes the number of sensors for any structure. Although this is a structural health monitoring principle, it has never been done before. MOSSPOLA was applied to a real helicopter’s main rotor blade using the 7 best-known metrics in SPO. Pareto fronts and sensor configurations were unprecedentedly generated and compared. Better sensor distributions were associated with higher hypervolume and the algorithm found a sensor configuration for each sensor number and metric, including one with 100% accuracy in identifying delamination considering triaxial modal displacements, minimum number of sensors, and noise for all blade sections.Esta tese de doutorado traz os conceitos mais importantes de otimização multi-objetivo e uma revisão sistemática dos artigos mais citados nos últimos anos deste tema em engenharia mecânica. O estado da arte mostra uma tendência no uso de meta-heurísticas e de técnicas de tomada de decisão a posteriori para resolver problemas de engenharia. Este fato aumenta a demanda sobre os algoritmos, que competem para entregar respostas mais precisas com o menor custo computacional possível. Nesse contexto, é proposta uma nova meta-heurística híbrida multi-objetivo inspirada em raios e Figuras de Lichtenberg. O Algoritmo de Lichtenberg Multi-objetivo (MOLA) é testado e comparado com outras metaheurísticas usando funções de teste complexas e problemas restritos e explícitos de engenharia. Ele superou os algoritmos mais utilizados na literatura: NSGA-II, MOPSO, MOEA/D, MOGWO e MOGOA. Após validação, foi aplicado em dois problemas complexos e impossíveis de serem analiticamente otimizados. O primeiro foi um caso de projeto: otimização multi-objetivo de tubos isogrid CFRP usando o método dos elementos finitos. As otimizações foram feitas considerando duas metodologias: i) usando um meta-modelo, e ii) atualização por elementos finitos. A última provou ser a melhor metodologia, encontrando soluções que reduziram pelo menos 45,69% da massa, 18,4% do coeficiente de instabilidade, 61,76% do TW e aumentaram em pelo menos 52,57% a frequência natural. Na segunda aplicação, MOLA foi modificado internamente e associado a técnicas de feature selection para se tornar o Seleção e Alocação ótima de Sensores Multi-objetivo baseado no Algoritmo de Lichtenberg (MOSSPOLA), um algoritmo inédito de Otimização de Posicionamento de Sensores (SPO) que maximiza a resposta modal adquirida e minimiza o número de sensores para qualquer estrutura. Embora isto seja um princípio de Monitoramento da Saúde Estrutural, nunca foi feito antes. O MOSSPOLA foi aplicado na pá do rotor principal de um helicóptero real usando as 7 métricas mais conhecidas em SPO. Frentes de Pareto e configurações de sensores foram ineditamente geradas e comparadas. Melhores distribuições de sensores foram associadas a um alto hipervolume e o algoritmo encontrou uma configuração de sensor para cada número de sensores e métrica, incluindo uma com 100% de precisão na identificação de delaminação considerando deslocamentos modais triaxiais, número mínimo de sensores e ruído para todas as seções da lâmina

Particle Swarm Optimization

Particle swarm optimization (PSO) is a population based stochastic optimization technique influenced by the social behavior of bird flocking or fish schooling.PSO shares many similarities with evolutionary computation techniques such as Genetic Algorithms (GA). The system is initialized with a population of random solutions and searches for optima by updating generations. However, unlike GA, PSO has no evolution operators such as crossover and mutation. In PSO, the potential solutions, called particles, fly through the problem space by following the current optimum particles. This book represents the contributions of the top researchers in this field and will serve as a valuable tool for professionals in this interdisciplinary field