Search NASA⌕ Search

SEARCH · Search NASA

Results for “ROUTING”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 307 records · Page 17

A Practical Approach to Obstacle Field Route Planning for Unmanned Rotorcraft

Autonomous helicopter operations in the near-earth environment will require robust and efficient obstacle field route planning. A method for obstacle field route planning is presented, which is composed of a mesh generation phase, a graph search phase, and a route refinement phase. The method mixes optimization and heuristics to obtain a satisfactory solution quickly. Simulations based on an unmanned helicopter model are presented.

Howlet, Jason K.↗

Method and apparatus for identification of hazards along an intended travel route

Targets proximate to a travel route plan were evaluated to determine hazardousness. Projected geometric representation of a vehicle determines intrusion of hazardous targets along travel route plan. Geometric representation of hazardous targets projected along motion vector to determine intrusion upon travel route plan. Intrusion assessment presented on user display.

Kronfeld, Kevin M.↗

A Linear Programming Approach to Routing Control in Networks of Constrained Nonlinear Positive Systems with Concave Flow Rates

We consider control design for positive compartmental systems in which each compartment's outflow rate is described by a concave function of the amount of material in the compartment.We address the problem of determining the routing of material between compartments to satisfy time-varying state constraints while ensuring that material reaches its intended destination over a finite time horizon. We give sufficient conditions for the existence of a time-varying state-dependent routing strategy which ensures that the closed-loop system satisfies basic network properties of positivity, conservation and interconnection while ensuring that capacity constraints are satisfied, when possible, or adjusted if a solution cannot be found. These conditions are formulated as a linear programming problem. Instances of this linear programming problem can be solved iteratively to generate a solution to the finite horizon routing problem. Results are given for the application of this control design method to an example problem. Key words: linear programming; control of networks; positive systems; controller constraints and structure.

Positive Systems↗

Assessment of Air Traffic Controller Acceptability of Aircrew Route Change Requests

NASA developed the traffic aware strategic aircrew requests concept for a cockpit automation that identifies route improvements and advises the aircrew to request the change from the air traffic controller. In order to increase the chance of air traffic control approval, the automation ensures that the route is clear of known traffic, weather, and airspace restrictions. Hence the technology is anticipated to provide benefits in areas such as flight efficiency, flight schedule compliance, passenger comfort, and pilot and controller workload. In support of a field trial of a prototype of the technology, observations were conducted at the Atlanta and Jacksonville air traffic control centers to identify the main factors that affect the acceptability of aircrew requests by air traffic controllers. Observers shadowed air traffic controllers as the test flight pilot made pre-scripted requests to invoke acceptability issues and then they interviewed voluntarily fifty controllers with experience ranging from one to thirty-five years. The most common reason for rejecting requests is conflicting with traffic followed by violating air traffic procedures, increasing sector workload, and conflicting with major arrival and departure flows and flow restrictions. Quantitative parameters such as the distance that a route should maintain from sector boundaries and special use airspace were identified and recommended for inclusion in the automation.

Flight Optimization; Field Trial↗

Assessment of Air Traffic Controller Acceptability of Aircrew Route Change Requests

NASA developed the traffic aware strategic aircrew requests concept for a cockpit automation that identifies route improvements and advises the aircrew to request the change from the air traffic controller. In order to increase the chance of air traffic control approval, the automation ensures that the route is clear of known traffic, weather, and airspace restrictions. Hence the technology is anticipated to provide benefits in areas such as flight efficiency, flight schedule compliance, passenger comfort, and pilot and controller workload. In support of a field trial of a prototype of the technology, observations were conducted at the Atlanta and Jacksonville air traffic control centers to identify the main factors that affect the acceptability of aircrew requests by air traffic controllers. Observers shadowed air traffic controllers as the test flight pilot made pre-scripted requests to invoke acceptability issues and then they interviewed voluntarily fifty controllers with experience ranging from one to thirty-five years. The most common reason for rejecting requests is conflicting with traffic followed by violating air traffic procedures, increasing sector workload, and conflicting with major arrival and departure flows and flow restrictions. Quantitative parameters such as the distance that a route should maintain from sector boundaries and special use airspace were identified and recommended for inclusion in the automation.

Flight Optimization; Field Trial↗

Airspace Technology Demonstration 3 (ATD-3): Dynamic Routes for Arrivals in Weather (DRAW) Technology Transfer Document Summary Version 1.0

