1,581 research outputs found
Cones in homotopy probability theory
This note defines cones in homotopy probability theory and demonstrates that
a cone over a space is a reasonable replacement for the space. The homotopy
Gaussian distribution in one variable is revisited as a cone on the ordinary
Gaussian.Comment: 8 pages. Missing reference adde
Anytime synthetic projection: Maximizing the probability of goal satisfaction
A projection algorithm is presented for incremental control rule synthesis. The algorithm synthesizes an initial set of goal achieving control rules using a combination of situation probability and estimated remaining work as a search heuristic. This set of control rules has a certain probability of satisfying the given goal. The probability is incrementally increased by synthesizing additional control rules to handle 'error' situations the execution system is likely to encounter when following the initial control rules. By using situation probabilities, the algorithm achieves a computationally effective balance between the limited robustness of triangle tables and the absolute robustness of universal plans
The Third Act of Schoenberg’s Moses und Aron
 
The entropy reduction engine: Integrating planning, scheduling, and control
The Entropy Reduction Engine, an architecture for the integration of planning, scheduling, and control, is described. The architecture is motivated, presented, and analyzed in terms of its different components; namely, problem reduction, temporal projection, and situated control rule execution. Experience with this architecture has motivated the recent integration of learning. The learning methods are described along with their impact on architecture performance
An analysis of commitment strategies in planning: The details
We compare the utility of different commitment strategies in planning. Under a 'least commitment strategy', plans are represented as partial orders and operators are ordered only when interactions are detected. We investigate claims of the inherent advantages of planning with partial orders, as compared to planning with total orders. By focusing our analysis on the issue of operator ordering commitment, we are able to carry out a rigorous comparative analysis of two planners. We show that partial-order planning can be more efficient than total-order planning, but we also show that this is not necessarily so
- …