Sciweavers

154 search results - page 26 / 31
» Robust snake convergence based on dynamic programming
Sort
View
LFP
1992
140views more  LFP 1992»
13 years 8 months ago
Global Tagging Optimization by Type Inference
Tag handling accounts for a substantial amount of execution cost in latently typed languages such as Common LISP and Scheme, especially on architectures that provide no special ha...
Fritz Henglein
AIPS
2007
13 years 10 months ago
Prioritizing Bellman Backups without a Priority Queue
Several researchers have shown that the efficiency of value iteration, a dynamic programming algorithm for Markov decision processes, can be improved by prioritizing the order of...
Peng Dai, Eric A. Hansen
AUTOMATICA
2007
124views more  AUTOMATICA 2007»
13 years 7 months ago
Motion planning in uncertain environments with vision-like sensors
In this work we present a methodology for intelligent path planning in an uncertain environment using vision like sensors, i.e., sensors that allow the sensing of the environment ...
Suman Chakravorty, John L. Junkins
ESA
2003
Springer
111views Algorithms» more  ESA 2003»
14 years 25 days ago
Fast Smallest-Enclosing-Ball Computation in High Dimensions
Abstract. We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in mos...
Kaspar Fischer, Bernd Gärtner, Martin Kutz
CDC
2008
IEEE
131views Control Systems» more  CDC 2008»
14 years 2 months ago
Explicit model predictive control for linear parameter-varying systems
Abstract— In this paper we demonstrate how one can reformulate the MPC problem for LPV systems to a series of mpLPs by a closed-loop minimax MPC algorithm based on dynamic progra...
Thomas Besselmann, Johan Löfberg, Manfred Mor...