图 书 馆
求解多智能体简单时态问题的算法Algorithms for Solving the Multiagent Simple Temporal Problem |
|
| 课程网址: | http://videolectures.net/icaps2010_boerkoel_asmstp/ |
| 主讲教师: | Boerkoel Jr James C |
| 开课单位: | 密歇根大学 |
| 开课时间: | 2010-11-15 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | The Simple Temporal Problem (STP) is a popular representation for solving centralized scheduling and planning problems. When scheduling agents are associated with different users who need to coordinate some of their activities, however, considerations such as privacy and scalability suggest solving the joint STP in a more distributed manner. Building on recent advances in STP algorithms that exploit loosely-coupled problem structure, this paper develops and evaluates algorithms for solving the multiagent STP. We define a partitioning of the multiagent STP with provable privacy guarantees, and show that our algorithms can exploit this partitioning while still finding the tightest consistent bounds on timepoints that must be coordinated across agents. We also demonstrate empirically that our algorithms can exploit concurrent computation, leading to solution time speed-ups over state-of-the-art centralized approaches, and enabling scalability to problems involving larger numbers of loosely-coupled agents. |
| 关 键 词: | 时间问题; 可扩展性问题; 松耦合剂 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2021-02-03：nkq |
| 阅读次数: | 35 |