86 research outputs found

    Advances in Spacecraft Attitude Control

    Get PDF
    Spacecraft attitude maneuvers comply with Euler's moment equations, a set of three nonlinear, coupled differential equations. Nonlinearities complicate the mathematical treatment of the seemingly simple action of rotating, and these complications lead to a robust lineage of research. This book is meant for basic scientifically inclined readers, and commences with a chapter on the basics of spaceflight and leverages this remediation to reveal very advanced topics to new spaceflight enthusiasts. The topics learned from reading this text will prepare students and faculties to investigate interesting spaceflight problems in an era where cube satellites have made such investigations attainable by even small universities. It is the fondest hope of the editor and authors that readers enjoy this book

    Advances in Spacecraft Attitude Control

    Get PDF
    Spacecraft attitude maneuvers comply with Euler's moment equations, a set of three nonlinear, coupled differential equations. Nonlinearities complicate the mathematical treatment of the seemingly simple action of rotating, and these complications lead to a robust lineage of research. This book is meant for basic scientifically inclined readers, and commences with a chapter on the basics of spaceflight and leverages this remediation to reveal very advanced topics to new spaceflight enthusiasts. The topics learned from reading this text will prepare students and faculties to investigate interesting spaceflight problems in an era where cube satellites have made such investigations attainable by even small universities. It is the fondest hope of the editor and authors that readers enjoy this book

    Scalable Control Strategies and a Customizable Swarm Robotic Platform for Boundary Coverage and Collective Transport Tasks

    Get PDF
    abstract: Swarms of low-cost, autonomous robots can potentially be used to collectively perform tasks over large domains and long time scales. The design of decentralized, scalable swarm control strategies will enable the development of robotic systems that can execute such tasks with a high degree of parallelism and redundancy, enabling effective operation even in the presence of unknown environmental factors and individual robot failures. Social insect colonies provide a rich source of inspiration for these types of control approaches, since they can perform complex collective tasks under a range of conditions. To validate swarm robotic control strategies, experimental testbeds with large numbers of robots are required; however, existing low-cost robots are specialized and can lack the necessary sensing, navigation, control, and manipulation capabilities. To address these challenges, this thesis presents a formal approach to designing biologically-inspired swarm control strategies for spatially-confined coverage and payload transport tasks, as well as a novel low-cost, customizable robotic platform for testing swarm control approaches. Stochastic control strategies are developed that provably allocate a swarm of robots around the boundaries of multiple regions of interest or payloads to be transported. These strategies account for spatially-dependent effects on the robots' physical distribution and are largely robust to environmental variations. In addition, a control approach based on reinforcement learning is presented for collective payload towing that accommodates robots with heterogeneous maximum speeds. For both types of collective transport tasks, rigorous approaches are developed to identify and translate observed group retrieval behaviors in Novomessor cockerelli ants to swarm robotic control strategies. These strategies can replicate features of ant transport and inherit its properties of robustness to different environments and to varying team compositions. The approaches incorporate dynamical models of the swarm that are amenable to analysis and control techniques, and therefore provide theoretical guarantees on the system's performance. Implementation of these strategies on robotic swarms offers a way for biologists to test hypotheses about the individual-level mechanisms that drive collective behaviors. Finally, this thesis describes Pheeno, a new swarm robotic platform with a three degree-of-freedom manipulator arm, and describes its use in validating a variety of swarm control strategies.Dissertation/ThesisDoctoral Dissertation Mechanical Engineering 201

    Using MapReduce Streaming for Distributed Life Simulation on the Cloud

    Get PDF
    Distributed software simulations are indispensable in the study of large-scale life models but often require the use of technically complex lower-level distributed computing frameworks, such as MPI. We propose to overcome the complexity challenge by applying the emerging MapReduce (MR) model to distributed life simulations and by running such simulations on the cloud. Technically, we design optimized MR streaming algorithms for discrete and continuous versions of Conway’s life according to a general MR streaming pattern. We chose life because it is simple enough as a testbed for MR’s applicability to a-life simulations and general enough to make our results applicable to various lattice-based a-life models. We implement and empirically evaluate our algorithms’ performance on Amazon’s Elastic MR cloud. Our experiments demonstrate that a single MR optimization technique called strip partitioning can reduce the execution time of continuous life simulations by 64%. To the best of our knowledge, we are the first to propose and evaluate MR streaming algorithms for lattice-based simulations. Our algorithms can serve as prototypes in the development of novel MR simulation algorithms for large-scale lattice-based a-life models.https://digitalcommons.chapman.edu/scs_books/1014/thumbnail.jp

    Robotic Manipulation and Capture in Space: A Survey

    Get PDF
    Space exploration and exploitation depend on the development of on-orbit robotic capabilities for tasks such as servicing of satellites, removing of orbital debris, or construction and maintenance of orbital assets. Manipulation and capture of objects on-orbit are key enablers for these capabilities. This survey addresses fundamental aspects of manipulation and capture, such as the dynamics of space manipulator systems (SMS), i.e., satellites equipped with manipulators, the contact dynamics between manipulator grippers/payloads and targets, and the methods for identifying properties of SMSs and their targets. Also, it presents recent work of sensing pose and system states, of motion planning for capturing a target, and of feedback control methods for SMS during motion or interaction tasks. Finally, the paper reviews major ground testing testbeds for capture operations, and several notable missions and technologies developed for capture of targets on-orbit

    Efficient meta-heuristics for spacecraft trajectory optimization

    Get PDF
    Meta-heuristics has a long tradition in computer science. During the past few years, different types of meta-heuristics, specially evolutionary algorithms got noticeable attention in dealing with real-world optimization problems. Recent advances in this field along with rapid development of high processing computers, make it possible to tackle various engineering optimization problems with relative ease, omitting the barrier of unknown global optimal solutions due to the complexity of the problems. Following this rapid advancements, scientific communities shifted their attention towards the development of novel algorithms and techniques to satisfy their need in optimization. Among different research areas, astrodynamics and space engineering witnessed many trends in evolutionary algorithms for various types of problems. By having a look at the amount of publications regarding the development of meta-heuristics in aerospace sciences, it can be seen that a high amount of efforts are dedicated to develop novel stochastic techniques and more specifically, innovative evolutionary algorithms on a variety of subjects. In the past decade, one of the challenging problems in space engineering, which is tackled mainly by novel evolutionary algorithms by the researchers in the aerospace community is spacecraft trajectory optimization. Spacecraft trajectory optimization problem can be simply described as the discovery of a space trajectory for satellites and space vehicles that satisfies some criteria. While a space vehicle travels in space to reach a destination, either around the Earth or any other celestial body, it is crucial to maintain or change its flight path precisely to reach the desired final destination. Such travels between space orbits, called orbital maneuvers, need to be accomplished, while minimizing some objectives such as fuel consumption or the transfer time. In the engineering point of view, spacecraft trajectory optimization can be described as a black-box optimization problem, which can be constrained or unconstrained, depending on the formulation of the problem. In order to clarify the main motivation of the research in this thesis, first, it is necessary to discuss the status of the current trends in the development of evolutionary algorithms and tackling spacecraft trajectory optimization problems. Over the past decade, numerous research are dedicated to these subjects, mainly from two groups of scientific communities. The first group is the space engineering community. Having an overall look into the publications confirms that the focus in the developed methods in this group is mainly regarding the mathematical modeling and numerical approaches in dealing with spacecraft trajectory optimization problems. The majority of the strategies interact with mixed concepts of semi-analytical methods, discretization, interpolation and approximation techniques. When it comes to optimization, usually traditional algorithms are utilized and less attention is paid to the algorithm development. In some cases, researchers tried to tune the algorithms and make them more efficient. However, their efforts are mainly based on try-and-error and repetitions rather than analyzing the landscape of the optimization problem. The second group is the computer science community. Unlike the first group, the majority of the efforts in the research from this group has been dedicated to algorithm development, rather than developing novel techniques and approaches in trajectory optimization such as interpolation and approximation techniques. Research in this group generally ends in very efficient and robust optimization algorithms with high performance. However, they failed to put their algorithms in challenge with complex real-world optimization problems, with novel ideas as their model and approach. Instead, usually the standard optimization benchmark problems are selected to verify the algorithm performance. In particular, when it comes to solve a spacecraft trajectory optimization problem, this group mainly treats the problem as a black-box with not much concentration on the mathematical model or the approximation techniques. Taking into account the two aforementioned research perspectives, it can be seen that there is a missing link between these two schemes in dealing with spacecraft trajectory optimization problems. On one hand, we can see noticeable advances in mathematical models and approximation techniques on this subject, but with no efforts on the optimization algorithms. On the other hand, we have newly developed evolutionary algorithms for black-box optimization problems, which do not take advantage of novel approaches to increase the efficiency of the optimization process. In other words, there seems to be a missing connection between the characteristics of the problem in spacecraft trajectory optimization, which controls the shape of the solution domain, and the algorithm components, which controls the efficiency of the optimization process. This missing connection motivated us in developing efficient meta-heuristics for solving spacecraft trajectory optimization problems. By having the knowledge about the type of space mission, the features of the orbital maneuver, the mathematical modeling of the system dynamics, and the features of the employed approximation techniques, it is possible to adapt the performance of the algorithms. Knowing these features of the spacecraft trajectory optimization problem, the shape of the solution domain can be realized. In other words, it is possible to see how sensitive the problem is relative to each of its feature. This information can be used to develop efficient optimization algorithms with adaptive mechanisms, which take advantage of the features of the problem to conduct the optimization process toward better solutions. Such flexible adaptiveness, makes the algorithm robust to any changes of the space mission features. Therefore, within the perspective of space system design, the developed algorithms will be useful tools for obtaining optimal or near-optimal transfer trajectories within the conceptual and preliminary design of a spacecraft for a space mission. Having this motivation, the main goal in this research was the development of efficient meta-heuristics for spacecraft trajectory optimization. Regarding the type of the problem, we focused on space rendezvous problems, which covers the majority of orbital maneuvers, including long-range and short-range space rendezvous. Also, regarding the meta-heuristics, we concentrated mainly on evolutionary algorithms based on probabilistic modeling and hybridization. Following the research, two algorithms have been developed. First, a hybrid self adaptive evolutionary algorithm has been developed for multi-impulse long-range space rendezvous problems. The algorithm is a hybrid method, combined with auto-tuning techniques and an individual refinement procedure based on probabilistic distribution. Then, for the short-range space rendezvous trajectory optimization problems, an estimation of distribution algorithm with feasibility conserving mechanisms for constrained continuous optimization is developed. The proposed mechanisms implement seeding, learning and mapping methods within the optimization process. They include mixtures of probabilistic models, outlier detection algorithms and some heuristic techniques within the mapping process. Parallel to the development of algorithms, a simulation software is also developed as a complementary application. This tool is designed for visualization of the obtained results from the experiments in this research. It has been used mainly to obtain high-quality illustrations while simulating the trajectory of the spacecraft within the orbital maneuvers.La Caixa TIN2016-78365R PID2019-1064536A-I00 Basque Government consolidated groups 2019-2021 IT1244-1

    Efficient meta-heuristics for spacecraft trajectory optimization

    Get PDF
    190 p.Uno de los problemas más difíciles de la ingeniería espacial es la optimización de la trayectoria de las naves espaciales. Dicha optimización puede formularse como un problema de optimización que dependiendo del tipo de trayectoria, puede contener además restricciones de diversa índole. El principal objetivo de esta tesis fue el desarrollo de algoritmos metaheurísticos eficientes para la optimización de la trayectoria de las naves espaciales. Concretamente, nos hemos centrado en plantear soluciones a maniobras de naves espaciales que contemplan cambios de orbitas de largo y coto alcance. En lo que respecta a la investigación llevada a cabo, inicialmente se ha realizado una revisión de estado del arte sobre optimización de cambios de orbitas de naves espaciales. Según el estudio realizado, la optimización de trayectorias para el cambio de orbitas cuenta con cuatro claves, que incluyen la modelización matemática del problema, la definición de las funciones objetivo, el diseño del enfoque a utilizar y la obtención de la solución del problema. Una vez realizada la revisión del estado del arte, se han desarrollado dos algoritmos metaheurísticos. En primer lugar, se ha desarrollado un algoritmo evolutivo híbrido auto-adaptativo para problemas de cambio de orbitas de largo alcance y multi-impulso. El algoritmo es un método híbrido, combinado con técnicas de autoajuste y un procedimiento derefinamiento individual basado en el uso de distribuciones de probabilidad. Posteriormente, en lo que respecta a los problemas de optimización de trayectoria de los encuentros espaciales de corto alcance, se desarrolla un algoritmo de estimación de distribuciones con mecanismos de conservación de viabilidad. Los mecanismos propuestos aplican métodos innovadores de inicialización, aprendizaje y mapeo dentro del proceso de optimización. Incluyen mixturas de modelos probabilísticos, algoritmos de detección de soluciones atípicas y algunas técnicas heurísticas dentro del proceso de mapeo. Paralelamente al desarrollo de los algoritmos, se ha desarrollado un software de simulación para la visualización de los resultados obtenidos en el cambio de orbitas de las naves espaciales

    Optimization of Robot Motion Planning using Ant Colony Optimization

    Get PDF
    Motion planning in robotics is a process to compute a collision free path between the initial and final configuration among obstacles. To plan a collision free path in the workspace, it would need to plan the motion of every point of its shaping according its degree of freedom. The motion of robot between obstacles is represented by a path in configuration space. It is an imaginary concept. Motion planning is aimed at enabling robots with capabilities of automatically deciding and executing a sequence motion in order to achieve a task without ollision with other objects in a given environment. Motion planning in a robot workspace for robotic assembly depends on sequence of parts or the order they are arranged to produce a robotic assembly product obeying all the constraints and instability of base assembly movement. If the number of parts increases the sequencing becomes difficult and hence the path planning. As multiple no. of paths are possible, the path is considered to be optimal when it minimizes the travelling time while satisfying the process constraint. For this purpose, it is necessary to select appropriate optimization technique for optimization of paths. Such types of problem can be solved by metaheuristic methods.The present work utilizes ACO for the generation of optimal motion planning sequence. The present algorithm is based on ant's behavior, pheromone update & pheromone evaporation and is used to enhance the local search. This procedure is applied to a grinder assembly, driver assembly and car alternator assembly. Two robots like adept-one and puma-762 are selected for picking and placing operation of parts in their workspace

    Reconfiguring Colloidal Solids with Defects Using Active Matter

    Full text link
    Engineering defect configurations within atomic crystalline materials, particularly metals, is a cornerstone of material science. Crystalline defects affect every facet of a material's properties, and in this regard, crystals composed of colloidal particles are no different from their atomic analogues. What is different, at the colloidal scale, is that new techniques have been developed to allow for the application of local forces by independently operating um-scale particles. The capacity of such active matter to manipulate, produce, and remove colloidal defects is only just starting to be explored. This dissertation seeks to establish the feasibility of directly controlling crystalline defects through the action of a particle species that exerts work locally, via computer simulation. The goals of such microstructure manipulation are to create materials with dynamic properties that change in response to external stimuli. Dynamic modification of crystallite shape, optical properties, or mechanical properties such as resistance to deformation are examples of what can be achieved through the action of active particles strongly coupled to colloidal defects. This dissertation is built around four studies of the behavior of defects in colloidal materials. First, I examine the nature of dislocations in crystals composed of particles interacting through repulsive pair potentials. By comparing attractive potentials to a family of repulsive ones with differing slopes, I explore the changes to mechanical properties and dislocation structure that occur as entropy comes to dominate the deformation free energy of a material. By varying the confining pressure, I find that attractive and repulsive systems can be matched in material properties and defect strain fields. Second, I study the interactions between colloidal dislocations and anisotropic interstitial particles that are capable of exerting local forces. By representing this interstitial by the strain field it produces when embedded in the crystal, I formulate a method of optimizing the interaction of the dislocation and interstitial by allowing the strain field to fluctuate. The optimization can be carried out very quickly compared to schemes requiring molecular dynamics simulation to assess a trial geometry's fitness. By molecular dynamics simulation of optimized particles with dislocations I show that such defects can be induced to glide by the action of bound active interstitials. Third, I explore the interaction of active rod-like interstitial particles with stacking faults in face-centered cubic colloidal crystals of repulsive spheres. I find that certain geometries of active interstitials are capable of efficiently searching through a crystal and binding strongly to a stacking fault. They rapidly encounter the stacking faults that link partial dislocations in the FCC crystal, and when absorbed provide an additional barrier to dislocation glide. The presence of such optimized active, stacking-fault seeking interstitials can be detected in the shear deformation properties of dislocated crystals even at concentrations as small as 64 per million host particles. Fourth, I explore how a crystalline colloidal robot could be reconfigured using shear displacements resulting from the biased migration of dislocations. I propose a means of creating and controlling the migration of dislocations in 2D colloidal crystals based on embedded clusters of particles capable of changing size. I show that for clusters of particular geometries, cyclic expansion and contraction of their constituent particles produce dislocations that accumulate slip. Single or multiple slip planes can be used to reshape the boundaries of a 2D colloidal crystallite.PHDMaterials Science and EngineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttps://deepblue.lib.umich.edu/bitstream/2027.42/153451/1/bvansade_1.pd
    corecore