Search NASA⌕ Search

SEARCH · Search NASA

Results for “routing problems”

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 217 records · Page 12

Fabrication Routes for Continuous Fiber-Reinforced Ceramic Composites (CFCC)

The primary approaches used for fabrication of continuous fiber-reinforced ceramic composite (CFCC) components have been reviewed. The CFCC fabrication issues related to fiber, interface, and matrix have been analyzed. The capabilities, advantages and limitations of the five matrix-infiltration routes have been compared and discussed. Today, the best fabrication route for the CFCC end-user is not clear and compromises need to be made depending on the details of the CFCC application. However, with time, this problem should be reduced as research continues to develop advanced CFCC constituents and fabrication routes.

DiCarlo, James A.↗

Enhancing Acute Migraine Treatment: Exploring Solid Lipid Nanoparticles and Nanostructured Lipid Carriers for the Nose-to-Brain Route

Migraine has a high prevalence worldwide and is one of the main disabling neurological diseases in individuals under the age of 50. In general, treatment includes the use of oral analgesics or non-steroidal anti-inflammatory drugs (NSAIDs) for mild attacks, and, for moderate or severe attacks, triptans or 5-HT1B/1D receptor agonists. However, the administration of antimigraine drugs in conventional oral pharmaceutical dosage forms is a challenge, since many molecules have difficulty crossing the blood-brain barrier (BBB) to reach the brain, which leads to bioavailability problems. Efforts have been made to find alternative delivery systems and/or routes for antimigraine drugs. In vivo studies have shown that it is possible to administer drugs directly into the brain via the intranasal (IN) or the nose-to-brain route, thus avoiding the need for the molecules to cross the BBB. In this field, the use of lipid nanoparticles, in particular solid lipid nanoparticles (SLN) and nanostructured lipid carriers (NLC), has shown promising results, since they have several advantages for drugs administered via the IN route, including increased absorption and reduced enzymatic degradation, improving bioavailability. Furthermore, SLN and NLC are capable of co-encapsulating drugs, promoting their simultaneous delivery to the site of therapeutic action, which can be a promising approach for the acute migraine treatment. This review highlights the potential of using SLN and NLC to improve the treatment of acute migraine via the nose-to-brain route. First sections describe the pathophysiology and the currently available pharmacological treatment for acute migraine, followed by an outline of the mechanisms underlying the nose-to-brain route. Afterwards, the main features of SLN and NLC and the most recent in vivo studies investigating the use of these nanoparticles for the treatment of acute migraine are presented.

Torres, Joana (ORCID:0000000327276229)↗

Tsunami evacuation mathematical model for the city of Padang

Tsunami is a series of wave trains which travels with high speed on the sea surface. This traveling wave is caused by the displacement of a large volume of water after the occurrence of an underwater earthquake or volcano eruptions. The speed of tsunami decreases when it reaches the sea shore along with the increase of its amplitudes. Two large tsunamis had occurred in the last decades in Indonesia with huge casualties and large damages. Indonesian Tsunami Early Warning System has been installed along the west coast of Sumatra. This early warning system will give about 10-15 minutes to evacuate people from high risk regions to the safe areas. Here in this paper, a mathematical model for Tsunami evacuation is presented with the city of Padang as a study case. In the model, the safe areas are chosen from the existing and selected high rise buildings, low risk region with relatively high altitude and (proposed to be built) a flyover ring road. Each gathering points are located in the radius of approximately 1 km from the ring road. The model is formulated as an optimization problem with the total normalized evacuation time as the objective function. The constraints consist of maximum allowable evacuation time in each route, maximum capacity of each safe area, and the number of people to be evacuated. The optimization problem is solved numerically using linear programming method with Matlab. Numerical results are shown for various evacuation scenarios for the city of Padang.

54 ENVIRONMENTAL SCIENCES↗

A Comparison of Genetic Programming Variants for Hyper-Heuristics

