Search NASA⌕ Search

SEARCH · Search NASA

Results for “route planning”

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 19 records

Region based route planning - Multi-abstraction route planning based on intermediate level vision processing

Intermediate and high level processing operations are performed on vision data for the organization of images into more meaningful, higher-level topological representations by means of a region-based route planner (RBRP). The RBRP operates in terrain scenarios where some or most of the terrain is occluded, proceeding without a priori maps on the basis of two-dimensional representations and gradient-and-roughness information. Route planning is accomplished by three successive abstractions and yields a detailed point-by-point path by searching only within the boundaries of relatively small regions.

Doshi, Rajkumar S.↗

Delivery drone route planning over a battery swapping network

Many enterprises invest on drone delivery research and development to drop off packages at consumers’ doorsteps in a matter of minutes. We study delivery drone route planning over a battery swapping network allowing farther reach by penetrating current battery capacity constraints. A mixed-integer nonlinear programming model is created to plan efficient drone routing over the swapping machines by minimizing the delivery lead time. We develop an exact solution method, evaluate its performance, and compare it with a straightforward nonlinear solver application. A case study highlights the applicability of the model. Data and source code to the solver are publicly shared.

drone battery swapping↗

Route planning in a four-dimensional environment

Robots must be able to function in the real world. The real world involves processes and agents that move independently of the actions of the robot, sometimes in an unpredictable manner. A real-time integrated route planning and spatial representation system for planning routes through dynamic domains is presented. The system will find the safest most efficient route through space-time as described by a set of user defined evaluation functions. Because the route planning algorthims is highly parallel and can run on an SIMD machine in O(p) time (p is the length of a path), the system will find real-time paths through unpredictable domains when used in an incremental mode. Spatial representation, an SIMD algorithm for route planning in a dynamic domain, and results from an implementation on a traditional computer architecture are discussed.

Slack, M. G.↗

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↗

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.↗

Smart CO2 Transport-Route Planning Tool

