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 条
  • [21] Programming Robotic Agents with Action Descriptions
    Kazhoyan, Gayane
    Beetz, Michael
    2017 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS), 2017, : 103 - 108
  • [22] Programming of the Robotic Arm/Plotter System
    Djukanovic, Milena
    Grujicic, Rade
    Radunovic, Luka
    Boskovic, Vuk
    ADVANCED TECHNOLOGIES, SYSTEMS, AND APPLICATIONS III, VOL 2, 2019, 60 : 342 - 354
  • [23] Modelling uncertainty in agent programming
    Kwisthout, Johan
    Dastani, Mehdi
    DECLARATIVE AGENT LANGUAGES AND TECHNOLOGIES III, 2006, 3904 : 17 - 32
  • [24] Agent-oriented programming
    不详
    IEEE INTELLIGENT SYSTEMS, 2004, 19 (05): : 47 - 47
  • [25] Mobile agent programming in Ajanta
    Tripathi, AR
    Karnik, NM
    Vora, MK
    Ahmed, T
    Singh, RD
    19TH IEEE INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, PROCEEDINGS, 1999, : 190 - 197
  • [26] Agent Oriented Programming进展
    王一川
    石纯一
    计算机科学, 2002, (12) : 120 - 122+97
  • [27] AGENT-ORIENTED PROGRAMMING
    SHOHAM, Y
    ARTIFICIAL INTELLIGENCE, 1993, 60 (01) : 51 - 92
  • [28] Agent programming in the cognitive era
    Rafael H. Bordini
    Amal El Fallah Seghrouchni
    Koen Hindriks
    Brian Logan
    Alessandro Ricci
    Autonomous Agents and Multi-Agent Systems, 2020, 34
  • [29] Similar agent oriented programming
    Liang, Chao-Zu
    Fei, Min-Rui
    Shanghai Jiaotong Daxue Xuebao/Journal of Shanghai Jiaotong University, 2002, 36 (SUPPL.): : 18 - 20
  • [30] Architecture for agent programming languages
    Hindriks, K
    d'Inverno, M
    Luck, M
    ECAI 2000: 14TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2000, 54 : 363 - 367