Robotic Agent Programming in TeleoR

被引:0
|
作者
Clark, Keith L. [1 ]
Robinson, Peter J. [1 ]
机构
[1] Univ Queensland, Dept Informat Syst & Elect Engn, Brisbane, Qld 4072, Australia
来源
2015 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA) | 2015年
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We present an extension, TeleoR, of Nilsson's Teleo-Reactive (TR) rule based robotic agent programming language[22]. For both languages programs essentially comprise sequences of Guard similar to>Action rules grouped into parameterised procedures. The Guard is a deductive query to a set of rapidly changing percept facts generated from the most recent sensor values. For TR, the Action is either a tuple of primitive robotic actions, to be executed in parallel, or a single call to a program procedure, which can be a recursive call, or a BeliefStoreupdate. TeleoR has extra forms of action. The procedures encode goal (teleo) directed reactive task and sub-task behaviours of robotic agents. TR/TeleoR programs are robust and opportunity grabbing, and so are well suited to human/robot or robot/robot co-operative tasks requiring flexible behaviour. TeleoR, extends TR in having: types and higher order features; extra forms of action rules that temporarily inhibit other rules in the same procedure; repeatable sequences of time capped actions; wait/repeat re-start of failed actions; belief store update and message send actions linked with any rule; a flexibly typed higher order LP/FP programming language for BeliefStore inference; support for the high level programming of multi-tasking agents that interleave the use of subsets of a set of independent robotic resources. All the extensions were driven by application needs. The use of QuLog enables us to guarantee by compiler analysis that all guarded rule actions will be fully instantiated and correctly typed when sent to a robot, perhaps via a ROS interface. The focus of this paper is on the extensions for single task communicating robotic agents. Our goal was to extend TR without losing the elegance and simplicity of Nilsson's language. We also wanted to be able to give the extended language a formally defined operational semantics, building upon one we had given for TR. The extensions, their semantics, and their implementation were developed in parallel. A methodology we can recommend.
引用
收藏
页码:5040 / 5047
页数:8
相关论文
共 50 条
  • [31] Declarative programming for agent applications
    Lloyd, J. W.
    Ng, K. S.
    AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS, 2011, 23 (02) : 224 - 272
  • [32] Subgoal semantics in agent programming
    van Riemsdijk, MB
    Dastani, M
    Meyer, JJC
    PROGRESS IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2005, 3808 : 548 - 559
  • [33] A Practical Agent Programming Language
    Dastani, Mehdi
    Meyer, John-Jules Ch.
    PROGRAMMING MULTI-AGENT SYSTEMS, 2008, 4908 : 107 - 123
  • [34] Requirements Modeling with Agent Programming
    Dasgupta, Aniruddha
    Krishna, Aneesh
    Ghose, Aditya K.
    INFORMATION SYSTEMS DEVELOPMENT: TOWARDS A SERVICE PROVISION SOCIETY, 2009, : 675 - 683
  • [35] Goal Types in Agent Programming
    Dastani, Mehdi
    van Riemsdijk, M. Birna
    Meyer, John-Jules Ch.
    ECAI 2006, PROCEEDINGS, 2006, 141 : 220 - +
  • [36] Programming an expressive autonomous agent
    Jain, Shikha
    Asawa, Krishna
    EXPERT SYSTEMS WITH APPLICATIONS, 2016, 43 : 131 - 141
  • [37] Intensional programming for agent communication
    Alagar, VS
    Paquet, J
    Wan, KY
    DECLARATIVE AGENT LANGUAGES AND TECHNOLOGIES II, 2005, 3476 : 239 - 255
  • [38] Declarative programming for agent applications
    J. W. Lloyd
    K. S. Ng
    Autonomous Agents and Multi-Agent Systems, 2011, 23 : 224 - 272
  • [39] Mobile agent programming in Ajanta
    Tripathi, Anand R.
    Karnik, Neeran M.
    Vora, Manish K.
    Ahmed, Tanvir
    Singh, Ram D.
    Proceedings - International Conference on Distributed Computing Systems, 1999, : 190 - 197
  • [40] A web-programming agent
    Imam, IF
    Proceedings of the 46th IEEE International Midwest Symposium on Circuits & Systems, Vols 1-3, 2003, : 994 - 996