Further Connections Between Contract-Scheduling and Ray-Searching Problems - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

Further Connections Between Contract-Scheduling and Ray-Searching Problems

Spyros Angelopoulos

Résumé

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.
Fichier non déposé

Dates et versions

hal-01362953 , version 1 (09-09-2016)

Identifiants

  • HAL Id : hal-01362953 , version 1

Citer

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⟩
35 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More