We address the problem of making online, parallel query plans fault-tolerant: i.e., provide intra-query fault-tolerance without blocking. We develop an approach that not only achi...
It is well known that there cannot be a single "best" heuristic for optimal planning in general. One way of overcoming this is by combining admissible heuristics (e.g. b...
Efficient algorithms for collision-free energy sub-optimal path planning for formations of spacecraft flying in deep space are presented. The idea is to introduce a set of way-poi...
This paper proposes a new planning architecture for agents operating in uncertain and dynamic environments. Decisiontheoretic planning has been recognized as a useful tool for rea...
The Princeton University Help Desk KnowledgeBase (KB) is a searchable online information system that publishes Princetonspecific computer solutions to better serve the University ...