Two overarching goals were promoted for the 2005 Mobile Robot Competition. The first was to give the competitions an exhibitionstyle format to make them as accessible to different areas of research as possible. This was change would place the competitions and exhibitions demonstrated at the Fourteenth Annual AAAI directly in line with the conference, Mobile Robot Competition and Exhibition, an teams would need to handle the challenges involved event hosted at the Twentieth National Conference with noisy, cluttered, and unstructured on Artificial Intelligence (AAAI 2005). The robot event had a particularly strong human environments. Scavenger Hunt: Autonomous robots were required to search a cluttered and crowded environment This year, AAAI changed the venue format for a defined list of objects and were from a convention center to a hotel setting. The Scavenger as defined by the team, and feedback Hunt event was organized by Douglas from the participants. Blank from Bryn Mawr College, the Robot Robot Challenge: Robots were required to attend Challenge and the Open Interaction Task were the conference autonomously, including organized by Ashley Stroupe from the Jet registering for the conference, navigating the Propulsion Laboratory, the research component conference hall, talking with attendees, and of the exhibition was organized by Magdalena answering questions.

The decision-making process of computer-controlled opponents in video games is called game AI. Adaptive game AI can improve the entertainment value of games by allowing computer-controlled opponents to ix weaknesses automatically in the game AI and to respond to changes in human-player tactics. Dynamic scripting is a reinforcement learning approach to adaptive game AI that learns, during gameplay, which game tactics an opponent should select to play effectively. In previous work, the tactics used by dynamic scripting were designed manually. We introduce the evolutionary state-based tactics generator (ESTG), which uses an evolutionary algorithm to generate tactics automatically. Experimental results show that ESTG improves dynamic scripting's performance in a real-time strategy game. We conclude that high-quality domain knowledge can be automatically generated for strong adaptive game AI opponents. Game developers can bene it from applying ESTG, as it considerably reduces the time and effort needed to create adaptive game AI.

Also, it provides a means for conflict resolution of multiple criteria and better assessment of options. This system provides identification, recognition, optimization, a very powerful solution methodology by permitting and control. The algorithmic methods optimization of power distribution system provide updates to the system status operation (Sarfi and Solo 2005a). Sarfi, Salama, and Chikhani (1994a) as well as system with a coupling between knowledgebased Sarfi and Solo (2002c) demonstrate that fuzzy and numerical methods combines the logic is not an asset in all power systems planning advantages of both methods for multiobjective and operation scenarios. Some rules do optimization of power distribution system not involve any uncertainty or can be represented operation. One must to ensure that the best methods are employed. An extensive study of software effectively optimizes a power distribution network tools used in real-time power system for multiple system-performance objectives, applications concluded that electric utility including system loss reduction, transformer companies were not satisfied with conventional load balancing, reduction of transformer approaches based on numerical methods in aging to decrease the failure rate and 50 percent of the cases examined (Sarfi, Salama, increase continuity of service, maintenance of and Chikhani 1994a). Dissatisfied parties a satisfactory voltage profile throughout the cited two major shortcomings in techniques network, reactive power compensation, and based on numerical methods: (1) lack of flexibility conservative voltage reduction (CVR) practice in system modeling, and (2) exclusion of to achieve peak shaving.

An end-to-end system was created at Genworth Financial to automate the underwriting of long-term care (LTC) and life insurance applications. Relying heavily on artificial intelligence techniques, the system has been in production since December 2002 and in 2004 completely automates the underwriting of 19 percent of the LTC applications. A fuzzy logic rules engine encodes the underwriter guidelines and an evolutionary algorithm optimizes the engine's performance. Finally, a natural language parser is used to improve the coverage of the underwriting system.

This article describes the ExpertCop tutorial system, a simulator of crime in an urban region. In ExpertCop, the students (police officers) configure and allocate an available police force according to a selected geographic region and then interact with the simulation. The student interprets the results with the help of an intelligent tutor, the pedagogical agent, observing how crime behaves in the presence of the allocated preventive policing. The interaction between domain agents representing social entities as criminals and police teams drives the simulation. ExpertCop induces students to reflect on resource allocation. The pedagogical agent implements interaction strategies between the student and the geosimulator, designed to make simulated phenomena better understood. In particular, the agent uses a machine-learning algorithm to identify patterns in simulation data and to formulate questions to the student about these patterns.

