Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 1,531 records · Page 85

Avoiding Braess' Paradox Through Collective Intelligence

In an Ideal Shortest Path Algorithm (ISPA), at each moment each router in a network sends all of its traffic down the path that will incur the lowest cost to that traffic. In the limit of an infinitesimally small amount of traffic for a particular router, its routing that traffic via an ISPA is optimal, as far as cost incurred by that traffic is concerned. We demonstrate though that in many cases, due to the side-effects of one router's actions on another routers performance, having routers use ISPA's is suboptimal as far as global aggregate cost is concerned, even when only used to route infinitesimally small amounts of traffic. As a particular example of this we present an instance of Braess' paradox for ISPA'S, in which adding new links to a network decreases overall throughput. We also demonstrate that load-balancing, in which the routing decisions are made to optimize the global cost incurred by all traffic currently being routed, is suboptimal as far as global cost averaged across time is concerned. This is also due to "side-effects", in this case of current routing decision on future traffic. The theory of COllective INtelligence (COIN) is concerned precisely with the issue of avoiding such deleterious side-effects. We present key concepts from that theory and use them to derive an idealized algorithm whose performance is better than that of the ISPA, even in the infinitesimal limit. We present experiments verifying this, and also showing that a machine-learning-based version of this COIN algorithm in which costs are only imprecisely estimated (a version potentially applicable in the real world) also outperforms the ISPA, despite having access to less information than does the ISPA. In particular, this COIN algorithm avoids Braess' paradox.

Wolpert , David H.↗

Mobile Router Technology Development

Cisco Systems and NASA have been performing joint research on mobile routing technology under a NASA Space Act Agreement. Cisco developed mobile router technology and provided that technology to NASA for applications to aeronautic and space-based missions. NASA has performed stringent performance testing of the mobile router, including the interaction of routing and transport-level protocols. This paper describes mobile routing, the mobile router, and some key configuration parameters. In addition, the paper describes the mobile routing test network and test results documenting the performance of transport protocols in dynamic routing environments.

Ivancic, William D.↗

Method and apparatus for eliminating unsuccessful tries in a search tree

A circuit switching system in an M-ary, n-cube connected network completes a best-first path from an originating node to a destination node by latching valid legs of the path as the path is being sought out. Each network node is provided with a routing hyperswitch sub-network, (HSN) connected between that node and bidirectional high capacity communication channels of the n-cube network. The sub-networks are all controlled by routing algorithms which respond to message identification headings (headers) on messages to be routed along one or more routing legs. The header includes information embedded therein which is interpreted by each sub-network to route and historically update the header. A logic circuit, available at every node, implements the algorithm and automatically forwards or back-tracks the header in the network legs of various paths until a completed path is latched.

Peterson, John C.↗

Wireless Avionics Packet to Support Fault Tolerance for Flight Applications

In this protocol and packet format, data traffic is monitored by all network interfaces to determine the health of transmitter and subsystems. When failures are detected, the network inter face applies its recover y policies to provide continued service despite the presence of faults. The protocol, packet format, and inter face are independent of the data link technology used. The current demonstration system supports both commercial off-the-shelf wireless connections and wired Ethernet connections. Other technologies such as 1553 or serial data links can be used for the network backbone. The Wireless Avionics packet is divided into three parts: a header, a data payload, and a checksum. The header has the following components: magic number, version, quality of service, time to live, sending transceiver, function code, payload length, source Application Data Interface (ADI) address, destination ADI address, sending node address, target node address, and a sequence number. The magic number is used to identify WAV packets, and allows the packet format to be updated in the future. The quality of service field allows routing decisions to be made based on this value and can be used to route critical management data over a dedicated channel. The time to live value is used to discard misrouted packets while the source transceiver is updated at each hop. This information is used to monitor the health of each transceiver in the network. To identify the packet type, the function code is used. Besides having a regular data packet, the system supports diagnostic packets for fault detection and isolation. The payload length specifies the number of data bytes in the payload, and this supports variable-length packets in the network. The source ADI is the address of the originating interface. This can be used by the destination application to identify the originating source of the packet where the address consists of a subnet, subsystem class within the subnet, a subsystem unit, and the local ADI number. The destination ADI is used to route the packet to its ultimate destination. At each hop, the sending interface uses the destination address to determine the next node for the data. The sending node is the node address of the interface that is broadcasting the packet. This field is used to determine the health of the subsystem that is sending the packet. In the case of a packet that traverses several intermediate nodes, it may be the node address of the intermediate node. The target node is the node address of the next hop for the packet. It may be an intermediate node, or the final destination for the packet. The sequence number is used to identify duplicate packets. Because each interface has multiple transceivers, the same packet will appear at both receivers. The sequence number allows the interface to correlate the reception and forward a single, unique packet for additional processing. The subnet field allows data traffic to be partitioned into segregated local networks to support large networks while keeping each subnet at a manageable size. This also keeps the routing table small enough so routing can be done by a simple table lookup in an FPGA device. The subsystem class identifies members of a set of redundant subsystems, and, in a hot standby configuration, all members of the subsystem class will receive the data packets. Only the active subsystem will generate data traffic. Specific units in a class of redundant units can be identified and, if the hot standby configuration is not used, packets will be directed to a specific subsystem unit.