Airspace Technology Demonstration – 3 (ATD-3) is part of NASA’s Airspace Operations and Safety Program (AOSP) – specifically, its Airspace Technology Demonstrations (ATD) Project. ATD-3 is a multi-year research and development effort which proposes to develop and demonstrate automation technologies and operating concepts that enable air navigation service providers and airspace users to continuously assess weather, winds, traffic, and other information to identify, evaluate, and implement workable opportunities for flight plan route corrections that can result in significant flight time and fuel savings in en route airspace. In order to ensure that the products of this tech-transfer are relevant and useful, NASA has created strong partnerships with the FAA and key industry stakeholders. This summary document and accompanying technology artifacts satisfy the third of three Research Transition Products (RTPs) defined in the Applied Traffic Flow Management (ATFM) Research Transition Team (RTT) Plan. This transfer consists of NASA’s Dynamic Routes for Arrivals in Weather (DRAW) –Arrival Metering Operations. This research enables continued use of arrival metering operations while efficiently rerouting traffic in weather

DRAW↗

ATD-3 Dynamic Routes for Arrivals in Weather (DRAW) Operational Concept, V2.0

NASA's Airspace Technology Demonstration-3 (ATD-3) is the applied traffic flow management activity, and third in the series of ATD projects. ATD-3 provides a suite of en route automation tools, both ground and flight-deck based, that focus on improving the efficiency of en route operation from initial cruise to arrival into the Terminal Radar Approach Control (TRACON). Dynamic Routes for Arrivals in Weather (DRAW) is a technology in the ATD-3 suite that is designed to provide Traffic Managers with a capability to efficiently manage arrival traffic flow and help sustain metering operations when weather is impacting arrivals into major airports. DRAW mitigates convective weather impact on arrival metering operations by providing tools to Traffic Managers that enable efficient reroutes free of convective weather conflicts, and integrated with the arrival metering schedule(s).

terminal airspace↗

SPRINT: Scheduling Planning Routing Intersatellite Network Tool

The Scheduling Planning Routing Intersatellite Network Tool (SPRINT) software system plans and schedules the operations (observations, inter-satellite crosslink communications, and ground communications) of Earth observation (EO) constellations of hundreds of resource-constrained small satellites to enable global, near real-time science. Historically, most CubeSats have flown radios only for direct-to-ground downlink of data; as a result, data availability is delayed by as long as it takes for the capturing satellite to pass over a ground station, typically hours. Current Planning and Scheduling (P&S) systems for constellations cannot handle data routing through a large, dynamic network topology, and all planning is handled on the ground without .the ability to autonomously prioritize important observations, or respond to unexpected changes in communication window or bandwidth. SPRINT directly handles both data routing for low latency bulk observation data downlink and replanning onboard to deal with dynamic priorities and fault response, maximizing the utility of downlinked data.

Kerri Cahoy↗

Collective network routing

Disclosed are a unified method and apparatus to classify, route, and process injected data packets into a network so as to belong to a plurality of logical networks, each implementing a specific flow of data on top of a common physical network. The method allows to locally identify collectives of packets for local processing, such as the computation of the sum, difference, maximum, minimum, or other logical operations among the identified packet collective. Packets are injected together with a class-attribute and an opcode attribute. Network routers, employing the described method, use the packet attributes to look-up the class-specific route information from a local route table, which contains the local incoming and outgoing directions as part of the specifically implemented global data flow of the particular virtual network.

97 MATHEMATICS AND COMPUTING↗

System and method for vehicle energy estimation, adaptive control and routing

In various embodiments the present disclosure provides a system and a method for estimating energy usage in a vehicle. The system includes hardware that perform certain operations that include receiving data associated with a route to be taken by the vehicle. The operations include determining, based on the data associated with the route and a state of the vehicle, an estimate corresponding to the energy that would be used by the vehicle when traversing a segment of the route.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Online Energy-optimal Routing for Electric Vehicles with Combinatorial Multi-arm Semi-Bandit

We have seen a rapid growth in the adoption of electric vehicle in today’s commercial mobility service market, from carrying passengers to the delivery of goods. One cardinal issue concerning the operation of EVs is the optimal routing of EV fleets with limited battery capacity. In this study, we investigate the energy-optimal online routing problem for the fleet of EVs, which focuses on identifying real-time minimum electricity consumption paths (MECP) for multiple OD pairs with limited information. We develop a multi-OD combinatorial multi-arm semi-bandit model (MCMAB) that uses the fleet of EVs as sensors in the transportation network and promotes the utilization of common information shared by different OD pairs. We further enrich the model with the path elimination policy to obtain MECP of high confidence while significantly reducing the number of learning iterations and the number of explorations needed. We demonstrate the effectiveness of the MCMAB and the efficiency of the path elimination policy with comprehensive numerical experiments in Manhattan, NYC. The results show that the proposed online routing algorithms can achieve near-optimal MECPs efficiently, and the quality of the solutions is significantly better than using the shortest travel time paths as approximate MECPs.

