Industry
Calendar of Events
Aided Design of User Interfaces. (ICKEDS 2004). "Halpern presents a masterful, complete and unified account of the many ways in which the connections between logic, probability theory and commonsensical linguistic terms can be formalized. 'believed,' 'known,' 'default,' 'relevant,' "Presents a novel thesis--that the mind is a'independent,' and'preferred' are given rigorous program whose components are semantically semantical and syntactical analyses, and their meaningful modules--and explores it with a rich interrelationships explicated and exemplified. An array of evidence drawn from a variety of fields.
Qualitative Spatial Reasoning Extracting and Reasoning with Spatial Aggregates
Bailey-Kellogg, Chris, Zhao, Feng
Reasoning about spatial data is a key task in many applications, including geographic information systems, meteorological and fluid-flow analysis, computer-aided design, and protein structure databases. Such applications often require the identifi- cation and manipulation of qualitative spatial representations, for example, to detect whether one object will soon occlude another in a digital image or efficiently determine relationships between a proposed road and wetland regions in a geographic data set. Qualitative spatial reasoning (QSR) provides representational primitives (a spatial "vocabulary") and inference mechanisms for these tasks. This article first reviews representative work on QSR for data-poor scenarios, where the goal is to design representations that can answer qualitative queries without much numeric information. It then turns to the data-rich case, where the goal is to derive and manipulate qualitative spatial representations that efficiently and correctly abstract important spatial aspects of the underlying data for use in subsequent tasks. This article focuses on how a particular QSR system, SPATIAL AGGREGATION, can help answer spatial queries for scientific and engineering data sets. A case study application of weather analysis illustrates the effective representation and reasoning supported by both data-poor and data-rich forms of QSR
AI in the News
In reflect the overall tenor of the article; (3) although robotics, speech recognition, search, etc. - AI software a decade makes…. In April, Business Communication online and without charge, few things that helps engineers create better jet Company (BCC) will release a good last forever; and (4) the AI in the News engines. One variety, called a neural September 29, 2003 (www.koreaherald.co. "Will the day really come when'intelligent' Brokers Will Spend Big on Anti-Money detecting credit-card fraud. Since 1992, robots take over mundane household Laundering. Wall Street & neural nets have slashed such incidents chores and give people more leisure Technology. There is no definition yet of the andtech.com). But according to will spend almost $700 million in the small credit unions are required to use the the preliminary definition by the International next three years on antimoney-laundering software in order to qualify for debit-card Federation of Robotics, an industry technologies, according to a recent report insurance from Credit Union National Association."
IJCAI-03 Conference Highlights
This summer's AI conference in Acapulco offered attendees wide variety of program choices as well as ample time to catch up with friends and colleagues. For many, scheduling time was probably the biggest challenge because the conference included numerous invited speakers, 189 technical paper presentations, 93 posters, a Mobile Robot Competition, 19 Innovative Applications of AI (IAAI) award-winning paper presentations, a Trading Agents Competition, a special track on AI and the web, and the vendor exhibit.
AAAI News
Program (July 28) is currently accepting nominations accessible to the general public or Tenth AAAI/SIGART Doctoral Consortium for AAAI Fellow. The AAAI Fellows to a broad AI audience (not just a subarea), (July 25-26) program is designed to written within the last two AAAI Intelligent Systems Demonstrations recognize people who have made significant, years.
SHOP2: An HTN Planning System
Nau, D. S., Au, T. C., Ilghami, O., Kuter, U., Murdock, J. W., Wu, D., Yaman, F.
The SHOP2 planning system received one of the awards for distinguished performance in the 2002 International Planning Competition. This paper describes the features of SHOP2 which enabled it to excel in the competition, especially those aspects of SHOP2 that deal with temporal and metric planning domains.
Accelerating Reinforcement Learning through Implicit Imitation
Imitation can be viewed as a means of enhancing learning in multiagent environments. It augments an agent's ability to learn useful behaviors by making intelligent use of the knowledge implicit in behaviors demonstrated by cooperative teachers or other more experienced agents. We propose and study a formal model of implicit imitation that can accelerate reinforcement learning dramatically in certain cases. Roughly, by observing a mentor, a reinforcement-learning agent can extract information about its own capabilities in, and the relative value of, unvisited parts of the state space. We study two specific instantiations of this model, one in which the learning agent and the mentor have identical abilities, and one designed to deal with agents and mentors with different action sets. We illustrate the benefits of implicit imitation by integrating it with prioritized sweeping, and demonstrating improved performance and convergence through observation of single and multiple mentors. Though we make some stringent assumptions regarding observability and possible interactions, we briefly comment on extensions of the model that relax these restricitions.
VHPOP: Versatile Heuristic Partial Order Planner
Younes, H. L.S., Simmons, R. G.
VHPOP is a partial order causal link (POCL) planner loosely based on UCPOP. It draws from the experience gained in the early to mid 1990's on flaw selection strategies for POCL planning, and combines this with more recent developments in the field of domain independent planning such as distance based heuristics and reachability analysis. We present an adaptation of the additive heuristic for plan space planning, and modify it to account for possible reuse of existing actions in a plan. We also propose a large set of novel flaw selection strategies, and show how these can help us solve more problems than previously possible by POCL planners. VHPOP also supports planning with durative actions by incorporating standard techniques for temporal constraint reasoning. We demonstrate that the same heuristic techniques used to boost the performance of classical POCL planning can be effective in domains with durative actions as well. The result is a versatile heuristic POCL planner competitive with established CSP-based and heuristic state space planners.
The Case for Durative Actions: A Commentary on PDDL2.1
The addition of durative actions to PDDL2.1 sparked some controversy. Fox and Long argued that actions should be considered as instantaneous, but can start and stop processes. Ultimately, a limited notion of durative actions was incorporated into the language. I argue that this notion is still impoverished, and that the underlying philosophical position of regarding durative actions as being a shorthand for a start action, process, and stop action ignores the realities of modelling and execution for complex systems.
Taming Numbers and Durations in the Model Checking Integrated Planning System
The Model Checking Integrated Planning System (MIPS) is a temporal least commitment heuristic search planner based on a flexible object-oriented workbench architecture. Its design clearly separates explicit and symbolic directed exploration algorithms from the set of on-line and off-line computed estimates and associated data structures. MIPS has shown distinguished performance in the last two international planning competitions. In the last event the description language was extended from pure propositional planning to include numerical state variables, action durations, and plan quality objective functions. Plans were no longer sequences of actions but time-stamped schedules. As a participant of the fully automated track of the competition, MIPS has proven to be a general system; in each track and every benchmark domain it efficiently computed plans of remarkable quality. This article introduces and analyzes the most important algorithmic novelties that were necessary to tackle the new layers of expressiveness in the benchmark problems and to achieve a high level of performance. The extensions include critical path analysis of sequentially generated plans to generate corresponding optimal parallel plans. The linear time algorithm to compute the parallel plan bypasses known NP hardness results for partial ordering by scheduling plans with respect to the set of actions and the imposed precedence relations. The efficiency of this algorithm also allows us to improve the exploration guidance: for each encountered planning state the corresponding approximate sequential plan is scheduled. One major strength of MIPS is its static analysis phase that grounds and simplifies parameterized predicates, functions and operators, that infers knowledge to minimize the state description length, and that detects domain object symmetries. The latter aspect is analyzed in detail. MIPS has been developed to serve as a complete and optimal state space planner, with admissible estimates, exploration engines and branching cuts. In the competition version, however, certain performance compromises had to be made, including floating point arithmetic, weighted heuristic search exploration according to an inadmissible estimate and parameterized optimization.