Sciweavers

84 search results - page 5 / 17
» Pruning State Spaces with Extended Beam Search
Sort
View
ICTAI
2003
IEEE
14 years 24 days ago
Eliminating Redundancies in SAT Search Trees
Conflict analysis is a powerful paradigm of backtrack search algorithms, in particular for solving satisfiability problems arising from practical applications. Accordingly, most...
Richard Ostrowski, Bertrand Mazure, Lakhdar Sais, ...
ICRA
2006
IEEE
103views Robotics» more  ICRA 2006»
14 years 1 months ago
Heuristic Search for Coordinating Robot Agents in Adversarial Domains
Abstract— This paper presents a search-based, real-time adaptive solution to the multi-robot coordination problem in adversarial environments. By decomposing the global coordinat...
Ilya Levner, Alex Kovarsky, Hong Zhang
ATAL
2007
Springer
14 years 1 months ago
A Q-decomposition and bounded RTDP approach to resource allocation
This paper contributes to solve effectively stochastic resource allocation problems known to be NP-Complete. To address this complex resource management problem, a Qdecomposition...
Pierrick Plamondon, Brahim Chaib-draa, Abder Rezak...
ACII
2005
Springer
13 years 9 months ago
Simulated Annealing Based Hand Tracking in a Discrete Space
Hand tracking is a challenging problem due to the complexity of searching in a 20+ degrees of freedom (DOF) space for an optimal estimation of hand configuration. This paper repres...
Wei Liang, Yunde Jia, Yang Liu, Cheng Ge
AAAI
2007
13 years 9 months ago
Filtering, Decomposition and Search Space Reduction for Optimal Sequential Planning
We present in this paper a hybrid planning system which combines constraint satisfaction techniques and planning heuristics to produce optimal sequential plans. It integrates its ...
Stéphane Grandcolas, C. Pain-Barre