Sciweavers

536 search results - page 33 / 108
» Planning by Abstraction Using HW[]
Sort
View
IJCAI
1993
13 years 9 months ago
A New Logical framework for Deductive Planning
objects, like elements of (abstract) data types in ordinary programming languages In the theory of abstract data types most often one only considers algebraic structures where all ...
Werner Stephan, Susanne Biundo
AH
2004
Springer
13 years 11 months ago
Adaptive Help for Webbased Applications
Abstract. This paper presents an approach that uses the techniques of plan recognition not only to infer short-term plans and goals, but also to infer the long-term procedural know...
Dorothea Iglezakis
IROS
2008
IEEE
138views Robotics» more  IROS 2008»
14 years 2 months ago
Blended local planning for generating safe and feasible paths
Abstract— Many planning approaches adhere to the twotiered architecture consisting of a long-range, low fidelity global planner and a short-range high fidelity local planner. W...
Ling Xu, Anthony Stentz
AAAI
2011
12 years 7 months ago
A Switching Planner for Combined Task and Observation Planning
From an automated planning perspective the problem of practical mobile robot control in realistic environments poses many important and contrary challenges. On the one hand, the p...
Moritz Göbelbecker, Charles Gretton, Richard ...
AGTIVE
2007
Springer
14 years 1 months ago
A First Experimental Evaluation of Search Plan Driven Graph Pattern Matching
Abstract. With graph pattern matching the field of graph transformation (GT) includes an NP-complete subtask. But for real-life applications it is essential that graph pattern mat...
Gernot Veit Batz, Moritz Kroll, Rubino Geiß