SEARCH · Engineering Papers

Results for “dynamic programming”

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 127 records · Page 7

All sources NASA NTRS DOE OSTI

DOE OSTI2019

Improving Ligand Geometry in Protein Data Bank Structures Computationally

Information about the three‐dimensional structures of complex biological molecules is an indispensable research tool for many fields of study, including biology, chemistry, pharmacology, and computer science. The Protein Data Bank (PDB) is an public digital archive providing access to structures of nucleic acids, proteins, and large macromolecular machines determined experimentally by X‐ray crystallography, nuclear magnetic resonance (NMR) spectroscopy, and 3‐dimensional electron microscopy (3DEM). PDB structures undergo validation for structural plausibility upon their deposition into the PDB using the program Mogul, which cross references each deposited structure against similar data in the Cambridge Structural Database (CSD). Ligands associated with PDB structures are a common source of structural inaccuracy. In this study, a programmatic pipeline was developed to determine if ligand geometric accuracy could be improved using known computational tools. Ligands with dubious geometry were identified through a Python mining code. A sample set of the identified structures was remodeled into minimum energy conformations using the molecular dynamics program AMBER and then fit to the original experimental density maps using the molecular modeling program Coot. The refined models were compared to the original models in the PDB as well as to similar structures in the CSD using the deposition statistical validation server. Preliminary results suggest that the pipeline effectively identifies and improves ligand structures that possess inaccurate geometry. This method can be used to evaluate and improve the accuracy of specific ligands in structures both archived and pending deposition. Support or Funding Information This work was supported by an NSF REU and the RCSB PDB [NSF (DBI‐1338415), NIH, and DOE.] This abstract is from the Experimental Biology 2019 Meeting. There is no full text article associated with this abstract published in The FASEB Journal .

Miller, Beck↗

DOE OSTI2015

A dynamic intron retention program enriched in RNA processing genes regulates gene expression during terminal erythropoiesis

Differentiating erythroblasts execute a dynamic alternative splicing program shown here to include extensive and diverse intron retention (IR) events. Cluster analysis revealed hundreds of developmentallydynamic introns that exhibit increased IR in mature erythroblasts, and are enriched in functions related to RNA processing such as SF3B1 spliceosomal factor. Distinct, developmentally-stable IR clusters are enriched in metal-ion binding functions and include mitoferrin genes SLC25A37 and SLC25A28 that are critical for iron homeostasis. Some IR transcripts are abundant, e.g. comprising ~50% of highly-expressed SLC25A37 and SF3B1 transcripts in late erythroblasts, and thereby limiting functional mRNA levels. IR transcripts tested were predominantly nuclearlocalized. Splice site strength correlated with IR among stable but not dynamic intron clusters, indicating distinct regulation of dynamically-increased IR in late erythroblasts. Retained introns were preferentially associated with alternative exons with premature termination codons (PTCs). High IR was observed in disease-causing genes including SF3B1 and the RNA binding protein FUS. Comparative studies demonstrated that the intron retention program in erythroblasts shares features with other tissues but ultimately is unique to erythropoiesis. Finally, we conclude that IR is a multi-dimensional set of processes that post-transcriptionally regulate diverse gene groups during normal erythropoiesis, misregulation of which could be responsible for human disease.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2015

Planning for Pre-Exascale Platform Environment (Fiscal Year 2015 Level 2 Milestone 5216)

This Plan for ASC Pre-Exascale Platform Environments document constitutes the deliverable for the fiscal year 2015 (FY15) Advanced Simulation and Computing (ASC) Program Level 2 milestone Planning for Pre-Exascale Platform Environment. It acknowledges and quantifies challenges and recognized gaps for moving the ASC Program towards effective use of exascale platforms and recommends strategies to address these gaps. This document also presents an update to the concerns, strategies, and plans presented in the FY08 predecessor document that dealt with the upcoming (at the time) petascale high performance computing (HPC) platforms. With the looming push towards exascale systems, a review of the earlier document was appropriate in light of the myriad architectural choices currently under consideration. The ASC Program believes the platforms to be fielded in the 2020s will be fundamentally different systems that stress ASC’s ability to modify codes to take full advantage of new or unique features. In addition, the scale of components will increase the difficulty of maintaining an errorfree system, thus driving new approaches to resilience and error detection/correction. The code revamps of the past, from serial- to vector-centric code to distributed memory to threaded implementations, will be revisited as codes adapt to a new message passing interface (MPI) plus “x” or more advanced and dynamic programming models based on architectural specifics. Development efforts are already underway in some cases, and more difficult or uncertain aspects of the new architectures will require research and analysis that may inform future directions for program choices. In addition, the potential diversity of system architectures may require parallel if not duplicative efforts to analyze and modify environments, codes, subsystems, libraries, debugging tools, and performance analysis techniques as well as exploring new monitoring methodologies. It is difficult if not impossible to selectively eliminate some of these activities until more information is available through simulations of potential architectures, analysis of systems designs, and informed study of commodity technologies that will be the constituent parts of future platforms.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Reinforcement Learning of Structured Stabilizing Control for Linear Systems With Unknown State Matrix

