Sciweavers

122 search results - page 8 / 25
» An Algorithm for Probabilistic Least-Commitment Planning
Sort
View
89
Voted
AIPS
2009
14 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
TRANSCI
2010
169views more  TRANSCI 2010»
14 years 4 months ago
A Model and Algorithm for the Courier Delivery Problem with Uncertainty
We consider the Courier Delivery Problem, a variant of the Vehicle Routing Problem with time windows in which customers appear probabilistically and their service times are uncert...
Ilgaz Sungur, Yingtao Ren, Fernando Ordó&nt...
IJRR
2002
98views more  IJRR 2002»
14 years 9 months ago
On Delaying Collision Checking in PRM Planning
: This paper describes the foundations and algorithms of a new probabilistic roadmap (PRM) planner that is: single-query
Gildardo Sánchez-Ante, Jean-Claude Latombe
86
Voted
KI
2002
Springer
14 years 9 months ago
ParleE: An Adaptive Plan Based Event Appraisal Model of Emotions
Abstract. We propose ParleE, a quantitative, flexible and adaptive model of emotions for a conversational agent in a multi-agent environment capable of multimodal communication. Pa...
The Duy Bui, Dirk Heylen, Mannes Poel, Anton Nijho...
AGENTS
1998
Springer
15 years 1 months ago
Learning Situation-Dependent Costs: Improving Planning from Probabilistic Robot Execution
Physical domains are notoriously hard to model completely and correctly, especially to capture the dynamics of the environment. Moreover, since environments change, it is even mor...
Karen Zita Haigh, Manuela M. Veloso