作者: S. Kaynama , M. Oishi , I. M. Mitchell , G. A. Dumont
关键词: Set (abstract data type) 、 Set theory 、 Approximation theory 、 Representation (mathematics) 、 Ellipsoid 、 Mathematics 、 Reachability 、 Piecewise 、 Mathematical optimization 、 Algorithm 、 Simple (abstract algebra)
摘要: In a previous paper we showed how the continual reachability set can be numerically computed using efficient maximal tools. The resulting is in general arbitrarily shaped and practice possibly non-convex. Here, present fixed-complexity piecewise ellipsoidal under-approximation of techniques. This provides simple approximation an otherwise relatively complicated that used when closed-form representation needed. We demonstrate results on problem control anesthesia.