Sciweavers

102 search results - page 8 / 21
» Search and Inference in AI Planning
Sort
View
ICWS
2008
IEEE
13 years 9 months ago
An Efficient Syntactic Web Service Composition Algorithm Based on the Planning Graph Model
In this paper, we have studied a common Web service composition problem, the syntactic matching problem, where the output parameters of a Web service can be used as the input para...
Xianrong Zheng, Yuhong Yan
AAAI
2004
13 years 9 months ago
Intelligent Agents for Coalition Search and Rescue Task Support
The Coalition Search and Rescue Task Support demonstration shows cooperative agents supporting a highly dynamic mission in which AI task planning, inter-agent collaboration, workf...
Austin Tate, Jeff Dalton, Clauirton de Siebra, J. ...
ICRA
2010
IEEE
157views Robotics» more  ICRA 2010»
13 years 6 months ago
Sampling-Based Motion and Symbolic Action Planning with geometric and differential constraints
Abstract— To compute collision-free and dynamicallyfeasibile trajectories that satisfy high-level specifications given in a planning-domain definition language, this paper prop...
Erion Plaku, Gregory D. Hager
KR
2004
Springer
14 years 1 months ago
Discovering State Invariants
We continue to advocate a methodology that we used earlier for pattern discovery through exhaustive search in selected small domains. This time we apply it to the problem of disco...
Fangzhen Lin
JMLR
2008
124views more  JMLR 2008»
13 years 7 months ago
Learning Control Knowledge for Forward Search Planning
A number of today's state-of-the-art planners are based on forward state-space search. The impressive performance can be attributed to progress in computing domain independen...
Sung Wook Yoon, Alan Fern, Robert Givan