Terrapin technologies manned Mars mission proposal

A Manned Mars Mission (M3) design study is proposed. The purpose of M3 is to transport 10 personnel and a habitat with all required support systems and supplies from low Earth orbit (LEO) to the surface of Mars and, after an eight-man surface expedition of 3 months, to return the personnel safely to LEO. The proposed hardware design is based on systems and components of demonstrated high capability and reliability. The mission design builds on past mission experience, but incorporates innovative design approaches to achieve mission priorities. Those priorities, in decreasing order of importance, are safety, reliability, minimum personnel transfer time, minimum weight, and minimum cost. The design demonstrates the feasibility and flexibility of a Waverider transfer module

Static search games played over graphs and general metric spaces

We define a general game which forms a basis for modelling situations of static search and concealment over regions with spatial structure. The game involves two players, the searching player and the concealing player, and is played over a metric space. Each player simultaneously chooses to deploy at a point in the space; the searching player receiving a payoff of 1 if his opponent lies within a predetermined radius r of his position, the concealing player receiving a payoff of 1 otherwise. The concepts of dominance and equivalence of strategies are examined in the context of this game, before focusing on the more specific case of the game played over a graph. Methods are presented to simplify the analysis of such games, both by means of the iterated elimination of dominated strategies and through consideration of automorphisms of the graph. Lower and upper bounds on the value of the game are presented and optimal mixed strategies are calculated for games played over a particular family of graphs

Coordination of Multirobot Teams and Groups in Constrained Environments: Models, Abstractions, and Control Policies

Robots can augment and even replace humans in dangerous environments, such as search and rescue and reconnaissance missions, yet robots used in these situations are largely tele-operated. In most cases, the robots\u27 performance depends on the operator\u27s ability to control and coordinate the robots, resulting in increased response time and poor situational awareness, and hindering multirobot cooperation. Many factors impede extended autonomy in these situations, including the unique nature of individual tasks, the number of robots needed, the complexity of coordinating heterogeneous robot teams, and the need to operate safely. These factors can be partly addressed by having many inexpensive robots and by control policies that provide guarantees on convergence and safety. In this thesis, we address the problem of synthesizing control policies for navigating teams of robots in constrained environments while providing guarantees on convergence and safety. The approach is as follows. We first model the configuration space of the group (a space in which the robots cannot violate the constraints) as a set of polytopes. For a group with a common goal configuration, we reduce complexity by constructing a configuration space for an abstracted group state. We then construct a discrete representation of the configuration space, on which we search for a path to the goal. Based on this path, we synthesize feedback controllers, decentralized affine controllers for kinematic systems and nonlinear feedback controllers for dynamical systems, on the polytopes, sequentially composing controllers to drive the system to the goal. We demonstrate the use of this method in urban environments and on groups of dynamical systems such as quadrotors. We reduce the complexity of multirobot coordination by using an informed graph search to simultaneously build the configuration space and find a path in its discrete representation to the goal. Furthermore, by using an abstraction on groups of robots we dissociate complexity from the number of robots in the group. Although the controllers are designed for navigation in known environments, they are indeed more versatile, as we demonstrate in a concluding simulation of six robots in a partially unknown environment with evolving communication links, object manipulation, and stigmergic interactions

Manned Orbital Operation, Special Section

Manned orbital space flight - operations, support, design, and development of concepts - spacecraft design and mission analysi

2006 Status of the Momentum eXchange Electrodynamic Re-Boost (MXER) Tether Development

The MXER Tether technology development is a high-payoff/high-risk investment area within the NASA In-Space Propulsion Technology (ISPT) Program. The ISPT program is managed by the NASA Headquarters Science Mission Directorate and implemented by the Marshall Space Flight Center in Huntsville, Alabama. The MXER concept was identified and competitively ranked within NASA's comprehensive Integrated In-Space Transportation Plan (IISTP); an agency-wide technology assessment activity. The objective of the MXER tether project within ISPT is to advance the technological maturation level for the MXER system, and its subsystems, as well as other space and terrestrial tether applications. Recent hardware efforts have focused on the manufacturability of space-survivable high-strength tether material and coatings, high-current electrodynamic tether, lightweight catch mechanism, high-accuracy propagator/predictor code, and efficient electron collection/current generation. Significant technical progress has been achieved with modest ISPT funding to the extent that MXER has evolved to a well-characterized system with greater capability as the design has been matured. Synergistic efforts in high-current electrodynamic tethers and efficient electron collection/current generation have been made possible through SBIR and STTR support. The entire development endeavor was orchestrated as a collaborative team effort across multiple individual contracts and has established a solid technology resource base, which permits a wide variety of future space cable/tether applications to be realized

Advanced Platform Systems Technology study. Volume 2: Trade study and technology selection

Three primary tasks were identified which include task 1-trade studies, task 2-trade study comparison and technology selection, and task 3-technology definition. Task 1 general objectives were to identify candidate technology trade areas, determine which areas have the highest potential payoff, define specific trades within the high payoff areas, and perform the trade studies. In order to satisfy these objectives, a structured, organized approach was employed. Candidate technology areas and specific trades were screened using consistent selection criteria and considering possible interrelationships. A data base comprising both manned and unmanned space platform documentation was used as a source of system and subsystem requirements. When requirements were not stated in the data base documentation, assumptions were made and recorded where necessary to characterize a particular spacecraft system. The requirements and assumptions were used together with the selection criteria to establish technology advancement goals and select trade studies. While both manned and unmanned platform data were used, the study was focused on the concept of an early manned space station

The 1990 Johnson Space Center bibliography of scientific and technical papers

Abstracts are presented of scientific and technical papers written and/or presented by L. B. Johnson Space Center (JSC) authors, including civil servants, contractors, and grantees, during the calendar year of 1990. Citations include conference and symposium presentations, papers published in proceedings or other collective works, seminars, and workshop results, NASA formal report series (including contractually required final reports), and articles published in professional journals

Design and Evaluation of Distributed Algorithms for Placement of Network Services

Network services play an important role in the Internet today. They serve as data caches for websites, servers for multiplayer games and relay nodes for Voice over IP: VoIP) conversations. While much research has focused on the design of such services, little attention has been focused on their actual placement. This placement can impact the quality of the service, especially if low latency is a requirement. These services can be located on nodes in the network itself, making these nodes supernodes. Typically supernodes are selected in either a proprietary or ad hoc fashion, where a study of this placement is either unavailable or unnecessary. Previous research dealt with the only pieces of the problem, such as finding the location of caches for a static topology, or selecting better routes for relays in VoIP. However, a comprehensive solution is needed for dynamic applications such as multiplayer games or P2P VoIP services. These applications adapt quickly and need solutions based on the immediate demands of the network. In this thesis we develop distributed algorithms to assign nodes the role of a supernode. This research first builds off of prior work by modifying an existing assignment algorithm and implementing it in a distributed system called Supernode Placement in Overlay Topologies: SPOT). New algorithms are developed to assign nodes the supernode role. These algorithms are then evaluated in SPOT to demonstrate improved SN assignment and scalability. Through a series of simulation, emulation, and experimentation insight is gained into the critical issues associated with allocating resources to perform the role of supernodes. Our contributions include distributed algorithms to assign nodes as supernodes, an open source fully functional distributed supernode allocation system, an evaluation of the system in diverse networking environments, and a simulator called SPOTsim which demonstrates the scalability of the system to thousands of nodes. An example of an application deploying such a system is also presented along with the empirical results