Sciweavers

1614 search results - page 214 / 323
» Planning as Temporal Reasoning
Sort
View
GIS
2010
ACM
15 years 5 months ago
A case for time-dependent shortest path computation in spatial networks
The problem of point-to-point shortest path computation in spatial networks is extensively studied with many approaches proposed to speed-up the computation. Most of the existing ...
Ugur Demiryurek, Farnoush Banaei Kashani, Cyrus Sh...
ICRA
2010
IEEE
142views Robotics» more  ICRA 2010»
15 years 5 months ago
A quadratic regulator-based heuristic for rapidly exploring state space
Abstract— Kinodynamic planning algorithms like RapidlyExploring Randomized Trees (RRTs) hold the promise of finding feasible trajectories for rich dynamical systems with complex...
Elena Leah Glassman, Russ Tedrake
ICRA
2010
IEEE
126views Robotics» more  ICRA 2010»
15 years 5 months ago
Simulation-based LQR-trees with input and state constraints
— We present an algorithm that probabilistically covers a bounded region of the state space of a nonlinear system with a sparse tree of feedback stabilized trajectories leading t...
Philipp Reist, Russ Tedrake
ATAL
2011
Springer
14 years 6 months ago
Towards a unifying characterization for quantifying weak coupling in dec-POMDPs
Researchers in the field of multiagent sequential decision making have commonly used the terms “weakly-coupled” and “loosely-coupled” to qualitatively classify problems i...
Stefan J. Witwicki, Edmund H. Durfee
IAT
2008
IEEE
16 years 27 days ago
Obligations with Deadlines and Maintained Interdictions in Privacy Regulation Frameworks
We aim at providing artificial agents with logical tools to reason specifically on privacy-related regulations, in order to comply with them. In order to express these regulatio...
Guillaume Piolle, Yves Demazeau