This paper delves into designing feedback control gains for a continuous-time linear quadratic regulator (LQR) problem that is constrained to certain predefined structure with unknown state matrix. We bring forth the ideas from reinforcement learning (RL) in conjunction with sufficient stability and performance guarantees in order to design these structured gains using the trajectory measurements of states and controls. Here we first formulate a model-based framework using dynamic programming (DP) to embed the structural constraint to the LQR gain computation in the continuous-time setting, and then subsequently, formulate a policy iteration RL algorithm that can alleviate the requirement of known state matrix in conjunction with maintaining the feedback gain structure. The design enables a distributed learning control design which is necessary for many large-scale cyber-physical systems. Theoretical guarantees are provided for stability and convergence of the structured reinforcement learning (SRL) algorithm. We validate our theoretical results with numerical simulations on a multi-agent networked linear time-invariant (LTI) dynamic system.

42 ENGINEERING↗

DOE OSTI2020

Scalable molecular dynamics on CPU and GPU architectures with NAMD

NAMD is a molecular dynamics program designed for high-performance simulations of very large biological objects on CPU- and GPU-based architectures. NAMD offers scalable performance on petascale parallel supercomputers consisting of hundreds of thousands of cores, as well as on inexpensive commodity clusters commonly found in academic environments. It is written in C++ and leans on Charm++ parallel objects for optimal performance on low-latency architectures. NAMD is a versatile, multipurpose code that gathers state-of-the-art algorithms to carry out simulations in apt thermodynamic ensembles, using the widely popular CHARMM, AMBER, OPLS, and GROMOS biomolecular force fields. Here, we review the main features of NAMD that allow both equilibrium and enhanced-sampling molecular dynamics simulations with numerical efficiency. We describe the underlying concepts utilized by NAMD and their implementation, most notably for handling long-range electrostatics; controlling the temperature, pressure, and pH; applying external potentials on tailored grids; leveraging massively parallel resources in multiple-copy simulations; and hybrid quantum-mechanical/molecular-mechanical descriptions. We detail the variety of options offered by NAMD for enhanced-sampling simulations aimed at determining free-energy differences of either alchemical or geometrical transformations and outline their applicability to specific problems. Last, we discuss the roadmap for the development of NAMD and our current efforts toward achieving optimal performance on GPU-based architectures, for pushing back the limitations that have prevented biologically realistic billion-atom objects to be fruitfully simulated, and for making large-scale simulations less expensive and easier to set up, run, and analyze. NAMD is distributed free of charge with its source code at www.ks.uiuc.edu.

high-performance computing↗

DOE OSTI2018

A Comparative Assessment of Economic Model Predictive Control Strategies for Fuel Economy Optimization of Heavy-Duty Trucks

This paper provides a comparative assessment of three control strategies that fuse a global, offline dynamic programming (DP) optimization with online model predictive control (MPC) in an effort to minimize fuel consumption for a heavy-duty truck. The online MPC optimization, which is local in nature, makes refinements to a coarsely (but globally, subject to grid resolution) optimized target velocity profile from the DP optimization. Three candidate economic MPC formulations are evaluated: a time-based formulation that directly penalizes predicted fuel consumption, a simplified time-based formulation that penalizes braking effort in place of fuel consumption, and a distance-based convex formulation that maintains a tradeoff between energy expenditure and tracking of the coarsely optimized velocity based on DP. The performance of each approach is presented for three representative route profiles, using a medium-fidelity proprietary Volvo model of the heavy-duty truck’s longitudinal dynamics. Results demonstrate 4-7% fuel economy improvement across all three formulations, when compared to a baseline strategy. Furthermore, we present a detailed analysis of energy usage by “type” (aerodynamic losses, braking losses, and comparison of brake-specific fuel consumption), under each candidate control approach.

