REPRESENTING AND ANALYZING ACTION PLANS AS NETWORKS OF CONCURRENT PROCESSES

被引:19
作者
LYONS, DM
机构
[1] Philips Laboratries, PhilipS Electronics, North American Corporation, Briarcliff Manor, NY 10510
来源
IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION | 1993年 / 9卷 / 03期
关键词
D O I
10.1109/70.240194
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Constructing action plans for a robot operating in an environment containing uncertain and dynamic events is a difficult task. Indeed, the inadequacy of the standard approaches for representing and producing plans for such environments has led some researchers to abandon explicit plan representation and to directly program behavior instead. Ultimately, no matter which approach is taken, producing appropriate behavior in such environments requires writing robot programs or action plans that include conditionals, loops, requests for sensory data, concurrency, etc. Existing approachs are simply not adequate to the task of modeling and analyzing such plans. Nonetheless, it is necessary that such plans be open to formal analysis: the complexity of control necessary to operate in uncertain and dynamic environments demands that more than human intuition be used to verify, or preferably autogenerate, such plans. The problem of constructing a plan representation that can deal with the complexity of representing and analyzing robot behavior in uncertain and dynamic environments is addressed. The key contributions are as follows. A concurrent-process based representation is developed which represents both the plan (or controller) and the uncertain and dynamic environment in which the plan operates. A methodology is outlined for analyzing the behavior of this interacting system of plan and world. This methodology is illustrated with a mixed-batch example from the domain of robotic kitting. To balance the theoretical work, a description of the implemented robot kitting cell is presented.
引用
收藏
页码:241 / 256
页数:16
相关论文
共 39 条
[1]  
Arbib M. A., 1981, BASIS THEORETICAL CO
[2]   A ROBUST LAYERED CONTROL-SYSTEM FOR A MOBILE ROBOT [J].
BROOKS, RA .
IEEE JOURNAL OF ROBOTICS AND AUTOMATION, 1986, 2 (01) :14-23
[3]  
CHAPMAN D, 1986, WORKSHOP PLANNING RE, P251
[4]  
De Mello L. S. H., 1990, IEEE T ROBOTICS AUTO, V6
[5]  
DONALD B, 1988, ARTIF INTELL, V37, P1
[6]   A GEOMETRIC APPROACH TO ERROR-DETECTION AND RECOVERY FOR ROBOT MOTION PLANNING WITH UNCERTAINTY [J].
DONALD, BR .
ARTIFICIAL INTELLIGENCE, 1988, 37 (1-3) :223-271
[7]  
DRUMMOND M, 1986, WORKSHOP PLANNING RE, P267
[8]   GEOMETRIC UNCERTAINTIES IN POLYHEDRAL OBJECT RECOGNITION [J].
ELLIS, RE .
IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 1991, 7 (03) :361-371
[9]   STRIPS - NEW APPROACH TO APPLICATION OF THEOREM PROVING TO PROBLEM SOLVING [J].
FIKES, RE ;
NILSSON, NJ .
ARTIFICIAL INTELLIGENCE, 1971, 2 (3-4) :189-208
[10]  
FIRBY R, 1989, YALEUCSDRR672 YAL U