Sciweavers

173 search results - page 28 / 35
» Search Complexities for HTN Planning
Sort
View
SAB
2004
Springer
159views Optimization» more  SAB 2004»
14 years 25 days ago
Swarming Behavior Using Probabilistic Roadmap Techniques
While techniques exist for simulating swarming behaviors, these methods usually provide only simplistic navigation and planning capabilities. In this review, we explore the benefi...
O. Burçhan Bayazit, Jyh-Ming Lien, Nancy M....
ICS
2007
Tsinghua U.
14 years 1 months ago
Scheduling FFT computation on SMP and multicore systems
Increased complexity of memory systems to ameliorate the gap between the speed of processors and memory has made it increasingly harder for compilers to optimize an arbitrary code...
Ayaz Ali, S. Lennart Johnsson, Jaspal Subhlok
AAAI
2004
13 years 9 months ago
SOFIA's Choice: An AI Approach to Scheduling Airborne Astronomy Observations
We describe an innovative solution to the problem of scheduling astronomy observations for the Stratospheric Observatory for Infrared Astronomy, an airborne observatory. The probl...
Jeremy Frank, Michael A. K. Gross, Elif Kürkl...
ICRA
2007
IEEE
89views Robotics» more  ICRA 2007»
14 years 1 months ago
Probabilistic Strategies for Pursuit in Cluttered Environments with Multiple Robots
Abstract— In this paper, we describe a method for coordinating multiple robots in a pursuit-evasion domain. We examine the problem of multiple robotic pursuers attempting to loca...
Geoffrey Hollinger, Athanasios Kehagias, Sanjiv Si...
JAIR
2010
115views more  JAIR 2010»
13 years 6 months ago
An Investigation into Mathematical Programming for Finite Horizon Decentralized POMDPs
Decentralized planning in uncertain environments is a complex task generally dealt with by using a decision-theoretic approach, mainly through the framework of Decentralized Parti...
Raghav Aras, Alain Dutech