Chen, Xiaowei↗

Investigation of the OECD/NEA PWR MOX/UO{sub 2} core transient benchmark using a coupled whole core pin-by-pin route in WIMS

This paper investigates the new CAMELOT coupling route developed in WIMS, which uses prepared tabulated cross-sections combined with the flux solver MERLIN module and the integrated sub-channel thermal hydraulics solver ARTHUR module to solve for the coupled core state. This coupling route is applied to the OECD/NEA pressurized water reactor (PWR) core transient benchmark exercise, involving 3-D neutronics and thermal-hydraulics analysis of a full-sized PWR core featuring MOX fuel at various core states, as well as simulating a control rod ejection transient. Analysis of the results for each part of the benchmark demonstrate that the high-resolution pin-by-pin analysis used in WIMS closely matches the other participants in the benchmark, with differences of between 20-200 pcm for k-effective, 1-2.5% RMS difference for assembly-averaged powers, 2-8% difference in rod worth calculations, < 200 ppm for calculations of critical boron concentration, zero difference in delayed neutron fraction calculation and a very close match for power response to the rod ejection transient. This is the first application of the WIMS-CAMELOT approach for the transient analysis of a full-sized reactor and as such further improvements such as reducing computational cost through parallelization, optimisation and memory reduction, are currently in active development. This paper demonstrates the accuracy and flexibility of the CAMELOT coupling route, providing a straightforward and consistent user image that can be easily used for a variety of modelling problems involving coupled neutronics and thermal-hydraulics. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Route Optimization for Offloading Congested Meter Fixes

The Optimized Route Capability (ORC) concept proposed by the FAA facilitates traffic managers to identify and resolve arrival flight delays caused by bottlenecks formed at arrival meter fixes when there exists imbalance between arrival fixes and runways. ORC makes use of the prediction capability of existing automation tools, monitors the traffic delays based on these predictions, and searches the best reroutes upstream of the meter fixes based on the predictions and estimated arrival schedules when delays are over a predefined threshold. Initial implementation and evaluation of the ORC concept considered only reroutes available at the time arrival congestion was first predicted. This work extends previous work by introducing an additional dimension in reroute options such that ORC can find the best time to reroute and overcome the 'firstcome- first-reroute' phenomenon. To deal with the enlarged reroute solution space, a genetic algorithm was developed to solve this problem. Experiments were conducted using the same traffic scenario used in previous work, when an arrival rush was created for one of the four arrival meter fixes at George Bush Intercontinental Houston Airport. Results showed the new approach further improved delay savings. The suggested route changes from the new approach were on average 30 minutes later than those using other approaches, and fewer numbers of reroutes were required. Fewer numbers of reroutes reduce operational complexity and later reroutes help decision makers deal with uncertain situations.

Optimized Route Capability↗

Energy impact evaluation for eco-routing and charging of autonomous electric vehicle fleet: Ambient temperature consideration

This paper studies the heterogeneous energy cost and charging demand impact of autonomous electric vehicle(EV) fleet under different ambient temperature. A data-driven method is introduced to formulate a two-dimensional grid stochastic energy consumption model for electric vehicles. This model aids in analyzing EV energy cost and describing uncertainties under variable traffic and ambient temperature conditions. According to this energy consumption model, an optimal eco-routing and charging decision making framework is designed for autonomous EV fleet. This optimization framework can improve the capability of autonomous EV's energy management and help to find their minimum energy cost routes with consideration of charging demand and travel time requirements. Based on these promising models and technologies, comprehensive case studies are performed on a data-driven simulated transportation network in New York City. Detailed results show us the heterogeneous energy impact and charging demand under different ambient temperature. By giving the same travel demand and charging station information, there may be more than 20% difference of overall energy cost and 60% difference of charging demand in a specific charging station between low and high ambient temperature of a month. All these studies will help to construct sustainable infrastructure for autonomous electric vehicle fleet management.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Evaluation of two inoculation routes of an adenovirus-mediated viral protein inhibitor in a Crimean-Congo hemorrhagic fever mouse model

