63 search results - page 4 / 13 » Anytime, Dynamic Planning in High-dimensional Search Spaces |
AIPS
2008
15 years 1 days ago
2008
We present an algorithm that quickly finds optimal plans for unforeseen agent preferences within graph-based planning domains where actions have deterministic outcomes and action ...
107
click to vote
SIGMOD
2012
ACM
13 years 5 days ago
2012
ACM
Locality-Sensitive Hashing (LSH) and its variants are wellknown methods for solving the c-approximate NN Search problem in high-dimensional space. Traditionally, several LSH funct...
AAAI
2007
15 years 1 days ago
2007
For autonomous artificial decision-makers to solve realistic tasks, they need to deal with searching through large state and action spaces under time pressure. We study the probl...
CP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Constraint satisfaction problems provide strong formalism for modeling variety of real life problems. This paper presents a work currently in progress of which the goal i...
IROS
2007
IEEE
15 years 4 months ago
2007
IEEE
— Motion planning for robotic arms is important for real, physical world applications. The planning for arms with high-degree-of-freedom (DOF) is hard because its search space is...