33 ADVANCED PROPULSION SYSTEMS↗

DOE OSTI2019

Economic Optimal Control for Minimizing Fuel Consumption of Heavy-Duty Trucks in a Highway Environment

This paper provides a comparative assessment of three economic optimal control strategies, aimed at minimizing the fuel consumption of heavy-duty trucks in a highway environment, under a representative lead vehicle model informed by traffic data. These strategies fuse a global, offline dynamic programming (DP) optimization with online model predictive control (MPC). We then show how two of the three strategies can be adapted to accommodate the presence of traffic and optimally navigate signalized intersections using infrastructure-to-vehicular (I2V) communication. The MPC optimization, which is local in nature, makes refinements to a coarsely (but globally, subject to grid resolution) optimized target velocity profile from the DP optimization. The three candidate economic MPC formulations that are evaluated include: a nonlinear time-based formulation that directly penalizes predicted fuel consumption, a nonlinear time-based formulation that penalizes braking effort as a surrogate for fuel consumption, and a linear distance-based convex formulation that maintains a tradeoff between energy expenditure and tracking of the coarsely optimized velocity profile obtained from DP. Using a medium-fidelity Simulink model, based on a Volvo truck's longitudinal and engine dynamics, we analyze the optimization's performance on four highway routes under various traffic scenarios. Results demonstrate 3.7-8.3% fuel economy improvement on highway routes without traffic and 6.5-10% on the same routes with traffic included. Furthermore, we present a detailed analysis of energy usage by "type" (aerodynamic losses, braking losses, and comparison of brake-specific fuel consumption), under each candidate control strategy.

33 ADVANCED PROPULSION SYSTEMS↗

DOE OSTI2021

Developing a Hybrid Electric Vehicle Eco-Cooperative Adaptive Cruise Control System at Signalized Intersections.

This study develops an eco-driving strategy for hybrid electric vehicles (HEVs) in the vicinity of signalized intersections, entitled HEV Eco-Cooperative Adaptive Cruise Control at Intersections (Eco-CACC-I). The proposed system computes real-time, energy-optimized vehicle trajectories using HEV vehicle dynamics and energy consumption models. In the proposed system, a simple HEV energy model is used to compute the instantaneous fuel consumption. This HEV energy model is selected since it is general, transferable, and can be easily used to compute instantaneous energy consumption levels for HEVs without the additional input of vehicle engine data or complicated power control strategies. In addition, a vehicle dynamics model is used to capture the relationship between speed, acceleration level, and tractive/resistance forces on vehicles. The energy-optimum problem is formulated as an optimization problem with constraints, which is solved using a moving-horizon dynamic programming approach. The proposed HEV Eco-CACC-I system was tested to evaluate its performance for various speed limits, roadway grades, and signal timings. Lastly, the proposed HEV controller was implemented in a microscopic traffic simulation software to test its network-wide performance. The test results from an arterial corridor with three signalized intersections demonstrate that the proposed system can effectively reduce stop-and-go traffic in the vicinity of signalized intersections producing savings of 7.4% in energy consumption, 5.8% in traffic delay and 23% vehicle stops, respectively.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

DOE OSTI2021

Capacity Investment under Bayesian Information Updates at Reporting Periods: Model and Application

We consider capacity addition decisions by a new product manufacturer faced with uncertain technology alternatives. The manufacturing capacity addition and technology development occurs in parallel, with preliminary results from a technology project's success providing valuable information to the manufacturer in adding capacity. We solve a stochastic dynamic program with Bayesian updates to obtain the manufacturer's expected profit‐maximizing capacity investment decision. Our model and applications are motivated by the Critical Materials Institute (CMI) (funded by the Department of Energy), which manages research projects focused on mitigating critical material constraints, vital to renewable energy technologies such as direct‐drive wind turbines, electric vehicles, and energy‐efficient lighting. We capture three unique aspects of the problem: first, the learning from project progress depends on task‐based stochastic outcomes and a project's percent‐done. Second, the underlying technology's profitability is based on a model of competition. Third, we evaluate the impact of progress across a portfolio of projects based on a manufacturer's capacity addition. We develop a heuristic that produces results that are close to optimal and can thus be used for large problem sizes. The managerial insights from an application of our model to CMI projects include: (i) technology projects that report the percent‐done of a project earlier increase expected manufacturer profit; (ii) careful choice of “safe bets,” that is, technologies with low profitability but a high probability of success, can increase expected manufacturer profit; (iii) a portfolio of projects can increase profits significantly over separate project evaluation; and (iv) dynamic management of project resources can increase overall profit.

