Navigation is an invisible utility that is often taken for granted with considerable societal and economic impacts. Not only is navigation essential to our modern life, but the more it advances, the more possibilities are created. Navigation is at the heart of three emerging fields: autonomous vehicles, location-based services, and intelligent transportation systems. Global navigation satellite systems (GNSS) are insufficient for reliable anytime, anywhere navigation, particularly indoors, in deep urban canyons, and in environments under malicious attacks (e.g., jamming and spoofing). The conventional approach to overcome the limitations of GNSS-based navigation is to couple GNSS receivers with dead reckoning sensors. A new paradigm, termed opportunistic navigation (OpNav), is emerging. OpNav is analogous to how living creatures naturally navigate: by learning their environment. OpNav aims to exploit the plenitude of ambient radio frequency signals of opportunity (SOPs) in the environment. OpNav radio receivers, which may be handheld or vehicle-mounted, continuously search for opportune signals from which to draw position and timing information, employing on-the-fly signal characterization as necessary. In collaborative opportunistic navigation (COpNav), multiple receivers share information to construct and continuously refine a global signal landscape. For the sake of motivation, consider the following problem. A number of receivers with no a priori knowledge about their own states are dropped in an environment comprising multiple unknown terrestrial SOPs. The receivers draw pseudorange observations from the SOPs. The receivers' objective is to build a high-fidelity signal landscape map of the environment within which they localize themselves in space and time. We then ask: (i) Under what conditions is the environment fully observable? (ii) In cases where the environment is not fully observable, what are the observable states? (iii) How would receiver-controlled maneuvers affect observability? (iv) What is the degree of observability of the various states in the environment? (v) What motion planning strategy should the receivers employ for optimal information gathering? (vi) How effective are receding horizon strategies over greedy for receiver trajectory optimization, and what are their limitations? (vii) What level of collaboration between the receivers achieves a minimal price of anarchy? This dissertation addresses these fundamental questions and validates the theoretical conclusions numerically and experimentally. / text

Preliminary interplanetary trajectory designs frequently use simplified two-body orbital mechanics and linked conics methodology to model the complex trajectories in multi-body systems. Incorporating gravity assists provides highly efficient interplanetary trajectories, enabling otherwise infeasible spacecraft missions. Future missions may employ powered gravity assists, using a propulsive maneuver during the flyby, improving the overall trajectory performance. This dissertation provides a complete description and analysis of a new interplanetary trajectory design tool known as TRACT (TRAjectory Configuration Tool). TRACT is capable of modeling complex interplanetary trajectories, including multiple ballistic and/or powered gravity assists, deep space maneuvers, parking orbits, and other common maneuvers. TRACT utilizes an adaptable architecture of modular boundary value problem (BVP) algorithms for all trajectory segments. A bi-level optimization scheme is employed to reduce the number of optimization variables, simplifying the user provided trajectory information. The standardized optimization parameter set allows for easy use of TRACT with a variety of optimization algorithms and mission constraints. The dissertation also details new research in powered gravity assists. A review of literature on optimal powered gravity assists is presented, where many optimal solutions found are infeasible for realistic spacecraft missions. The need was identified for a mission feasible optimal powered gravity assist algorithm using only a single impulsive maneuver. The solution space was analyzed and a complete characterization was developed for solution types of the optimal single-impulse powered gravity assist. Using newfound solution space characteristics, an efficient and reliable optimal single-impulse powered gravity assist BVP algorithm was formulated. The mission constraints were strictly enforced, such as maintaining the closest approach above a minimum radius and below a maximum radius. An extension of the optimal powered gravity assist research is the development of a gravity assist BVP algorithm that utilizes an asymptote ΔV correction maneuver to produce ballistic gravity assist trajectory solutions. The efficient algorithm is tested with real interplanetary mission trajectory parameters and successfully converges upon ballistic gravity assists with improved performance compared to traditional methods. A hybrid approach is also presented, using the asymptote maneuver algorithm together with traditional gravity assist constraints to reach ballistic trajectory solutions more reliably, while improving computational performance.

ITC/USA 2013 Conference Proceedings / The Forty-Ninth Annual International Telemetering Conference and Technical Exhibition / October 21-24, 2013 / Bally's Hotel & Convention Center, Las Vegas, NV / External stores separation campaign is very risky therefore its preparation presents a big technical challenge for the instrumentation group. Determination of store trajectory requires the integration of two hi-speed hi-resolution video cameras into FTI. Link bandwidth precludes the development of a real-time application to be used at the Ground Telemetry System (GTS) for separation validation. To improve efficiency IPEV, with FINEP funding, is developing a system where the separation trajectory is computed on-board and in real-time. Computed parameters are merged into FTI to be processed into GTS and compared to the estimated trajectory. The proposed architecture is presented and discussed.

