Further Connections Between Contract-Scheduling and Ray-Searching Problems
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence. Main Track. Pages 1516-1521.
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.
@inproceedings{ijcai2015p217,
title = {Further Connections Between Contract-Scheduling and Ray-Searching Problems},
author = {Angelopoulos, Spyros},
booktitle = {Proceedings of the Twenty-Fourth International Joint Conference on
Artificial Intelligence, {IJCAI-15}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Qiang Yang and Michael Wooldridge},
pages = {1516--1521},
year = {2015},
month = {7},
note = {Main Track},
url = {https://ijcai.org/proceedings/2015/217},
}
TY - CPAPER TI - Further Connections Between Contract-Scheduling and Ray-Searching Problems AU - Angelopoulos, Spyros T2 - Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI-15 PB - International Joint Conferences on Artificial Intelligence PY - 2015 SP - 1516 EP - 1521 UR - https://ijcai.org/proceedings/2015/217 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
