Finite plans proved to be an efficient method to steer complex control systems via feedback quantization. Such finite plans can be encoded by finite-length words constructed on suitable alphabets, thus permitting transmission on limited capacity channels. In particular flat systems can be steered computing arbitrarily close approximations of a desired equilibrium in polynomial time. The paper investigates how the efficiency of planning is affected by the choice of inputs, and provides some results as to optimal performance in terms of accuracy and range. Efficiency is here measured in terms of computational complexity and description length (in number of bits) of finite plans.
Improving efficiency of finite plans by optimal choice of input sets
BICCHI, ANTONIO;
2006-01-01
Abstract
Finite plans proved to be an efficient method to steer complex control systems via feedback quantization. Such finite plans can be encoded by finite-length words constructed on suitable alphabets, thus permitting transmission on limited capacity channels. In particular flat systems can be steered computing arbitrarily close approximations of a desired equilibrium in polynomial time. The paper investigates how the efficiency of planning is affected by the choice of inputs, and provides some results as to optimal performance in terms of accuracy and range. Efficiency is here measured in terms of computational complexity and description length (in number of bits) of finite plans.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
