Past educational robotics research has indicated that the use of simulators can increase students’ performance in introductory robotics programming courses. In this paper, we introduce a simulator for the iRobot Create that works on Windows PCs. It was developed to work with a Python robotics library and includes an Eclipse plugin, but can simulate any library that uses the serial Open Interface on the Create. The platform, library, and simulator are all easy to use and have been well-received initially by students.

Machine reading aims to automatically extract knowledge from text. It is a long-standing goal of AI and holds the promise of revolutionizing Web search and other fields. In this paper, we analyze the core challenges of machine reading and show that statistical relational AI is particularly well suited to address these challenges. We then propose a unifying approach to machine reading in which statistical relational AI plays a central role. Finally, we demonstrate the promise of this approach by presenting OntoUSP, an end-to-end machine reading system that builds on recent advances in statistical relational AI and greatly outperforms state-of-the-art systems in a task of extracting knowledge from biomedical abstracts and answering questions.

Many approaches were explored in recent years to introduce principles of metacognition and meta-learning into cognitive architectures, yet none of them resulted in a scalable human-like learner. This work presents an approach intended to fill the gap between human self-regulated learners and artificial learners by introducing a new spin of the familiar core cognitive architecture paradigm, taking it to a meta-level. The resultant architecture enables in artifacts exclusively human higher cognitive and learning abilities: specifically, deliberative new knowledge construction. Model predictions agree with results of a pilot study with human subjects.

The Model AI Assignments session seeks to gather and disseminate the best assignment designs of the Artificial Intelligence (AI) Education community. Recognizing that assignments form the core of student learning experience, we here present abstracts of eight AI assignments that are easily adoptable, playfully engaging, and flexible for a variety of instructor needs.

The Department of Computer Science at the University of Southern California recently created two new degree programs, namely a Bachelor's Program in Computer Science (Games) and a Master's Program in Computer Science (Game Development). In this paper, we discuss two projects that use games as motivator. First, the Computer Games in the Classroom Project develops stand-alone projects on standard artificial intelligence topics that use video-game technology to motivate the students but do not require the students to use game engines. Second, the Pinball Project develops the necessary hardware and software to enable students to learn concepts from robotics by developing games on actual pinball machines.

We present a new robot platform, the Finch, that was designed to align with the learning goals and concepts taught in introductory computer science courses. The Finch was developed in the context of the CSbots program, the goal of which is to improve retention and learning in computer science courses through the use of robots and other physically embodied hardware. This paper concentrates on design constraints that were determined in earlier CSbots studies and how those constraints were instantiated by the Finch. We also present some preliminary results from pilot studies in which Finch robots were used in CS1 and CS2 classes.

In this paper, we describe the outline for a course-long information retrieval (IR) project. The project guides the students in constructing a working IR system from the ground up. The first half of the project is structured and closely follows common foundational IR concepts. During this portion of the project, a bare-bones IR system is constructed. For the last half of the project, students (in groups) implement research-driven extensions to the basic system with the additional constraint that their project must integrate with the base system. By the end, the students have worked on a large software project (~40 classes with thousands of lines of code) in a group setting as well as been introduced to the research process. This project plan has been successfully used in an undergraduate course; resources including starter code, solutions, and an example IR system with project write-ups are available.

In Australia, the Scientists-in-Schools program partners professional scientists with teachers from K-12 schools to improve early engagement and educational outcomes in the sciences and mathematics.  An overview of the developing syllabus of a K-6 course resulting from the pairing of a senior AI researcher with teachers from a K-6 (primary) school is presented. Now entering its third year, the course introduces the basic concepts, vocabulary and history of science generally and AI specifically in a manner that emphasises student engagement and provides a challenging but age appropriate syllabus. Reflecting on the course at this time provides an action research basis for ongoing maturation of the syllabus, and the paper is presented in that light.

Mixed reality is an important classroom tool for managing complexity from both the students' and instructor's standpoints. It can be used to provide important scaffolds when introducing robotics, by allowing elements of perception and control to be abstracted, and these abstractions removed as a course progresses (or left in place to introduce robotics to younger groups of students). In prior work, we have illustrated the potential of this approach both in providing scaffolding, building an inexpensive robotics laboratory, and also providing control of evaluation of robotics environments for student evaluation and scientific experimentation. In this paper, we explore integrating extensions and improvements to the mixed reality components themselves as part of a course in applied artificial intelligence and robotics. We present a set of assignments that in addition to exploring robotics concepts, actively integrate creating or improving mixed reality components. We find that this approach better leverages the advantages brought about by mixed reality in terms of student motivation, and also provides some very useful software engineering experience to the students.

The stable marriage (SM) problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more generally to any two-sided market. In the classical formulation, n men and n women express their preferences (via a strict total order) over the members of the other sex. Solving a SM problem means finding a stable marriage where stability is an envy-free notion: no man and woman who are not married to each other would both prefer each other to their partners or to being single. We consider both the classical stable marriage problem and one of its useful variations (denoted SMTI) where the men and women express their preferences in the form of an incomplete preference list with ties over a subset of the members of the other sex. Matchings are permitted only with people who appear in these lists, an we try to find a stable matching that marries as many people as possible. Whilst the SM problem is polynomial to solve, the SMTI problem is NP-hard. We propose to tackle both problems via a local search approach, which exploits properties of the problems to reduce the size of the neighborhood and to make local moves efficiently. We evaluate empirically our algorithm for SM problems by measuring its runtime behaviour and its ability to sample the lattice of all possible stable marriages. We evaluate our algorithm for SMTI problems in terms of both its runtime behaviour and its ability to find a maximum cardinality stable marriage.For SM problems, the number of steps of our algorithm grows only as O(nlog(n)), and that it samples very well the set of all stable marriages. It is thus a fair and efficient approach to generate stable marriages.Furthermore, our approach for SMTI problems is able to solve large problems, quickly returning stable matchings of large and often optimal size despite the NP-hardness of this problem.