Goto

Collaborating Authors

 Planning & Scheduling


A Game Theoretic Approach to Ad-Hoc Coalitions in Human-Robot Societies

AAAI Conferences

As robots evolve into fully autonomous agents, settings involving human-robot teams will evolve into human-robot societies, where multiple independent agents and teams, both humans and robots, coexist and work in harmony. Given such a scenario, the question we ask is - How can two or more such agents dynamically form coalitions or teams for mutual benefit with minimal prior coordination? In this work, we provide a game theoretic solution to address this problem. We will first look at a situation with full information, provide approximations to compute the extensive form game more efficiently, and then extend the formulation to account for scenarios when the human is not totally confident of its potential partner's intentions. Finally we will look at possible extensions of the game, that can capture different aspects of decision making with respect to ad-hoc coalition formation in human-robot societies.


An Intelligent Dialogue Agent for the IoT Home

AAAI Conferences

In this paper, we propose an intelligent dialogue agent for the IoT home. The goal of the proposed system is to efficiently control IoT devices with natural spoken dialogue. This system is made up of the following components: Spoken Language Understanding for analyzing textual input and understanding user intention, Dialogue Management with a State Manager that consists of dialogue policies, Context Manager for understanding the environment, Action Planner responsible for generating a sequence of actions to achieve user intention, Things Manager for observing and controlling IoT devices, and Natural Language Generation that generates natural language from computer-based representation. This system is fully implemented in software and is evaluated in a real IoT home environment.


Plan Explicability and Predictability for Robot Task Planning

arXiv.org Artificial Intelligence

Intelligent robots and machines are becoming pervasive in human populated environments. A desirable capability of these agents is to respond to goal-oriented commands by autonomously constructing task plans. However, such autonomy can add significant cognitive load and potentially introduce safety risks to humans when agents behave unexpectedly. Hence, for such agents to be helpful, one important requirement is for them to synthesize plans that can be easily understood by humans. While there exists previous work that studied socially acceptable robots that interact with humans in "natural ways", and work that investigated legible motion planning, there lacks a general solution for high level task planning. To address this issue, we introduce the notions of plan {\it explicability} and {\it predictability}. To compute these measures, first, we postulate that humans understand agent plans by associating abstract tasks with agent actions, which can be considered as a labeling process. We learn the labeling scheme of humans for agent plans from training examples using conditional random fields (CRFs). Then, we use the learned model to label a new plan to compute its explicability and predictability. These measures can be used by agents to proactively choose or directly synthesize plans that are more explicable and predictable to humans. We provide evaluations on a synthetic domain and with human subjects using physical robots to show the effectiveness of our approach


The gig economy: Distraction or disruption?

#artificialintelligence

From the increasing use of contingent freelance workers to the growing role of robotics and smart machines, the corporate workforce is changing--radically and rapidly. These changes are no longer simply a distraction; they are now actively disrupting labor markets and the economy. Three years ago, Deloitte introduced the concept of the open talent economy, predicting that new labor models--on and off the balance sheet--would become increasingly important sources of talent.2 Granted, respondents to this year's survey rated workforce management the least important of the trends we explored. At an even more basic level, companies are struggling to understand who (and what) their workforces are composed of and how to manage today's incredibly diverse combination of worker types.


ASlib: A Benchmark Library for Algorithm Selection

arXiv.org Artificial Intelligence

The task of algorithm selection involves choosing an algorithm from a set of algorithms on a per-instance basis in order to exploit the varying performance of algorithms over a set of instances. The algorithm selection problem is attracting increasing attention from researchers and practitioners in AI. Years of fruitful applications in a number of domains have resulted in a large amount of data, but the community lacks a standard format or repository for this data. This situation makes it difficult to share and compare different approaches effectively, as is done in other, more established fields. It also unnecessarily hinders new researchers who want to work in this area. To address this problem, we introduce a standardized format for representing algorithm selection scenarios and a repository that contains a growing number of data sets from the literature. Our format has been designed to be able to express a wide variety of different scenarios. Demonstrating the breadth and power of our platform, we describe a set of example experiments that build and evaluate algorithm selection models through a common interface. The results display the potential of algorithm selection to achieve significant performance improvements across a broad range of problems and algorithms.


Conformant Planning as a Case Study of Incremental QBF Solving

arXiv.org Artificial Intelligence

