Search Techniques for Problem Solving Under Uncertainty and Incomplete Information

Papers from the 1999 AAAI Spring Symposium

Weixiong Zhang and Sven Koenig, Program Cochairs

Technical Report SS-99-07 published by The AAAI Press, Menlo Park, California. This technical report is also available in book and CD format.

Sample Citation

Barash, Danny. 1999. A Genetic Search in Policy Space for Solving Markov Decision Processes. In Search Techniques for Problem Solving Under Uncertainty and Incomplete Information: Papers from the 1999 Spring Symposium, ed. Weixiong Zhang and Sven Koenig, 8-12. Technical Report SS-99-07. Association for the Advancement of Artificial Intelligence, Menlo Park, California.

Please Note: Abstracts are linked to individual titles, and will appear in a separate browser window. Full-text versions of the papers are linked to the abstract text. Access to full text may be restricted to AAAI members. PDF file sizes may be large!

PSIPOP: Planning with Sensing over Partially Closed Worlds / 1
Tamara Babaian and James G. Schmolze

A Genetic Search in Policy Space for Solving Markov Decision Processes / 8
Danny Barash

Using Selective-Sampling Simulations in Poker / 13
Darse Billings, Denis Papp, Lourdes Peña, Jonathan Schaeffer, and Duane Szafron

Search Control Methods in Deep Blue / 19
Murray S. Campbell, A. Joseph Hoane, Jr., and Feng-hsiung Hsu

Controlling the Parameters of Parallel Search Using Uncertainty Reasoning / 24
Diane J. Cook and Piotr J. Gmytrasiewicz

Learning Situation-Dependent Rules: Improving Planning for an Incompletely Modeled Domain / 30
Karen Zita Haigh and Manuela M. Veloso

Interval Processing for Search Control under Incomplete Data / 36
Pham Hong Hanh

Solving Markov Decision Problems Using Heuristic Search / 42
Eric A. Hansen and Shlomo Zilberstein

Extended Abstract: Learning Search Strategies / 48
Daishi Harada and Stuart Russell

Robot Sonar Mapping by Bayesian Search / 53
Kenneth D. Harris and Michael Recce

Branch and Bound with Mini-Bucket Heuristics / 59
Kalev Kask and Rina Dechter

Overview and Examples of Real-Time Search in Unknown or Nondeterministics Domains / 65
Sven Koenig

Divide-and-Conquer Bidirectional Search / 71
Richard E. Korf

Stochastic Sampling and Search in Belief Updating Algorithms for Very Large Bayesian Networks / 77
Yan Lin and Marek J. Druzdzel

C-MAXPLAN: Contingent Planning in the MAXPLAN Framework / 83
Stephen M. Majercik

Incremental Data-Driven Refinement of Knowledge / 89
Robert A. Morris and Ibrahim El-far

Strategic Search: A New Paradigm for Complex Game Playing: Application to the Game of Go / 95
Régis Moneret

Partial Order Evaluation in Game Tree Search, and its Application to Analyzing Semeai in the Game of Go / 101
Martin Müller

Search Techniques for Learning Probabilistic Models of Word Sense Disambiguation / 107
Ted Pedersen

Attributes of the Inventive Problems / 113
Semyon D. Savransky

Direct Policy Search and Uncertain Policy Evaluation / 119
Jürgen Schmidhuber and Jieyu Zhao

Manufacturing Planning under Uncertainty and Incomplete Information / 125
Yury Smirnov

Efficient Planning through Separate Resource Scheduling / 130
Biplav Srivastava and Subbarao Kambhampati

Searching Stochastically-Generated Multi-Abstraction-Level Design Spaces / 136
Louis Steinberg

Learning to Plan Probabilistically / 142
Ron Sun and Chad Sessions

Truncated and Anytime Depth-First Branch and Bound: A Case Study on the Asymmetric Traveling Salesman Problem / 148
Weixiong Zhang

Almost Nothing’s Perfect (A Research Description) / 154
Leona F. Fass

A New Methodology for Information Representation is Required (A Position Paper) / 156
Jianfeng Zhou

AAAI Digital Library

AAAI relies on your generous support through membership and donations. If you find these resources useful, we would be grateful for your support.