This paper unifies and extends several different existing strategies for deploying groups of robots in an environment. A cost function is proposed that can be specialized to rep...
Mac Schwager, Daniela Rus, Jean-Jacques E. Slotine
We analyze the convergence of randomized trace estimators. Starting at 1989, several algorithms have been proposed for estimating the trace of a matrix by 1 M M i=1 zT i Azi, where...
This paper describes a computationally feasible approximation to the AIXI agent, a universal reinforcement learning agent for arbitrary environments. AIXI is scaled down in two ke...
Joel Veness, Kee Siong Ng, Marcus Hutter, William ...
This work on cognitive radio access ventures beyond the more traditional “listen-before-talk” paradigm that underlies many cognitive radio access proposals. We exploit the bi-...
We consider sequential quadratic programming (SQP) methods for solving constrained nonlinear programming problems. It is generally believed that SQP methods are sensitive to the a...