The paper studies reachability problem of autonomous ai^ine systems on n-dimensional polytopes.Our goal is to obtain both the largest positive invariant set in the polytope and the backward reachable set(the attractio...The paper studies reachability problem of autonomous ai^ine systems on n-dimensional polytopes.Our goal is to obtain both the largest positive invariant set in the polytope and the backward reachable set(the attraction domain)of each facet.Special attention is paid to the largest stable invariant affine subspace.After presenting several useful properties of those sets,a partition procedure is given to determine the largest positive invariant set in the polytope and all the attraction domains of facets.展开更多
基金Supported by National Natural Science Foundation of China(60504024)Zhejiang Provincial Natural Science Foundation of China(Y106010)the Specialized Research Fund for the Doctoral Program of Higher Education of China(20060335022)
文摘The paper studies reachability problem of autonomous ai^ine systems on n-dimensional polytopes.Our goal is to obtain both the largest positive invariant set in the polytope and the backward reachable set(the attraction domain)of each facet.Special attention is paid to the largest stable invariant affine subspace.After presenting several useful properties of those sets,a partition procedure is given to determine the largest positive invariant set in the polytope and all the attraction domains of facets.
