Robots reason about abstract actions, such as "go to position `l'", in order to decide what to do or to generate plans for their intended course of action. The use of abstract actions enables robots to employ small action libraries, which reduces the search space for decision making. When executing the actions, however, the robot must tailor the abstract actions to the specific task and situation context at hand. In this article we propose a novel robot action execution system that learns success and performance models for possible specializations of abstract actions. At execution time, the robot uses these models to optimize the execution of abstract actions to the respective task contexts. The robot can so use abstract actions for efficient reasoning, without compromising the performance of action execution. We show the impact of our action execution model in three robotic domains and on two kinds of action execution problems: (1) the instantiation of free action parameters to optimize the expected performance of action sequences; (2) the automatic introduction of additional subgoals to make action sequences more reliable.

Art historians and archaeologists have long grappled with the regional classification of ancient Near Eastern ivory carvings. Based on the visual similarity of sculptures, individuals within these fields have proposed object assemblages linked to hypothesized regional production centers. Using quantitative rather than visual methods, we here approach this classification task by exploiting computational methods from machine learning currently used with success in a variety of statistical problems in science and engineering. We first construct a prediction function using 66 categorical features as inputs and regional style as output. The model assigns regional style group (RSG), with 98 percent prediction accuracy. We then rank these features by their mutual information with RSG, quantifying single-feature predictive power. Using the highest- ranking features in combination with nomographic visualization, we have found previously unknown relationships that may aid in the regional classification of these ivories and their interpretation in art historical context.

The games of prediction with expert advice are considered in this paper. We present some modification of Kalai and Vempala algorithm of following the perturbed leader for the case of unrestrictedly large one-step gains. We show that in general case the cumulative gain of any probabilistic prediction algorithm can be much worse than the gain of some expert of the pool. Nevertheless, we give the lower bound for this cumulative gain in general case and construct a universal algorithm which has the optimal performance; we also prove that in case when one-step gains of experts of the pool have ``limited deviations'' the performance of our algorithm is close to the performance of the best expert.

The paper investigates stochastic resource allocation problems with scarce, reusable resources and non-preemtive, time-dependent, interconnected tasks. This approach is a natural generalization of several standard resource management problems, such as scheduling and transportation problems. First, reactive solutions are considered and defined as control policies of suitably reformulated Markov decision processes (MDPs). We argue that this reformulation has several favorable properties, such as it has finite state and action spaces, it is aperiodic, hence all policies are proper and the space of control policies can be safely restricted. Next, approximate dynamic programming (ADP) methods, such as fitted Q-learning, are suggested for computing an efficient control policy. In order to compactly maintain the cost-to-go function, two representations are studied: hash tables and support vector regression (SVR), particularly, nu-SVRs. Several additional improvements, such as the application of limited-lookahead rollout algorithms in the initial phases, action space decomposition, task clustering and distributed sampling are investigated, too. Finally, experimental results on both benchmark and industry-related data are presented.

Rev. C) Statistical modeling of nuclear data provides a novel approach to nuclear systematics complementary to established theoretical and phenomenological approaches based on quantum theory. More specifically, fully-connected, multilayer feedforward artificial neural network models are developed using the Levenberg-Marquardt optimization algorithm together with Bayesian regularization and cross-validation. The predictive performance of models emerging from extensive computer experiments is compared with that of traditional microscopic and phenomenological models as well as with the performance of other learning systems, including earlier neural network models as well as the support vector machines recently applied to the same problem. In discussing the results, emphasis is placed on predictions for nuclei that are far from the stability line, and especially those involved in the r-process nucleosynthesis. It is found that the new statistical models can match or even surpass the predictive performance of conventional models for beta-decay systematics and accordingly should provide a valuable additional tool for exploring the expanding nuclear landscape. I. INTRODUCTION "Numbers are the within of all things." Among nuclear physicists this need is driven both by the experimental programs of existing and future radioactive ion beam facilities and by the stresses placed on established nuclear structure theory as totally new areas of the nuclear landscape are opened for exploration. For nuclear astrophysicists, such information is intrinsic to an understanding of supernova explosions - the initialization of the explosion, the subsequent neutronization of the core material, and the strength and fate of the shock wave formed - and the nucleosynthesis of heavy elements above Fe, notably the r-process [3, 4, 5]. Both the element distribution on the r-path and the time scale of the r-process are highly sensitive to the β-decay properties of the neutron-rich nuclei involved. Except for a few key nuclei, β decay of r-process nuclei cannot be studied in terrestrial laboratories, so the required information must come from nuclear models. These include the more phenomenological treatments, such as the Gross Theory (GT), as well as microscopic approaches based on the shell model and the proton-neutron Quasiparticle Random-Phase Approximation (pnQRPA) in various versions.

