Sciweavers

203 search results - page 10 / 41
» Learning to plan for constrained manipulation from demonstra...
Sort
View
AIPS
2000
14 years 11 months ago
New Results about LCGP, a Least Committed GraphPlan
Planners from the family of Graphplan (Graphplan, IPP, STAN...) are presently considered as the most efficient ones on numerous planning domains. Their partially ordered plans can...
Michel Cayrol, Pierre Régnier, Vincent Vida...
89
Voted
ICRA
2003
IEEE
108views Robotics» more  ICRA 2003»
15 years 2 months ago
On-line safe path planning in unknown environments
s - For the on-line safe path planning of a mobile robot in unknown environments, the paper proposes a simple Hopfield Neural Network ( HNN ) planner. Without learning process, the...
Weidong Chen, Changhong Fan, Yugeng Xi
ECCV
2004
Springer
15 years 11 months ago
A Constrained Semi-supervised Learning Approach to Data Association
Data association (obtaining correspondences) is a ubiquitous problem in computer vision. It appears when matching image features across multiple images, matching image features to ...
Hendrik Kück, Nando de Freitas, Peter Carbone...
ICML
2006
IEEE
15 years 10 months ago
Maximum margin planning
Mobile robots often rely upon systems that render sensor data and perceptual features into costs that can be used in a planner. The behavior that a designer wishes the planner to ...
Nathan D. Ratliff, J. Andrew Bagnell, Martin Zinke...
JAIR
2010
145views more  JAIR 2010»
14 years 8 months ago
Planning with Noisy Probabilistic Relational Rules
Noisy probabilistic relational rules are a promising world model representation for several reasons. They are compact and generalize over world instantiations. They are usually in...
Tobias Lang, Marc Toussaint