Government
The Fifth International Conference on Artificial Intelligence Planning and Scheduling
Barrett, Anthony, Chien, Steve
The Fifth International Conference on Artificial Intelligence Planning and Scheduling (AIPS 2000) was held on 14-17 April 2000 at Breckenridge, Colorado; it was colocated with the Seventh International Conference on Principles of Knowledge Representation and Reasoning (KR2000). This conference brought together researchers working in all aspects of problems in planning, scheduling, planning and learning, and plan execution for dealing with complex problems.
What Does the Future Hold?
I was asked to give a visionary talk about the future applications of Artificial Intelligence technology; but I should warn you that I'm actually not very good as a visionary. Most of my predictions about what will happen in the industry don't come true even though they ought to. So I'm not going to tell you what the future holds; what I will do is to point out some of the technological trends that are at work. The outline of the talk is as follows: I'll start off by looking at the previous IAAI conferences and reflect on what we've learned from them. Then I'll look at what's changing in the hardware base that sets the context for all the computer applications we do. I think that will lead to interesting new viewpoints. Next I'll sketch what applications might arise from this new viewpoint. Finally, I'll discuss how the development of practical applications ought to interact with the scientific enterprise of trying to understand intelligence, in particular, human intelligence.
The AAAI 1999 Mobile Robot Competitions and Exhibitions
Meeden, Lisa, Schultz, Alan, Balch, Tucker, Bhargava, Rahul, Haigh, Karen Zita, Bohlen, Marc, Stein, Cathryne, Miller, David
The Eighth Annual Mobile Robot Competition and Exhibition was held as part of the Sixteenth National Conference on Artificial Intelligence in Orlando, Florida, 18 to 22 July. The goals of these robot events are to foster the sharing of research and technology, allow research groups to showcase their achievements, encourage students to enter robotics and AI fields at both the undergraduate and graduate level, and increase awareness of the field. The 1999 events included two robot contests; a new, long-term robot challenge; an exhibition; and a National Botball Championship for high school teams sponsored by the KISS Institute. Each of these events is described in detail in this article.
The AIPS-98 Planning Competition
Long, Derek, Kautz, Henry, Selman, Bart, Bonet, Blai, Geffner, Hector, Koehler, Jana, Brenner, Michael, Hoffmann, Joerg, Rittinger, Frank, Anderson, Corin R., Weld, Daniel S., Smith, David E., Fox, Maria, Long, Derek
In 1998, the international planning community was invited to take part in the first planning competition, hosted by the Artificial Intelligence Planning Systems Conference, to provide a new impetus for empirical evaluation and direct comparison of automatic domain-independent planning systems. This article describes the systems that competed in the event, examines the results, and considers some of the implications for the future of the field.
Editorial
First, I would The editorial board members will play an active role in like to welcome B. Chandrasekaran, guiding the magazine, monitoring progress across the field of The Ohio and assuring that the magazine has timely, high-quality State University, as the articles on significant new developments. I expect the editorial new book review editor, board to have a considerable impact on the magazine, and Robert Morris, of and I am very grateful to the board members for NASA Ames Research Center, accepting this responsibility. I know that they will do an Finally, to expedite the processing of submissions, AI outstanding job, and I urge the AI community to actively Magazine will now accept submissions in electronic form. Full submission guidelines are available on the AI Magazine Chandrasekaran has prepared an editorial, appearing in home page, www.aaai.org/Magazine. I look forward to your this issue, presenting his vision for the book review section.
Basis Selection for Wavelet Regression
Wheeler, Kevin R., Dhawan, Atam P.
A wavelet basis selection procedure is presented for wavelet regression. Both the basis and threshold are selected using crossvalidation. The method includes the capability of incorporating prior knowledge on the smoothness (or shape of the basis functions) into the basis selection procedure. The results of the method are demonstrated using widely published sampled functions. The results of the method are contrasted with other basis function based methods.
Probabilistic Image Sensor Fusion
Sharma, Ravi K., Leen, Todd K., Pavel, Misha
We present a probabilistic method for fusion of images produced by multiple sensors. The approach is based on an image formation model in which the sensor images are noisy, locally linear functions of an underlying, true scene. A Bayesian framework then provides for maximum likelihood or maximum a posteriori estimates of the true scene from the sensor images. Maximum likelihood estimates of the parameters of the image formation model involve (local) second order image statistics, and thus are related to local principal component analysis. We demonstrate the efficacy of the method on images from visible-band and infrared sensors. 1 Introduction Advances in sensing devices have fueled the deployment of multiple sensors in several computational vision systems [1, for example]. Using multiple sensors can increase reliability with respect to single sensor systems.
Improved Switching among Temporally Abstract Actions
Sutton, Richard S., Singh, Satinder P., Precup, Doina, Ravindran, Balaraman
In robotics and other control applications it is commonplace to have a preexisting set of controllers for solving subtasks, perhaps handcrafted or previously learned or planned, and still face a difficult problem of how to choose and switch among the controllers to solve an overall task as well as possible. In this paper we present a framework based on Markov decision processes and semi-Markov decision processes for phrasing this problem, a basic theorem regarding the improvement in performance that can be obtained by switching flexibly between given controllers, and example applications of the theorem. In particular, we show how an agent can plan with these high-level controllers and then use the results of such planning to find an even better plan, by modifying the existing controllers, with negligible additional cost and no re-planning. In one of our examples, the complexity of the problem is reduced from 24 billion state-action pairs to less than a million state-controller pairs. In many applications, solutions to parts of a task are known, either because they were handcrafted by people or because they were previously learned or planned. For example, in robotics applications, there may exist controllers for moving joints to positions, picking up objects, controlling eye movements, or navigating along hallways. More generally, an intelligent system may have available to it several temporally extended courses of action to choose from. In such cases, a key challenge is to take full advantage of the existing temporally extended actions, to choose or switch among them effectively, and to plan at their level rather than at the level of individual actions.