Block, Gary L.↗

MMIC Amplifiers and Wafer Probes for 350 to 500 GHz

A wireless avionics interface exploits the constrained nature of data networks in flight systems to use a lightweight routing method. This simplified routing means that a processor is not required, and the logic can be implemented as an intellectual property (IP) core in a field-programmable gate array (FPGA). The FPGA can be shared with the flight subsystem application. In addition, the router is aware of redundant subsystems, and can be configured to provide hot standby support as part of the interface. This simplifies implementation of flight applications requiring hot stand - by support. When a valid inbound packet is received from the network, the destination node address is inspected to determine whether the packet is to be processed by this node. Each node has routing tables for the next neighbor node to guide the packet to the destination node. If it is to be processed, the final packet destination is inspected to determine whether the packet is to be forwarded to another node, or routed locally. If the packet is local, it is sent to an Applications Data Interface (ADI), which is attached to a local flight application. Under this scheme, an interface can support many applications in a subsystem supporting a high level of subsystem integration. If the packet is to be forwarded to another node, it is sent to the outbound packet router. The outbound packet router receives packets from an ADI or a packet to be forwarded. It then uses a lookup table to determine the next destination for the packet. Upon detecting a remote subsystem failure, the routing table can be updated to autonomously bypass the failed subsystem.

Samoska, Lorene A.↗

Cruise-Efficient Short Takeoff and Landing (CESTOL): Potential Impact on Air Traffic Operations

The National Aeronautics and Space Administration (NASA) is investigating technological and operational concepts for introducing Cruise-Efficient Short Takeoff and Landing (CESTOL) aircraft into a future US National Airspace System (NAS) civil aviation environment. CESTOL is an aircraft design concept for future use to increase capacity and reduce emissions. CESTOL provides very flexible takeoff, climb, descent and landing performance capabilities and a high-speed cruise capability. In support of NASA, this study is a preliminary examination of the potential operational impact of CESTOL on airport and airspace capacity and delay. The study examines operational impacts at a subject site, Newark Liberty Intemational Airport (KEWR), New Jersey. The study extends these KEWR results to estimate potential impacts on NAS-wide network traffic operations due to the introduction of CESTOL at selected major airports. These are the 34 domestic airports identified in the Federal Aviation Administration's Operational Evolution Plan (OEP). The analysis process uses two fast-time simulation tools to separately model local and NAS-wide air traffic operations using predicted flight schedules for a 24-hour study period in 2016. These tools are the Sen sis AvTerminal model and NASA's Airspace Concept Evaluation System (ACES). We use both to simulate conventional-aircraft-only and CESTOL-mixed-with-conventional-aircraft operations. Both tools apply 4-dimension trajectory modeling to simulate individual flight movement. The study applies AvTerminal to model traffic operations and procedures for en route and terminal arrival and departures to and from KEWR. These AvTerminal applications model existing arrival and departure routes and profiles and runway use configurations, with the assumption jet-powered, large-sized civil CESTOL aircraft use a short runway and standard turboprop arrival and departure procedures. With these rules, the conventional jet and CESTOL aircraft are procedurally separated from each other geographically and in altitude during tenninal airspace approach and departure operations, and each use a different arrival runway. AvTeminal implements its unique Focal-point Scheduling Process to sequence, space and delay aircraft to resolve spacing and overtake conflicts among flights in the airspace and airport system serving KEWR. This Process effectively models integrated arrival and departure operations. AvTerminal assesses acceptance rates and delay magnitude and causality at selected locations, including en route outer boundary fixes, tenninal airspace arrival and departure boundary fixes, terminal airspace arrival merge and departure diverge fixes, and runway landing and takeoff runways. The analysis compares the resulting capacity impacts, flight delays and delay sources between CESTOL and conventional KEWR operations. AvTerminal quantitative results showed that CESTOL has significant capability to increase airport arrival acceptance rates (35-40% at KEWR) by taking advantage of otherwise underused airspace and runways where available. The study extrapolates the AvTerminal-derived KEWR peak arrival and departure acceptance rates to estimate capacity parameter values for each of the OEP airports in the ACES modeling of traffic through the entire NAS network. The extrapolations of acceptance rates allow full, partial or no achievement of CESTOL capacity gains at an OEP airport as determined by assessments of the degree to which local procedures allow leveraging of CESTOL capabilities. These assessments consider each OEP airport's runway geometries, runway system configurations, airport and airspace operations, and potential CESTOL traffic loadings. The ACES modeling, simulates airport and airspace spacing constraints imposed by airport runway system, terminal and en route air traffic control and traffic flow management operations using airport acceptance rates representing conventional-aircraft-only and CESTOL-mixed operations. CEOL aircraft are assumed to have Mach 0.8, and alternatively Mach 0.7, cruise speeds to examine compatibility with conventional aircraft operations in common airspace. The ACES results provides estimates of CESTOL delay impact NAS-wide and at OEP airports due to changes in OEP airport acceptance rates and changes in en route airspace potential conflict rates. Preliminary results show meaningful nationwide delay reductions (20%) due to CESTOL operations at 34 major domestic airports.

