期刊文献+

基于有穷自动机的自然语言状态转换 被引量:1

State transition method of natural language based on finite automata machine
在线阅读 下载PDF
导出
摘要 针对Robocup自主机器人比赛中,机器人进攻和防守状态、动作转换延迟问题,采用一种基于有穷自动机模型的自然语言状态转换方法,把机器人、环境等自然语言信息抽象成形式化的符号和状态,并转化为有穷自动机输入符号.通过设定状态转移函数、字母表规则、无差别地完成各种状态转换过程.研究结果表明:该方法能有效地完成自然语言状态下的机器人状态、动作间的转换,具有较好的实时性和可靠性. This paper proposes an action transition approach for natural language based on finite automata model to overcome the delayed action transition in offense and defense transition in Robocup for autonomous mobile robots game.In this model,the natural language information such as robots and environment is transformed into the abstract symbols,states and input symbols of finite automata.The state transition is completed by setting state transition functions,alphabet rules without any differentiation.The experimental study proves that this approach is able to efficiently complete the state and action transitions under natural language state.It is highly reliable and in real-time.
出处 《辽宁工程技术大学学报(自然科学版)》 CAS 北大核心 2012年第6期885-888,共4页 Journal of Liaoning Technical University (Natural Science)
基金 国家自然科学基金资助项目(60874002)
关键词 自然语言 有穷自动机 状态转移函数 字母表规则 前向视觉 全向视觉 移动机器人 机器人世界杯 natural language processing finite automata machine states transition functions alphabet rules forward vision omni-vision mobile robots Robocup
  • 相关文献

参考文献2

二级参考文献11

  • 1邱道文.Automata theory based on complete residuated lattice-valued logic[J].Science in China(Series F),2001,44(6):419-429. 被引量:14
  • 2田启家,沈恩绍,史忠植.(P^(1,1))和正则语言[J].计算机学报,1996,19(11):848-853. 被引量:1
  • 3HOPCROFT J, MOTWANI R, ULLMAN J D. Introduction to automata theory, language, and eomputation[M]. 3rd Edition. New York :Addison-Wesley, 2006.
  • 4CARROLL J, LONG D. Theory of finite automata with an introduction to formal languages [M]. New Jersey:Prentice-Hall, 1989.
  • 5NIPKOW T, PAULSON L C, WENZEL M. Isabelle/HOL: a proof assistant for higher-order logic [M]. New York :Springer-Verlag, 2002.
  • 6WANGJS, ZHANG X Y, ZHANG Y S, et al. A Probabilistic model for parametric fairness in isabelle/ HOL [C]. University of Kaiserslautern : TPHOLs 2007 (Emerging Trends), 2007.
  • 7HOLZL J. Proving inequalities over reals with com- putation in Isabelle/HOL[C]. Munid: In Proceedings of the ACM SIGSAM 2009 International Workshop on Programming Languages for Mechanized Mathematics Systems, 2009.
  • 8BLECH J O, GLESNER S, LEITNER J, et al. A comparison between two formal correctness proofs in Isabelle/HOL [C]. Amsterdam: Proc COCV Workshop, ETAPS 2005, ENTCS, 2005.
  • 9FRIEDL J. Mastering regular expressions [M]. Beijing:O'Reilly Media, 2006.
  • 10KLEENE S C. Representation of events in nerve nets and finite automata[M]. Princeton : Automata Studies, 1956.

共引文献7

同被引文献5

  • 1Jensfelt P,Kristensen S.Active global localization for a mobile robot using multiple hypothesis trackingIEEE Transactions on Robotics and Automation,2001.
  • 2C. Sagues,J.J. Guerrero.Visual Correction for Mobile Robot HomingRobotics and Autonomous Systems,2005.
  • 3Fidan B,Dasgupta S,Anderson B D O.Guaranteeing practical convergence inalgorithms for sensor and source localizationIEEE Transactions on SignalProcessing,2008.
  • 4Stephen Se,David G Lowe,James J,et al.Vision-based global localization andmapping for mobile robotsIEEE Transactions on Robotics,2005.
  • 5伦淑娴,薛洪波,卢东升.改进PSO权值算法在流水生产调度中的应用[J].辽宁工程技术大学学报(自然科学版),2011,30(2):308-311. 被引量:8

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部