Modern society is faced with ever more complex problems, many of which can be formulated as generate-and-test optimization problems. General-purpose optimization algorithms are not well suited for real-world scenarios where many instances of the same problem class need to be repeatedly and efficiently solved, such as routing vehicles over highways with constantly changing traffic flows, because they are not targeted to a particular scenario. Hyper-heuristics automate the design of algorithms to create a custom algorithm for a particular scenario. Hyper-heuristics typically employ Genetic Programming (GP) and this project has investigated the relationship between the choice of GP and performance in Hyper-heuristics. Results are presented demonstrating the existence of problems for which there is a statistically significant performance differential between the use of different types of GP.

97 MATHEMATICS AND COMPUTING↗

Weak Convergence and Fluid Limits in Optimal Time-to-Empty Queueing Control Problems

We consider a class of controlled queue length processes, in which the control allocates each server's effort among the several classes of customers requiring its service. Served customers are routed through the network according to (prescribed) routing probabilities. In the fluid rescaling, X{sup n}(t) = 1/nX(nt) , we consider the optimal control problem of minimizing the integral of an undiscounted positive running cost until the first time that X{sup n}=0. Our main result uses weak convergence ideas to show that the optimal value functions V{sup n} of the stochastic control problems for X{sup n}(t) converge (as n{yields}{infinity}) to the optimal value V of a control problem for the limiting fluid process. This requires certain equicontinuity and boundedness hypotheses on (V{sup n}). We observe that these are essentially the same hypotheses that would be needed for the Barles-Perthame approach in terms of semicontinuous viscosity solutions. Sufficient conditions for these equicontinuity and boundedness properties are briefly discussed.

97 MATHEMATICS AND COMPUTING↗

Adaptive Bio-Inspired Wireless Network Routing for Planetary Surface Exploration

Wireless mobile networks suffer connectivity loss when used in a terrain that has hills, and valleys when line of sight is interrupted or range is exceeded. To resolve this problem and achieve acceptable network performance, we have designed an adaptive, configurable, hybrid system to automatically route network packets along the best path between multiple geographically dispersed modules. This is very useful in planetary surface exploration, especially for ad-hoc mobile networks, where computational devices take an active part in creating a network infrastructure, and can actually be used to route data dynamically and even store data for later transmission between networks. Using inspiration from biological systems, this research proposes to use ant trail algorithms with multi-layered information maps (topographic maps, RF coverage maps) to determine the best route through ad-hoc network at real time. The determination of best route is a complex one, and requires research into the appropriate metrics, best method to identify the best path, optimizing traffic capacity, network performance, reliability, processing capabilities and cost. Real ants are capable of finding the shortest path from their nest to a food source without visual sensing through the use of pheromones. They are also able to adapt to changes in the environment using subtle clues. To use ant trail algorithms, we need to define the probability function. The artificial ant is, in this case, a software agent that moves from node to node on a network graph. The function to calculate the fitness (evaluate the better path) includes: length of the network edge, the coverage index, topology graph index, and pheromone trail left behind by other ant agents. Each agent modifies the environment in two different ways: 1) Local trail updating: As the ant moves between nodes it updates the amount of pheromone on the edge; and 2) Global trail updating: When all ants have completed a tour the ant that found the shortest route updates the edges in its path.

Alena, Richard I.↗

Fully alternating, triaxial electric or magnetic fields offer new routes to fluid vorticity

Noncontact methods of generating strong fluid vorticity are important to problems involving heat and mass transfer, fluid mixing, active wetting, and droplet transport. Furthermore, because zero or even negative shear viscosities can be induced, vorticity can greatly extend the control range of the smart fluids used in magnetorheological devices. In recent work we have shown that a particular class of ac/ac/dc triaxial fields (so-called symmetry-breaking rational fields ) can create strong vorticity in magnetic particle suspensions and have presented a theory of the vorticity that is based on the symmetry of the 2-d Lissajous trajectories of the field and its converse. In this paper we demonstrate that there are three countably infinite sets of fully alternating ac/ac/ac triaxial fields whose frequencies form rational triads that have the symmetry required to drive fluid vorticity. The symmetry of the 3-d Lissajous trajectories of the field and its converse can be derived and from this the direction of the vorticity axis can be predicted, as can the dependence of the sign of the vorticity on the phase relations between the three field components. Experimental results are presented that validate the symmetry theory. These discoveries significantly broaden the class of triaxial fields that can be exploited to produce strong noncontact flow.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Problem Complexity and LLM: H-M Team Reliability in Challenging Environments