Past research on probabilistic databases has studied the problem of answering queries on a static database. Application scenarios of probabilistic databases however often involve the conditioning of a database using additional information in the form of new evidence. The conditioning problem is thus to transform a probabilistic database of priors into a posterior probabilistic database which is materialized for subsequent query processing or further refinement. It turns out that the conditioning problem is closely related to the problem of computing exact tuple confidence values. It is known that exact confidence computation is an NP-hard problem. This has led researchers to consider approximation techniques for confidence computation. However, neither conditioning nor exact confidence computation can be solved using such techniques. In this paper we present efficient techniques for both problems. We study several problem decomposition methods and heuristics that are based on the most successful search techniques from constraint satisfaction, such as the Davis-Putnam algorithm. We complement this with a thorough experimental evaluation of the algorithms proposed. Our experiments show that our exact algorithms scale well to realistic database sizes and can in some scenarios compete with the most efficient previous approximation algorithms.

(ESAS 2008).

Human-Robot Interaction (HRI-2008) with robots," highlights the importance It also featured Foundation, and the European a panel on "robo-ethics" intended Network for the Advancement of Artificial to start a discussion of the ethical Cognitive Systems (EU Cognition) and societal implications of provided grants. More than 250 autonomous robots and a panel on representatives from academia, government, "what is HRI?" that examined the constitutive and industry attended HRI-components of human-robot 2008. HRI is the premier forum for the Of the 134 submissions, the program presentation and discussion of committee accepted 48 full research results in human-robot interaction. Human-robot interaction 27 submissions) were featured in a special is inherently interdisciplinary session. The workshops artificial intelligence, cognitive science, addressed metrics (an examination of ergonomics, human-computer proposed guidelines for evaluating interaction, psychology, robotics, and HRI), coding behavioral video data other fields. From 1997 to 2000, he was vice president of development for Fourth Planet, Inc., a developer of real-time visualization software. Fong has published more than 50 papers in field robotics, human-robot interaction, virtual reality user interfaces, and parallel processing, was chair of the 2006 AAAI Spring Symposium on human-robot interaction in space, and is cogeneral chair for HRI-2008. Kerstin Dautenhahn is the research professor of artificial intelligence in the School of Computer Science and coordinator of the Adaptive Systems Research Group at the University of Hertfordshire in the United Kingdom. Save the Date! -- July 11-15, 2010 AAAI comes to Atlanta, Georgia in 2010! Please mark your calendars, and visit www. She was general chair of IEEE RO-MAN06 and cogeneral chair of HRI-2008. Scheutz was the coprogram chair for HRI-Seven student teams competed to award went to "Robots in Organizations: University of Amsterdam took top Jodi Forlizzi.

There have been many erroneous pre-scientific and common sense inductions. We want to understand why people believe in wrong theories. Our hypothesis is that mistaken inductions are due not only to the lack of facts, but also to the poor description of existing facts and to implicit knowledge which is transmitted socially. This paper presents several experiments the aim of which is to validate this hypothesis by using machine learning and data mining techniques to simulate the way people build erroneous theories from observations.

Real-time heuristic search is a challenging type of agent-centered search because the agent's planning time per action is bounded by a constant independent of problem size. A common problem that imposes such restrictions is pathfinding in modern computer games where a large number of units must plan their paths simultaneously over large maps. Common search algorithms (e.g., A*, IDA*, D*, ARA*, AD*) are inherently not real-time and may lose completeness when a constant bound is imposed on per-action planning time. Real-time search algorithms retain completeness but frequently produce unacceptably suboptimal solutions. In this paper, we extend classic and modern real-time search algorithms with an automated mechanism for dynamic depth and subgoal selection. The new algorithms remain real-time and complete. On large computer game maps, they find paths within 7% of optimal while on average expanding roughly a single state per action. This is nearly a three-fold improvement in suboptimality over the existing state-of-the-art algorithms and, at the same time, a 15-fold improvement in the amount of planning per action.