391 search results - page 2 / 79 » Comparison-Based Algorithms Are Robust and Randomized Algori... |
IROS
2006
IEEE
13 years 11 months ago
2006
IEEE
— We present an anytime algorithm for planning paths through high-dimensional, non-uniform cost search spaces. Our approach works by generating a series of Rapidly-exploring Rand...
AAAI
1990
13 years 6 months ago
1990
This paper presents a projection algorithm for incremental control rule synthesis. The algorithm synthesizes an initial set of goal-achieving control rules using a combination of ...
CLUSTER
2011
IEEE
12 years 5 months ago
2011
IEEE
In the last decade, numerous efforts have been devoted to design efficient algorithms for clustering the wireless mobile ad‐hoc networks (MANET) consider...
CORR
2012
Springer
12 years 1 months ago
2012
Springer
Abstract— In this paper, we consider a class of continuoustime, continuous-space stochastic optimal control problems. Building upon recent advances in Markov chain approximation ...
OPODIS
2008
13 years 6 months ago
2008
Abstract. We consider the problem of Rendezvous or gathering of multiple autonomous entities (called mobile agents) moving in an unlabelled environment (modelled as a graph). The p...