In traditional human-machine operations, the functional decomposition of actions and responsibilities among various agents is assigned a priori. For instance, in current air traffic operations, although assisted by software, human pilots have the ultimate control of aircraft. Multiagent human-machine and machine-machine systems will face problems of varying and potentially unpredicted complexity in future challenging scenarios of planetary, en route, and orbital activities. Hence, it is important to enable dynamic transfer of decision-making to appropriate team members, human or machine, depending on which agent is best equipped to solve that specific problem on a time budget. In this paper, we consider aspects of problem-solving and its modeling that affect the outcomes of decision-making as a function of solution quality and the likelihood of solving the problem on a required time budget. We focus on Large Language Models (LLM) as potential machine teammates and conclude that practical, predictive modeling of their performance, at the current stage of their development, is infeasible. Simple examples help us illustrate that current LLM will require fundamental advancements to provide reliable support in team decision-making, especially in safety-critical and time-critical domains. The study is not meant to diminish the value of the remarkable capabilities of LLM, but rather to gain a better understanding of the technology’s appropriate use and the needed additions.

function allocation↗

Data-Driven Prediction and Optimization of Energy Use for Transit Fleets of Electric and ICE Vehicles

Due to the high upfront cost of electric vehicles, many public transit agencies can afford only mixed fleets of internal combustion and electric vehicles. Optimizing the operation of such mixed fleets is challenging because it requires accurate trip-level predictions of electricity and fuel use as well as efficient algorithms for assigning vehicles to transit routes. We present a novel framework for the data-driven prediction of trip-level energy use for mixed-vehicle transit fleets and for the optimization of vehicle assignments, which we evaluate using data collected from the bus fleet of CARTA, the public transit agency of Chattanooga, TN. We first introduce a data collection, storage, and processing framework for system-level and high-frequency vehicle-level transit data, including domain-specific data cleansing methods. We train and evaluate machine learning models for energy prediction, demonstrating that deep neural networks attain the highest accuracy. Based on these predictions, we formulate the problem of minimizing energy use through assigning vehicles to fixed-route transit trips. We propose an optimal integer program as well as efficient heuristic and meta-heuristic algorithms, demonstrating the scalability and performance of these algorithms numerically using the transit network of CARTA.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Homogeneous states in driven granular mixtures: Enskog kinetic theory versus molecular dynamics simulations

The homogeneous state of a binary mixture of smooth inelastic hard disks or spheres is analyzed. The mixture is driven by a thermostat composed by two terms: a stochastic force and a drag force proportional to the particle velocity. The combined action of both forces attempts to model the interaction of the mixture with a bath or surrounding fluid. The problem is studied by means of two independent and complementary routes. First, the Enskog kinetic equation with a Fokker-Planck term describing interactions of particles with thermostat is derived. Then, a scaling solution to the Enskog kinetic equation is proposed where the dependence of the scaled distributions φ{sub i} of each species on the granular temperature occurs not only through the dimensionless velocity c = v/v{sub 0} (v{sub 0} being the thermal velocity) but also through the dimensionless driving force parameters. Approximate forms for φ{sub i} are constructed by considering the leading order in a Sonine polynomial expansion. The ratio of kinetic temperatures T{sub 1}/T{sub 2} and the fourth-degree velocity moments λ{sub 1} and λ{sub 2} (which measure non-Gaussian properties of φ{sub 1} and φ{sub 2}, respectively) are explicitly determined as a function of the mass ratio, size ratio, composition, density, and coefficients of restitution. Second, to assess the reliability of the theoretical results, molecular dynamics simulations of a binary granular mixture of spheres are performed for two values of the coefficient of restitution (α = 0.9 and 0.8) and three different solid volume fractions (ϕ = 0.00785, 0.1, and 0.2). Comparison between kinetic theory and computer simulations for the temperature ratio shows excellent agreement, even for moderate densities and strong dissipation. In the case of the cumulants λ{sub 1} and λ{sub 2}, good agreement is found for the lower densities although significant discrepancies between theory and simulation are observed with increasing density.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Rolling Horizon with K-Position Search Method for Strategic Deconfliction of Package Delivery UAS

