The undergraduate computer science curriculum is generally focused on skills and tools;  most students are not exposed to much  research in the field, and do not learn how to navigate the research literature.  We describe how science fiction reviews were used as a gateway to research reviews.  Students learn a little about current or recent research on a topic that stirs their imagination, and learn how to search for, read critically, and compare technical papers on a topic related their chosen science fiction book, movie, or TV show.

RoadNarrows has entered the “desktop-size” 5 degree of freedom robot arm, Hekateros, in the Small-Scale Manipulator Challenge, at the 2011 AAAI conference. Hekateros is utilizing a variety of sensors and software to successfully perceive and manipulate the chess gam

Students have implemented approaches to these problems, using our HRTeam framework (Sklar et al. 2010), which is built on Player/Stage (Vaughan and Gerkey 2007).

We present the initial stage of our research on Learning from Demonstration algorithms. We have implemented an algorithm based on Confident Execution, one of the components of the Confidence-Based Autonomy algorithm developed by Chernova and Veloso. Our preliminary experiments were conducted first in simulation and then using a Sony AIBO ERS-7 robot. So far, our robot has been able to learn crude navigation strategies, despite limited trials. We are currently working on improving our implementation by including additional features that describe more broadly the state of the agent. Our long term goal is to incorporate Learning from Demonstration techniques in our HRTeam (human/multi-robot) framework.

The design and implementation of a robotic chess agent is described. Shallow Blue, a competitor in the AAAI 2011 Small Scale Manipulation Challenge, is constructed with low-cost components including Lego NXT bricks and is programmed using Java and Lejos.

The initial idea of using Lego Mindstorms Robots for student courses had soon to be expanded to a simulation environment as the user base in students grew larger and the need for parallel development and testing arose. An easy to use and easy to set up means of providing positioning data led to the creation of an indoor positioning system so that new users can adapt quickly and successfully, as sensors on the actual robots are difficult to configure and hard to interpret in an environmental context. A global positioning system shared among robots can make local sensors obsolete and still deliver more precise information than currently available sensors, also providing the base necessary for the robots to effectively work on shared tasks as a group. Further more, a simulator for robots programmed with Fujaba and Java which was developed along the way can be used by many developers simultaneously and lets them evaluate their code in a simple way, while close to real-world results.

This paper describes our efforts preparing a mobile manipulator for the 2011 AAAI Small Scale Manipulation Challenge. We describe our approach to building a low-cost mobile manipulator for human-scale environments using ROS and off-the-shelf sensory and servos.

That drone and its basic capabilities are summarized in Figure 1. The flexibility and controllability of quadrotor helicopters have made them a recent focus of interest among robotics and AI research groups. At the same time, their popularity has led to a wide range of commercially available platforms, some at prices accessible for undergraduate educational use. This project evaluates the ARDrone quadrotor helicopter as a basis for use in undergraduate classes such as robotics, computer vision, or embodied AI. We have encountered both successes and frustrations in using the ARDrone to date. Looking forward, the quadrotor's capabilities do seem a promising basis for future curricular offerings.

Much recent work in satisficing planning has aimed at striking a balance between coverage - solving as many problems as possible - and plan quality. Current planners achieve near perfect coverage on the latest IPC benchmarks. It is therefore natural to investigate their scaling behavior on more difficult instances. Among state of the art planners, LAMA (Richter, Helmert, and Westphal 2008) is able to generate high quality plans, but its coverage drops off rapidly with increasing prob- lem complexity. The Arvand planner (Nakhost and Müller 2009) scales to much harder instances but generates lower quality plans. This paper introduces a new algorithm, Monte Carlo Random Walk-based Local Tree Search (MRW-LTS), which uses random walks to selectively build local search trees. Experiments demonstrate that MRW-LTS combines a scaling behavior that is better than LAMA’s with a plan quality that is better than Arvand’s.

Freuder and Elfe (1996) introduced Neighborhood Inverse Consistency (NIC) for binary CSPs. In this paper, we introduce RNIC, the extension of NIC to non-binary CSPs, and describe a practical algorithm for enforcing it. We propose an adaptive strategy to weaken or strengthen this property based on the connectivity of the network. We demonstrate the effectiveness of RNIC as a full lookahead strategy during search for solving difficult benchmark problems.