SOLVING MULTI-AGENT FLEXIBLE PLANNING PROBLEMS BASED ON SOFT CONSTRAINTS

摘要：

Multi-agent planning is an extension of classical Artificial Intelligence planning. Usually multiple agents can act together to achieve planning goal. But classical multi-agent methods require that the constraints are either totally satisfied or totally violated, which is too rigorous to formulate and to solve most of the real problems. In this paper, we define a multi-agent flexible planning problem which supports soft constraints, and then we present a new technique called distributed flexible constraint satisfaction (GST1), which is the combination of flexible CSP and distributed CSP, to deal with this planning problem. For a given multi-agent flexible planning problem, multiple agents can plan cooperatively with a satisfaction degree when solving the problem is difficult or infeasible, and then we can get a plan with a tradeoff between plan quality and length.

关键词： Multi-agent planning Soft constraints Distributed flezible CSP Multi-agent flezible planning

作者: WEN-XIANG GU JUN-SHU WANG MING-HAO YIN JIN-LI LI

作者单位: Department of Computer Science, School of Computer, Northeast Normal University, Changchun 130117, China

会议类型: 国际会议

会议名称: 2008 International Conference on Machine Learning and Cybernetics(2008机器学习与控制论国际会议)

会议地点: 昆明

会议语种:英文

页码: 2373-2378

在线出版日期: 2008-07-12（万方平台首次上网日期，不代表论文的发表时间）