NETL has developed the Smart CO2 Transport-Route Planning Tool to help inform energy transport planning and development. The stand-alone, open-source tool applies data-driven, geospatial and machine-learning informed logic to identify potential routes or evaluate existing corridors based on current legislation, best construction practices, and more. Underpinning the interactive tool, is NETL’s CO2 Transport Planning Database (https://edx.netl.doe.gov/dataset/ccs-pipeline-route-planning-database-v1). This geospatial resource contains more than 70 gigabytes of data representing more than 60 critical factors for the spatial routing of CO2 transport, including land use requirements, existing infrastructure, high consequence areas, and natural hazards.

Bipartisan Infrastructure Law↗

Energy-Aware Route Planning with RouteE Compass

This poster introduces RouteE Compass, a new tool that advances sustainable transportation by enabling energy-aware route planning across diverse vehicle types and large-scale road networks. By addressing practical trade-offs between energy consumption, travel time, and economic cost, RouteE Compass fills critical gaps in traditional routing methods, which often lack the flexibility to prioritize energy directly. The tool's scalability and high-performance computing capabilities allow for national-scale analyses, offering actionable insights for fleet operators, transit agencies, and researchers. As an open-source, extensible platform, RouteE Compass empowers ongoing research and innovation in energy-aware routing, supporting the broader goals of reducing emissions and enhancing transportation sustainability.

ADVANCED PROPULSION SYSTEMS,DIRECT ENERGY CONVERSI↗

A Geodatabase Designed to Inform and Support Safe CO2 Transport-Route Planning

The National Energy Technology Laboratory developed the Carbon Capture and Storage (CCS) Pipeline Route Planning Database to inform safe and sustainable CO2 transport planning in support of decarbonization efforts. This comprehensive Esri Geodatabase contains over 90 GBs of data and 60+ spatial layers representing key considerations including natural hazards, infrastructure, energy, and social justice. Leveraging ArcGIS Pro, nationwide raster, and vector datasets containing millions of features were processed to be easily digestible for users and complex modeling software.

Romeo, Lucy↗

Smart CO2 Transport-Route Planning Tool: Providing Data and Insights for Accelerating Carbon Transport & Storage Deployment

Overview presentation given at the 2024 FECM / NETL Carbon Management Research Project Review Meeting on NETL's Bipartisan Infrastructure Law-funded Smart CO2 Transport-Route Planning Tool and associated geodatabase. This machine learning informed, data-driven public resource was designed to inform regulators, industry, and researchers plan and develop safe and efficient transport routes across the country.

Romeo, Lucy↗

PDPTW-DB: MILP-Based Offline Route Planning for PDPTW with Driver Breaks

The Pickup and Delivery Problem with Time Windows (PDPTW) involves optimizing routes for vehicles to meet pickup and delivery requests within specific time constraints, a challenge commonly faced in logistics and transportation. Microtransit, a flexible and demand-responsive service using smaller vehicles within defined zones, can be effectively modeled as a PDPTW. Yet, the need for driver breaks—a key human constraint—is frequently overlooked in PDPTW solutions, despite being necessary for regulatory compliance. This study presents a novel mixed-integer linear programming formulation for the Pickup and Delivery Problem with Time Windows and Driver Breaks (PDPTW-DB). To the best of our knowledge this formulation is the first to consider mandatory periodic driver breaks within optimized Microtransit routes. The proposed model incorporates regulatory compliant break scheduling directly within the vehicle routing optimization framework. By considering driver break requirements as an integral component of the optimization process, rather than as a post-processing step, the model enables the generation of routes that respect hours of service regulations while minimizing operational costs. This integrated approach facilitates the generation of schedules that are operationally efficient and prioritize driver welfare through driver breaks. We work with a public transit agency from the southern USA, and highlight the specific nuances of driver break optimization, and present a Pickup and Delivery Problem with Time Windows formulation for optimizing Microtransit operations and scheduling driver breaks. We validate our approach using real-world data from the transit agency. Our results validate our formulation in producing cost-effective, and regulation-compliant solutions.

Applied Computing, Transportation↗

Application of fuel/time minimization techniques to route planning and trajectory optimization

Rising fuel costs combined with other economic pressures have resulted in industry requirements for more efficient air traffic control and airborne operations. NASA has responded with an on-going research program to investigate the requirements and benefits of using new airborne guidance and pilot procedures that are compatible with advanced air traffic control systems and that will result in more fuel efficient flight. The results of flight testing an airborne computer algorithm designed to provide either open-loop or closed-loop guidance for fuel efficient descents while satisfying time constraints imposed by the air traffic control system is summarized. Some of the potential cost and fuel savings that are obtained with sophisticated vertical path optimization capabilities are described.

Knox, C. E.↗

Improved Results for Route Planning in Stochastic Transportation Networks

In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times are not determined by a fixed schedule but instead may be random. the problem requires more than standard shortest path techniques. In recent work, Datar and Ranade provide algorithms in the case where bus arrivals are assumed to be independent and exponentially distributed. We offer solutions to two important generalizations of the problem, answering open questions posed by Datar and Ranade. First, we provide a polynomial time algorithm for a much wider class of arrival distributions, namely those with increasing failure rate. This class includes not only exponential distributions but also uniform, normal, and gamma distributions. Second, in the case where bus arrival times are independent and geometric discrete random variable,. we provide an algorithm for transportation networks of buses and trains, where trains run according to a fixed schedule.

Boyan, Justin↗

Interfaces For Planning Vehicle Routes

A system for producing vehicle routes such as aircraft flight plans in the presence of weather and other hazards defines static and moving hazards with polygons drawn on a display containing graphic hazard regions. Different hazard types and intensities are displayed differently. Both lateral and vertical geographic depictions are displayed, and hazards can be displayed temporally as well. Users input information and thresholds for hazards.

Thea Lynn Feyereisen↗

Delay Banking for Managing Air Traffic

Delay banking has been invented to enhance air-traffic management in a way that would increase the degree of fairness in assigning arrival, departure, and en-route delays and trajectory deviations to aircraft impacted by congestion in the national airspace system. In delay banking, an aircraft operator (airline, military, general aviation, etc.) would be assigned a numerical credit when any of their flights are delayed because of an air-traffic flow restriction. The operator could subsequently bid against other operators competing for access to congested airspace to utilize part or all of its accumulated credit. Operators utilize credits to obtain higher priority for the same flight, or other flights operating at the same time, or later, in the same airspace, or elsewhere. Operators could also trade delay credits, according to market rules that would be determined by stakeholders in the national airspace system. Delay banking would be administered by an independent third party who would use delay banking automation to continually monitor flights, allocate delay credits, maintain accounts of delay credits for participating airlines, mediate bidding and the consumption of credits of winning bidders, analyze potential transfers of credits within and between operators, implement accepted transfers, and ensure fair treatment of all participating operators. A flow restriction can manifest itself in the form of a delay in assigned takeoff time, a reduction in assigned airspeed, a change in the position for the aircraft in a queue of all aircraft in a common stream of traffic (e.g., similar route), a change in the planned altitude profile for an aircraft, or change in the planned route for the aircraft. Flow restrictions are typically imposed to mitigate traffic congestion at an airport or in a region of airspace, particularly congestion due to inclement weather, or the unavailability of a runway or region of airspace. A delay credit would be allocated to an operator of a flight that has accepted, or upon which was imposed, a flow restriction. The amount of the credit would increase with the amount of delay caused by the flow restriction, the exact amount depending on which of several candidate formulas is eventually chosen. For example, according to one formula, there would be no credit for a delay smaller than some threshold value (e.g., 30 seconds) and the amount of the credit for a longer delay would be set at the amount of the delay minus the threshold value. Optionally, the value of a delay credit could be made to decay with time according to a suitable formula (e.g., an exponential decay). Also, optionally, a transaction charge could be assessed against the value of a delay credit that an operator used on a flight different from the one for which the delay originated or that was traded with a different operator. The delay credits accumulated by a given airline could be utilized in various ways. For example, an operator could enter a bid for priority handling in a new flow restriction that impacts one or more of the operator s flights; if the bid were unsuccessful, all or a portion of the credit would be returned to the bidder. If the bid pertained to a single aircraft that was in a queue, delay credits could be consumed in moving the aircraft to an earlier position within the queue. In the case of a flow restriction involving a choice of alternate routes, planned altitude profile, aircraft spacing, or other non-queue flow restrictions, delay credits could be used to bid for an alternative assignment.

Green, Steve↗