Search NASA⌕ Search

SEARCH · Search NASA

Results for “backtracking”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

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

At least 19 records

Performance Improvements Through Advanced PV Backtracking on Uneven Terrain

The climatic sensitivity of new terrain-aware backtracking algorithms is evaluated across 800 locations in the continental USA on a representative synthetic rolling terrain. We find that a global optimization approach to backtracking results in climate-specific annual energy gains of 2.4%–3.2% relative to a traditional backtracking algorithm baseline. We identify a strong logarithmic correlation between local diffuse fraction and yield improvement, and highlight the effect of seasonal precipitation on performance gains. We also find that a backtracking approach, which approximates the terrain as constant, does not offer significant annual energy gains over the baseline on the synthetic terrain. Our findings suggest that specific yield from backtracking in the USA can be improved by as much as 88 kWh/kW by considering terrain when selecting a backtracking algorithm.

Backtracking↗

Maximizing Yield with Improved Single-Axis Backtracking on Cross-Axis Slopes

Many tracking PV systems avoid row-to-row shading by backtracking in morning and afternoon. Because the common single-axis backtracking implementation assumes the array is in a horizontal plane, it does not fully prevent row-to-row shading in arrays installed on cross-axis slopes, e.g. an east-west slope for a tracker with north-south axis alignment. This paper presents the simulated effect of reduced self-shading on annual production with two modified backtracking strategies. Depending on the array geometry and the steepness of the cross-axis grade, using a modified backtracking strategy improved annual yield by 3-10%.

41 EE - Solar Energy Technologies Office (EE-4S)↗

Maximizing Yield with Improved Single-Axis Backtracking on Cross-Axis Slopes: Preprint

Many tracking PV systems avoid row-to-row shading by backtracking in morning and afternoon. Because the common single-axis backtracking implementation assumes the array is in a horizontal plane, it does not fully prevent row-to-row shading in arrays installed on cross-axis slopes. This paper simulates the effect of reduced self-shading on annual production with two modified backtracking strategies. Depending on the array geometry and the steepness of the cross-axis grade, using a modified backtracking strategy improved annual yield by 3-10%.

41 EE - Solar Energy Technologies Office (EE-4S)↗

A Linear Programming Approach to Backtracking for Single-Axis Trackers on Rolling Terrain

In this article, we present a computationally efficient method for determining optimal backtracking rotations for single-axis solar trackers on nonuniform terrain. The method allows for ganged tracking, mechanical rotation constraints, uneven row spacing, and arbitrary maximum allowable shaded fractions (to enable “fractional backtracking”). As with previous 2-D approaches, the method is suitable for terrain that varies in the transverse direction with respect to the rotation axis of the trackers. The novelty of the method lies in formulating the problem of shade avoidance as a linear problem, which is achieved by using the row interception width as the optimization variable instead of rotation angles. Formulating backtracking as a linear problem enables the use of extremely efficient linear programming algorithms, making the method highly scalable, requiring less than 1 min to compute optimal rotation schedules for hundreds of trackers. It also produces more effective backtracking rotations, reducing the frequency of shading by 4× and improving system energy output by 1%–2%.

Optimization↗

Ising model observables and non-backtracking walks

This paper presents an alternative proof of the connection between the partition function of the Ising model on a finite graph G and the set of non-backtracking walks on G. The techniques used also give formulas for spin-spin correlation functions in terms of non-backtracking walks. The main tools used are Viennot's theory of heaps of pieces and turning numbers on surfaces.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Shaded fraction and backtracking in single-axis trackers on rolling terrain

A generalized closed-form equation for the shaded collector fraction in solar arrays on rolling or undulating terrain is provided for single-axis tracking and fixed-tilt systems. The equation accounts for different rotation angles between the shaded and shading trackers, cross-axis slope between the two trackers, and offset between the collector plane and axis of rotation. The validity of the equation is demonstrated through comparison with numerical ray-tracing simulations and remaining minor sources of error are quantified. Additionally, a simple procedure to determine backtracking rotations for each row in an array installed on the rolling terrain (varying in the direction perpendicular to the tracker axes) is provided. The backtracking equation accounts for a desired shaded fraction (including complete shade avoidance) as well as an axis-collector offset. Test cases are provided to facilitate implementation of these equations.

