Sciweavers

33356 search results - page 259 / 6672
» Models of Continual Computation
Sort
View
ICRA
2010
IEEE
157views Robotics» more  ICRA 2010»
15 years 5 months ago
Sampling-Based Motion and Symbolic Action Planning with geometric and differential constraints
Abstract— To compute collision-free and dynamicallyfeasibile trajectories that satisfy high-level specifications given in a planning-domain definition language, this paper prop...
Erion Plaku, Gregory D. Hager
HCI
2009
15 years 4 months ago
Adaptive Learning via Social Cognitive Theory and Digital Cultural Ecosystems
This paper will look at the human predisposition to oral tradition and its effectiveness as a learning tool to convey mission-critical information. After exploring the effectivenes...
Joseph Juhnke, Adam R. Kallish
ICCV
2011
IEEE
14 years 6 months ago
Generalized Ordering Constraints for Multilabel Optimization
We propose a novel framework for imposing label ordering constraints in multilabel optimization. In particular, label jumps can be penalized differently depending on the jump dire...
Evgeny Strekalovskiy, Daniel Cremers
ICPR
2002
IEEE
16 years 7 months ago
Curvature Estimation of Surfaces in 3D Grey-Value Images
In this paper we present a novel method to estimate curvature of iso grey-level surfaces in grey-value images. Our method succeeds where isophote curvature fails. There is neither...
Bernd Rieger, Frederik J. Timmermans, Lucas J. van...
ICRA
2005
IEEE
115views Robotics» more  ICRA 2005»
16 years 5 days ago
An Interpolated Dynamic Navigation Function
— The E∗ algorithm is a path planning method capable of dynamic replanning and user-configurable path cost interpolation. It calculates a navigation function as a sampling of ...
Roland Philippsen, Roland Siegwart