An analysis of the use of complex-step differentiation (CSD) in optimization problems is presented. Complex-step differentiation is a numerical approximation of the derivative of a function valid for any real-valued analytic function. The primary benefit of this method is that the approximation does not depend on a difference term; therefore round-off error is reduced to the machine word-length. A suitably small choice of the perturbation length, h, then results in the virtual elimination of truncation error in the series approximation. The theoretical basis for this method is derived highlighting its merits and limitations. The Lunar Ascent Problem is used to compare CSD to traditional forward differencing in applications useful to the solution of optimization problems. Complex-step derivatives are shown to sufficiently apply in various interpolation and integration methods, and, in fact, consistently outperform traditional methods. Further, the Optimal Orbit Transfer Problem is used to test the accuracy, robustness, and runtime of CSD in comparison to central differencing. It is shown that CSD is a considerably more accurate derivative approximation which results in an increased robustness and decreased optimization time. Also, it is shown that each approximation is computed in less time using CSD than central differences. Overall, complex-step derivatives are shown to be a fast, accurate, and easy to implement differentiation method ideally suited for most optimization problems. / text

In this document we review the status of existing techniques for nonlinear model order reduction by investigating how well these techniques perform for typical industrial needs. In particular the TPWL-method (Trajectory Piecewise Linear-method) and the POD-approach (Proper Orthogonal Decomposion) is taken under consideration. We address several questions that are (closely) related to both the theory and application of nonlinear model order reduction techniques. The goal of this document is to provide an overview of available methods together with a classification of nonlinear problems that in principle could be handled by these methods.

