Sciweavers

220 search results - page 6 / 44
» Path planning using learned constraints and preferences
Sort
View
ICML
2005
IEEE
15 years 10 months ago
Preference learning with Gaussian processes
In this paper, we propose a probabilistic kernel approach to preference learning based on Gaussian processes. A new likelihood function is proposed to capture the preference relat...
Wei Chu, Zoubin Ghahramani
90
Voted
ICRA
2009
IEEE
115views Robotics» more  ICRA 2009»
15 years 4 months ago
Multi-robot coordination using generalized social potential fields
Abstract— We present a novel approach to compute collisionfree paths for multiple robots subject to local coordination constraints. More specifically, given a set of robots, the...
Russell Gayle, William Moss, Ming C. Lin, Dinesh M...
IJRR
2010
107views more  IJRR 2010»
14 years 8 months ago
Non-parametric Learning to Aid Path Planning over Slopes
— This paper addresses the problem of closing the loop from perception to action selection for unmanned ground vehicles, with a focus on navigating slopes. A new non-parametric l...
Sisir Karumanchi, Thomas Allen, Tim Bailey, Steve ...
SI3D
2003
ACM
15 years 2 months ago
Interactive navigation in complex environments using path planning
We present a novel approach for interactive navigation in complex 3D synthetic environments using path planning. Our algorithm precomputes a global roadmap of the environment by u...
Brian Salomon, Maxim Garber, Ming C. Lin, Dinesh M...
CP
2004
Springer
15 years 3 months ago
Controllability of Soft Temporal Constraint Problems
In real-life temporal scenarios, uncertainty and preferences are often essential, coexisting aspects. We present a formalism where temporal constraints with both preferences and un...
Francesca Rossi, Kristen Brent Venable, Neil Yorke...