We consider planning with uncertainty in the initial state as a case study of incremental quantified Boolean formula (QBF) solving. We report on experiments with a workflow to incrementally encode a planning instance into a sequence of QBFs. To solve this sequence of incrementally constructed QBFs, we use our general-purpose incremental QBF solver DepQBF. Since the generated QBFs have many clauses and variables in common, our approach avoids redundancy both in the encoding phase and in the solving phase. Experimental results show that incremental QBF solving outperforms non-incremental QBF solving. Our results are the first empirical study of incremental QBF solving in the context of planning and motivate its use in other application domains.


Salesforce VP: In the age of predictive and self-learning tech, marketing is turning into goal-setting

#artificialintelligence

You don't have to go very far in the marketing tech space these days to bump into predictive technology that scores future customers, system intelligence that puts unnoticed pieces of data together or machine learning that recognizes useful patterns in piles of data. More and more, smart marketing tools are generating insights, assisting with or making decisions, and even taking actions. But this calls into question what the field is about. Since the first time someone stimulated interest in a new product, marketers have assembled information and made choices about ways to get the word out about their products, increase the number of customers, generate customer loyalty and boost sales. So it's not out of bounds to ask: what is the marketer's role when increasingly self-reliant and autonomous intelligent software does those things?


How to use crazy good trip-planning tools from Google and Lonely Planet

Los Angeles Times

Every day new travel sites and apps are launched that promise to make trip planning easier. Some do and some don't. Here are two free tools optimized for smartphones that I tested and really liked: Lonely Planet's free Guides app for iOS and Android, and Destinations on Google, which makes it easy to aggregate information for your next travel adventure. The app includes more than 35 free importable guides to international and U.S. destinations, from Bangkok to London and Boston to San Francisco. I tested New York, Kyoto and Vancouver.


Fast Path Planning Using Experience Learning from Obstacle Patterns

AAAI Conferences

We consider the problem of robot path planning in an environment where the location and geometry of obstacles are initially unknown while reusing relevant knowledge about collision avoidance learned from robots’ previous navigational experience. Our main hypothesis in this paper is that the path planning times for a robot can be reduced if it can refer to previous maneuvers it used to avoid collisions with obstacles during earlier missions, and adapt that information to avoid obstacles during its current navigation. To verify this hypothesis,we propose an algorithm called LearnerRRT that first uses a feature matching algorithm called Sample ConsensusInitial Alignment (SAC-IA) to efficiently match currently encountered obstacle features with past obstacle features, and, then uses an experience based learning technique to adapt previously recorded robot obstacle avoidance trajectories corresponding to the matched feature, to the current scenario. The feature matching and machine learning techniques are integrated into the robot’s path planner so that the robot can rapidly and seamlessly update its path to circumvent an obstacle it encounters, in real-time, and continue to move towards its goal. We have conducted several experiments using a simulated Coroware Corobot robot within the Webots simulator to verify the performance of our proposed algorithm,with different start and goal locations, and different obstacle geometries and placements, as well as compared our approach to a state-of-the-art sampling based path planner. Our results show that the proposed algorithm LearnerRRT performs much better than InformedRRT*. When given the same time, our algorithm finished its task successfully whereas Informed RRT* could only achieve 10-20 percent of the optimal distance.


Epistemological Qualification of Valid Action Plans for UGVs or UAVs in Urban Areas

AAAI Conferences

It is nowadays our responsibility to convince our contemporary citizens that AI devices as UGVs (Unmanned Ground Vehicles) and UAVs (Unmanned Aerial Vehicles) are crucial actors of today’s life in a dual domains, both civilian and military. In particular, the decision process is the main component of every military operation and is of high interest because of two main reasons : it is necessary designed to cope with conflict issues and it requires a very complex planning process to be successful. The difficulty to find a good plan is worse in urban areas because of the high uncertainty due to the topology of these areas, the presence of civilians, who can be hostile or friendly, and the unpredictable nature of enemies. The idea in that paper is to qualify what can be a valid computed plan in that context , i.e. welldesigned for recovering of peace, rescue operations after a bombing event, hostage salvage, non-combatant evacuation operations, civil-military co-operation, ...., in urban areas. This planning process leads to associate actually four components, the representation of the tactical scheme, the implementation of the tactical scheme as the behaviour of special forces, military units or emergency squads, the proof process or the explanation process, and finally the handling of external factors depending on the current environment or the current context in which the operation takes place. This paper uses a quaternary representation called the epistemological quadriptych, in order to highlight that the integration of UGVs or UAVs devices requires actually to understand the role of knowledge and behaviour and to provide secure and valid action plans, i.e. which can be explained and justified.