Previous work on story planning has shown success in the generation of plans that are both intention-coherent and demonstrate aspects of inter-character conflict. However, the initial models of intention and conflict have been limited, in that they lack methods to generate story plots wherecharacters drop sub-plans to achieve their goals in believably consistent and expressive ways and adopt new sub-plans in the face of plan failure. In current work, we have developed models of failed actions in stories that go hand in hand with erroneous belief models for character. Motivated by characterizations of rational agents' intentions as choice combined with commitment, we provide a framing of the plan generation process that is intended to show how characters form their own plans to achieve their own goals, act upon those plans until they feel that conditions no longer support their plans, and then re-plan in the face of adversity to achieve their goals. We show an example story plan that contains several types of character-based intention dynamics targeted by our approach.

A goal of Experience Managers (EM) is to guide users through a space of narrative trajectories, or story branches, in an Interactive Narrative (IN). When a user performs an action that deviates from the intended trajectory, the EM uses a mediation strategy called accommodation to transition the user to a new desirable trajectory. However, generating the trajectory options then selecting the appropriate one is computationally expensive and at odds with the low-latency needs of an IN. We define three desirable properties (exemplar trajectories, narrative-theoretic comparison, and efficiency) that general solutions would possess and demonstrate how our plan-based Intention Dependency Graph addresses them.

Monte Carlo Tree Search (MCTS) is an effective decision making algorithm that often works well without domain knowledge, finding an increasing application in commercial mobile and video games. A promising application of MCTS is creating AI opponents for board and card games, where Information Set MCTS (ISMCTS) can provide a challenging opponent and reduces the cost of creating game-specific AI opponents. Most research to date has aimed at improving the quality of decision making by (IS)MCTS, with respect to time usage. Memory usage is also an important constraint in commercial applications, particularly on mobile platforms or when there are many AI agents. This paper presents the first systematic study of memory bounding techniques for (IS)MCTS. (IS)MCTS is well known to be an anytime algorithm. We also introduce an anyspace version of (IS)MCTS which can make effective use of any pre-specified amount of memory. This algorithm has been implemented in a commercial version of the card game Spades downloaded more than 6 million times. We find that for games of imperfect information high quality decisions can be made with rather small memory footprints, making (IS)MCTS an even more attractive algorithm for commercial game implementations.

The Dynamic Analysis and Replanning Tool (DART) is an artificial intelligence program used by the U.S. military to optimize and schedule the transportation of supplies or personnel and solve other logistical problems. In the first 4 years of its use, DART saved the military enough money to recoup the previous 30 years of investments. DART is one of many examples of utilizing AI for planning. Airports use AI for planning flights; Google Maps and other navigation systems use AI for planning; the Mars Rover uses AI to navigate the Red Planet; many large corporations utilize AI planning algorithms to plan logistics and personnel. Using a simplified entrepreneurial analogy, this article will explain a planning approach called "Serial Planning Graphs."

In part, the critics of AI are driven by the knowledge that'white collar jobs' are the ones that are now under threat. Business leaders are frequently confronted by notions of job-killing automation and headlines on the variation of the theme that "Robots Will Steal Our Jobs." Elon Musk, CEO of Tesla, Silicon Valley figurehead, and champion of technology-driven innovation even goes a step further by suggesting AI is a fundamental threat to human civilisation. In part, the critics of AI are driven by the knowledge that'white collar jobs' are the ones that are now under threat. The robot on the assembly line is now a familiar image.

In the smart grid, the intent is to use flexibility in demand, both to balance demand and supply as well as to resolve potential congestion. A first prominent example of such flexible demand is the charging of electric vehicles, which do not necessarily need to be charged as soon as they are plugged in. The problem of optimally scheduling the charging demand of electric vehicles within the constraints of the electricity infrastructure is called the charge scheduling problem. The models of the charging speed, horizon, and charging demand determine the computational complexity of the charge scheduling problem. For about 20 variants, we show, using a dynamic programming approach, that the problem is either in P or weakly NP-hard. We also show that about 10 variants of the problem are strongly NP-hard, presenting a potentially significant obstacle to their use in practical situations of scale.

This paper introduces a cognitive architecture for a humanoid robot to engage in a proactive, mixed-initiative exploration and manipulation of its environment, where the initiative can originate from both the human and the robot. The framework, based on a biologically-grounded theory of the brain and mind, integrates a reactive interaction engine, a number of state-of-the-art perceptual and motor learning algorithms, as well as planning abilities and an autobiographical memory. The architecture as a whole drives the robot behavior to solve the symbol grounding problem, acquire language capabilities, execute goal-oriented behavior, and express a verbal narrative of its own experience in the world. We validate our approach in human-robot interaction experiments with the iCub humanoid robot, showing that the proposed cognitive architecture can be applied in real time within a realistic scenario and that it can be used with naive users.

Abstract: "Teams of robots often have to assign target locations among themselves and then plan collision-free paths to their target locations. Examples include autonomous aircraft towing vehicles and automated warehouse systems. Today, hundreds of robots already navigate autonomously in Amazon fulfillment centers to move inventory pods all the way from their storage locations to the packing stations. Path planning for these robots can be NP-hard, yet one must find high-quality collision-free paths for them in real-time. The shorter these paths are, the fewer robots are needed and the cheaper it is to open new fulfillment centers.

Commonsense reasoning is in principle a central problem in artificial intelligence, but it is a very difficult one. One approach that has been pursued since the earliest days of the field has been to encode commonsense knowledge as statements in a logic-based representation language and to implement commonsense reasoning as some form of logical inference. This paper surveys the use of logic-based representations of commonsense knowledge in artificial intelligence research.

Financial Gravity, a tax services and wealth management firm in Dallas, is sponsoring an AI design challenge for the creation of an an artificially intelligent tax advisor. The AI-enabled automated tax planning assistant software, as it's being called, will be named Odele; and its target end users are business owners, entrepreneurs and high net worth families with multiple sources of income, some investments, and the ability to save for the future. Financial Gravity reports that it has a database of ideal tax scenarios that maximize take-home income. The firm wants Odele to connect individuals to their most ideal scenario.