Couluris, G. J.↗

Traverse Planning Experiments for Future Planetary Surface Exploration

This paper describes the results of a recent (July-August 2010 and July 2011) planetary surface traverse planning experiment. The purpose of this experiment was to gather data relevant to robotically repositioning surface assets used for planetary surface exploration. This is a scenario currently being considered for future human exploration missions to the Moon and Mars. The specific scenario selected was a robotic traverse on the lunar surface from an outpost at Shackleton Crater to the Malapert Massif. As these are exploration scenarios, the route will not have been previously traversed and the only pre-traverse data sets available will be remote (orbital) observations. Devon Island was selected as an analog location where a traverse route of significant length could be planned and then traveled. During the first half of 2010, a team of engineers and scientists who had never been to Devon Island used remote sensing data comparable to that which is likely to be available for the Malapert region (eg., 2-meter/pixel imagery, 10-meter interval topographic maps and associated digital elevation models, etc.) to plan a 17-kilometer (km) traverse. Surface-level imagery data was then gathered on-site that was provided to the planning team. This team then assessed whether the route was actually traversable or not. Lessons learned during the 2010 experiment were then used in a second experiment in 2011 for which a much longer traverse (85 km) was planned and additional surface-level imagery different from that gathered in 2010 was obtained for a comparative analysis. This paper will describe the route planning techniques used, the data sets available to the route planners and the lessons learned from the two traverses planned and carried out on Devon Island.

Hoffman, S. J.↗

Comparison of Controller and Flight Deck Algorithm Performance During Interval Management with Dynamic Arrival Trees (STARS)

Managing the interval between arrival aircraft is a major part of the en route and TRACON controller s job. In an effort to reduce controller workload and low altitude vectoring, algorithms have been developed to allow pilots to take responsibility for, achieve and maintain proper spacing. Additionally, algorithms have been developed to create dynamic weather-free arrival routes in the presence of convective weather. In a recent study we examined an algorithm to handle dynamic re-routing in the presence of convective weather and two distinct spacing algorithms. The spacing algorithms originated from different core algorithms; both were enhanced with trajectory intent data for the study. These two algorithms were used simultaneously in a human-in-the-loop (HITL) simulation where pilots performed weather-impacted arrival operations into Louisville International Airport while also performing interval management (IM) on some trials. The controllers retained responsibility for separation and for managing the en route airspace and some trials managing IM. The goal was a stress test of dynamic arrival algorithms with ground and airborne spacing concepts. The flight deck spacing algorithms or controller managed spacing not only had to be robust to the dynamic nature of aircraft re-routing around weather but also had to be compatible with two alternative algorithms for achieving the spacing goal. Flight deck interval management spacing in this simulation provided a clear reduction in controller workload relative to when controllers were responsible for spacing the aircraft. At the same time, spacing was much less variable with the flight deck automated spacing. Even though the approaches taken by the two spacing algorithms to achieve the interval management goals were slightly different they seem to be simpatico in achieving the interval management goal of 130 sec by the TRACON boundary.