Vedantam, Aditya↗

DOE OSTI2017

Energy exchange dynamics across L–H transitions in NSTX

Here, we studied the energy exchange dynamics across the low-to-high-confinement (L–H) transition in NSTX discharges using the gas-puff imaging (GPI) diagnostic. The investigation focused on the energy exchange between flows and turbulence to help clarify the mechanism of the L–H transition. We applied this study to three types of heating schemes, including a total of 17 shots from the NSTX 2010 campaign run. Results show that the edge fluctuation characteristics (fluctuation levels, radial and poloidal correlation lengths) measured using GPI do not vary just prior to the H-mode transition, but change after the transition. Using a velocimetry approach (orthogonal-dynamics programming), velocity fields of a $24\times 30$ cm GPI view during the L–H transition were obtained with good spatial (~1 cm) and temporal (~2.5 μs) resolutions. Analysis using these velocity fields shows that the production term is systematically negative just prior to the L–H transition, indicating a transfer from mean flows to turbulence, which is inconsistent with the predator–prey paradigm. Moreover, the inferred absolute value of the production term is two orders of magnitude too small to explain the observed rapid L–H transition. These discrepancies are further reinforced by consideration of the ratio between the kinetic energy in the mean flow to the thermal free energy, which is estimated to be much less than 1, suggesting again that the turbulence depletion mechanism may not play an important role in the transition to the H-mode. Although the Reynolds work therefore appears to be too small to directly deplete the turbulent free energy reservoir, order-of-magnitude analysis shows that the Reynolds stress may still make a non-negligible contribution to the observed poloidal flows.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2022

134 billion intersecting brane models

The landscape of string vacua is very large, but generally expected to be finite in size. Enumerating the number and properties of the vacua is an important task for both the landscape and the swampland, in part to gain a deeper understanding of what is possible and “generic”. We obtain an exact counting of distinct intersecting brane vacua of type IIA string theory on the T 6 /Z 2 × Z 2 orientifold. Care is taken to only count gauge-inequivalent brane configurations. Leveraging the recursive nature by which branes may be added together one-by-one, we use dynamic programming to efficiently count the number of solutions of the tadpole, K-theory and supersymmetry consistency conditions. The distributions of 4D gauge group rank and complex structure moduli for the entire ensemble of intersecting brane vacua are presented. The methods we developed here may be useful in obtaining sharp upper and lower bounds on other corners of the landscape.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2017

Minimal Time Problem with Impulsive Controls

Time optimal control problems for systems with impulsive controls are investigated. Sufficient conditions for the existence of time optimal controls are given. A dynamical programming principle is derived and Lipschitz continuity of an appropriately defined value functional is established. The value functional satisfies a Hamilton–Jacobi–Bellman equation in the viscosity sense. A numerical example for a rider-swing system is presented and it is shown that the reachable set is enlargered by allowing for impulsive controls, when compared to nonimpulsive controls.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2016

Graphical models for optimal power flow

Optimal power flow (OPF) is the central optimization problem in electric power grids. Although solved routinely in the course of power grid operations, it is known to be strongly NP-hard in general, and weakly NP-hard over tree networks. In this paper, we formulate the optimal power flow problem over tree networks as an inference problem over a tree-structured graphical model where the nodal variables are low-dimensional vectors. We adapt the standard dynamic programming algorithm for inference over a tree-structured graphical model to the OPF problem. Combining this with an interval discretization of the nodal variables, we develop an approximation algorithm for the OPF problem. Further, we use techniques from constraint programming (CP) to perform interval computations and adaptive bound propagation to obtain practically efficient algorithms. Compared to previous algorithms that solve OPF with optimality guarantees using convex relaxations, our approach is able to work for arbitrary tree-structured distribution networks and handle mixed-integer optimization problems. Further, it can be implemented in a distributed message-passing fashion that is scalable and is suitable for “smart grid” applications like control of distributed energy resources. In conclusion, numerical evaluations on several benchmark networks show that practical OPF problems can be solved effectively using this approach.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2022

Optimal management of electric hotel loads in mild hybrid heavy duty truck

