Dynamic Sensor Policies

Detecting and Resolving Errors in Manufacturing Systems

Volume

Papers from the 1994 AAAI Spring Symposium

Contents

We propose to generate a tree of possible sensing policies offline (using dynamic programming), cache the optimal sensor decisions at each level, and subsequently use actual world states as indexes into this structure to make a rational sensor choice online. Because no states are discarded in the dynamic programming process (only non-optimal paths), we are always guaranteed of having earlier cached an optimal decision for each state we anticipate possibly encountering at execution time. This combination of offiine and online computation allows the sensor selection process to be sensitive to actual events, while making use of assumptions and regularities inherent in the structure of the domain.