Sciweavers

2100 search results - page 121 / 420
» Observation Can Be as Effective as Action in Problem Solving
Sort
View
CVPR
2007
IEEE
14 years 3 months ago
A Graph Reduction Method for 2D Snake Problems
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...
Jianhua Yan, Keqi Zhang, Chengcui Zhang, Shu-Ching...
AIPS
2009
13 years 10 months ago
Navigation Planning in Probabilistic Roadmaps with Uncertainty
Probabilistic Roadmaps (PRM) are a commonly used class of algorithms for robot navigation tasks where obstacles are present in the environment. We examine the situation where the ...
Michael Kneebone, Richard Dearden
ICRA
2010
IEEE
142views Robotics» more  ICRA 2010»
13 years 7 months ago
Learning and planning high-dimensional physical trajectories via structured Lagrangians
— We consider the problem of finding sufficiently simple models of high-dimensional physical systems that are consistent with observed trajectories, and using these models to s...
Paul Vernaza, Daniel D. Lee, Seung-Joon Yi
ECAI
2004
Springer
14 years 2 months ago
Planning with Numerical Expressions in LPG
Abstract. We present some techniques for handling planning problems with numerical expressions that can be specified using the standard planning language PDDL. These techniques ar...
Alfonso Gerevini, Alessandro Saetti, Ivan Serina
DAGSTUHL
2007
13 years 10 months ago
Learning Probabilistic Relational Dynamics for Multiple Tasks
The ways in which an agent’s actions affect the world can often be modeled compactly using a set of relational probabilistic planning rules. This paper addresses the problem of ...
Ashwin Deshpande, Brian Milch, Luke S. Zettlemoyer...