Battiste, Vernol↗

Method and System for Air Traffic Rerouting for Airspace Constraint Resolution

A dynamic constraint avoidance route system automatically analyzes routes of aircraft flying, or to be flown, in or near constraint regions and attempts to find more time and fuel efficient reroutes around current and predicted constraints. The dynamic constraint avoidance route system continuously analyzes all flight routes and provides reroute advisories that are dynamically updated in real time. The dynamic constraint avoidance route system includes a graphical user interface that allows users to visualize, evaluate, modify if necessary, and implement proposed reroutes.

Sheth, Kapil S.↗

Precision Arrival Scheduling for Tactical Reconfiguration

This research adapts the concept of precision arrival scheduling to accommodate reconfiguration operations between two sets of fixed arrival routes modeled for Chicago O'Hare International Airport (ORD). Integrated fixed path routing from en-route to runways was modeled for ORD's top two peak traffic configurations, as well as transition routing between the two configurations. A first-come-first-served multi-point scheduler was adapted to the reconfiguration problem by prioritizing the rescheduling of aircraft within the terminal airspace at the time of reconfiguration notification. Arrival rescheduling was then tested for a range of arrival rates and reconfiguration notification lead-times in fasttime simulation. Reconfigurations with lead-times as short as 10 minutes at a nominal static configuration arrival rate (~25 arrivals per quarter hour) could be accommodated with little impact to throughput. However, as lead-time shortened below 25 minutes, individual aircraft efficiency quickly degraded due to extra flight time at lower altitude and speed. In general, first-come-first-served arrival scheduling on fixed routing for this sample reconfiguration problem is promising if at least 10-15 minutes lead-time is given before the reconfiguration is in effect.

airport reconfiguration↗

In-Flight Evaluation of the Traffic Aware Planner on the NASA HU-25A Guardian Aircraft

NASA’s Traffic Aware Planner (TAP) software is a research-prototype decision support tool that provides pilots with time- and fuel-saving route recommendations that optimize their current trajectory. The software runs on a first-of-a-kind system architecture onboard three aircraft in revenue service conducting operational evaluations with a major domestic airline. Therefore, significant NASA-internal testing is required prior to releasing the software to the partner airline. This paper describes a flight test plan that exercises the functionality of the TAP software in a representative operational environment, describes the system architecture developed and implemented for the NASA Langley HU-25A Guardian aircraft to support the test objectives, presents outcomes of the flight test campaign, and discusses use cases that demonstrate the value of flight testing for this activity.Research into flight path optimization of transport aircraft conducted by the National Aeronautics and SpaceAdministration (NASA) has produced an operational concept known as Traffic Aware Strategic Aircrew Requests(TASAR) [1, 2]. This near-term concept [3] provides the aircrew with a flight deck decision support tool known asthe Traffic Aware Planner (TAP). The TAP software leverages a growing number of information sources on the flightdeck to make time- and fuel-saving route optimization recommendations to the aircrew while en route. The aircrewcan then use the suggestions provided by the tool to make route change requests with a greater likelihood of acceptanceby air traffic control (ATC). Since TASAR is a concept intended for the current operational environment, it isintentionally designed to have no safety-critical impact or require any changes to current Federal AviationAdministration (FAA) rules and procedures [4, 5].The research prototype TAP system [6–8], explained further in Section III.C, continually incorporates up-to-dateaircraft state data from onboard avionics, as well as the latest position of surrounding traffic, the most recent windforecast, and the most recent convective weather forecast, in order to calculate candidate trajectory modifications thatimprove upon the current active route. These trajectories account for user-selectable objective functions [3] of reducedfuel burn, reduced flight time, or an airline-derived combination of factors known as trip cost. Previous analyses andsimulations have estimated substantial savings for airlines employing this technique within the U.S. National AirspaceSystem (NAS) [9–11]. Operational evaluations with Alaska Airlines seek to validate these projected benefits usingmeasured data while simultaneously providing benefits to the airline [12, 13].The TAP software has undergone a number of human-in-the-loop simulations [14] and flight test activities[15–17] in order to validate the operational concept, evaluate human factors considerations (e.g., workload, usability,distraction, etc.), and to assess the ability of the software to function in a representative operational environment (e.g.,connected to live avionics data, using in-flight internet connectivity, etc.). However, these simulations and flight testcampaigns did not account for the hardware architecture implemented on the three aircraft for Alaska Airlines’operational evaluations of the TAP software. Therefore, a need was identified to thoroughly test the functionality ofthe software in a similar hardware architecture to that of the partner airline’s aircraft. Information regarding testapparatus and environments used to evaluate TAP prior to testing on the HU-25A can be found in reference [18].A campaign of flight trials on a NASA aircraft, the HU-25A Guardian, was conducted to ensure that the researchprototype TAP system functions well in a configuration similar to the Alaska Airlines aircraft prior to deployment.This airborne, networked environment enables an assessment of the operational factors unique to the flight environment. Additionally, this activity evaluated the effectiveness and benefit of new TAP functionality andoperation in a relevant flight environment while allowing the rapid prototyping of new concepts and features.This paper is organized as follows: Section II discusses the details of the flight test plan, flight profiles, and theduties of personnel involved with conducting flight operations. Section III describes the test platform, avionicsequipage, and system architecture. Section IV presents a discussion of results, and Section V contains concludingremarks.