Here, the problem of engine idling for heavy-duty trucks has been under study for decades with Auxiliary Power Units (APUs) and Truck Stop Electrification (TSE) as the most compelling solutions. With the electrification of trucks approaching feasibility in terms of cost-effective technology, hybridization offers another “degree of freedom” to tackle the problem. Here, this work aims at exploiting a battery pack of a 48 V mild-hybrid heavy-duty truck to store sufficient onboard energy for powering the auxiliary loads during the hoteling. This problem is not trivial, as the battery packs typically cannot recover the entire energy required through regeneration alone; hence an optimal energy management strategy needs to be employed to charge the battery through the engine during drive operation. This strategy optimizes powertrain performances among the four modes: (i) Engine of Coasting (EOC), (ii) Regeneration by braking, (iii) Regeneration by engine, and (iv) engine idling. This paper presents the development of a Dynamic Programming (DP) framework that employs a multi-objective cost function to minimize the fuel consumption and maximize the regeneration using the above-mentioned four modes. A typical heavy-duty truck drive cycle is used to represent the drive phase, with mandatory hoteling stops as per regulations. A comprehensive powertrain model is developed using validated components’ model. The DP employs two state variables: battery State-of-Charge (SOC) and engine mode, and three control inputs: (i) the engine ON–OFF state, (ii) clutch engagement state, and (iii) power request at the Electric Machine (EM) for calculating optimal SOC trajectory. The framework also tackles rapid engine ON–OFF scenarios to avoid the challenges associated with DP and the compromises in fuel cost with those approaches. Finally, the effectiveness of the proposed framework is tested for potential fuel savings on two different battery packs by performing the full cycle simulations. The results show 6.47% of fuel consumption reduction as compared to traditional APU-based heavy-duty truck.

33 ADVANCED PROPULSION SYSTEMS↗

DOE OSTI2018

Pairwise alignment for very long nucleic acid sequences

Highlights: • The PAAVLS algorithm can be employed for alignment of very long sequences. • The PAAVLS algorithm largely reduces memory demand as the Smith–Waterman algorithm. • The running times of the PAAVLS and Smith–Waterman algorithms are comparable. Sequence alignment is one of the fundamental problems in computational biology and has numerous applications. The Smith–Waterman algorithm generates optimal local alignment for pairwise alignment task and has become a standard algorithm in its field. However, the current version of the Smith–Waterman algorithm demands a significant amount of memory and is not suitable for alignment of very long sequences. On the hand, the recent DNA sequencing technologies have produced vast amounts of biological sequences. Some nucleic acid sequences are very long and cannot employ the Smith–Waterman algorithm. To this end, this study proposes the PAAVLS algorithm that follows the dynamic programming technique employed by the Smith–Waterman algorithm and largely reduces the demand of memory. The proposed PAAVLS algorithm can be employed for alignment of very long sequences, i.e., sequences contain more than 100,000,000 nucleotides, on a personal computer. Additionally, the running time of the proposed PAAVLS algorithm is comparable with the running time of the standard Smith–Waterman algorithm.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2023

PotLib 2023: New version of a potential energy surface library for chemical systems

POTLIB is a library of global and semiglobal potential energy surface subprograms. The library currently features 410 entries, including both single-state entries and multi-state entries. When one calls the routine of a single-state entry, it returns the ground-electronic-state adiabatic potential energy surface at the input geometry. In addition, some entries also return the gradient of the surface. Further, when one calls a multi-state entry, it returns a diabatic potential energy matrix (DPEM). If the entry also has the gradient of the DPEM, one can compute adiabatic surfaces, their gradients, and the nonadiabatic coupling vectors (NACs) from the DPEM and its gradient by diagonalization. Some but not all the routines conform to one of a set of standard interfaces. The goal is to facilitate chemical dynamics research by collecting and disseminating a comprehensive collection of state-of-the-art potential energy routines (developed by a wide, international group of researchers) with systematic and well-defined interfaces for use with chemical dynamics programs. Systems in the library include CHArO 2 , CHN 2 O + , CH 2 O, CH 2 O 2 , CH 3 N 2 , CH 3 O, CH 4 , CH 4 Br, CH 4 Cl, CH 4 F, CH 4 O, CH 4 OCl, CH 4 OF, CH 4 OH, CH 5 , CH$^{+}_{5}$, CH 5 N, CH 5 O 2 , CH 8 O 2 , C 2 H 2 N 2 O, C 2 H 2 O, C 2 H 4 N, C 2 H 4 O 4 , C 2 H 6 Cl, C 2 H 6 F, C 2 H 6 H, C 2 H 6 O, C 2 H 6 OH, C 2 H 7 , C 2 O 2 , C 3 H 4 O 2 , C 3 H 7 NO, C 6 H 6 O, C 6 H 6 S, C 7 H8S, HBrCl, HCl 2 , HF 2 , HI 2 , HLiF, HNaF, HO 2 , HO 3 , HOBr, HSiO, H 2 Br, H 2 ClO, H 2 F, H 2 F 2 , H 2 FO, H 2 Na, H 2 O, H 2 O 2 , H 2 OBr, H 3 , H 3 Cl, H 3 ClN, H 3 ClO, H 3 N, H 3 O, H 3 O 2 , H$^{+}_{3}$, H 3 S, H 4 ClSi, H 4 N, H 4 NO, H 4 O 2 , H 5 GeO, H 5 Si, H$^{+}_{7}$, Al m H n , Al n , Ar N O, K 2 Rb 2 , NO 2 , N 2 O, N 2 O 2 , N 3 , N 4 , O 3 , and O 4 .

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2021

