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

契约排序问题与光线搜索问题的进一步联系

Further Connections Between Contract-Scheduling and Ray-Searching Problems

Sorbonne Universités, UPMC Univ Paris 06(索邦大学,巴黎第六大学(UPMC));CNRS(法国国家科学研究中心)

Spyros Angelopoulos

摘要:

本文讨论了两类不同的,但相互关联的优化问题。第一类问题涉及的机器人,必须找到一个隐藏的目标,在一个环境中,由一组并发的射线。第二类涉及到的中断算法的设计,通过一个时间表的合同算法。我们研究了这些家庭的问题,如搜索和调度概率的考虑,冗余和容错问题,随机策略,性能和抢占之间的权衡的几个变种。对于许多这些问题,我们提出了第一个已知的结果,适用于多射线和多问题域。我们的目标是证明几个动机良好的设置可以使用相同的基本方法来解决。

英文摘要:

This paper addresses two classes of different, yet interrelated optimization problems. The first class of problems involves a robot that must locate a hidden target in an environment that consists of a set of concurrent rays. The second class pertains to the design of interruptible algorithms by means of a schedule of contract algorithms. We study several variants of these families of problems, such as searching and scheduling with probabilistic considerations, redundancy and fault-tolerance issues, randomized strategies, and trade-offs between performance and preemptions. For many of these problems we present the first known results that apply to multi-ray and multi-problem domains. Our objective is to demonstrate that several well-motivated settings can be addressed using the same underlying approach.

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

↑