Micro-task markets like Amazon MTurk enable online workers to provide human intelligence as Web-based on demand services (so called "people services"). Businesses facing large amounts of knowledge work can benefit from increased flexibility and scalability of their workforce but need to cope with reduced control of result quality. While this problem is well recognized, it has so far only rudimentarily been addressed by existing platforms and tools. In this paper, we present a flexible research toolkit which enables experiments with advanced quality management mechanisms for generic micro-task markets. The toolkit enables control of correctness and performance of task fulfillment by means of continuous sampling, dynamic majority voting and worker pooling. While we demonstrate its application and performance for an OCR scenario building on Amazon MTurk, the toolkit supports the development of advanced quality management mechanisms for a large variety of people service scenarios and platforms.

It is well known that argumentation can usefully be analysed as a distinct, if complex, type of speech act. Speech acts that form a part of argumentative discourse, and in particular, of argumentative dialogue, can be seen as anchors for the establishment of inferences between propositions in the domain of discourse. Most often, the speech acts that directly give rise to inference are implicit, but can be drawn out in analysis by consideration of the type of dialogue game being played. AI approaches to argumentation often focus solely on such inferences as the means by which persuasion can be effected – but this is in contrast with psychological and rhetorical models which have long recognised the role played by extra-logical features of the dialogical context. These ‘peripheral’ cues can not only affect persuasive effect of the logical, ‘central’ argumentation, but can override and dominate it. This paper presents a theory which allows both central and peripheral aspects of argumentation to be represented in a coherent analytical account based on the sequences of speech acts which constitute dialogues.

Despite recent impressive progress in automated planning and navigation tools, artifacts still lack robustness and flexibility of biological systems. In order to mimic biology, it is necessary to use principles of dynamics and architecture found in the brain. Here we translate our biologically inspired model of spatial learning and navigation (Samsonovich and Ascoli, L&M 2005) into a model suitable for implementation in spiking networks with STDP synapses, based on soon to become available hardware. Simulation studies of the model prove its robustness and scalability. The approach naturally extends to various types of action planning beyond the spatial domain. The architecture can be used in autonomous intelligent agents of various nature.

In this paper we describe the integration of a robot control platform (Player/Stage) and a real robot (Pioneer P3DX) with PELEA (Planning, Execution and LEarning Architecture). PELEA is a general-purpose planning architecture suitable for a wide range of real world applications, from robotics to emergency management. It allows planning engineers to generate planning applications since it integrates planning, execution, replanning, monitoring and learning capabilities. We also present a relational learning approach for automatically modeling robot-action execution durations, with the purpose of improving the planning process of PELEA by refining domain definitions.

Reasoning agents are often faced with the need to robustly deal with erroneous information. When a robot given the task of returning with the red cup from the kitchen table arrives in the kitchen to find no red cup but instead notices a blue cup and a red plate on the table, what should it do? The best course of action is to attempt to salvage the situation by relying on its preferences to return with one of the objects available. We provide a solution to this problem using the Situation Calculus extended with a notion of belief. We then provide an efficient practical implementation by mapping this formalism into default rules for which we have an implemented solver.

We present our efforts to deploy mobile robots in office environments, focusing in particular on the challenge of planning a schedule for a robot to accomplish user-requested actions. We concretely aim to make our CoBot mobile robots available to execute navigational tasks requested by users, such as telepresence, and picking up and delivering messages or objects at different locations. We contribute an efficient web-based approach in which users can request and schedule the execution of specific tasks. The scheduling problem is converted to a mixed integer programming problem. The robot executes the scheduled tasks using a synthetic speech and touch-screen interface to interact with users, while allowing users to follow the task execution online. Our robot uses a robust Kinect-based safe navigation algorithm, moves fully autonomously without the need to be chaperoned by anyone, and is robust to the presence of moving humans, as well as non-trivial obstacles, such as legged chairs and tables. Our robots have already performed 15km of autonomous service tasks.

In this paper we present a principled planner based approach to the active visual object search problem in unknown environments. We make use of a hierarchical planner that combines the strength of decision theory and heuristics. Furthermore, our object search approach leverages on the conceptual spatial knowledge in the form of object co-occurrences and semantic place categorisation. A hierarchical model for representing object locations is presented with which the planner is able to perform indirect search. Finally we present real world experiments to show the feasibility of the approach.

The ability to plan their own motions and to reliably execute them is an important precondition for autonomous robots. In this paper, we consider the problem of planning the motion of a mobile manipulation robot in the presence of deformable objects in the environment. Our approach combines probabilistic roadmap planning with a deformation simulation system. Since the physical deformation simulation is computationally demanding, we use an efficient variant of Gaussian process regression to estimate the deformation cost for individual objects based on training examples. We generate the training data by employing a simulation system in a preprocessing step. Consequently, no simulations are needed during runtime. We implemented and tested our approach on a mobile manipulation robot. Our experiments show that the robot is able to accurately predict and thus consider the deformation cost its manipulator introduces to the environment during motion planning. Simultaneously, the computation time is substantially reduced compared to a system that performs physical simulations online.

In Hypertable ranges of table data are stored and accessed on different nodes and allows for flexible management of the underlying hardware. Overall performance is sensitive to the balance of range load across the cluster. The project developers aim to create a simple interface to allow researchers to design experimental load balancing strategies that incorporate machine learning and optimization. This paper specifies the load balancing problem and introduces it as a challenge problem for AI and machine learning.

This paper proposes a new challenging optimization problem, called COOLING-AWARE WORKLOADPLACEMENT PROBLEM, that looks for a workload placement that optimizes the overall data center power consumption given by the sum of the server power consumption and of the computer room air conditioner power consumption. We formulate CWPP as a Mixed Integer Non Linear Problem using a cross-interferencematrix that links the workload placement to the cold airtemperature. Since state-of-the-art Mixed Integer Non Linear solvers can solve to optimality only the smallest instances, we devised two heuristics to obtain good feasible solutions: (i) a heuristic algorithm based on an integer linear relaxation of the problem, and (ii) a VariableNeighborhood Search algorithm. Both heuristic algorithms are evaluated against the best lower bounds obtained with a Mixed Integer Non Linear solver. Preliminary computational results show that both heuristics provide solutions that have a small percentage gap from the optimal solutions.