SEARCH · Engineering Papers

Results for “performance bound”

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.

SourceResearch connectionFrom yearThrough year

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

At least 91 records · Page 5

All sources NASA NTRS DOE OSTI

DOE OSTI2025

Understanding the Conductivity and Transference Trade-Off in Polymer Electrolytes Using a Robeson-Inspired Upper Bound

The development of high-performance electrolytes is crucial for advancing next-generation lithium and sodium battery technologies. Since the cation is the working ion in both technologies, electrolytes exhibiting the rapid cation transport are essential for making progress. Pathways to optimize electrolytes are unclear due to the inherent trade-off between conductivity and cation transference. While this trade-off is sometimes recognized, there are no well-accepted methodologies for quantifying it. Inspired by the Robeson upper bound for the permeability–selectivity trade-off in gas separation membranes, we propose an approach for quantifying the trade-off in electrolytes using Newman’s concentrated solution theory. We suggest calling this the Newman upper bound. By analyzing published data from 30 polymer electrolytes containing univalent lithium and sodium salts, the Newman upper bound is expressed as κ = 2.0(1/ρ+ – 1) where κ (mS/cm) is conductivity and ρ+ is the current fraction measured in a symmetric cell as first described by Bruce et al. [J. Electroanal. Chem. Interfacial Electrochem. 1987, 225 (1), 1–17]. This formulation of the upper bound introduces a critical guiding metric for designing next-generation polymer electrolytes; it highlights factors underlying the trade-off, including the salt diffusion coefficient (D), cation transference number relative to solvent velocity ( t + 0 ), and thermodynamic factor (1 + (d lnγ+–)/(d lnm)), where γ+– is the mean molar activity coefficient and m is the molality. These parameters have been measured for very few electrolytes. We posit that establishing the molecular properties that govern these parameters will lead to improved electrolytes that greatly exceed the current upper bound.

He, Zirong↗

DOE OSTI2026

Di-nucleons do not form bound states at heavy pion mass

We perform a high-statistics lattice QCD calculation of the low-energy two-nucleon scattering amplitudes. To address discrepancies in the literature, the calculation is performed at a heavy pion mass in the limit that the light quark masses are equal to the physical strange quark mass, 𝑚 𝜋 = 𝑚 𝐾 ≃ 714 MeV. Using a state-of-the-art momentum space method, we rule out the presence of a bound di-nucleon in both the isospin 0 (deuteron) and 1 (di-neutron) channels, in contrast with many previous results that made use of compact hexaquark creation operators. To diagnose the discrepancy, we add such hexaquark interpolating operators to our basis and find that they do not affect the determination of the two-nucleon finite-volume spectrum, and thus they do not couple to deeply bound di-nucleons that are missed by the momentum-space operators. Furthermore, we perform a high-statistics calculation of the HAL QCD potential on the same gauge ensembles and find qualitative agreement with our main results. We conclude that di-nucleons do not form bound states at heavy pion masses and that previous identification of deeply bound di-nucleons must have arisen from a misidentification of the spectrum from off-diagonal elements of a correlation function.

Physics - Physics of elementary particles and fiel↗

DOE OSTI2025

Di-nucleons do not form bound states at heavy pion mass

We perform a high-statistics lattice QCD calculation of the low-energy two-nucleon scattering amplitudes. In order to address discrepancies in the literature, the calculation is performed at a heavy pion mass in the limit that the light quark masses are equal to the physical strange quark mass, $m_π= m_K \simeq 714 $ MeV. Using a state-of-the-art momentum space method, we rule out the presence of a bound di-nucleon in both the isospin 0 (deuteron) and 1 (di-neutron) channels, in contrast with many previous results that made use of compact hexaquark creation operators. In order to diagnose the discrepancy, we add such hexaquark interpolating operators to our basis and find that they do not affect the determination of the two-nucleon finite volume spectrum, and thus they do not couple to deeply bound di-nucleons that are missed by the momentum-space operators. Further, we perform a high-statistics calculation of the HAL QCD potential on the same gauge ensembles and find qualitative agreement with our main results. We conclude that two-nucleons do not form bound states at heavy pion masses and that previous identification of deeply bound di-nucleons must have arisen from a misidentification of the spectrum from off-diagonal elements of a correlation function.

FOS: Physical sciences↗

DOE OSTI2025

