Sciweavers

4894 search results - page 31 / 979
» Dynamic Abstraction Planning
Sort
View
ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
15 years 4 months ago
Finding Best k Policies
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
Peng Dai, Judy Goldsmith
IROS
2008
IEEE
161views Robotics» more  IROS 2008»
15 years 4 months ago
A perception mechanism for supporting autonomous intersection handling in urban driving
Abstract— Knowledge of the driving environment is essential for robotic vehicles to comply with traffic rules while autonomously traversing intersections. However, due to limite...
Young-Woo Seo, Chris Urmson
ICLP
2007
Springer
15 years 1 months ago
OnEQL: An Ontology Efficient Query Language Engine for the Semantic Web
Abstract. In this paper we describe the OnEQL system, a query engine that implements optimization techniques and evaluation strategies to speed up the evaluation time of querying a...
Edna Ruckhaus, Maria-Esther Vidal, Eduardo Ruiz
KR
2004
Springer
15 years 3 months ago
Learning Probabilistic Relational Planning Rules
To learn to behave in highly complex domains, agents must represent and learn compact models of the world dynamics. In this paper, we present an algorithm for learning probabilist...
Hanna Pasula, Luke S. Zettlemoyer, Leslie Pack Kae...
FLAIRS
2004
14 years 11 months ago
Mixed-Initiative Case Replay
Mixed-initiative case replay introduces an active human into the case-based planning process. The goals of this novel technique are to utilize the strengths of machine-based case ...
Michael T. Cox