Sciweavers

232 search results - page 12 / 47
» Randomized Kinodynamic Planning
Sort
View
ICRA
1994
IEEE
105views Robotics» more  ICRA 1994»
15 years 4 months ago
Harmonic Functions and Collision Probabilities
There is a close relationship between harmonic functions { which have recently been proposed for path planning { and hitting probabilities for random processes. The hitting probab...
Christopher I. Connolly
ENDM
2006
77views more  ENDM 2006»
15 years 14 days ago
A Two-stage Model for a Day-ahead Paratransit Planning Problem
We consider a dynamic planning problem for paratransit transportation. The focus is on a decision to take one day ahead: which requests to serve with own vehicles, and which reque...
Maria L. A. G. Cremers, Willem K. Klein Haneveld, ...
AIPS
2009
15 years 1 months ago
Computing Robust Plans in Continuous Domains
We define the robustness of a sequential plan as the probability that it will execute successfully despite uncertainty in the execution environment. We consider a rich notion of u...
Christian Fritz, Sheila A. McIlraith
CORR
2010
Springer
134views Education» more  CORR 2010»
15 years 17 days ago
Incremental Sampling-based Algorithms for Optimal Motion Planning
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
Sertac Karaman, Emilio Frazzoli
101
Voted
NAACL
2001
15 years 1 months ago
SPoT: A Trainable Sentence Planner
Sentence planning is a set of inter-related but distinct tasks, one of which is sentence scoping, i.e. the choice of syntactic structure for elementary speech acts and the decisio...
Marilyn A. Walker, Owen Rambow, Monica Rogati