Sciweavers

66 search results - page 9 / 14
» Using Caching to Solve Larger Probabilistic Planning Problem...
Sort
View
IROS
2007
IEEE
127views Robotics» more  IROS 2007»
15 years 5 months ago
Goal directed navigation with uncertainty in adversary locations
— This paper addresses the problem of planning for goal directed navigation in the environment that contains a number of possible adversary locations. It first shows that common...
Maxim Likhachev, Anthony Stentz
ICLP
2010
Springer
15 years 3 months ago
Tabling and Answer Subsumption for Reasoning on Logic Programs with Annotated Disjunctions
Probabilistic Logic Programming is an active field of research, with many proposals for languages, semantics and reasoning algorithms. One such proposal, Logic Programming with A...
Fabrizio Riguzzi, Terrance Swift
ATAL
2010
Springer
14 years 11 months ago
Incremental plan aggregation for generating policies in MDPs
Despite the recent advances in planning with MDPs, the problem of generating good policies is still hard. This paper describes a way to generate policies in MDPs by (1) determiniz...
Florent Teichteil-Königsbuch, Ugur Kuter, Gui...
IROS
2006
IEEE
100views Robotics» more  IROS 2006»
15 years 5 months ago
Toward Interactive Reaching in Static Environments for Humanoid Robots
— Reaching is a critical task for humanoid robots, requiring the application of state-of-the-art algorithms for motion planning and inverse kinematics. Practical algorithms for s...
Evan Drumwright, Victor Ng-Thow-Hing
ECCC
2007
99views more  ECCC 2007»
14 years 11 months ago
An Exponential Time/Space Speedup For Resolution
Satisfiability algorithms have become one of the most practical and successful approaches for solving a variety of real-world problems, including hardware verification, experime...
Philipp Hertel, Toniann Pitassi