We describe techniques to optimally select landmarks for performing mobile robot localization by matching terrain maps. The method is based upon a maximum-likelihood robot localiza...
The maxn algorithm (Luckhardt and Irani, 1986) for playing multiplayer games is flexible, but there are only limited techniques for pruning maxn game trees. This paper presents oth...
Iterative solvers such as the Jacobi and Gauss-Seidel relaxation methods are important, but time-consuming building blocks of many scientific and engineering applications. The per...
— A team of robots cooperating to quickly produce a map needs to share landmark information between members so that the local maps can be accurately merged. However, the appearan...
—Dynamic spectrum trading amongst small cognitive users is fundamentally different along two axes: temporal variation, and spatial variation of user demand and channel condition....