People complete tasks more quickly when they have concrete plans, especially for open-ended, creative tasks. However, people often fail to create such action plans. (How) can systems provide people with these concrete steps automatically? To scalably provide personalized action plans, this paper introduces and evaluates crowdsourcing and peer approaches for creating plans, and NLP techniques for reusing them. We evaluated the effects of action plans on different types of tasks. A between-subjects experiment found that people who received crowd-created plans completed more tasks than people asked to self-create plans and than a control group without action plans. We found that crowd-created action plans are especially effective for lingering and high-level tasks. A second experiment found that peer-provided plans led to more completed tasks than no plans. A third experiment found that participants who received reused action plans also completed more tasks than a control group without action plans. We have incorporated these principles into TaskGenies: a crowd-powered task management system.

It is well established that in certain domains, noisy inputs can be reliablycombined to obtain a better answer than any individual.It is now possible to consider the crowdsourcing of physical actions,commonly used for creative expressions such as drawing, shading, and singing.We provide algorithms for converting low-quality inputobtained from the physical actions of a crowd into high-quality output.The inputs take the form of line drawings, shaded images, and songs.We investigate single-individual crowds (multiple inputs from a single human)and multiple-individual crowds.

General representation, abstraction and exchange definitions are crucial for dynamically configurable context recognition. However, to evaluate potential definitions, suitable standard datasets are needed. This paper presents our effort to create and maintain large scale, multimodal standard datasets for context recognition research. We ourselves used these datasets in previous research to deal with placement effects and presented low-level sensor abstractions in motion based on-body sensing. Researchers, conducting novel data collections, can rely on the toolchain and the the low-level sensor abstractions summarized in this paper. Additionally, they can draw from our experiences developing and conducting context recognition experiments. Our toolchain is already a valuable rapid prototyping tool. Still, we plan to extend it to crowd-based sensing, enabling the general public to gather context data, learn more about their lives and contribute to context recognition research. Applying higher level context reasoning on the gathered context data is a obvious extension to our work.

Many practical planning problems necessitate the generation of a plan under incomplete information about the state of the world. In this paper we propose the notion of Assumption-Based Planning. Unlike conformant planning, which attempts to find a plan under all possible completions of the initial state, an assumption-based plan supports the assertion of additional assumptions about the state of the world, simplifying the planning problem. In many practical settings, such plans can be of higher quality than conformant plans. We formalize the notion of assumption-based planning, establishing a relationship between assumption-based and conformant planning, and prove properties of such plans. We further provide for the scenario where some assumptions are more preferred than others. Exploiting the correspondence with conformant planning, we propose a means of computing assumption-based plans via a translation to classical planning. Our translation is an extension of the popular approach proposed by Palacios and Geffner and realized in their T0 planner. We have implemented our planner, A0, as a variant of T0 and tested it on a number of expository domains drawn from the International Planning Competition. Our results illustrate the utility of this new planning paradigm.

A natural, common way of doing this is by crowdsourcing this stage as well, and specifically Human computation is a fast-growing field that seeks to harness letting people vote over different proposals that were the relative strengths of humans to solve problems that submitted by their peers. For example, in EteRNA thousands are difficult for computers to solve alone. The field has recently of designs are submitted each month, but only a small number been gaining traction within the AI community, as k of them can be synthesized in the lab (as of late 2011, increasingly more deep connections between AI and human k 8). To single out k designs to be synthesized, players computation are uncovered (Dai, Mausam, and Weld 2010; vote by reporting their k favorite designs, each of which is Shahaf and Horvitz 2010).

Reading groups domain is a new domain for group recommenders. In this paper we propose a web based group recommender system which is called BoRGo: Book Recommender for Reading Groups, for reading groups domain. BoRGo uses a new information filtering technique which uses the difference between positive and negative feedbacks about a feature of a user profile and also presents an interface for after recommendation processes like achieving a consensus on the reading list.

In the area of reasoning about actions, one of the key computational problems is the projection problem: to find whether a given logical formula is true after performing a sequence of actions. This problem is undecidable in the general situation calculus; however, it is decidable in some fragments. We consider a fragment P of the situation calculus and Reiter’s basic action theories (BAT) such that the projection problem can be reduced to the satisfiability problem in an expressive description logic ALCO(U) that includes nominals (O), the universal role (U), and constructs from the well-known logic ALC. It turns out that our fragment P is more expressive than previously explored description logic based fragments of the situation calculus. We explore some of the logical properties of our theories. In particular, we show that the projection problem can be solved using regression in the case where BATs include a general “static” TBox, i.e., an ontology that has no occurrences of fluents. Thus, we propose seamless integration of traditional ontologies with reasoning about actions. We also show that the projection problem can be solved using progression if all actions have only local effects on the fluents, i.e., in P, if one starts with an incomplete initial theory that can be transformed into an ALCO(U) concept, then its progression resulting from the execution of a ground action can still be expressed in the same language. Moreover, we show that for a broad class of incomplete initial theories progression can be computed efficiently.

Cooperative multi-agent path planning around a common location has many applications, and has received significant at- tention from the research community. Our research is motivated by the need for groups of autonomous vehicles or mobile robots to collaboratively plan efficient paths around shared navigational coordinates (waypoints) in a distributed and decentralized manner. Our ongoing research is focused on creating a distributed solution to Dresner and Stone’s Autonomous Intersection Management problem. In the future we plan to relax the constraints of this problem, and allow more flexibility in the angles of approach and departure from a single waypoint, and also plan to consider efficient group plans for multi-waypoint routes. In this paper we briefly introduce intersection management, present preliminary results for an unstructured peer-to-peer approach to the problem, and discuss future research directions.

Homophily is the tendency of individuals in a social system to link to others who are similar to them and understanding homophily can help us build better user models for personalization and recommender systems. Many studies have verified homophily along demographic dimensions, such as age, location, occupation, etc., not only in real-world social networks but also online. However, there is limited research showing that homophily also exists when similarity is judged by topics of expertise or interests. We demonstrate the existence of topical homophily on Twitter using a novel source of evidence provided by Twitter lists. In this paper, we use LDA to extract topics from Twitter lists (a collection of user accounts created by some user that others can follow) and measure similarity between listed users based on the learned topics. We show that topically similar users are more likely to be linked via a follow relationship than less similar users.

Design tasks are notoriously difficult, because success is defined by the perception of the target audience, whose feedback is usually not available during design stages. Commonly, design is performed by professionals who have specific domain knowledge (i.e., an intuitive understanding of the implicit requirements of the task) and do not need the feedback of the perception of the viewers during the process. In this paper, we present a novel design methodology for creating minimal sketches of objects that uses an iterative optimization scheme. We define minimality for a sketch via the minimal number of straight line segments required for correct recognition by 75% of naiive viewers. Crowd-sourcing techniques allow us to directly include the perception of the audience in the design process. By joining designers and crowds, we are able to create a human computation system that can efficiently optimize sketches without requiring high levels of domain knowledge (i.e., design skills) from any worker.