TASK DECOMPOSITION AND PLAN GENERATION IN MULTIAGENT DOMAINS

被引:2
作者
KAMEL, M
SYED, A
机构
[1] University of Waterloo, Waterloo
关键词
D O I
10.1016/0736-5845(92)90020-7
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This paper discusses the problem of finding assignment of subtasks to agents which generate concurrent and synchronized plans to achieve the main task in minimum time. An approach is discussed wherein an initial plan is generated containing the basic inherent operations and their sequences, using a specific assignment of subtasks. The initial plan is then to estimate the multiagent plans and their completion time for each assignment of subtasks in order to identify the optimal assignment. A method used by this approach to generate the initial plan is also described. This approach is analyzed and compared with the exhaustive method of generating plans for all possible assignments of subtasks to agents.
引用
收藏
页码:71 / 83
页数:13
相关论文
共 14 条
[1]  
Chang, Expert Process Planning for Manufacturing, (1990)
[2]  
Maeda, Shinohara, Geometric reasoning and organized optimization for automated process planning, Proc. AAAI, pp. 105-110, (1988)
[3]  
Hoffman, Automated assembly in a CSG domain, IEEE Conf. on Robotics and Automation, pp. 210-215, (1989)
[4]  
Georgeff, The representation of events in multiagent domains, Proc. AAAI, pp. 70-75, (1986)
[5]  
Stuart, An implementation of a multiagent plan synchronizer, Proc. IJCAI, pp. 1031-1033, (1985)
[6]  
Stuart, Branching regular expressions and multiagent plans, Reasoning about Actions and Plans: Proceedings of the 1986 Workshop, pp. 161-187, (1987)
[7]  
Georgeff, Communication and interaction in multiagent planning, Proc. AAAI, pp. 115-119, (1983)
[8]  
Kamel, Syed, An object-oriented multiple agent planning system, Distributed Artificial Intelligence, 2, pp. 259-290, (1989)
[9]  
De Fazio, Whitney, Simplified generation of all mechanical assembly sequences, IEEE Journal on Robotics and Automation, 3 RA, pp. 640-658, (1987)
[10]  
Homem de Mello, Sanderson, Planning repair sequences using the AND/OR graph representation of assembly plans, IEEE Int. Conf. on Robotics and Automation, pp. 1861-1862, (1988)