Issues associated with establishing control zones for international space operations

Cooperative missions in Earth orbit can be facilitated by developing a strategy to regulate the manner in which vehicles interact in orbit. One means of implementing such a strategy is to utilize a control zones technique that assigns different types of orbital operations to specific regions of space surrounding a vehicle. Considered here are issues associated with developing a control zones technique to regulate the interactions of spacecraft in proximity to a manned vehicle. Technical and planning issues, flight hardware and software issues, mission management parameter, and other constraints are discussed. Also covered are manned and unmanned vehicle operations, and manual versus automated flight control. A review of the strategies utilized by the Apollo Soyuz Test Project and the Space Station Freedom Program is also presented

NASA agenda for tomorrow

Key elements of national policy, NASA goals and objectives, and other materials that comprise the framework for NASA planning are included. The contents are expressed as they existed through much of 1988; thus they describe the strategic context employed by NASA in planning both the FY 1989 program just underway and the proposed FY 1990 program. NASA planning will continue to evolve in response to national policy requirements, a changing environment, and new opportunities. Agenda for Tomorrow provides a status report as of the time of its publication

Monitoring using Heterogeneous Autonomous Agents.

This dissertation studies problems involving different types of autonomous agents observing objects of interests in an area. Three types of agents are considered: mobile agents, stationary agents, and marsupial agents, i.e., agents capable of deploying other agents or being deployed themselves. Objects can be mobile or stationary. The problem of a mobile agent without fuel constraints revisiting stationary objects is formulated. Visits to objects are dictated by revisit deadlines, i.e., the maximum time that can elapse between two visits to the same object. The problem is shown to be NP-complete and heuristics are provided to generate paths for the agent. Almost periodic paths are proven to exist. The efficacy of the heuristics is shown through simulation. A variant of the problem where the agent has a finite fuel capacity and purchases fuel is treated. Almost periodic solutions to this problem are also shown to exist and an algorithm to compute the minimal cost path is provided. A problem where mobile and stationary agents cooperate to track a mobile object is formulated, shown to be NP-hard, and a heuristic is given to compute paths for the mobile agents. Optimal configurations for the stationary agents are then studied. Several methods are provided to optimally place the stationary agents; these methods are the maximization of Fisher information, the minimization of the probability of misclassification, and the minimization of the penalty incurred by the placement. A method to compute optimal revisit deadlines for the stationary agents is given. The placement methods are compared and their effectiveness shown using numerical results. The problem of two marsupial agents, one carrier and one passenger, performing a general monitoring task using a constrained optimization formulation is stated. Necessary conditions for optimal paths are provided for cases accounting for constrained release of the passenger, termination conditions for the task, as well as retrieval and constrained retrieval of the passenger. A problem involving two marsupial agents collecting information about a stationary object while avoiding detection is then formulated. Necessary conditions for optimal paths are provided and rectilinear motion is demonstrated to be optimal for both agents.PhDAerospace EngineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/111439/1/jfargeas_1.pd

Adaptive Airborne Separation to Enable UAM Autonomy in Mixed Airspace

The excitement and promise generated by Urban Air Mobility (UAM) concepts have inspired both new entrants and large aerospace companies throughout the world to invest hundreds of millions in research and development of air vehicles, both piloted and unpiloted, to fulfill these dreams. The management and separation of all these new aircraft have received much less attention, however, and even though NASAs lead is advancing some promising concepts for Unmanned Aircraft Systems (UAS) Traffic Management (UTM), most operations today are limited to line of sight with the vehicle, airspace reservation and geofencing of individual flights. Various schemes have been proposed to control this new traffic, some modeled after conventional air traffic control and some proposing fully automatic management, either from a ground-based entity or carried out on board among the vehicles themselves. Previous work has examined vehicle-based traffic management in the very low altitude airspace within a metroplex called UTM airspace in which piloted traffic is rare. A management scheme was proposed in that work that takes advantage of the homogeneous nature of the traffic operating in UTM airspace. This paper expands that concept to include a traffic management plan usable at all altitudes desired for electric Vertical Takeoff and Landing urban and short-distance, inter-city transportation. The interactions with piloted aircraft operating under both visual and instrument flight rules are analyzed, and the role of Air Traffic Control services in the postulated mixed traffic environment is covered. Separation values that adapt to each type of traffic encounter are proposed, and the relationship between required airborne surveillance range and closure speed is given. Finally, realistic scenarios are presented illustrating how this concept can reliably handle the density and traffic mix that fully implemented and successful UAM operations would entail