14 SOLAR ENERGY↗

Expected performance of m-solution backtracking

This paper derives upper bounds on the expected number of search tree nodes visited during an m-solution backtracking search, a search which terminates after some preselected number m problem solutions are found. The search behavior is assumed to have a general probabilistic structure. The results are stated in terms of node expansion and contraction. A visited search tree node is said to be expanding if the mean number of its children visited by the search exceeds 1 and is contracting otherwise. It is shown that if every node expands, or if every node contracts, then the number of search tree nodes visited by a search has an upper bound which is linear in the depth of the tree, in the mean number of children a node has, and in the number of solutions sought. Also derived are bounds linear in the depth of the tree in some situations where an upper portion of the tree contracts (expands), while the lower portion expands (contracts). While previous analyses of 1-solution backtracking have concluded that the expected performance is always linear in the tree depth, the model allows superlinear expected performance.

Nicol, D. M.↗

Empirical results on scheduling and dynamic backtracking

At the Honeywell Technology Center (HTC), we have been working on a scheduling problem related to commercial avionics. This application is large, complex, and hard to solve. To be a little more concrete: 'large' means almost 20,000 activities, 'complex' means several activity types, periodic behavior, and assorted types of temporal constraints, and 'hard to solve' means that we have been unable to eliminate backtracking through the use of search heuristics. At this point, we can generate solutions, where solutions exist, or report failure and sometimes why the system failed. To the best of our knowledge, this is among the largest and most complex scheduling problems to have been solved as a constraint satisfaction problem, at least that has appeared in the published literature. This abstract is a preliminary report on what we have done and how. In the next section, we present our approach to treating scheduling as a constraint satisfaction problem. The following sections present the application in more detail and describe how we solve scheduling problems in the application domain. The implemented system makes use of Ginsberg's Dynamic Backtracking algorithm, with some minor extensions to improve its utility for scheduling. We describe those extensions and the performance of the resulting system. The paper concludes with some general remarks, open questions and plans for future work.

Boddy, Mark S.↗

Backtracking and Re-execution in the Automatic Debugging of Parallelized Programs

In this work we describe a new approach using relative debugging to find differences in computation between a serial program and a parallel version of th it program. We use a combination of re-execution and backtracking in order to find the first difference in computation that may ultimately lead to an incorrect value that the user has indicated. In our prototype implementation we use static analysis information from a parallelization tool in order to perform the backtracking as well as the mapping required between serial and parallel computations.

Matthews, Gregory↗

Slope-Aware Backtracking for Single-Axis Trackers

Closed-form equations of the true-tracking angle, backtracking angle, shaded fraction, and orientation angles of single-axis solar trackers installed on arbitrarily oriented slopes are derived. These slope-aware adjustments are necessary to successfully prevent row to row shading in arrays with nonzero cross-axis slope. A tracker rotation modeling procedure comprising these equations is provided.

14 SOLAR ENERGY↗

Generalizing Backtrack-Free Search: A Framework for Search-Free Constraint Satisfaction

Tractable classes of constraint satisfaction problems are of great importance in artificial intelligence. Identifying and taking advantage of such classes can significantly speed up constraint problem solving. In addition, tractable classes are utilized in applications where strict worst-case performance guarantees are required, such as constraint-based plan execution. In this work, we present a formal framework for search-free (backtrack-free) constraint satisfaction. The framework is based on general procedures, rather than specific propagation techniques, and thus generalizes existing techniques in this area. We also relate search-free problem solving to the notion of decision sets and use the result to provide a constructive criterion that is sufficient to guarantee search-free problem solving.

Jonsson, Ari K.↗

