Feedback can reduce the specification complexity of motor programs

被引:37
作者
Egerstedt, MB [1 ]
Brockett, RW
机构
[1] Georgia Inst Technol, Atlanta, GA 30332 USA
[2] Harvard Univ, Cambridge, MA 02138 USA
关键词
automata; complexity theory; feedback; motion control;
D O I
10.1109/TAC.2002.808466
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we show that when it is possible to use feedback in the specification of "motor programs," the length of the descriptions of the instruction sequences for carrying out a given task can be reduced by a factor that reflects the richness of the available feedback signals. The model on which this work is based is that of a finite automaton, modified in such away that instruction processing is akin to the way in which difference or differential equations "process" piecewise constant inputs. In terms of such "free-running" automata, we show that when feedback is available the length of the shortest description can be reduced by a factor depending on the ratio of the size of the entire state space to the size of the set of states for which feedback is locally effective.
引用
收藏
页码:213 / 223
页数:11
相关论文
共 14 条
  • [1] Arbib M. A., 1968, ALGEBRAIC THEORY MAC
  • [2] BLACK HS, 1934, BELL SYST TECH J, P1
  • [3] Brockett R., 1997, P 36 IEEE C DEC CONT, P2628
  • [4] Brockett R. W., 1988, Proceedings of the 1988 IEEE International Conference on Robotics and Automation (Cat. No.88CH2555-1), P534, DOI 10.1109/ROBOT.1988.12107
  • [5] Brockett R. W., 1993, PERSPECTIVES CONTROL, P29
  • [6] Buckley F., 1990, Distance in Graphs
  • [7] Cover T. M., 2005, ELEM INF THEORY, DOI 10.1002/047174882X
  • [8] FLEMING W, 1987, IMA VOLUMES MATH ITS, V10
  • [9] GINZBURG A, 1968, ACM MONOGRAPH SERIES
  • [10] Hopcroft JE., 2000, INTRO AUTOMATA THEOR