Sciweavers

26 search results - page 2 / 6
» Symbolic Generalization for On-line Planning
Sort
View
AIPS
2003
13 years 6 months ago
Guided Symbolic Universal Planning
Symbolic universal planning based on the reduced Ordered Binary Decision Diagram (OBDD) has been shown to be an efficient approach for planning in non-deterministic domains. To d...
Rune M. Jensen, Manuela M. Veloso, Randal E. Bryan...
AAAI
2012
11 years 7 months ago
Evaluating Temporal Plans in Incomplete Domains
Recent work on planning in incomplete domains focuses on constructing plans that succeed despite incomplete knowledge of action preconditions and effects. As planning models becom...
Daniel Morwood, Daniel Bryce
ATAL
2009
Springer
13 years 12 months ago
A model for integrating dialogue and the execution of joint plans
Coming up with a plan for a team that operates in a non-deterministic environment is a complex process, and the problem is further complicated by the need for team members to comm...
Yuqing Tang, Timothy J. Norman, Simon Parsons
ECAI
2000
Springer
13 years 9 months ago
Extensions of Constraint Solving for Proof Planning
The integration of constraint solvers into proof planning has pushed the problem solving horizon. Proof planning benefits from the general functionalities of a constraint solver s...
Erica Melis, Jürgen Zimmer, Tobias Mülle...
ICIP
2009
IEEE
14 years 6 months ago
Circular Blurred Shape Model For Symbol Spotting In Documents
Symbol spotting problem requires feature extraction strategies able to generalize from training samples and to localize the target object while discarding most part of the image. ...