Certains gènes, modulant la sérotonine (5-hydroxytryptamine, 5-HT), ont été associés aux tempéraments liés à l'anxiété. Une limitation dans la plupart de ces études est que les études sont de nature transversale et l'anxiété a été évaluée à un seul point dans le temps. De plus, seules quelques études ont été réalisées chez les enfants. Le but de la présente étude était d'étudier le rôle des gènes HTR2A et TPH2 dans le développement des trajectoires d’anxiété durant l’enfance. Les associations entre ces gènes, ces trajectoires, le diagnostic d’anxiété à l'âge adulte et les différences entre les sexes ont été examinées dans l'Étude Longitudinale des Enfants de Maternelle au Québec, composée de 3185 enfants recrutés en 1986-1987. Leur anxiété a été cotée par leur professeur annuellement entre 6 et 12 ans. Ces cotes ont été modélisées en trajectoires comportementales. Les données genotypées de 5-HT, disponibles pour 1068 personnes, ont été analysées en utilisant les statistiques du Chi-carré, des régressions logistiques et des analyses de variance. Sur les 37 polymorphismes étudiés, plusieurs ont été associés à la trajectoire de forte anxiété, tels le 5-HTR2A (rs1328684, rs95534511, rs1745837, rs7984966, 7330636) et TPH2 (rs11179050, rs11179052, rs1386498). Bien que les trajectoires d’anxiété en enfance n’aient pas prédit le diagnostic d'anxiété à 21 ans, les relations ont été trouvées entre ce diagnostic, HTR2A et les polymorphismes du nucléotide simple (PNS) de TPH2. On remarque que les PNS associés à l’anxiété durant l’enfance et l’âge adulte ne sont pas les mêmes. La force d'association entre les gènes étudiés et l'anxiété diffère entre les garçons et les filles. Cette étude est la première à identifier une association entre les variantes TPH2, 5-HTR2A et les trajectoires d’anxiété en enfance. Les études futures devraient reproduire les résultats dans d'autres échantillons, enquêter sur l'interaction avec les facteurs de stress, et étudier la pertinence fonctionnelle de la PNS. / A number of genes known to modulate serotonin (5-hydroxytryptamine, 5-HT) have been associated with anxiety-related temperaments. A limitation in most of these studies is that the studies are cross-sectional and anxiety has been measured at a single point in time. Furthermore, only a few studies have been done in children. The aim of the present study was to investigate the role of the HTR2A and TPH2 gene in the development of trajectories of anxiety in childhood/ adolescence. Associations between these genes, anxiety trajectories in childhood and anxiety diagnoses in adulthood were also investigated. Finally, gender differences were explored. Research questions were investigated in the Quebec Longitudinal Study of Kindergarten Children, consisting of 3185 boys and girls, selected in 1986-1987. Children`s anxiety was rated by their teacher every year between the age of 6 and 12 years. The ratings were modeled into behavioral trajectories. 5-HT genotyping data were available for 1068 cohort members. Data were analyzed using Chi-square statistics, logistic regressions and ANOVAs. Out of 37 investigated polymorphisms, several polymorphisms, such as 5-HTR2A (rs1328684, rs95534511, rs1745837, rs7984966, 7330636) and TPH2 (rs11179050, rs11179052, rs1386498) were associated with a high anxiety trajectory. Though trajectories of high anxiety in childhood did not predict an anxiety diagnosis at age 21, relationships were found between HTR2A and TPH2 SNPs and anxiety diagnosis at age 21. We note that the SNPs associated with anxiety were different between adults and children. The strength of association between the investigated genes and anxiety differed between boys and girls. This is the first study reporting an association with some HTR2A and TPH2 variants and trajectories of anxiety in children. Future studies should replicate the findings in other samples, investigate the interaction with stressors, and study the functional relevance of the SNPs

This thesis presents several ways to understand transports of air and water masses in the atmosphere and ocean, and the transports of energy that they imply. It presents work using various kinds of observations as well as computer simulations of the atmosphere and oceans. One of the main focuses is to identify similarities and differences between models and observations, as well as between different models. The first half of the thesis applies Lagrangian methods to study flows in the atmosphere and oceans. Part of the work focuses on understanding how particles follow the currents in the Baltic Sea and how they disperse. It is suggested that the commonly used regional ocean model for the Baltic Sea, RCO, underestimates the transport and the dispersion of the particles, which can have consequences for studies of e.g. biogeochemistry as well as for operational use. A similar methodology is used to study how particles are transported between the tropics and mid-latitudes by the large-scale atmospheric circulation. It is found that the mass transport associated with northbound and southbound particles can cancel in the zonally averaged circulation, and we propose that the degree of cancellation depends on the method of averaging. The latter half of the thesis focuses on Eulerian stream functions and specifically a thermodynamic stream function that combines the zonal and meridional circulations of the atmosphere into a single circulation. The results are used to study the inter-annual variability of the intensity and thermodynamic properties of the global atmospheric circulation. A significant correlation to ENSO variability is found both in reanalysis and the EC-Earth coupled climate model. It is also shown that a set of models from the CMIP5 project show a slowdown of the atmospheric circulation as a result of global warming and associated changes in near-surface moisture content and upper-level radiative cooling. / Denna avhandling presenterar olika metoder för att studera datormodeller av atmosfä- ren, haven, och klimatsystemet. Metoderna använder såväl Lagrangeska synsätt dvs att betrakta atmosfären eller haven som individuella partiklar i rörelse, som Eulerska synsätt där atmosfären och haven ses som gas eller vätska i rörelse. I artikel 1 sjö- sätts ett antal “surface drifters” i Östersjön som driver fritt med havsströmmarna och vars hastighet mäts av satelliter. Genom att modellera Lagrangeska partiklars rörelser i Östersjön och jämföra med dessa “surface drifters” kan det visas att datormodeller kan underskatta både medelhastigheten av partiklarna samt deras utbredning. I ar- tikel 2 simuleras luftmassornas rörelser mellan tropikerna och mellanbreddgraderna (∼ 45◦N/S). Ett medelvärde över all longituder tenderar att ignorera betydande mass- och energitransporter mellan tropikerna och mellanbredderna, och dessa kvantifieras i detalj i artikel 2. Artiklarna 3 och 4 presenterar en metod för att studera atmosfärens storskaliga rörelser utifrån ett termodynamiskt perspektiv där luftmassornas värme och fukt studeras. Det visas att variationer ytvattentemperatur vid ekvatorn i Stilla havet kan få atmosfären att, i ett globalt medelvärde, bli fuktigare och varmare samtidigt som masstransporter- na saktar ner. På samma sätt visas att en global uppvärmning till följd av ökade utsläpp av växthusgaser kan få atmosfären att bli varmare, fuktigare och att masstransporterna kan sakta ner. / <p>At the time of the doctoral defence the following papers were unpublished and had a status as follows: Paper 3: In press; Paper 4: Manuscript.</p> / BalticWay

We propose novel methods to utilize orthogonal polynomial approximation in higher dimension spaces, which enable us to modify classical differential equation solvers to perform high precision, long-term orbit propagation. These methods have immediate application to efficient propagation of catalogs of Resident Space Objects (RSOs) and improved accounting for the uncertainty in the ephemeris of these objects. More fundamentally, the methodology promises to be of broad utility in solving initial and two point boundary value problems from a wide class of mathematical representations of problems arising in engineering, optimal control, physical sciences and applied mathematics. We unify and extend classical results from function approximation theory and consider their utility in astrodynamics. Least square approximation, using the classical Chebyshev polynomials as basis functions, is reviewed for discrete samples of the to-be-approximated function. We extend the orthogonal approximation ideas to n-dimensions in a novel way, through the use of array algebra and Kronecker operations. Approximation of test functions illustrates the resulting algorithms and provides insight into the errors of approximation, as well as the associated errors arising when the approximations are differentiated or integrated. Two sets of applications are considered that are challenges in astrodynamics. The first application addresses local approximation of high degree and order geopotential models, replacing the global spherical harmonic series by a family of locally precise orthogonal polynomial approximations for efficient computation. A method is introduced which adapts the approximation degree radially, compatible with the truth that the highest degree approximations (to ensure maximum acceleration error < 10^−9ms^−2, globally) are required near the Earths surface, whereas lower degree approximations are required as radius increases. We show that a four order of magnitude speedup is feasible, with both speed and storage efficiency op- timized using radial adaptation. The second class of problems addressed includes orbit propagation and solution of associated boundary value problems. The successive Chebyshev-Picard path approximation method is shown well-suited to solving these problems with over an order of magnitude speedup relative to known methods. Furthermore, the approach is parallel-structured so that it is suited for parallel implementation and further speedups. Used in conjunction with orthogonal Finite Element Model (FEM) gravity approximations, the Chebyshev-Picard path approximation enables truly revolutionary speedups in orbit propagation without accuracy loss.

In this thesis, the redundancy resolution and failure analysis of Cable-Driven Parallel Manipulators (CDPM) are investigated. A CDPM consists mainly of a Mobile Platform (MP) actuated by cables. Cables can only apply force in the form of tension. So, to design a fully controllable CDPM, the manipulator has to be redundantly actuated (e.g., by using redundant cables, external force/moment or gravity). In this research, the redundancy resolution of planar CDPMs is investigated at the kinematic and dynamic levels in order to improve the manipulator safety, reliability and performance, e.g., by avoiding large tension in the cables that may result in high impact forces, and avoiding large MP velocities that may cause instability in the manipulator, or on the contrary, by increasing the cable tensions and the stiffness for high-precision applications. The proposed approaches are utilized in trajectory planning, design of controllers, and safe dynamic workspace analysis where collision is imminent and the safety of humans, objects and the manipulator itself are at risk. The kinematic and dynamic models of the manipulator required in the design and control of manipulators are examined and simulated under various operating conditions and manufacturing automation tasks to predict the behaviour of the CDPM. In the presented research, some of the challenges associated with the redundancy resolution are resolved including positive tension requirement in each cable, infinite inverse dynamic solutions, slow-computation abilities when using optimization techniques, failure of the manipulator, and elasticity of cables that has a significant role in the dynamics of a heavy loaded manipulator with a large workspace. Optimization-based and non-optimization-based techniques are employed to resolve the redundancy of CDPM. Depending on the advantages and disadvantages of each method, task requirements, the used redundancy resolution technique, and the objective function suitable optimization-based and non-optimization-based routines are employed. Methodologies that could combine redundancy resolution techniques at various levels (e.g., position, velocity, acceleration, and torque levels) are proposed. / Thesis (Ph.D, Mechanical and Materials Engineering) -- Queen's University, 2012-09-26 22:39:34.35

This dissertation presents the research, development and application of trajectory creation, obstacle avoidance and trajectory optimisation methods for an existing serial manipulator power line inspection robot (PLIR). The obstacle avoidance implementation allows the robot to navigate around an obstacle obstructing its navigation along the line. The algorithm generated end effector trajectory waypoints autonomously based on bounding box obstacle descriptions in Cartesian space, and connected them with a fifth order basis-spline end effector trajectory command. The trajectories were created taking into account the dynamic torque and velocity constraints of the robot while ignoring non-linearities. Performance was inspected and evaluated in a simulated workspace environment. The trajectory optimisation was designed to maximise the robot’s operating range, with constraints on the battery power supply, by minimising charge consumed during obstacle avoidance trajectories. The temporal components of the basis-spline trajectories were optimised by minimising a timeenergy type of cost function subject to the dynamic constraints of the robot. Cost function analyses are presented for a simple frictionless robot model based on the recursive Newton-Euler method, and for a more realistic model including viscous, Coulomb and static friction as well as gearbox backlash. It is shown that the Nelder-Mead simplex method was appropriate for optimisation. For representative trajectories that were studied, the optimiser was capable of finding global minima with satisfactory speed and accuracy in simulation. The validity of trajectory optimisation with regard to the cost function behaviour was confirmed. This was based on experiments carried out on the robot hardware in the laboratory, examining the predicted and actual actuator current profiles. The engineering design and implementation of hardware and software for the base station and on-board system is presented, together with the layout of the PLIR’s control system and PID (proportional-integral-derivative) controller design. Trajectory commands are sent from the base station to the robot via Wi-Fi for execution. Furthermore, live video feed from the robot can be sent to the ground station computer. Furthermore, high voltage testing of the PLIR showed that the engineering design of the robot and communication platform is robust. / Thesis (M.Sc.Eng.)-University of KwaZulu-Natal, Durban, 2012.