Sulfur-functionalized solid-phase materials for the selective separation of arsenic and selenium

Radioactive arsenic (As) isotopes are of growing interest for applications in nuclear medicine, national security, and environmental research. Recent efforts at the Facility for Rare Isotope Beams (FRIB) have focused on aqueous harvesting of selenium-72,73 ( 72,73 Se) and their daughter isotopes, arsenic-72,73 ( 72,73 As), which are particularly valuable for medical applications and nuclear data studies, respectively. Both conventional isotope production and harvesting methods require chemical separations to purify radioactive As from parent and co-produced Se radioisotopes. While several solid-phase separation methods for As and Se exist, many depend on complex oxidation state control or highly acidic conditions. This study presents results for sulfur-based solid-phase materials selected to enable uptake at lower acidity and eliminate the need for intricate redox chemistry. Specifically, the performance of three covalently bound sulfur-based ligands were evaluated: (1) thiophenol-polystyrene, (2) propanethiol-silica, and (3) thiourea-silica. Uptake characteristics—including distribution coefficients (Dw), kinetics, and column separation behavior—were assessed using 75 Se and 73 As in hydrochloric (HCl) acid and nitric (HNO 3 ) solutions. The resins demonstrated high-yield (>95%) and high-purity As recovery across a range of HCl concentrations. Comparable results in HNO 3 were achieved when combined with anion exchange chromatography. Furthermore, the potential application of these materials for medical isotope generators was also investigated through ligand stability and repeated elution studies. Overall, sulfur leaching from the resins was negligible at the concentrations relevant for these separations but increased with higher acid concentrations.

Arsenic↗

DOE OSTI2020

A Novel Modeling Framework for Computationally Efficient and Accurate Real-Time Ensemble Flood Forecasting With Uncertainty Quantification

A novel modeling framework that simultaneously improves accuracy, predictability, and computational efficiency is presented. It embraces the benefits of three modeling techniques integrated together for the first time: surrogate modeling, parameter inference, and data assimilation. The use of polynomial chaos expansion (PCE) surrogates significantly decreases computational time. Parameter inference allows for model faster convergence, reduced uncertainty, and superior accuracy of simulated results. Ensemble Kalman filters assimilate errors that occur during forecasting. To examine the applicability and effectiveness of the integrated framework, we developed 18 approaches according to how surrogate models are constructed, what type of parameter distributions are used as model inputs, and whether model parameters are updated during the data assimilation procedure. We conclude that (1) PCE must be built over various forcing and flow conditions, and in contrast to previous studies, it does not need to be rebuilt at each time step; (2) model parameter specification that relies on constrained, posterior information of parameters (so-called Selected specification) can significantly improve forecasting performance and reduce uncertainty bounds compared to Random specification using prior information of parameters; and (3) no substantial differences in results exist between single and dual ensemble Kalman filters, but the latter better simulates flood peaks. The use of PCE effectively compensates for the computational load added by the parameter inference and data assimilation (up to ~80 times faster). Therefore, the presented approach contributes to a shift in modeling paradigm arguing that complex, high-fidelity hydrologic and hydraulic models should be increasingly adopted for real-time and ensemble flood forecasting.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2024

Heterogenous catalysis for oxygen tolerant photoredox atom transfer radical polymerization and small-molecule dehalogenation

Heterogeneous photocatalysts (PCs) have garnered attention for their sustainability and cost-effectiveness. Despite the existence of various types of these PCs, their synthesis often involves complex, multi-step procedures and laborious purification. Herein, we propose a simple method for attaching small-molecule photocatalytic species onto crosslinked 3-D polymer networks as insoluble scaffolds to create robust heterogeneous PCs. The highly swellable poly(ethylene glycol)-based ChemMatrix (CM) resin, known for its amphiphilic properties and high functional group loading, facilitated the covalent immobilization of the photoredox dye Eosin Y (EY), but also streamlined functionalization with Ir( III ) complexes. The resulting heterogeneous CM-EY demonstrated efficient photocatalytic performance in open-to-air dual photoredox catalysis of atom transfer radical polymerization (photo-ATRP) under green light. This was confirmed by the well-controlled synthesis of polymers with molecular masses ranging from 20 kDa to 300 kDa and low dispersities. Furthermore, CM-EY exhibited excellent photostability and recyclability over multiple cycles of ATRP. The heterogeneous catalysis of photo-ATRP provided high temporal control and enabled benign conditions for synthesizing protein-polymer hybrids (PPH). When combined with the initiator-modified CM (CM-BIB), CM-EY facilitated the solid-phase synthesis of homopolymers and block copolymers with recyclable performance. However, the coordinatively bound Ir@CM showed decreased catalytic activity and efficiency toward photoredox dehalogenation due to the leaching of active species during recycling. This study highlights the advantages of the covalent linking of catalysts to solid supports over non-covalent interactions, underscoring the potential of functionalized polymer resin as a promising scaffold. Such an approach offers customization and tunability, presenting opportunities for innovation in green chemistry.