The Electrical Systems Division at the NASA Kennedy Space Center has developed and deployed an agent-based tool to monitor the space shuttle's ground processing telemetry stream. The application, the NASA Engineering Shuttle Telemetry Agent (NESTA), increases situational awareness for system and hardware engineers during ground processing of the shuttle's subsystems. The agent provides autonomous monitoring of the telemetry stream and automatically alerts system engineers when predefined criteria have been met. Efficiency and safety are improved through increased automation. Sandia National Labs' Java Expert System Shell is employed as the rule engine. The shell's predicate logic lends itself well to capturing the heuristics and specifying the engineering rules of this spaceport domain. The declarative paradigm of the rule- based agent yields a highly modular and scalable design spanning multiple subsystems of the shuttle. Several hundred monitoring rules have been written thus far with corresponding notifications sent to shuttle engineers. This article discusses the rule-based telemetry agent used for space shuttle ground processing and explains the problem domain, development of the agent software, benefits of AI technology, and deployment and sustaining engineering of the product.

TEXTAL is a computer program that automatically interprets electron density maps to determine the atomic structures of proteins through X-ray crystallography. Electron density maps are traditionally interpreted by visually fitting atoms into density patterns. This manual process can be time-consuming and error prone, even for expert crystallographers. Noise in the data and limited resolution make map interpretation challenging. To automate the process, TEXTAL employs a variety of AI and pattern-recognition techniques that emulate the decision-making processes of domain experts. In this article, we discuss the various ways AI technology is used in TEXTAL, including neural networks, case-based reasoning, nearest neighbor learning and linear discriminant analysis. The AI and pattern-recognition approaches have proven to be effective for building protein models even with medium resolution data. TEXTAL is a successfully deployed application; it is being used in more than 100 crystallography labs from 20 countries.

This editorial introduces the articles published in the AI Magazine special issue on Innovative Applications of Artificial Intelligence (IAAI), based on a selection of papers that appeared in the IAAI-05 conference, which occurred July 9-13 2005 in Pittsburgh, Pennsylvania. IAAI is the premier venue for learning about AI's impact through deployed applications and emerging AI application technologies. Case studies of deployed applications with measurable benefits arising from the use of AI technology provide clear evidence of the impact and value of AI technology to today's world. The emerging applications track features technologies that are rapidly maturing to the point of application. The six articles selected for this special issue are extended versions of papers that appeared at the conference. Three of the articles describe deployed applications that are already in use in the field. Three articles from the emerging technology track were particularly innovative and demonstrated some unique technology features ripe for deployment.

In a field of research about general reasoning mechanisms, it is essential to have appropriate benchmarks. Ideally, the benchmarks should reflect possible applications of the developed technology. In AI Planning, researchers more and more tend to draw their testing examples from the benchmark collections used in the International Planning Competition (IPC). In the organization of (the deterministic part of) the fourth IPC, IPC-4, the authors therefore invested significant effort to create a useful set of benchmarks. They come from five different (potential) real-world applications of planning: airport ground traffic control, oil derivative transportation in pipeline networks, model-checking safety properties, power supply restoration, and UMTS call setup. Adapting and preparing such an application for use as a benchmark in the IPC involves, at the time, inevitable (often drastic) simplifications, as well as careful choice between, and engineering of, domain encodings. For the first time in the IPC, we used compilations to formulate complex domain features in simple languages such as STRIPS, rather than just dropping the more interesting problem constraints in the simpler language subsets. The article explains and discusses the five application domains and their adaptation to form the PDDL test suites used in IPC-4. We summarize known theoretical results on structural properties of the domains, regarding their computational complexity and provable properties of their topology under the h+ function (an idealized version of the relaxed plan heuristic). We present new (empirical) results illuminating properties such as the quality of the most wide-spread heuristic functions (planning graph, serial planning graph, and relaxed plan), the growth of propositional representations over instance size, and the number of actions available to achieve each fact; we discuss these data in conjunction with the best results achieved by the different kinds of planners participating in IPC-4.

This paper presents a new framework for anytime heuristic search where the task is to achieve as many goals as possible within the allocated resources. We show the inadequacy of traditional distance-estimation heuristics for tasks of this type and present alternative heuristics that are more appropriate for multiple-goal search. In particular, we introduce the marginal-utility heuristic, which estimates the cost and the benefit of exploring a subtree below a search node. We developed two methods for online learning of the marginal-utility heuristic. One is based on local similarity of the partial marginal utility of sibling nodes, and the other generalizes marginal-utility over the state feature space. We apply our adaptive and non-adaptive multiple-goal search algorithms to several problems, including focused crawling, and show their superiority over existing methods.