A k-mer based approach for classifying viruses without taxonomy identifies viral associations in human autism and plant microbiomes

Viruses are an underrepresented taxa in the study and identification of microbiome constituents; however, they play an essential role in health, microbiome regulation, and transfer of genetic material. Only a few thousand viruses have been isolated, sequenced, and assigned a taxonomy, which limits the ability to identify and quantify viruses in the microbiome. Additionally, the vast diversity of viruses represents a challenge for classification, not only in constructing a viral taxonomy, but also in identifying similarities between a virus’ genotype and its phenotype. However, the diversity of viral sequences can be leveraged to classify their sequences in metagenomic and metatranscriptomic samples, even if they do not have a taxonomy. To identify and quantify viruses in transcriptomic and genomic samples, we developed a dynamic programming algorithm for creating a classification tree out of 715,672 metagenome viruses. To create the classification tree, we clustered proportional similarity scores generated from the k-mer profiles of each of the metagenome viruses to create a database of metagenomic viruses. The resulting Kraken2 database of the metagenomic viruses can be found here: https://www.osti.gov/biblio/1615774 and is compatible with Kraken2. We then integrated the viral classification database with databases created with genomes from NCBI for use with ParaKraken (a parallelized version of Kraken provided in Supplemental Zip 1), a metagenomic/transcriptomic classifier. To illustrate the breadth of our utility for classifying metagenome viruses, we analyzed data from a plant metagenome study identifying genotypic and compartment specific differences between two Populus genotypes in three different compartments. We also identified a significant increase in abundance of eight viral sequences in post mortem brains in a human metatranscriptome study comparing Autism Spectrum Disorder patients and controls. We also show the potential accuracy for classifying viruses by utilizing both the JGI and NCBI viral databases to identify the uniqueness of viral sequences. Finally, we validate the accuracy of viral classification with NCBI databases containing viruses with taxonomy to identify pathogenic viruses in known COVID-19 and cassava brown streak virus infection samples. Our method represents the compulsory first step in better understanding the role of viruses in the microbiome by allowing for a more complete identification of sequences without taxonomy. Better classification of viruses will improve identifying associations between viruses and their hosts as well as viruses and other microbiome members. Despite the lack of taxonomy, this database of metagenomic viruses can be used with any tool that utilizes a taxonomy, such as Kraken, for accurate classification of viruses.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2023

A novel method for co-optimizing battery sizing and charging strategy of battery electric bus fleets: An application to the city of Paris

Battery-electric buses (BEBs) are a promising technology for replacing diesel buses and reducing their environmental burden. However, their charging process can take several hours, depending on the charging technique and strategy, making them susceptible to schedule disruptions. Furthermore, the selection of the charging strategy and battery size can increase the total capital investment and operational expenses of a BEB fleet, which is a major obstacle to its adoption. Therefore, to minimize the total cost of ownership (TCO) and prevent schedule disruptions, it is essential to establish a well-defined approach to determine an appropriate battery size and charging strategy for BEB fleets. This paper presents a method for reducing the TCO of BEB by determining the optimal battery size and charging strategy for each bus while satisfying operating constraints. The method involves a two-step optimization algorithm that uses Dynamic Programming and Genetic Algorithm. Further, the study applies this approach to the bus fleet serving line 21 in Paris and generates the optimal battery sizing, charging strategy, and required charging infrastructure. The results indicate that 100 kWh batteries offer the best trade-off between capital and operational expenditure for the fleet deployment if used with 65–85 kW chargers at bus terminals.

33 ADVANCED PROPULSION SYSTEMS↗