In this research, the strategic deconfliction of unmanned aircraft systems for an urban package delivery environment with two depots and multiple drop-off locations is studied. This research aims to formulate a mathematical model to compute both the departure sequence and scheduled time of departure for each unmanned aircraft system at a depot, considering temporal constraints at en-route crossing waypoints and depots for strategic deconfliction. However, the problem formulation results in an NP-hard mixed-integer nonlinear programming problem for the global optimal solution, so instead, a "rolling horizon with𝑘-position search"heuristic method is developed. The simulation studies show that an increase in the value of𝑘(the parameter used to determine the size of the local neighborhood) reduces the average ground delay at the cost of an increase in the computation time for a given problem size. The study also shows an order of magnitude increase in the maximum number of flights scheduled with the integration of rolling horizon (time decomposition) compared to those without the integration of rolling horizon in the heuristic algorithm for a given computation time cut off.

UTM↗

SOFIA's Choice: Automating the Scheduling of Airborne Observations

This paper describes the problem of scheduling observations for an airborne telescope. Given a set of prioritized observations to choose from, and a wide range of complex constraints governing legitimate choices and orderings, how can we efficiently and effectively create a valid flight plan which supports high priority observations? This problem is quite different from scheduling problems which are routinely solved automatically in industry. For instance, the problem requires making choices which lead to other choices later, and contains many interacting complex constraints over both discrete and continuous variables. Furthermore, new types of constraints may be added as the fundamental problem changes. As a result of these features, this problem cannot be solved by traditional scheduling techniques. The problem resembles other problems in NASA and industry, from observation scheduling for rovers and other science instruments to vehicle routing. The remainder of the paper is organized as follows. In 2 we describe the observatory in order to provide some background. In 3 we describe the problem of scheduling a single flight. In 4 we compare flight planning and other scheduling problems and argue that traditional techniques are not sufficient to solve this problem. We also mention similar complex scheduling problems which may benefit from efforts to solve this problem. In 5 we describe an approach for solving this problem based on research into a similar problem, that of scheduling observations for a space-borne probe. In 6 we discuss extensions of the flight planning problem as well as other problems which are similar to flight planning. In 7 we conclude and discuss future work.

Frank, Jeremy↗

ColdRoute: effective routing of cold questions in stack exchange sites

Routing questions in Community Question Answer services such as Stack Exchange sites is a well-studied problem. Yet, cold-start—a phenomena observed when a new question is posted is not well addressed by existing approaches. Additionally, cold questions posted by new askers present significant challenges to state-of-the-art approaches. We propose ColdRoute to address these challenges. ColdRoute is able to handle the task of routing cold questions posted by new or existing askers to matching experts. Specifically, we use Factorization Machines on the one-hot encoding of critical features such as question tags and compare our approach to well-studied techniques such as CQARank and semantic matching (LDA, BoW, and Doc2Vec). Furthermore by using data from eight stack exchange sites, we are able to improve upon the routing metrics (Precision@1, Accuracy, MRR) over the state-of-the-art models such as semantic matching by 159.5, 31.84, and 40.36% for cold questions posted by existing askers, and 123.1, 27.03, and 34.81% for cold questions posted by new askers respectively.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Tuple spaces in hardware for accelerated implicit routing

Organizing and optimizing data objects on networks with support for data migration and failing nodes is a complicated problem to handle as systems grow. The goal of this work is to demonstrate that high levels of speedup can be achieved by moving responsibility for finding, fetching, and staging data into an FPGA-based network card. We present a system for implicit routing of data via FPGA-based network cards. In this system, data structures are requested by name, and the network of FPGAs finds the data within the network and relays the structure to the requester. This is acheived through successive examination of hardware hash tables implemented in the FPGA. By avoiding software stacks between nodes, the data is quickly fetched entirely through FPGA-FPGA interaction. The performance of this system is orders of magnitude faster than software implementations due to the improved speed of the hash tables and lowered latency between the network nodes.

