Recommendations for NASA research and development in artificial intelligence

Basic artificial intelligence (AI) research, AI applications, engineering, institutional management, and previously impractical missions enabled by AI are discussed

Landscape of solutions in constraint satisfaction problems

We present a theoretical framework for characterizing the geometrical properties of the space of solutions in constraint satisfaction problems, together with practical algorithms for studying this structure on particular instances. We apply our method to the coloring problem, for which we obtain the total number of solutions and analyze in detail the distribution of distances between solutions.Comment: 4 pages, 4 figures. Replaced with published versio

NASA space station automation: AI-based technology review. Executive summary

Research and Development projects in automation technology for the Space Station are described. Artificial Intelligence (AI) based technologies are planned to enhance crew safety through reduced need for EVA, increase crew productivity through the reduction of routine operations, increase space station autonomy, and augment space station capability through the use of teleoperation and robotics

Performance of an environmental test to detect Mycobacterium bovis infection in badger social groups

A study by Courtenay and others (2006) demonstrated that the probability of detecting Mycobacterium bovis by PCR in soil samples from the spoil heaps of main badger setts correlated with the prevalence of excretion (infectiousness) of captured badgers belonging to the social group. It has been proposed that such a test could be used to target badger culling to setts containing infectious animals (Anon 2007). This short communication discusses the issues surrounding this concept, with the intention of dispelling any misconceptions among relevant stakeholders (farmers, policy makers and conservationists)

The Peculiar Phase Structure of Random Graph Bisection

The mincut graph bisection problem involves partitioning the n vertices of a graph into disjoint subsets, each containing exactly n/2 vertices, while minimizing the number of "cut" edges with an endpoint in each subset. When considered over sparse random graphs, the phase structure of the graph bisection problem displays certain familiar properties, but also some surprises. It is known that when the mean degree is below the critical value of 2 log 2, the cutsize is zero with high probability. We study how the minimum cutsize increases with mean degree above this critical threshold, finding a new analytical upper bound that improves considerably upon previous bounds. Combined with recent results on expander graphs, our bound suggests the unusual scenario that random graph bisection is replica symmetric up to and beyond the critical threshold, with a replica symmetry breaking transition possibly taking place above the threshold. An intriguing algorithmic consequence is that although the problem is NP-hard, we can find near-optimal cutsizes (whose ratio to the optimal value approaches 1 asymptotically) in polynomial time for typical instances near the phase transition.Comment: substantially revised section 2, changed figures 3, 4 and 6, made minor stylistic changes and added reference

Exhaustive enumeration unveils clustering and freezing in random 3-SAT

We study geometrical properties of the complete set of solutions of the random 3-satisfiability problem. We show that even for moderate system sizes the number of clusters corresponds surprisingly well with the theoretic asymptotic prediction. We locate the freezing transition in the space of solutions which has been conjectured to be relevant in explaining the onset of computational hardness in random constraint satisfaction problems.Comment: 4 pages, 3 figure

Random Costs in Combinatorial Optimization

The random cost problem is the problem of finding the minimum in an exponentially long list of random numbers. By definition, this problem cannot be solved faster than by exhaustive search. It is shown that a classical NP-hard optimization problem, number partitioning, is essentially equivalent to the random cost problem. This explains the bad performance of heuristic approaches to the number partitioning problem and allows us to calculate the probability distributions of the optimum and sub-optimum costs.Comment: 4 pages, Revtex, 2 figures (eps), submitted to PR

Eulerian simulation of the fluid dynamics of helicopter brownout

A computational model is presented that can be used to simulate the development of the dust cloud that can be entrained into the air when a helicopter is operated close to the ground in desert or dusty conditions. The physics of this problem, and the associated pathological condition known as ‘brownout’ where the pilot loses situational awareness as a result of his vision being occluded by dust suspended in the flow around the helicopter, is acknowledged to be very complex. The approach advocated here involves an approximation to the full dynamics of the coupled particulate-air system. Away from the ground, the model assumes that the suspended particles remain in near equilibrium under the action of aerodynamic forces. Close to the ground, this model is replaced by an algebraic sublayer model for the saltation and entrainment process. The origin of the model in the statistical mechanics of a distribution of particles governed by aerodynamic forces allows the validity of the method to be evaluated in context by comparing the physical properties of the suspended particulates to the local properties of the flow field surrounding the helicopter. The model applies in the Eulerian frame of reference of most conventional Computational Fluid Dynamics codes and has been coupled with Brown’s Vorticity Transport Model. Verification of the predictions of the coupled model against experimental data for particulate entrainment and transport in the flow around a model rotor are encouraging. An application of the coupled model to analyzing the differences in the geometry and extent of the dust clouds that are produced by single main rotor and tandem-rotor configurations as they decelerate to land has shown that the location of the ground vortex and the size of any regions of recirculatory flow, should they exist, play a primary role in governing the extent of the dust cloud that is created by the helicopter