Sciweavers

24 search results - page 3 / 5
» Planning in Answer Set Programming using Ordered Task Decomp...
Sort
View
AAAI
2008
13 years 8 months ago
HTN-MAKER: Learning HTNs with Minimal Additional Knowledge Engineering Required
We describe HTN-MAKER, an algorithm for learning hierarchical planning knowledge in the form of decomposition methods for Hierarchical Task Networks (HTNs). HTNMAKER takes as inpu...
Chad Hogg, Héctor Muñoz-Avila, Ugur ...
ISCI
2007
88views more  ISCI 2007»
13 years 6 months ago
Strategy creation, decomposition and distribution in particle navigation
Strategy planning is crucial to control a group to achieve a number of tasks in a closed area full of obstacles. In this study, genetic programming has been used to evolve rule-ba...
Ulas Beldek, Kemal Leblebicioglu
IROS
2009
IEEE
227views Robotics» more  IROS 2009»
14 years 21 days ago
Cell-RRT: Decomposing the environment for better plan
— In order to define an architecture for task and motion planning of a mobile robot, we propose the CellRRT path planner that combines the advantages of planning approaches by d...
Julien Guitton, Jean-Loup Farges, Raja Chatila
CP
2004
Springer
13 years 11 months ago
A Hybrid Method for Planning and Scheduling
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
John N. Hooker
ACL
2009
13 years 3 months ago
Do Automatic Annotation Techniques Have Any Impact on Supervised Complex Question Answering?
In this paper, we analyze the impact of different automatic annotation methods on the performance of supervised approaches to the complex question answering problem (defined in th...
Yllias Chali, Sadid A. Hasan, Shafiq R. Joty