42 ENGINEERING↗

Cooperative Clustering Techniques Applied to Contact Graph Routing

Routing in the space internet has to face many unique challenges - from unplanned disconnections and interruptions to predictable intermittent connectivity due to high network mobility and long propagation delays. NASA’s current approach to such routing is Contact Graph Routing (CGR), using a graph formed of prescheduled communication contacts to compute routes through the network. While this approach manages to tackle issues of connectivity and propagation delays, it is a global approach that requires continuous knowledge of the entire network. In a potential future Solar Space Internet (SSI) such an approach on its own cannot scale to large networks with thousands of members. In this presentation we propose clustering as a solution to CGR scalability. Clustering has been used in many networking problems as a way to subdivide the network and allow for localized routing and better scalability. Using techniques from graph theory and game theory, we explore various existing clustering algorithms and adapt them to the Contact Graph Routing setting. Finally, we propose a way to combine multiple algorithms to create a Delay Tolerant Clustering Protocol.

Yael Kirkpatrick↗

Cooperative Clustering Techniques For Space Network Scalability

Routing in the space internet must face many unique challenges - from unplanned disconnections and interruptions to predictable intermittent connectivity due to high network mobility and long propagation delays. NASA’s current approach to such routing is Contact Graph Routing (CGR), using a graph formed of prescheduled communication contacts to compute routes through the network. While this approach manages to tackle issues of connectivity and propagation delays, it is a global approach that requires continuous knowledge of the entire network. In a potential future Solar Space Internet (SSI) such an approach on its own cannot scale to large networks with thousands of members. In this paper we propose clustering as a solution to CGR scalability. Clustering has been used in many networking problems as a way to subdivide the network and allow for localized routing and better scalability. Using techniques from graph theory and game theory, we explore various existing clustering algorithms and adapt them to the Contact Graph Routing setting. We propose a way to combine multiple algorithms to create a Delay Tolerant Clustering Protocol (DTCP). In addition, we explore the underlying networking mechanisms such as multicast, neighbor discovery, and software defined networking that may be used to enable DTCP.

Delay Tolerant Networking↗

Optimization of Airport Surface Traffic: A Case-Study of Incheon International Airport

This study aims to develop a controllers' decision support tool for departure and surface management of ICN. Airport surface traffic optimization for Incheon International Airport (ICN) in South Korea was studied based on the operational characteristics of ICN and airspace of Korea. For surface traffic optimization, a multiple runway scheduling problem and a taxi scheduling problem were formulated into two Mixed Integer Linear Programming (MILP) optimization models. The Miles-In-Trail (MIT) separation constraint at the departure fix shared by the departure flights from multiple runways and the runway crossing constraints due to the taxi route configuration specific to ICN were incorporated into the runway scheduling and taxiway scheduling problems, respectively. Since the MILP-based optimization model for the multiple runway scheduling problem may be computationally intensive, computation times and delay costs of different solving methods were compared for a practical implementation. This research was a collaboration between Korea Aerospace Research Institute (KARI) and National Aeronautics and Space Administration (NASA).

surface management↗

Optimization of Airport Surface Traffic: A Case-Study of Incheon International Airport

This study aims to develop a controllers decision support tool for departure and surface management of ICN. Airport surface traffic optimization for Incheon International Airport (ICN) in South Korea was studied based on the operational characteristics of ICN and airspace of Korea. For surface traffic optimization, a multiple runway scheduling problem and a taxi scheduling problem were formulated into two Mixed Integer Linear Programming (MILP) optimization models. The Miles-In-Trail (MIT) separation constraint at the departure fix shared by the departure flights from multiple runways and the runway crossing constraints due to the taxi route configuration specific to ICN were incorporated into the runway scheduling and taxiway scheduling problems, respectively. Since the MILP-based optimization model for the multiple runway scheduling problem may be computationally intensive, computation times and delay costs of different solving methods were compared for a practical implementation. This research was a collaboration between Korea Aerospace Research Institute (KARI) and National Aeronautics and Space Administration (NASA).

taxi scheduler↗