The 30/20 GHz flight experiment system, phase 2. Volume 2: Experiment system description

A detailed technical description of the 30/20 GHz flight experiment system is presented. The overall communication system is described with performance analyses, communication operations, and experiment plans. Hardware descriptions of the payload are given with the tradeoff studies that led to the final design. The spacecraft bus which carries the payload is discussed and its interface with the launch vehicle system is described. Finally, the hardwares and the operations of the terrestrial segment are presented

Modeling and Analysis of Power Processing Systems (MAPPS), initial phase 2

The overall objective of the program is to provide the engineering tools to reduce the analysis, design, and development effort, and thus the cost, in achieving the required performances for switching regulators and dc-dc converter systems. The program was both tutorial and application oriented. Various analytical methods were described in detail and supplemented with examples, and those with standardization appeals were reduced into computer-based subprograms. Major program efforts included those concerning small and large signal control-dependent performance analysis and simulation, control circuit design, power circuit design and optimization, system configuration study, and system performance simulation. Techniques including discrete time domain, conventional frequency domain, Lagrange multiplier, nonlinear programming, and control design synthesis were employed in these efforts. To enhance interactive conversation between the modeling and analysis subprograms and the user, a working prototype of the Data Management Program was also developed to facilitate expansion as future subprogram capabilities increase

GeantV: Results from the prototype of concurrent vector particle transport simulation in HEP

Full detector simulation was among the largest CPU consumer in all CERN experiment software stacks for the first two runs of the Large Hadron Collider (LHC). In the early 2010's, the projections were that simulation demands would scale linearly with luminosity increase, compensated only partially by an increase of computing resources. The extension of fast simulation approaches to more use cases, covering a larger fraction of the simulation budget, is only part of the solution due to intrinsic precision limitations. The remainder corresponds to speeding-up the simulation software by several factors, which is out of reach using simple optimizations on the current code base. In this context, the GeantV R&D project was launched, aiming to redesign the legacy particle transport codes in order to make them benefit from fine-grained parallelism features such as vectorization, but also from increased code and data locality. This paper presents extensively the results and achievements of this R&D, as well as the conclusions and lessons learnt from the beta prototype.Comment: 34 pages, 26 figures, 24 table

Precision Pointing Control System (PPCS) system design and analysis

The precision pointing control system (PPCS) is an integrated system for precision attitude determination and orientation of gimbaled experiment platforms. The PPCS concept configures the system to perform orientation of up to six independent gimbaled experiment platforms to design goal accuracy of 0.001 degrees, and to operate in conjunction with a three-axis stabilized earth-oriented spacecraft in orbits ranging from low altitude (200-2500 n.m., sun synchronous) to 24 hour geosynchronous, with a design goal life of 3 to 5 years. The system comprises two complementary functions: (1) attitude determination where the attitude of a defined set of body-fixed reference axes is determined relative to a known set of reference axes fixed in inertial space; and (2) pointing control where gimbal orientation is controlled, open-loop (without use of payload error/feedback) with respect to a defined set of body-fixed reference axes to produce pointing to a desired target

Design study of a low cost civil aviation GPS receiver system

A low cost Navstar receiver system for civil aviation applications was defined. User objectives and constraints were established. Alternative navigation processing design trades were evaluated. Receiver hardware was synthesized by comparing technology projections with various candidate system designs. A control display unit design was recommended as the result of field test experience with Phase I GPS sets and a review of special human factors for general aviation users. Areas requiring technology development to ensure a low cost Navstar Set in the 1985 timeframe were identified

Study of low acceleration space transportation systems. Volume I - Summary Phase II STUDY report

Technical feasibility of electric-nuclear propulsion system for manned Mars missio

Models and algorithms for multi-agent search problems