This is NASA

Mission, facilities, and projects of NAS

Inside magazine, December 2013-January 2014

Iowa Department of Transportation Newsletter. INSIDE Magazine is developed to help keep all Iowa DOT employees informed about critical issues affecting them, recognize DOT employees for their excellent service and share interesting aspects in the lives of our co-workers

Reitinsuunnittelu määrätyssä järjestyksessä tehtäville peltotöille usean työkoneen yhteistyönä

Coverage path planning is the task of finding a collision free path that passes over every point of an area or volume of interest. In agriculture, the coverage task is encountered especially in the process of crop cultivation. Several tasks are performed on the field, one after the other, during the cultivation cycle. Cooperation means that multiple agents, in this case vehicles, are working together towards a common goal. Several studies consider the problem where a single task is divided and assigned among the agents. In this thesis, however, the vehicles have different tasks that are sequentially dependent, that is, the first task must be completed before the other. The tasks are performed simultaneously on the same area. The literature review suggests that there is a lack of previous research on this topic. The objective of this thesis was to develop an algorithm to solve the cooperative coverage path planning problem for sequentially dependent tasks. A tool chain that involves Matlab, Simulink and Visual Studio was adapted for the development and testing of the solution. A development and testing architecture was designed including a compatible interface to a simulation and a real-life test environment. Two different algorithms were implemented based on the idea of computing short simultaneous paths at a time and scheduling them in real-time. The results were successfully demonstrated in a real-life test environment with two tractors equipped with a disc cultivator and a seeder. The objective was to sow the test area. The test drives show that with the algorithms that were developed in this thesis it is possible to perform two sequentially dependent agricultural coverage tasks simultaneously on the same area.Kattavassa reitinsuunnittelussa yritetään löytää polku, jonka aikana määritelty ala tai tilavuus tulee käytyä läpi niin että alueen jokainen piste on käsitelty. Maataloudessa tämä tehtävä on merkityksellinen erityisesti peltoviljelyssä. Useita peltotöitä suoritetaan yksi toisensa jälkeen samalla alueella viljelyvuoden aikana. Useissa tutkimuksissa käsitellään yhteistyönä tehtävää reitinsuunnittelua, jossa yksi tehtävä on jaettu osiin ja osat jaetaan useiden tekijöiden kuten robottien kesken. Tässä diplomityössä peltotyökoneilla on kuitenkin omat erilliset tehtävänsä, joilla on määrätty järjestys, eli niiden suorittaminen riippuu työjärjestyksestä. Työkoneet työskentelevät samanaikaisesti samalla alueella. Diplomityössä tehty kirjallisuuskatsaus viittaa siihen, että vastaavaa aihetta ei ole aiemmin tutkittu. Tämän diplomityön tavoitteena on kehittää algoritmi, jolla voidaan toteuttaa reitinsuunnittelu määrätyssä järjestyksessä tehtäville peltotöille usean peltotyökoneen yhteistyönä. Algoritmikehitystä ja testausta varten suunniteltiin yhtenäinen rajapinta, jolla algoritmia voitaisiin testata sekä simulaatiossa että todellisessa testitilanteessa. Algoritmikehityksessä käytettiin työkaluina Matlab, Simulink ja Visual Studio -ohjelmia. Työssä toteutettiin kaksi algoritmia, jotka perustuvat samaan ideaan: suunnitellaan kerrallaan kaksi lyhyttä samanaikaista polkua, jotka ajoitetaan reaaliajassa. Algoritmeja testattiin todellisessa testiympäristössä kahden työkoneen yhteistyönä, kun tavoitteena on kylvää koko testialue. Ensimmäinen työvaihe suoritettiin lautasmuokkaimella ja toinen kylvökoneella. Testiajot osoittavat, että diplomityössä kehitetyillä algoritmeilla voidaan ohjata kahden toisistaan riippuvaisen peltotyön toteutus samanaikaisesti samalla peltoalueella