arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv cs/9910016cs.AI
收藏

Probabilistic代理程序

Probabilistic Agent Programs

Juergen Dix, Mirco Nanni, VS Subrahmanian

摘要:

代理是小程序,它们根据环境或状态的变化自主采取行动。在过去的几年里,有越来越多的努力来构建可以与其他代理交互和/或协作的代理。在这些努力中,Eiter,Subrahmanian和Pick(AIJ,108(1-2),第179-255页)已经展示了如何在遗留代码之上构建代理。然而,他们的框架假设代理状态是完全确定的,并且代理状态中没有不确定性。因此,他们的框架允许代理开发人员指定当代理100%确定世界状态中的真/假时,他的代理将如何反应。在本文中,我们提出了一个\emph{probabilistic agent program}的概念,并显示如何,给定一个任意程序编写的任何命令式语言,我们可以建立一个声明性的“概率”代理程序的顶部,它支持决策的存在不确定性。我们提供了两种替代语义的概率代理程序。我们表明,第二种语义,虽然更认识吸引力,是更复杂的计算。我们提供了完善的算法来计算\emph{positive}代理程序的语义。

英文摘要:

Agents are small programs that autonomously take actions based on changes in their environment or ``state.'' Over the last few years, there have been an increasing number of efforts to build agents that can interact and/or collaborate with other agents. In one of these efforts, Eiter, Subrahmanian amd Pick (AIJ, 108(1-2), pages 179-255) have shown how agents may be built on top of legacy code. However, their framework assumes that agent states are completely determined, and there is no uncertainty in an agent's state. Thus, their framework allows an agent developer to specify how his agents will react when the agent is 100% sure about what is true/false in the world state. In this paper, we propose the concept of a \emph{probabilistic agent program} and show how, given an arbitrary program written in any imperative language, we may build a declarative ``probabilistic'' agent program on top of it which supports decision making in the presence of uncertainty. We provide two alternative semantics for probabilistic agent programs. We show that the second semantics, though more epistemically appealing, is more complex to compute. We provide sound and complete algorithms to compute the semantics of \emph{positive} agent programs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