Sciweavers

80 search results - page 9 / 16
» Design Tradeoffs in Partial Order (Plan space) Planning
Sort
View
AAAI
2004
13 years 9 months ago
Branching and Pruning: An Optimal Temporal POCL Planner Based on Constraint Programming
A key feature of modern optimal planners such as Graphplan and Blackbox is their ability to prune large parts of the search space. Previous Partial Order Causal Link (POCL) planne...
Vincent Vidal, Hector Geffner
ECAI
2004
Springer
14 years 1 months ago
Guiding a Theorem Prover with Soft Constraints
Attempts to use finite models to guide the search for proofs by resolution and the like in first order logic all suffer from the need to trade off the expense of generating and m...
John K. Slaney, Arnold Binas, David Price
ICRA
2007
IEEE
130views Robotics» more  ICRA 2007»
14 years 1 months ago
Greedy but Safe Replanning under Kinodynamic Constraints
— We consider motion planning problems for a vehicle with kinodynamic constraints, where there is partial knowledge about the environment and replanning is required. We present a...
Kostas E. Bekris, Lydia E. Kavraki
ICRA
1994
IEEE
147views Robotics» more  ICRA 1994»
13 years 11 months ago
Provable Strategies for Vision-Guided Exploration in Three Dimensions
An approach is presented for exploring an unknown, arbitrary surface in three-dimensional (3D) space by a mobile robot. The main contributions are (1) an analysis of the capabilit...
Kiriakos N. Kutulakos, Charles R. Dyer, Vladimir J...
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