Constrained control allocation - Three-moment problem
Citations
1,389 citations
841 citations
Cites methods from "Constrained control allocation - Th..."
...Improvements over the original algorithm (Durham, 1993) are based on various data structures, enumerations and representations (Bordignon & Durham, 1995; Durham, 1994a,b, 1999; Petersen & Bodson, 2002) as well as linear programming (Bodson, 2002; Oppenheimer et al., 2010)....
[...]
350 citations
Cites background from "Constrained control allocation - Th..."
...1Linear models are also common in flight control applications [2], [3]....
[...]
...Various computational algorithms for constrained least squares control allocation, with emphasis on efficient real-time implementation without real-time optimization, are studied in [2], [3], [11]–[15]....
[...]
305 citations
Cites background or methods from "Constrained control allocation - Th..."
...• The choice of u∗ is not always unique (Durham 1994a)....
[...]
...For k = dim v = 3, Durham has proposed a number of methods (Durham 1994b,a, 1999, 2001), all of which are based on the notion of an attainable moment subset (AMS)....
[...]
...Durham (1994a) showed that this problem occurs if not all k × k submatrices of B have full rank....
[...]
...Methods to make the choice of u∗ unique include perturbing the elements of B to avoid rank deficiency (Durham 1994a), and averaging over (a subset of) the possible control inputs (Petersen and Bodson 2000), which in our case would lead to u∗ = (0 0 1)T ....
[...]
...Description of Method In the original papers on direct control allocation (Durham 1993, 1994b), the method was described as follows....
[...]
262 citations
Cites methods from "Constrained control allocation - Th..."
...1 Direct Control Allocation The direct control allocation method was mainly proposed and refined by Durham and his group [Durham 1993], [Durham 1994a], [Durham 1994b]....
[...]
References
579 citations
527 citations
141 citations
27 citations