专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20140279818A1 GAME THEORY MODEL FOR PATROLLING AN AREA THAT ACCOUNTS FOR DYNAMIC UNCERTAINTY 审中-公开
标题翻译：用于计算动态不确定性帐户的游戏理论模型
公开(公告)号：US20140279818A1
公开(公告)日：2014-09-18
申请号：US14216449
申请日：2014-03-17
申请人： Albert Xin Jiang , Zhengyu Yin , Chao Zhang , Milind Tambe , Sarit Kraus
发明人： Albert Xin Jiang , Zhengyu Yin , Chao Zhang , Milind Tambe , Sarit Kraus
IPC分类号： G06N5/04
CPC分类号： G06N5/048 , G06N7/005 , G06Q10/047
摘要： Game theory models may be used for producing a strategy and schedule for patrolling an area like a rail transportation system. In some instances, the model may account for events that cause a patrol unit to deviate from a patrol schedule and route. For example, a patrol schedule may be generated for one or more patrol units using a Bayesian Stackelberg game theory model based on a map of the public transportation system, a schedule of the transports, a list of the one or more patrolling units, a probability distribution for the occurrence of the passenger not paying to ride the transports, a list of the one or more possible events that would delay the patrol units, and a probability distribution for the occurrence of the one or more possible events that would delay the patrolling units represented by a Markov-decision process.
摘要翻译：游戏理论模型可用于制定巡视像铁路运输系统这样的区域的战略和时间表。在某些情况下，该模型可能会导致巡视单位偏离巡逻进度和路线的事件。例如，可以使用基于公共交通系统的地图，运输时间表，一个或多个巡逻单元的列表，一个或多个巡逻单元的列表，使用贝叶斯Stackelberg游戏理论模型来生成针对一个或多个巡逻单元的巡逻时间表分配用于不支付乘坐运输工具的乘客的发生，将延迟巡逻单位的一个或多个可能的事件的列表，以及发生一个或多个可能的事件的概率分布，这些事件将延迟巡逻单位由马尔科夫决定过程代表。

2. 发明申请

US20130273514A1 Optimal Strategies in Security Games 审中-公开
标题翻译：安全游戏中的最佳策略
公开(公告)号：US20130273514A1
公开(公告)日：2013-10-17
申请号：US13838466
申请日：2013-03-15
申请人： Milind Tambe , Fernando Ordóñez , Rong Yang , Zhengyu Yin , Matthew Brown , Bo An , Christopher Kiekintveld
发明人： Milind Tambe , Fernando Ordóñez , Rong Yang , Zhengyu Yin , Matthew Brown , Bo An , Christopher Kiekintveld
IPC分类号： G09B5/00
CPC分类号： G09B5/00 , G06N7/005 , G07F17/32
摘要： Different solution methodologies for addressing problems or issues when directing security domain patrolling strategies according to attacker-defender Stackelberg security games. One type of solution provides for computing optimal strategy against quantal response in security games, and includes two algorithms, the GOSAQ and PASAQ algorithms. Another type of solution provides for a unified method for handling discrete and continuous uncertainty in Bayesian Stackelberg games, and introduces the HUNTER algorithm. Another solution type addresses multi-objective security games (MOSG), combining security games and multi-objective optimization. MOSGs have a set of Pareto optimal (non-dominated) solutions referred to herein as the Pareto frontier. The Pareto frontier can be generated by solving a sequence of constrained single-objective optimization problems (CSOP), where one objective is selected to be maximized while lower bounds are specified for the other objectives. Specific examples of applications to security domains are described.
摘要翻译：根据攻击者防御者Stackelberg安全游戏指导安全域巡逻策略时，解决问题或问题的不同解决方法。一种类型的解决方案提供了针对安全游戏中的量化响应的计算最优策略，并且包括两种算法：GOSAQ和PASAQ算法。另一种类型的解决方案提供了一种用于处理贝叶斯Stackelberg游戏中离散和连续不确定性的统一方法，并介绍了HUNTER算法。另一种解决方案类型涉及多目标安全游戏（MOSG），结合安全游戏和多目标优化。 MOSG具有一组帕累托最优（非主导）解决方案，这里称为帕累托前沿。帕累托边界可以通过解决一系列约束单目标优化问题（CSOP）来生成，其中一个目标被选择为最大化，而下限被指定用于其他目标。描述了对安全域的应用的具体示例。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式