Kapil, Kriti↗

DOE OSTI2023

Spatiotemporally Adaptive Compression for Scientific Dataset with Feature Preservation – A Case Study on Simulation Data with Extreme Climate Events Analysis

Scientific discoveries are increasingly constrained by limited storage space and I/O capacities. For time-series simulations and experiments, their data often need to be decimated over timesteps to accommodate storage and I/O limitations. In this paper, we propose a technique that addresses storage costs while improving post-analysis accuracy through spatiotemporal adaptive, error-controlled lossy compression. We investigate the trade-off between data precision and temporal output rates, revealing that reducing data precision and increasing timestep frequency lead to more accurate analysis outcomes. Additionally, we integrate spatiotemporal feature detection with data compression and demonstrate that performing adaptive error-bounded compression in higher dimensional space enables greater compression ratios, leveraging the error propagation theory of a transformation-based compressor. To evaluate our approach, we conduct experiments using the well-known E3SM climate simulation code and apply our method to compress variables used for cyclone tracking. Our results show a significant reduction in storage size while enhancing the quality of cyclone tracking analysis, both quantitatively and qualitatively, in comparison to the prevalent timestep decimation approach. Compared to three state-of-the-art lossy compressors lacking feature preservation capabilities, our adaptive compression framework improves perfectly matched cases in TC tracking by 26.4-51.3% at medium compression ratios and by 77.3-571.1% at large compression ratios, with a merely 5–11% computational overhead.

Gong, Qian↗

DOE OSTI2022

Online Learning and Pricing for Service Systems with Reusable Resources

We consider a price-based revenue management problem with finite reusable resources over a finite time horizon T. Customers arrive following a price-dependent Poisson process, and each customer requests one unit of c homogeneous reusable resources. If there is an available unit, the customer gets served within a price-dependent exponentially distributed service time; otherwise, the customer waits in a queue until the next available unit. In this paper, we assume that the firm does not know how the arrival and service rates depend on posted prices, and thus it makes adaptive pricing decisions in each period based only on past observations to maximize the cumulative revenue. Given a discrete price set with cardinality P, we propose two online learning algorithms, termed batch upper confidence bound (BUCB) and batch Thompson sampling (BTS), and prove that the cumulative regret upper bound is O˜(√PT) , which matches the regret lower bound. In establishing the regret, we bound the transient system performance upon price changes via a novel coupling argument, and also generalize bandits to accommodate subexponential rewards. Here, we also extend our approach to models with balking and reneging customers and discuss a continuous price setting. Our numerical experiments demonstrate the efficacy of the proposed BUCB and BTS algorithms.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

ORNL Post-irradiation Examination (LAMDA) Final Report on Characterization of Irradiated Grade 92 Ferritic-Martensitic Steels

Irradiation effects on ferritic-martensitic steel Grade 92 were investigated in this project. Samples from two heats of Grade 92, i.e., G92-2b and NF616, were selected, which were irradiated in the High Flux Isotope Reactor (HFIR) and the Advanced Test Reactor (ATR), respectively. Samples from two heats of ferriticmartensitic steel T91, irradiated in the ATR, were also selected as references for the Grade 92 samples. The selected G92-2b samples were irradiated to 0.5–14.7 displacements per atom (dpa) at two temperature regimes: 400–497 °C and 683–720°C. The selection of the high irradiation temperatures up to ~720°C is to test the performance at such upper bound temperatures, which would provide insights for the upper bound applicable temperature for Grade 92. The selected NF616 and T91 samples were irradiated to 3–8.2 dpa at 292–448°C. Except for T91 heat2 samples in 3-mm diameter discs, all the other selected samples are of type SS-J2 miniature tensile specimens. Two Nuclear Science User Facilities (NSUF), i.e., the Irradiated Materials Examination and Testing (IMET) hot cell facility and the Low Activation Materials Design and Analysis (LAMDA) facility, were used in the Post-Irradiation Examination (PIE) activities for the selected samples, which include: Tensile tests at room temperature (IMET); Fractography of the tensile fracture surfaces (LAMDA: scanning electron microscopy and energy; dispersive spectroscopy); Vickers hardness measurements (LAMDA); and Microstructural characterization (LAMDA: electron backscatter diffraction, focused-ion beam, and transmission electron microscopy).

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2020

