An introduction to graph-rewriting framework for high-level robotic task planning

被引:0
作者
Sarkar, N [1 ]
Sarkar, MS
机构
[1] Univ Hawaii Manoa, Dept Mech Engn, Honolulu, HI 96822 USA
[2] Queens Univ, Dept Comp & Informat Sci, Kingston, ON K7L 3N6, Canada
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper introduces graph-rewriting methodology for robotic task planning. An approach to represent a high-level task plan in the form of a graph and modify it to accommodate various planning strategies is proposed. Explicitly delineated graph-rewrite rules and their ordered applications are used to reflect the change in plans by changing the graph topology. A framework for modeling complex manipulation tasks as interconnection of simpler subtasks and events connecting them is presented. Using a simple example, it is demonstrated how various: plans: can dynamically evolve as: a function of events. The advantages of graph-rewriting methodology in task planning, importance of developing a reusable graph-rewrite rule fibrary for manipulation tasks, and its connection to low-level control are also outlined in this introductory paper.
引用
收藏
页码:129 / 138
页数:10
相关论文
共 34 条
[1]  
[Anonymous], HUMANKIND EMERGING
[2]  
BLOSTEIN D, 95373 QUEENS U DEP C
[3]  
BROCK D, 1993, THESIS MIT
[4]  
BROCKETT R, 1993, PERSPECTIVE CONTROL
[5]  
CAO TH, 1993, PROCEEDINGS : IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS 1-3, P317, DOI 10.1109/ROBOT.1993.292001
[6]  
CLAUS V, 1979, SPRINGER VERLAG LECT, V73
[7]  
DARIO P, 1992, P IEEE RSJ INT C INT, P1896
[8]   FORMAL MANIPULATION OF FORRESTER DIAGRAMS BY GRAPH-GRAMMARS [J].
DOLADO, JJ ;
TORREALDEA, FJ .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1988, 18 (06) :981-996
[9]  
Engels G., 1992, ACM Transactions on Software Engineering and Methodology, V1, P135, DOI 10.1145/128894.128895
[10]  
Fahmy H., 1993, Machine Vision and Applications, V6, P83, DOI 10.1007/BF01211933