Sciweavers

50 search results - page 3 / 10
» State Space Search for Risk-Averse Agents
Sort
View
AAAI
2007
13 years 7 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
ICRA
2006
IEEE
103views Robotics» more  ICRA 2006»
13 years 11 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
AAAI
1996
13 years 6 months ago
Easy and Hard Testbeds for Real-Time Search Algorithms
Although researchers have studied which factors influence the behavior of traditional search algorithms, currently not much is known about how domain properties influence the perf...
Sven Koenig, Reid G. Simmons
AAAI
1996
13 years 6 months ago
Efficient Goal-Directed Exploration
If a state space is not completely known in advance, then search algorithms have to explore it sufficiently to locate a goal state and a path leading to it, performing therefore w...
Yury V. Smirnov, Sven Koenig, Manuela M. Veloso, R...
AAAI
2008
13 years 7 months ago
Minimizing Disk I/O in Two-Bit Breadth-First Search
We present a breadth-first search algorithm, two-bit breadthfirst search (TBBFS), which requires only two bits for each state in the problem space. TBBFS can be parallelized in se...
Richard E. Korf