Sciweavers

914 search results - page 37 / 183
» The Computational Complexity of Probabilistic Planning
Sort
View
ICRA
2003
IEEE
222views Robotics» more  ICRA 2003»
14 years 3 months ago
Path planning using learned constraints and preferences
— In this paper we present a novel method for robot path planning based on learning motion patterns. A motion pattern is defined as the path that results from applying a set of ...
Gregory Dudek, Saul Simhon
EXPERT
2008
108views more  EXPERT 2008»
13 years 10 months ago
Case-Based Plan Adaptation: An Analysis and Review
: In this article we analyze the current state of case-based plan adaptation research. We include the traditional distinction between transformational and derivational analogy but ...
Héctor Muñoz-Avila, Michael T. Cox
AAAI
2004
13 years 11 months ago
Analogical Path Planning
We present a probabilistic method for path planning that considers trajectories constrained by both the environment and an ensemble of restrictions or preferences on preferred mot...
Saul Simhon, Gregory Dudek
ICRA
2008
IEEE
123views Robotics» more  ICRA 2008»
14 years 4 months ago
Target-directed attention: Sequential decision-making for gaze planning
— It is widely agreed that efficient visual search requires the integration of target-driven top-down information and image-driven bottom-up information. Yet the problem of gaze...
Julia Vogel, Nando de Freitas
ECCV
2008
Springer
13 years 11 months ago
Multi-thread Parsing for Recognizing Complex Events in Videos
This paper presents a probabilistic grammar approach to the recognition of complex events in videos. Firstly, based on the original motion features, a rule induction algorithm is a...
Zhang Zhang, Kaiqi Huang, Tieniu Tan