返回
Workflow Nets for Multiagent Cooperation
DOI:10.1109/TASE.2011.2163510.png)
摘要
En 中文
We present a formal framework for robotic cooperation in which we use an extension to Petri nets, known as workflow nets, to establish a protocol among mobile agents based on the task coverage they maintain. Our choice is motivated by the fact that Petri nets handle concurrency and that goal reachability, or soundness, can be theoretically established. In particular, we define a mathematical cooperation operator which turns cooperation problems expressed as workflow nets into algebraic representations. While we do not address the problem of efficiency, we formally demonstrate that this framework guarantees soundness, or goal reachability, using workflow nets. Note to Practitioners-Cooperative behavior is a key issue in process automation as it enhances the execution time of a process. This contribution proposes a framework which guarantees the completion of a plan given that it is achievable within the set capabilities exhibited by the cooperative agents. The proposed algorithm turns a cooperative plan expressed with logic predicates and operators into a workflow net that is guaranteed to complete. If the cooperative plan is static during its execution, then it is achieved at a minimal cost (whether that be time, or any other measures of efficiency). Otherwise, if the cooperative agents possess sufficient perceptual or communication capabilities to assess (partially or fully) the state of the cooperation, then they are free to replan at will. This framework is applicable to any automation scenario that can be expressed in the form of predicate logic.
Keyword:
Linear algebra
linear programming
multirobot systems
Petri nets
robotics and automation
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.4
论文数:
5.2K
被引数:
1.6W
机构
引用论文
A discovery biotransformation strategy: combining in silico tools with high-resolution mass spectrometry and software-assisted data analysis for high-throughput metabolism
Xenobiotica
IF0

