Sciweavers

98 search results - page 12 / 20
» Planning with Recursive Subgoals
Sort
View
ENTCS
2006
169views more  ENTCS 2006»
14 years 9 months ago
Constructing Induction Rules for Deductive Synthesis Proofs
We describe novel computational techniques for constructing induction rules for deductive synthesis proofs. Deductive synthesis holds out the promise of automated construction of ...
Alan Bundy, Lucas Dixon, Jeremy Gow, Jacques D. Fl...
ICCBR
2005
Springer
15 years 3 months ago
Case Adaptation by Segment Replanning for Case-Based Planning Systems
An adaptation phase is crucial for a good and reasonable Case-Based Planning (CBP) system. The adaptation phase is responsible for finding a solution in order to solve a new proble...
Flavio Tonidandel, Marcio Rillo
IJCAI
1997
14 years 11 months ago
Efficiently Executing Information-Gathering Plans
Themost costly aspect of gathering information over the Internet is that of transferring data over the networkto answer the user’s query. Wemaketwo contributions in this paperth...
Marc Friedman, Daniel S. Weld
65
Voted
ICRA
2003
IEEE
119views Robotics» more  ICRA 2003»
15 years 2 months ago
Incremental low-discrepancy lattice methods for motion planning
We present deterministic sequences for use in sampling-based approaches to motion planning. They simultaneously combine the qualities found in many other sequences: i) the increme...
Stephen R. Lindemann, Steven M. LaValle
AIPS
2003
14 years 11 months ago
Synthesis of Hierarchical Finite-State Controllers for POMDPs
We develop a hierarchical approach to planning for partially observable Markov decision processes (POMDPs) in which a policy is represented as a hierarchical finite-state control...
Eric A. Hansen, Rong Zhou