The problem of searching for objects of interest occurs in important applications ranging from rescue, security, transportation, to medicine. With the increasing use of autonomous vehicles as search platforms, there is a need for fast algorithms that can generate search plans for multiple agents in response to new information. In this dissertation, we develop new techniques for automated generation of search plans for different classes of search problems. First, we study the problem of searching for a stationary object in a discrete search space with multiple agents where each agent can access only a subset of the search space. In these problems, agents can fail to detect an object when inspecting a location. We show that when the probabilities of detection only depend on the locations, this problem can be reformulated as a minimum cost network optimization problem, and develop a fast specialized algorithm for the solution. We prove that our algorithm finds the optimal solution in finite time, and has worst-case computation performance that is faster than general minimum cost flow algorithms. We then generalize it to the case where the probabilities of detection depend on the agents and the locations, and propose a greedy algorithm that is 1/2-approximate. Second, we study the problem of searching for a moving object in a discrete search space with multiple agents where each agent can access only a subset of a discrete search space at any time and agents can fail to detect objects when searching a location at a given time. We provide necessary conditions for an optimal search plan, extending prior results in search theory. For the case where the probabilities of detection depend on the locations and the time periods, we develop a forward-backward iterative algorithm based on coordinate descent techniques to obtain solutions. To avoid local optimum, we derive a convex relaxation of the dynamic search problem and show this can be solved optimally using coordinate descent techniques. The solutions of the relaxed problem are used to provide random starting conditions for the iterative algorithm. We also address the problem where the probabilities of detection depend on the agents as well as the locations and the time periods, and show that a greedy-style algorithm is 1/2-approximate. Third, we study problems when multiple objects of interest being searched are physically scattered among locations on a graph and the agents are subject to motion constraints captured by the graph edges as well as budget constraints. We model such problem as an orienteering problem, when searching with a single agent, or a team orienteering problem, when searching with multiple agents. We develop novel real-time efficient algorithms for both problems. Fourth, we investigate classes of continuous-region multi-agent adaptive search problems as stochastic control problems with imperfect information. We allow the agent measurement errors to be either correlated or independent across agents. The structure of these problems, with objectives related to information entropy, allows for a complete characterization of the optimal strategies and the optimal cost. We derive a lower bound on the performance of the minimum mean-square error estimator, and provide upper bounds on the estimation error for special cases. For agents with independent errors, we show that the optimal sensing strategies can be obtained in terms of the solution of decoupled scalar convex optimization problems, followed by a joint region selection procedure. We further consider search of multiple objects and provide an explicit construction for adaptively determining the sensing actions

Study of fault tolerant software technology for dynamic systems

The major aim of this study is to investigate the feasibility of using systems-based failure detection isolation and compensation (FDIC) techniques in building fault-tolerant software and extending them, whenever possible, to the domain of software fault tolerance. First, it is shown that systems-based FDIC methods can be extended to develop software error detection techniques by using system models for software modules. In particular, it is demonstrated that systems-based FDIC techniques can yield consistency checks that are easier to implement than acceptance tests based on software specifications. Next, it is shown that systems-based failure compensation techniques can be generalized to the domain of software fault tolerance in developing software error recovery procedures. Finally, the feasibility of using fault-tolerant software in flight software is investigated. In particular, possible system and version instabilities, and functional performance degradation that may occur in N-Version programming applications to flight software are illustrated. Finally, a comparative analysis of N-Version and recovery block techniques in the context of generic blocks in flight software is presented

Integrated design of high performance pulsed power converters : application to klystron modulators for the compact linear colider (CLIC)

Ce travail de recherche présente l’étude, conception et validation d’une topologie de convertisseur de puissance pulsé qui compense la chute de tension pour des modulateurs de type klystron de haute performance. Cette topologie est capable de compenser la chute de tension du banc de condensateur principal et, en même temps, de faire fonctionner le modulateur avec une consommation de puissance constante par rapport au réseau électrique. Ces spécifications sont requises par le projet Compact Linear Collider (CLIC) pour les modulateurs klystron de son Drive Beam. Le dimensionnement du système est effectué à partir d’un outil d’optimisation globale développé à partir des modèles analytiques qui décrivent les performances de chaque composant du système. Tous les modèles sont intégrés dans un processus optimal intermédiaire de conception qui utilise des techniques d’optimisation afin de réaliser un dimensionnement optimal du système. Les performances de cette solution optimale intermédiaire sont alors évaluées à l’aide d’un modèle plus fin basé sur des simulations numériques. Une technique d’optimisation utilisant l’approche «space mapping» est alors mise en oeuvre. Si l’écart entre les performances prédites et les performances simulées est important, des facteurs de correction sont appliqués aux modèles analytiques et le processus d’optimisation est relancé. Cette méthode permet d’obtenir une solution optimale validée par le modèle fin en réduisant le nombre de simulations. La topologie finale sélectionnée pour le cahier des charges du modulateur CLIC est validée expérimentalement sur des prototypes à échelle réduite. Les résultats valident la méthodologie de dimensionnement et respectent les spécifications.This research work presents the study, design and validation of a pulsed power converter topology that performs accurate voltage droop compensation for high performance klystron modulators. This topology is capable of compensating the voltage droop of the intermediate capacitor bank and, at the same time, it makes possible a constant power consumption operation of the modulator from the utility grid. These two main specifications are required for the Compact Linear Collider (CLIC) Drive Beam klystron modulators. The dimensioning of the system is performed by developing a global optimization design tool. This tool is first based on developed analytical models describing the performances of each system subcomponent. All these models are integrated into an intermediate design environment that uses nonlinear optimization techniques to calculate an optimal dimensioning of the system. The intermediate optimal solution performances are then evaluated using a more accurate model based on numerical simulation. Therefore, an optimization technique using «space mapping» is implemented. If differences between predicted performances and simulated results are non-negligible, correction factors are applied to the analytical models and the optimization process is launched again. This method makes possible to achieve an optimal solution validated by numerical simulation while reducing the number of numerical simulation steps. The selected final topology for the CLIC klystron modulator is experimentally validated using reduced scale prototypes. Results validate the selected methodology and fulfill the specifications