A Graph Based Backtracking Algorithm for Solving General CSPs

Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complete task in general, tractable classes of CSPs have been identified based on the structure of the underlying constraint graphs. Much effort has been spent on exploiting structural properties of the constraint graph to improve the efficiency of finding a solution. These efforts contributed to development of a class of CSP solving algorithms called decomposition algorithms. The strength of CSP decomposition is that its worst-case complexity depends on the structural properties of the constraint graph and is usually better than the worst-case complexity of search methods. Its practical application is limited, however, since it cannot be applied if the CSP is not decomposable. In this paper, we propose a graph based backtracking algorithm called omega-CDBT, which shares merits and overcomes the weaknesses of both decomposition and search approaches.

Pang, Wanlin↗

A Constraint-Based Planner for Data Production

This paper presents a graph-based backtracking algorithm designed to support constrain-tbased planning in data production domains. This algorithm performs backtracking at two nested levels: the outer- backtracking following the structure of the planning graph to select planner subgoals and actions to achieve them and the inner-backtracking inside a subproblem associated with a selected action to find action parameter values. We show this algorithm works well in a planner applied to automating data production in an ecological forecasting system. We also discuss how the idea of multi-level backtracking may improve efficiency of solving semi-structured constraint problems.

Pang, Wanlin↗

Orbit-product representation and correction of Gaussian belief propagation

We present a new interpretation of Gaussian belief propagation (GaBP) based on the 'zeta function' representation of the determinant as a product over orbits of a graph. We show that GaBP captures back-tracking orbits of the graph and consider how to correct this estimate by accounting for non-backtracking orbits. We show that the product over non-backtracking orbits may be interpreted as the determinant of the non-backtracking adjacency matrix of the graph with edge weights based on the solution of GaBP. An efficient method is proposed to compute a truncated correction factor including all non-backtracking orbits up to a specified length.

99 GENERAL AND MISCELLANEOUS↗

Pause sequences facilitate entry into long-lived paused states by reducing RNA polymerase transcription rates

Transcription by RNA polymerase (RNAP) is interspersed with sequence-dependent pausing. The processes through which paused states are accessed and stabilized occur at spatiotemporal scales beyond the resolution of previous methods, and are poorly understood. Here, we combine high-resolution optical trapping with improved data analysis methods to investigate the formation of paused states at enhanced temporal resolution. We find that pause sites reduce the forward transcription rate of nearly all RNAP molecules, rather than just affecting the subset of molecules that enter long-lived pauses. We propose that the reduced rates at pause sites allow time for the elongation complex to undergo conformational changes required to enter long-lived pauses. We also find that backtracking occurs stepwise, with states backtracked by at most one base pair forming quickly, and further backtracking occurring slowly. Finally, we find that nascent RNA structures act as modulators that either enhance or attenuate pausing, depending on the sequence context.

59 BASIC BIOLOGICAL SCIENCES↗

RANDOM BALLISTIC INTERPRETATION OF NONLINEAR GUIDING CENTER THEORY

Nonlinear guiding center (NLGC) theory has been used to explain the asymptotic perpendicular diffusion coefficient {kappa} of energetic charged particles in a turbulent magnetic field, which can be applied to better understand cosmic ray transport. Here we re-derive NLGC, replacing the assumption of diffusive decorrelation with random ballistic decorrelation (RBD), which yields an explicit formula for {kappa} . We note that scattering processes can cause a reversal of the guiding center motion along the field line, i.e., 'backtracking', leading to partial cancellation of contributions to {kappa}, especially for low-wavenumber components of the magnetic turbulence. We therefore include a heuristic backtracking correction (BC) that can be used in combination with RBD. In comparison with computer simulation results for various cases, NLGC with RBD and BC provides a substantially improved characterization of the perpendicular diffusion coefficient for a fluctuation amplitude less than or equal to the large-scale magnetic field.

79 ASTRONOMY AND ASTROPHYSICS↗