Sciweavers

173 search results - page 8 / 35
» Search Complexities for HTN Planning
Sort
View
AI
2000
Springer
13 years 7 months ago
Using temporal logics to express search control knowledge for planning
Over the years increasingly sophisticated planning algorithms have been developed. These have made for more efficient planners, but unfortunately these planners still suffer from ...
Fahiem Bacchus, Froduald Kabanza
ICRA
2009
IEEE
165views Robotics» more  ICRA 2009»
14 years 2 months ago
Global path planning for robust Visual Servoing in complex environments
Abstract— We incorporate sampling-based global path planning with Visual Servoing (VS) for a robotic arm equipped with an in-hand camera. The path planning accounts for a number ...
Moslem Kazemi, Kamal K. Gupta, Mehran Mehrandezh
SI3D
2003
ACM
14 years 21 days ago
Interactive navigation in complex environments using path planning
We present a novel approach for interactive navigation in complex 3D synthetic environments using path planning. Our algorithm precomputes a global roadmap of the environment by u...
Brian Salomon, Maxim Garber, Ming C. Lin, Dinesh M...
AAAI
2006
13 years 9 months ago
Cost-Optimal External Planning
This paper considers strategies for external memory based optimal planning. An external breadth-first search exploration algorithm is devised that is guaranteed to find the costop...
Stefan Edelkamp, Shahid Jabbar
ECP
1997
Springer
128views Robotics» more  ECP 1997»
13 years 11 months ago
SINERGY: A Linear Planner Based on Genetic Programming
In this paper we describe SINERGY, which is a highly parallelizable, linear planning system that is based on the genetic programming paradigm. Rather than reasoning about the world...
Ion Muslea