Sciweavers

1146 search results - page 89 / 230
» On the Complexity of Domain-Independent Planning
Sort
View
ECAI
2010
Springer
13 years 9 months ago
Knowledge Compilation Using Interval Automata and Applications to Planning
Knowledge compilation [6, 5, 14, 8] consists in transforming a problem offline into a form which is tractable online. In this paper, we introduce new structures, based on the notio...
Alexandre Niveau, Hélène Fargier, C&...
EOR
2006
178views more  EOR 2006»
13 years 9 months ago
A fuzzy optimization model for QFD planning process using analytic network approach
In both the quality improvement and the design of a product, the engineering characteristics affecting product performance are primarily identified and improved to optimize custom...
Cengiz Kahraman, Tijen Ertay, Gülçin B...
JSW
2008
99views more  JSW 2008»
13 years 9 months ago
An Intelligent Home Environment based on Service Planning over Peer-to-Peer Overlay Network
With the population of network usage, it is possible to connect home appliances with each other. The basic demand is to connect home appliances easily with less user intervening an...
Chuan-Feng Chiu, Steen J. Hsu, Sen-Ren Jan
IJRR
2007
171views more  IJRR 2007»
13 years 9 months ago
Creating High-quality Paths for Motion Planning
Many algorithms have been proposed that create a path for a robot in an environment with obstacles. Most methods are aimed at finding a solution. However, for many applications, ...
Roland Geraerts, Mark H. Overmars
ICRA
2010
IEEE
154views Robotics» more  ICRA 2010»
13 years 7 months ago
Multi-agent path planning with multiple tasks and distance constraints
— The DPC algorithm developed in our previous work is an efficient way of computing optimal trajectories for multiple robots in a distributed fashion with timeparameterized cons...
Subhrajit Bhattacharya, Maxim Likhachev, Vijay Kum...