Sheep?' (later adapted to film as Blade American. In each artificial life creation The items in this collage were selected com). Let us related AI TOPICS pages--at www. Of course, it has problems of robotics, such as visual contain all of the relevant information; been stated by many authors (even in this recognition, navigation and machine and, (2) all items are offered "as is" and column) that when we make contact with learning. I can the fact that an item has been selected does alien beings, they may be the robotic envision a future in which robotic devices not imply any endorsement whatsoever.

(MDAI 2007).

This year's program, to be held in conjunction later this spring!

We report on the eleventh annual SIGART/AAAI Doctoral Consortium, held in conjunction with the National Conference on Artificial Intelligence (AAAI-06). We discuss highlights and innovations of this year's consortium and include pointers to the consortium website.

The primary revolution in automated planning in the last decade has been the very impressive scale-up in planner performance. A large part of the credit for this can be attributed squarely to the invention and deployment of powerful reachability heuristics. Most, if not all, modern reachability heuristics are based on a remarkably extensible data structure called the planning graph, which made its debut as a bit player in the success of GraphPlan, but quickly grew in prominence to occupy the center stage. Planning graphs are a cheap means to obtain informative look-ahead heuristics for search and have become ubiquitous in state-of-the-art heuristic search planners. We present the foundations of planning graph heuristics in classical planning and explain how their flexibility lets them adapt to more expressive scenarios that consider action costs, goal utility, numeric resources, time, and uncertainty.

To construct a perpetual self-aware cognitive agent that can continuously operate with independence, an introspective machine must be produced. To assemble such an agent, it is necessary to perform a full integration of cognition (planning, understanding, and learning) and metacognition (control and monitoring of cognition) with intelligent behaviors. The failure to do this completely is why similar, more limited efforts have not succeeded in the past. I outline some key computational requirements of metacognition by describing a multi- strategy learning system called Meta-AQUA and then discuss an integration of Meta-AQUA with a nonlinear state-space planning agent. I show how the resultant system, INTRO, can independently generate its own goals, and I relate this work to the general issue of self-awareness by machine.

The SNePS knowledge representation, reasoning, and acting system has several features that facilitate metacognition in SNePS-based agents. The most prominent is the fact that propositions are represented in SNePS as terms rather than as sentences, so that propositions can occur as argu- ments of propositions and other expressions without leaving first-order logic. The SNePS acting subsystem is integrated with the SNePS reasoning subsystem in such a way that: there are acts that affect what an agent believes; there are acts that specify knowledge-contingent acts and lack-of-knowledge acts; there are policies that serve as "daemons," triggering acts when certain propositions are believed or wondered about. The GLAIR agent architecture supports metacognition by specifying a location for the source of self-awareness and of a sense of situatedness in the world. Several SNePS-based agents have taken advantage of these facilities to engage in self-awareness and metacognition.

Recent years have seen a resurgence of interest in the use of metacognition in intelligent systems. This article is part of a small section meant to give interested researchers an overview and sampling of the kinds of work currently being pursued in this broad area. The current article offers a review of recent research in two main topic areas: the monitoring and control of reasoning (metareasoning) and the monitoring and control of learning (metalearning).

National scientific societies removes potential limitations imposed by the are evolving to serve their international old name as we move forward in an increasingly constituencies, and in doing so, have come to global scientific environment. We have reconsider their roles, their purposes, their consulted with many of our sibling AI societies. This is such an of our activities as a consequence of the occasion for AAAI as it embarks on its second name change. The proposal initially received enthusiastic AAAI's membership has strong international support from the AAAI Executive Council (una - representation. The same is true of the contributors nimous with one abstention), and the Strategic to, and attendees of, AAAI, and AAAIsponsored, Planning Committee, consisting of all past conferences, symposia, tutorials, presidents and current presidential officers of and workshops.

We describe how to convert the heuristic search algorithm A* into an anytime algorithm that finds a sequence of improved solutions and eventually converges to an optimal solution. The approach we adopt uses weighted heuristic search to find an approximate solution quickly, and then continues the weighted search to find improved solutions as well as to improve a bound on the suboptimality of the current solution. When the time available to solve a search problem is limited or uncertain, this creates an anytime heuristic search algorithm that allows a flexible tradeoff between search time and solution quality. We analyze the properties of the resulting Anytime A* algorithm, and consider its performance in three domains; sliding-tile puzzles, STRIPS planning, and multiple sequence alignment. To illustrate the generality of this approach, we also describe how to transform the memory-efficient search algorithm Recursive Best-First Search (RBFS) into an anytime algorithm.