Underwood, Matthew C.↗

Using Machine-Learning to Dynamically Generate Operationally Acceptable Strategic Reroute Options

The newly developed Trajectory Option Set (TOS), a preference-weighted set of alternative routes submitted by flight operators, is a capability in the U.S. traffic flow management system that enables automated trajectory negotiation between flight operators and Air Navigation Service Providers. The objective of this paper is to describe and demonstrate an approach for automatically generating pre-departure and airborne TOSs that have a high probability of operational acceptance. The approach uses hierarchical clustering of historical route data to identify route candidates. The probability of operational acceptance is then estimated using predictors trained on historical flight plan amendment data using supervised machine learning algorithms, allowing the routes with highest probability of operational acceptance to be selected for the TOS. Features used describe historical route usage, difference in flight time and downstream demand to capacity imbalance. A random forest was found to be the best performing algorithm for learning operational acceptability, with a model accuracy of 0.96. The approach is demonstrated for an historical pre-departure flight from Dallas/Fort Worth International Airport to Newark Liberty International Airport.

Evans, Antony↗

Using Machine-Learning to Dynamically Generate Operationally Acceptable Strategic Reroute Options

The newly developed Trajectory Option Set (TOS), a preference-weighted set of alternative routes submitted by flight operators, is a capability in the U.S. traffic flow management system that enables automated trajectory negotiation between flight operators and Air Navigation Service Providers. The objective of this paper is to describe and demonstrate an approach for automatically generating pre-departure and airborne TOSs that have a high probability of operational acceptance. The approach uses hierarchical clustering of historical route data to identify route candidates. The probability of operational acceptance is then estimated using predictors trained on historical flight plan amendment data using supervised machine learning algorithms, allowing the routes with highest probability of operational acceptance to be selected for the TOS. Features used describe historical route usage, difference in flight time and downstream demand to capacity imbalance. A random forest was found to be the best performing algorithm for learning operational acceptability, with a model accuracy of 0.96. The approach is demonstrated for an historical pre-departure flight from Dallas/Fort Worth International Airport to Newark Liberty International Airport.

Evans, Antony↗

Adaptive powertrain control for plugin hybrid electric vehicles

A powertrain control system for a plugin hybrid electric vehicle. The system comprises an adaptive charge sustaining controller; at least one internal data source connected to the adaptive charge sustaining controller; and a memory connected to the adaptive charge sustaining controller for storing data generated by the at least one internal data source. The adaptive charge sustaining controller is operable to select an operating mode of the vehicle's powertrain along a given route based on programming generated from data stored in the memory associated with that route. Further described is a method of adaptively controlling operation of a plugin hybrid electric vehicle powertrain comprising identifying a route being traveled, activating stored adaptive charge sustaining mode programming for the identified route and controlling operation of the powertrain along the identified route by selecting from a plurality of operational modes based on the stored adaptive charge sustaining mode programming.

33 ADVANCED PROPULSION SYSTEMS↗

Collectively loading programs in a multiple program multiple data environment

Techniques are disclosed for loading programs efficiently in a parallel computing system. In one embodiment, nodes of the parallel computing system receive a load description file which indicates, for each program of a multiple program multiple data (MPMD) job, nodes which are to load the program. The nodes determine, using collective operations, a total number of programs to load and a number of programs to load in parallel. The nodes further generate a class route for each program to be loaded in parallel, where the class route generated for a particular program includes only those nodes on which the program needs to be loaded. For each class route, a node is selected using a collective operation to be a load leader which accesses a file system to load the program associated with a class route and broadcasts the program via the class route to other nodes which require the program.

