Sciweavers

283 search results - page 3 / 57
» Incremental Deterministic Planning
Sort
View
AIPS
2006
13 years 9 months ago
Bounded Branching and Modalities in Non-Deterministic Planning
We study the consequences on complexity that arise when bounds on the number of branch points on the solutions for non-deterministic planning problems are imposed as well as when ...
Blai Bonet
IROS
2006
IEEE
100views Robotics» more  IROS 2006»
14 years 1 months ago
Multi-Robot Motion Planning by Incremental Coordination
— A recent study showed that high failure rates in many instances of decoupled multi-robot motion planning makes the decoupled planning approach an unsuitable choice in compariso...
Mitul Saha, Pekka Isto
AIPS
2000
13 years 9 months ago
Using Generic Preferences to Incrementally Improve Plan Quality
We describe a methodology for representing and optimizing user preferences on plans. Our approach differs from previous work on plan optimization in that we employ a generalizatio...
Gregg Rabideau, Barbara Engelhardt, Steve A. Chien