We introduce a new algorithm to cover an unknown space with a homogeneous team of circular mobile robots. Our approach is based on a single robot coverage algorithm, a boustrophed...
DeWitt Latimer IV, Siddhartha S. Srinivasa, Vincen...
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
We conduct computer simulation experiments in pre-operative planning of vascular reconstruction with a physician in the experimental loop. We constructed a problem-solving environ...
Peter M. A. Sloot, Alfredo Tirado-Ramos, Alfons G....
We describe a novel integration of Planning with Probabilistic State Estimation and Execution resulting in a unified representational and computational framework based on declarat...
Conor McGann, Frederic Py, Kanna Rajan, John Ryan,...
We propose a new decision-theoretic approach for solving execution-time deliberation scheduling problems using recent advances in Generalized Semi-Markov Decision Processes (GSMDP...