Sciweavers

858 search results - page 115 / 172
» Planning and defeasible reasoning
Sort
View
ICRA
2010
IEEE
142views Robotics» more  ICRA 2010»
14 years 10 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»
14 years 10 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
13 years 12 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
SPATIALCOGNITION
2004
Springer
15 years 5 months ago
Branching Allen
Allen’s interval calculus is one of the most prominent formalisms in the domain of qualitative spatial and temporal reasoning. Applications of this calculus, however, are restric...
Marco Ragni, Stefan Wölfl
ICCBR
2003
Springer
15 years 5 months ago
Case Mining from Large Databases
Abstract. This paper presents an approach of case mining to automatically discover case bases from large datasets in order to improve both the speed and the quality of case based r...
Qiang Yang, Hong Cheng