Sciweavers

1539 search results - page 1 / 308
» Fast and Simple Methods For Computing Control Points
Sort
View
CORR
2006
Springer
93views Education» more  CORR 2006»
13 years 11 months ago
Fast and Simple Methods For Computing Control Points
The purpose of this paper is to present simple and fast methods for computing control points for polynomial curves and polynomial surfaces given explicitly in terms of polynomials ...
Jean H. Gallier, Weqing Gu
CAGD
2005
113views more  CAGD 2005»
13 years 11 months ago
Fast degree elevation and knot insertion for B-spline curves
We give a new, simple algorithm for simultaneous degree elevation and knot insertion for B-spline curves. The method is based on the simple approach of computing derivatives using...
Qi-Xing Huang, Shi-Min Hu, Ralph R. Martin
CDC
2010
IEEE
130views Control Systems» more  CDC 2010»
13 years 6 months ago
A fast well-conditioned interior point method for predictive control
Interior point methods (IPMs) have proven to be an efficient way of solving quadratic programming problems in predictive control. A linear system of equations needs to be solved in...
Amir Shahzad, Eric C. Kerrigan, George A. Constant...
AAAI
1997
14 years 11 days ago
Incremental Methods for Computing Bounds in Partially Observable Markov Decision Processes
Partially observable Markov decision processes (POMDPs) allow one to model complex dynamic decision or control problems that include both action outcome uncertainty and imperfect ...
Milos Hauskrecht
CDC
2008
IEEE
161views Control Systems» more  CDC 2008»
14 years 1 months ago
A fast algorithm to compute the controllability, decentralized fixed-mode, and minimum-phase radius of LTI systems
In this paper, an efficient algorithm is presented for solving the 2-D optimization problem which is associated with computing the robustness measures of a number of linear time-in...
Simon Lam, Edward J. Davison