The operation of a human organization requires dozens of everyday tasks to ensure coherence in organizational activities, monitor the status of such activities, gather information relevant to the organization, keep everyone in the organization informed, and so on. Teams of software agents can aid humans in accomplishing these tasks, facilitating the organization's coherent functioning and rapid response to crises and reducing the burden on humans. Based on this vision, this article reports on ELECTRIC ELVES, a system that has been operational 24 hours a day, 7 days a week at our research institute since 1 June 2000. Tied to individual user workstations, fax machines, voice, and mobile devices such as cell phones and palm pilots, ELECTRIC ELVES has assisted us in routine tasks, such as rescheduling meetings, selecting presenters for research meetings, tracking people's locations, organizing lunch meetings, and so on. We discuss the underlying AI technologies that led to the success of ELECTRIC ELVES, including technologies devoted to agent-human interactions, agent coordination, the accessing of multiple heterogeneous information sources, dynamic assignment of organizational tasks, and the deriving of information about organization members. We also report the results of deploying ELECTRIC ELVES in our own research organization.

Running times are the median of five runs on an UltraSparc II (296MHz CPU, 256Mb RAM).

Running times are the median of five runs on an UltraSparc II (296MHz CPU, 256Mb RAM).

Choosing an environment is an important decision for agent developers. A key issue in this decision is whether the environment will provide realistic problems for the agent to solve, in the sense that the problems are true to the issues that arise in addressing a particular research question. In addition to realism, other important issues include how tractable problems are that can be formulated in the environment, how easy agent performance can be measured, and whether the environment can be customized or extended for specific research questions. In the ideal environment, researchers can pose realistic but tractable problems to an agent, measure and evaluate its performance, and iteratively rework the environment to explore increasingly ambitious questions, all at a reasonable cost in time and effort. As might be expected, trade-offs dominate the suitability of an environment; however, we have found that the modern graphic user interface offers a good balance among these trade-offs. This article takes a brief tour of agent research in the user interface, showing how significant questions related to vision, planning, learning, cognition, and communication are currently being addressed.

We describe an approach to intelligent user interfaces, based on the idea of making the computer a collaborator, and an application-independent technology for implementing such interfaces.

The planning competition has become a regular part of the biennial Artificial Intelligence Planning and Scheduling (AIPS) conferences. The 2000 competition featured a much larger group of participants and a wide variety of different approaches to planning. Besides the dramatic increase in participation, the 2000 competition demonstrated that planning technology has taken a giant leap forward in performance since 1998. The 2000 competition featured planning systems that were orders of magnitude faster than the planners of just two years prior.

Tokenplan is a planner based on the use of Petri nets. Its main feature is the flexibility it offers in the way it builds the planning graph. The next step is to demonstrate the benefits we expect from our planner in planning problems involving optimization and uncertainty handling.

System R is a variant of the original planning algorithm used in strips. It was the only planner that competed in both the automatic and hand-tailored tracks in the Fifth International Conference on Artificial Intelligence Planning and Scheduling competition.

AltAlt is designed to exploit the complementary strengths of two of the currently popular competing approaches for plan generation: (1) graphplan and (2) heuristic state search. It uses the planning graph to derive effective heuristics that are then used to guide heuristic state search. The heuristics derived from the planning graph do a better job of taking the subgoal interactions into account and, as such, are significantly more effective than existing heuristics. AltAlt was implemented on top of two state-of-the-art planning systems: (1) stan3.0, a graphplan-style planner, and (2) hsp-r, a heuristic search planner.

Shop is a hierarchical task network planning algorithm that is provably sound and complete across a large class of planning domains. It plans for tasks in the same order that they will later be executed, and thus, it knows the current world state at each step of the planning process. For example, shop's preconditions can include logical inferences, complex numeric computations, and calls to external programs.