Sciweavers

IJIT
2004
13 years 5 months ago
Memetic Algorithm Based Path Planning for a Mobile Robot
In this paper, the problem of finding the optimal collision free path for a mobile robot, the path planning problem, is solved using an advanced evolutionary algorithm called memet...
Neda Shahidi, Hadi Esmaeilzadeh, Marziye Abdollahi...
AAAI
2010
13 years 5 months ago
High-Quality Policies for the Canadian Traveler's Problem
We consider the stochastic variant of the Canadian Traveler's Problem, a path planning problem where adverse weather can cause some roads to be untraversable. The agent does ...
Patrick Eyerich, Thomas Keller, Malte Helmert
ICRA
1993
IEEE
184views Robotics» more  ICRA 1993»
13 years 8 months ago
Vision-Guided Exploration: A Step Toward General Motion Planning in Three Dimensions
We present an approach for solving the path planning problem for a mobile robot operating in an unknown, three dimensional environment containing obstacles of arbitrary shape. The...
Kiriakos N. Kutulakos, Vladimir J. Lumelsky, Charl...
IWANN
1997
Springer
13 years 8 months ago
Dynamic Path Planning with Spiking Neural Networks
: The path planning problem is relevant for all applications in which a mobil robot should autonomously navigate. Finding the shortest path in an environment that is only partialy ...
Ulrich Roth, Marc Walker, Arne Hilmann, Heinrich K...
ICML
2003
IEEE
14 years 5 months ago
Planning in the Presence of Cost Functions Controlled by an Adversary
We investigate methods for planning in a Markov Decision Process where the cost function is chosen by an adversary after we fix our policy. As a running example, we consider a rob...
H. Brendan McMahan, Geoffrey J. Gordon, Avrim Blum