97 MATHEMATICS AND COMPUTING↗

Collectively loading programs in a multiple program multiple data environment

Techniques are disclosed for loading programs efficiently in a parallel computing system. In one embodiment, nodes of the parallel computing system receive a load description file which indicates, for each program of a multiple program multiple data (MPMD) job, nodes which are to load the program. The nodes determine, using collective operations, a total number of programs to load and a number of programs to load in parallel. The nodes further generate a class route for each program to be loaded in parallel, where the class route generated for a particular program includes only those nodes on which the program needs to be loaded. For each class route, a node is selected using a collective operation to be a load leader which accesses a file system to load the program associated with a class route and broadcasts the program via the class route to other nodes which require the program.

97 MATHEMATICS AND COMPUTING↗

Connected and automated vehicles, driving systems, and control logic for info-rich eco-autonomous driving

A method for controlling automated driving operations of a vehicle includes determining vehicle origin and destination data, and generating a graphical representation of a road network with multiple candidate routes between the vehicle's origin and destination. Road-level data, including speed, turn angle, and/or gradient data, is received for each candidate route, and respective total energy uses are estimated for the vehicle to traverse across the candidate routes. Multiple candidate driving strategies, each having respective speed and acceleration profiles, are determined for the candidate route with the lowest estimated total energy use. An optimal candidate driving strategy is selected through a cost evaluation of the associated speed and acceleration profiles and forward movement simulations of the vehicle over a prediction horizon. Command signals are transmitted to the vehicle's steering and/or powertrain systems to execute control operations based on the optimal driving strategy and the candidate route with the lowest energy use.

Zhao, Junfeng↗

The Strategic Benefit of Self Shielded Boxes for Storage and Disposal of Metallic Uranic Material-18141

Sellafield Ltd, on behalf of the Nuclear Decommissioning Authority (NDA), is responsible for the management of a number of facilities whose inventories include a range of metallic uranic material. Additional fuel and fuel bearing materials exist in the NDA estate, some of which are similar to the Sellafield-managed inventory and others present different management challenges. Whilst UK Government policy directs that some of these materials are assets and are therefore managed with eventual future use in mind, there remains a large quantity of material, principally either out-of-scope for reprocessing or which derives from legacy facilities, which is likely to be disposed of to a future Geological Disposal Facility (GDF). The majority of this material is stored under wet conditions to facilitate dose shielding and heat dissipation and will therefore require removal from wet storage, consolidation and conditioning, prior to transfer to GDF. In order to accelerate high hazard and risk reduction by sooner retrieval of legacy material from wetted storage, one of the legacy storage facilities has led technical work to develop the design of Self Shielded Boxes (SSBs) and to substantiate their use for interim storage of the materials in question. Use of the SSBs would represent a change of strategy on the Sellafield Site: historically, timescales for retrieval of material have been reliant upon a waste treatment and storage/disposal route being available. SSBs provide the opportunity to retrieve uranic materials from aging legacy storage facilities for immediate buffer storage, by decoupling the timing of retrieval from the availability of an onward route. An understanding was required of the scope for defining optimal routes for each metallic uranic fuel and fuel bearing material group for safe transport and storage commensurate with current final disposal assumptions and risks, taking into account international best practice. A study is underway to understand options for transfer of material into SSBs, buffer/interim storage locations, treatment/conditioning processes and transport to the GDF. This work forms the basis of a prioritised road-map for the development of routes for study material groups aligned with ongoing and existing planned technical work, which is a pre-requisite to strategy development. The ultimate output of the study will be identification of full life cycle management strategies for metallic uranic material from an enterprise perspective. The combination of this strategic work and ongoing technical work will underpin a series of decisions to divert sub-groups of uranic material away from currently assumed baseline routes in support of earliest practicable hazard and risk reduction. Hence, each decision will reduce the scope of a placeholder future uranic fuel treatment capability, which will diminish the associated British Pound 1 bn capital cost. To date, a technical case for interim storage of uranic material in SSBs has been substantiated for around two thirds of the study materials. The requirement for a new strategy at Sellafield was driven by technical development of SSBs in response to the needs of one programme, but this prompted the study into the potential utilisation of SSBs in order to derive benefit for the wider enterprise and across the NDA estate. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