Crimean-Congo hemorrhagic fever virus (CCHFV) is a tick-borne nairovirus with a wide geographic spread that can cause severe and lethal disease. No specific medical countermeasures are approved to combat this illness. The CCHFV L protein contains an ovarian tumor (OTU) domain with a cysteine protease thought to modulate cellular immune responses by removing ubiquitin and ISG15 post-translational modifications from host and viral proteins. Viral deubiquitinases like CCHFV OTU are attractive drug targets, as blocking their activity may enhance cellular immune responses to infection, and potentially inhibit viral replication itself. We previously demonstrated that the engineered ubiquitin variant CC4 is a potent inhibitor of CCHFV replication in vitro. A major challenge of the therapeutic use of small protein inhibitors such as CC4 is their requirement for intracellular delivery, e.g., by viral vectors. In this study, we examined the feasibility of in vivo CC4 delivery by a replication-deficient recombinant adenovirus (Ad-CC4) in a lethal CCHFV mouse model. Since the liver is a primary target of CCHFV infection, we aimed to optimize delivery to this organ by comparing intravenous (tail vein) and intraperitoneal injection of Ad-CC4. While tail vein injection is a traditional route for adenovirus delivery, in our hands intraperitoneal injection resulted in higher and more widespread levels of adenovirus genome in tissues, including, as intended, the liver. However, despite promising in vitro results, neither route of in vivo CC4 treatment resulted in protection from a lethal CCHFV infection.

59 BASIC BIOLOGICAL SCIENCES↗

Optimization of municipal solid waste collection and transportation routes

Graphical abstract: Display Omitted - Highlights: • Profitable integrated solid waste management system. • Optimal municipal waste collection scheme between the sources and waste collection centres. • Optimal path calculation between waste collection centres and transfer stations. • Optimal waste routing between the transfer stations and processing plants. - Abstract: Optimization of municipal solid waste (MSW) collection and transportation through source separation becomes one of the major concerns in the MSW management system design, due to the fact that the existing MSW management systems suffer by the high collection and transportation cost. Generally, in a city different waste sources scatter throughout the city in heterogeneous way that increase waste collection and transportation cost in the waste management system. Therefore, a shortest waste collection and transportation strategy can effectively reduce waste collection and transportation cost. In this paper, we propose an optimal MSW collection and transportation scheme that focus on the problem of minimizing the length of each waste collection and transportation route. We first formulize the MSW collection and transportation problem into a mixed integer program. Moreover, we propose a heuristic solution for the waste collection and transportation problem that can provide an optimal way for waste collection and transportation. Extensive simulations and real testbed results show that the proposed solution can significantly improve the MSW performance. Results show that the proposed scheme is able to reduce more than 30% of the total waste collection path length.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Two-step route to size and shape controlled gibbsite nanoplates and the crystal growth mechanism

Mastery of gibbsite (α-Al(OH) 3 ) nucleation and crystal growth is significant in fundamental aluminum chemistry and also beneficial for industrial applications and the remediation of nuclear waste. Herein, we developed an additive-free two-step route to size and morphology controlled synthesis of gibbsite nanoplates. Independent temperature manipulation of nucleation and crystal growth regimes was used to control the efficacy and yield of the process, producing gibbsite nanoplates with tunable morphologies and sizes. We achieve morphologies ranging from hexagon, pseudo hexagon, truncated triangle to rhombic, and average basal plane diameters from 120 to 850 nm, with thicknesses between 8 and 45 nm. Analysis of gibbsite structure, size and morphology with techniques including powder X-ray diffraction (p-XRD), 27 Al magic angle spinning nuclear magnetic resonance spectroscopy (MAS NMR), scanning electron microscopy (SEM), and atomic force microscopy (AFM) provided key details on the nucleation and crystal growth mechanisms. The results indicate the temperature of the nucleation aging step is the most important factor controlling the final particle size. Particularly small nanoplates were obtained with a low nucleation aging temperature followed by high crystal growth temperature, suggesting that gibbsite growth can be approximated via a LaMer-type burst nucleation and crystal growth mechanism. Scalability was demonstrated by triplicate of 2 L experiments which prepared gibbsite nanoplates of ~200 nm size and with an average yield of ~55% after 84 h. Compared to existing techniques, this improved two-step route is cheaper, more efficient and environmentally friendly.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Two-Stage Approach for Routing Multiple Unmanned Aerial Vehicles with Stochastic Fuel Consumption

The past decade has seen a substantial increase in the use of small unmanned aerial vehicles (UAVs) in both civil and military applications. This article addresses an important aspect of refueling in the context of routing multiple small UAVs to complete a surveillance or data collection mission. Specifically, this article formulates a multiple-UAV routing problem with the refueling constraint of minimizing the overall fuel consumption for all the vehicles as a two-stage stochastic optimization problem with uncertainty associated with the fuel consumption of each vehicle. The two-stage model allows for the application of sample average approximation (SAA). Although the SAA solution asymptotically converges to the optimal solution for the two-stage model, the SAA run time can be prohibitive for medium- and large-scale test instances. Hence, we develop a tabu search-based heuristic that exploits the model structure while considering the uncertainty in fuel consumption. Extensive computational experiments corroborate the benefits of the two-stage model compared to a deterministic model and the effectiveness of the heuristic for obtaining high-quality solutions.

42 ENGINEERING↗