ArborX: A Performance Portable Geometric Search Library

Searching for geometric objects that are close in space is a fundamental component of many applications. The performance of search algorithms comes to the forefront as the size of a problem increases both in terms of total object count as well as in the total number of search queries performed. Scientific applications requiring modern leadership-class supercomputers also pose an additional requirement of performance portability, i.e., being able to efficiently utilize a variety of hardware architectures. In this article, we introduce a new open-source C++ search library, ArborX, which we have designed for modern supercomputing architectures. Herein, we examine scalable search algorithms with a focus on performance, including a highly efficient parallel bounding volume hierarchy implementation, and propose a flexible interface making it easy to integrate with existing applications. We demonstrate the performance portability of ArborX on multi-core CPUs and GPUs and compare it to the state-of-the-art libraries such as Boost.Geometry.Index and nanoflann.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Design, fabrication, simulation, and testing of additively manufactured lattice-based copper heat sinks

Here, this study investigates the potential advantages of lattice structure-based bound metal material extrusion (MEX) 3D printing for fabricating high-performance copper heat sinks. Copper powder-filled polymer filaments, with a copper content of > 90 wt.%, were developed specifically for the bound metal MEX 3D printing process. Three types of structures—planar, strut, and surface lattices—were 3D printed to facilitate efficient heat transfer pathways within the heat sinks. Subsequent post-processing steps, including polymer removal and sintering, were performed to achieve dense copper parts. Hot isostatic pressing was further employed to enhance the sintered density from 93 to 98%. Finite element analysis (FEA) simulations were conducted to assess the heat transfer efficiency of the designs, and heat transfer experiments were performed using a custom setup to validate the simulation results. Additionally, this research explores the use of extended hold times during pre-sintering and a reduced atmosphere to enhance the %IACS values (electrical conductivity) and thermal performance of the bound metal MEX 3D printed copper heat sinks. The investigation combines experimental analysis, including simulations and heat transfer experiments, to gain insights into the structure-material property relationships and optimize the thermal performance of the printed heat sinks.

