Further Connections Between Contract-Scheduling and Ray-Searching Problems

Spyros Angelopoulos 1
1 RO - Recherche Opérationnelle
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : 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 a common approach.
Document type :
Conference papers
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01362953
Contributor : Spyros Angelopoulos <>
Submitted on : Friday, September 9, 2016 - 12:16:13 PM
Last modification on : Thursday, March 21, 2019 - 2:22:36 PM

Identifiers

  • HAL Id : hal-01362953, version 1

Citation

Spyros Angelopoulos. Further Connections Between Contract-Scheduling and Ray-Searching Problems. 24th International Joint Conference on Artificial Intelligence, Jul 2015, Buenos Aires, Argentina. pp.1516-1522. ⟨hal-01362953⟩

Share

Metrics

Record views

58