Ajjarapu, Kameswara Pavan Kumar [Oak Ridge Nationa↗

DOE OSTI2026

An Integrated Framework for Memory-Centric Analysis: From Trace Collection to Co-Design

The memory wall phenomenon—where advances in processor performance significantly outpace those in memory subsystems—poses a fundamental challenge for contemporary computing systems. In memory-bound applications, memory subsystem behavior dominates performance, yet existing analysis approaches present significant limitations: detailed microarchitectural simulators require days to weeks to simulate modest workloads; hardware performance counters provide only aggregate statistics that obscure temporal and spatial access patterns; and scaled simulation approaches face challenges in capturing certain behaviors that emerge at larger scales. These limitations reflect a processor-centric design philosophy increasingly misaligned with memory-bound workloads where detailed understanding of memory access patterns, cache hierarchy interactions, and contention is critical for effective optimization. This paper presents an integrated framework for memory-centric analysis that enables effective hardware-software co-design. We describe practical trace collection techniques, including hardware-assisted processor tracing with minimal overhead and portable software-based instrumentation with statistical sampling. We present multi-perspective analysis methods that examine memory behavior from temporal, sequential, spatial, and relational viewpoints, revealing distinct optimization opportunities invisible in aggregate metrics. We detail an architectural modeling framework that uses sampled traces with temporal interpolation and confidence-based filtering to evaluate cache and memory configurations. Evaluation on representative benchmarks demonstrates that this framework achieves practical accuracy (L2 cache errors of 2.64\%, confidence-filtered L3 errors of 9.92\%, bandwidth errors of 7.33\%) while providing substantial speedup (26.8×) over cycle-accurate simulation, enabling rapid design space exploration. We demonstrate how this integrated framework enables systematic identification of both hardware optimizations (memory controller tuning, bank partitioning, NUMA configuration) and software optimizations (data layout restructuring, prefetching strategies, memory-aware scheduling). Through this comprehensive treatment of the memory-centric analysis pipeline—from trace collection through architectural modeling to co-design application—we provide researchers and practitioners with practical techniques for addressing memory bottlenecks in contemporary computing systems.

Gajaria, Dhruv Mayur↗

DOE OSTI2026

Qubit lattice algorithm simulations of the scattering of a bounded two dimensional electromagnetic pulse from an infinite planar dielectric interface

Qubit lattice algorithm (QLA) simulations are performed for a two-dimensional spatially bounded pulse propagating onto a plane interface between two dielectric slabs. QLA is an initial value scheme that consists of a sequence of unitary collision and streaming operators, with appropriate potential operators, that recover Maxwell equations in inhomogeneous dielectric media to the second order in the lattice discreteness. For the case of total internal reflection, there is transient energy transfer into the second medium due to the evanescent fields as the Poynting unit vector of the pulse is rotated from its incident to reflected direction. Because of the finite spatial extent of the pulse, a self-consistent Goos–Hanchen-type displacement along the interface is found without imposing any explicit interface boundary conditions on the fields. For normal incidence, the standard Fresnel coefficients are recovered for appropriately averaged QLA fields. Energy is conserved at all times to seven significant figures.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2026

Quantum Routing and Entanglement Dynamics Through Bottlenecks

To implement arbitrary quantum circuits in architectures with restricted interactions, one may effectively simulate all-to-all connectivity by routing quantum information. We consider the entanglement dynamics and routing between two regions only connected through an intermediate “bottleneck” region with few qubits. In such systems, where the entanglement rate is restricted by a vertex boundary rather than an edge boundary of the underlying interaction graph, existing results such as the small incremental entangling theorem give only a trivial constant lower bound on the routing time (the minimum time to perform an arbitrary permutation). We significantly improve the lower bound on the routing time in systems with a vertex bottleneck. Specifically, for any system with two regions 𝐿,𝑅 with 𝑁 𝐿 ,𝑁 𝑅 qubits, respectively, coupled only through an intermediate region 𝐶 with 𝑁 𝐶 qubits, for any 𝛿 > 0 we show a lower bound of Ω⁢(𝑁$^{1−𝛿}_{𝑅}$/√𝑁 𝐿⁢ 𝑁 𝐶 ) on the Hamiltonian quantum routing time when using piecewise time-independent Hamiltonians, or time-dependent Hamiltonians subject to a smoothness condition. We also prove an upper bound on the average amount of bipartite entanglement between 𝐿 and 𝐶,𝑅 that can be generated in time 𝑡 by such architecture-respecting Hamiltonians in systems constrained by vertex bottlenecks, improving the scaling in the system size from 𝑂⁡(𝑁 𝐿⁢ 𝑡) to 𝑂⁡(√𝑁 𝐿⁢ 𝑡). As a special case, when applied to the star graph (i.e., one vertex connected to 𝑁 leaves), we obtain an Ω⁡(√𝑁 1−𝛿 ) lower bound on the routing time and on the time to prepare 𝑁/2 Bell pairs between the vertices. We also show that, in systems of free particles, we can route optimally on the star graph in time Θ⁡(√𝑁) using Hamiltonian quantum routing, obtaining a speedup over gate-based routing, which takes time Θ⁡(𝑁).

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

SchedInspector: A Batch Job Scheduling Inspector Using Reinforcement Learning

Improving the performance of job executions is an important goal of HPC batch job schedulers, such as minimizing job waiting time, slowdown, or completion time. Such a goal is often accomplished using carefully designed heuristics based on job features, such as job size and job duration. However, these heuristics overlook important runtime factors (e.g., cluster availability and waiting job patterns), which may vary across time and make a previously sound scheduling decision not hold any longer. In this study, we propose a new approach to incorporate runtime factors into batch job scheduling for better job execution performance. The key idea is to add a scheduling inspector on top of the base job scheduler to scrutinize its scheduling decisions. The inspector will take the runtime factors into consideration and accordingly determine the fitness of the scheduled job. It then either accepts the scheduled job or rejects it and asks the base schedulers to try again later. We realize such an inspector, namely SchedInspector, by leveraging the intelligence of reinforcement learning. Through extensive experiments, we show SchedInspector can intelligently integrate the runtime factors into various batch job scheduling policies, including the state-of-the-art one, to gain better job execution performance, such as smaller average bounded job slowdown (up to 69% better) or average job waiting time (up to 52% better), across various real-world workloads. We also show that although rejecting scheduling decisions may leave the resources idle hence affect the system utilization, SchedInspector is able to achieve the job execution performance improvement with marginal impact on the system utilization (typically less than 1%). We consider one key advantage of SchedInspector is it automatically learns to work with and improve existing job scheduling policies without changing them, which makes it promising to serve as a generic enhancer for various batch job scheduling policies.

Zhang, Di↗

DOE OSTI2022

Ultrafast Error-bounded Lossy Compression for Scientific Datasets

Today's scientific high-performance computing applications and advanced instruments are producing vast volumes of data across a wide range of domains, which impose a serious burden on data transfer and storage. Error-bounded lossy compression has been developed and widely used in the scientific community because it not only can significantly reduce the data volumes but also can strictly control the data distortion based on the user-specified error bound. Existing lossy compressors, however, cannot offer ultrafast compression speed, which is highly demanded by numerous applications or use cases (such as in-memory compression and online instrument data compression). In this paper, we propose a novel ultrafast error-bounded lossy compressor that can obtain fairly high compression performance on both CPUs and GPUs and with reasonably high compression ratios. The key contributions are threefold. (1) We propose a generic error-bounded lossy compression framework---called SZx---that achieves ultrafast performance through its novel design comprising only lightweight operations such as bitwise and addition/subtraction operations, while still keeping a high compression ratio. (2) We implement SZx on both CPUs and GPUs and optimize the performance according to their architectures. (3) We perform a comprehensive evaluation with six real-world production-level scientific datasets on both CPUs and GPUs. Experiments show that SZx is 2~16x faster than the second-fastest existing error-bounded lossy compressor (either SZ or ZFP) on CPUs and GPUs, with respect to both compression and decompression.

Yu, Xiaodong↗

DOE OSTI2022

Offering of Variable Resources in Regulation Markets with Performance Targets: An Analysis

To date, wind and solar power plants have mainly provided energy. Going forward, with the application of appropriate controls, they can offer additional grid services, such as regulating reserves. Additional grid services can present an opportunity for additional value streams to wind and solar power plants. However, the additional value might not be realized when operator-determined performance targets and settlement adjustments for the delivery of regulation capacity are disregarded. Additionally, this article studies the participation of variable resources in centralized regulation markets. We derive analytical results for regulation offers in terms of quantity and price considering that a variable resource does not want to risk being disqualified as a regulation provider, incurring losses, or foregoing more profitable opportunities. Our analysis suggests that U.S. operator-determined performance targets impose an upper bound on the quantity of a variable resource’s regulation offer; and settlement adjustments for the delivery of regulation affect the price at which variable resources offer and the calculations of opportunity costs in case of imperfect regulation delivery.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2020

A General Framework for Bounding Approximate Dynamic Programming Schemes

For years, there has been interest in approximation methods for solving dynamic programming problems, because of the inherent complexity in computing optimal solutions characterized by Bellman’s principle of optimality. A wide range of approximate dynamic programming (ADP) methods now exists. It is of great interest to guarantee that the performance of an ADP scheme be at least some known fraction, say ß , of optimal. This letter introduces a general approach to bounding the performance of ADP methods, in this sense, in the stochastic setting. The approach is based on new results for bounding greedy solutions in string optimization problems, where one has to choose a string (ordered set) of actions to maximize an objective function. This bounding technique is inspired by submodularity theory, but submodularity is not required for establishing bounds. Instead, the bounding is based on quantifying certain notions of curvature of string functions; the smaller the curvatures the better the bound. The key insight is that any ADP scheme is a greedy scheme for some surrogate string objective function that coincides in its optimal solution and value with those of the original optimal control problem. The ADP scheme then yields to the bounding technique mentioned above, and the curvatures of the surrogate objective determine the value ß of the bound. The surrogate objective and its curvatures depend on the specific ADP.

discrete event systems↗