{"type":"ScholarlyArticle","title":"Further Connections Between Contract-Scheduling and Ray-Searching Problems","authors":[{"name":"Spyros Angelopoulos","slug":"spyros-angelopoulos","given":"Spyros","family":"Angelopoulos","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/2015/217","pdf":"https://ijcai.org/proceedings/2015/0217.pdf","markdown":"https://ijcai.org/proceedings/2015/217.md","bibtex":"https://ijcai.org/proceedings/2015/bibtex/217","volume":{"slug":"2015","title":"Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2015","url":"https://ijcai.org/proceedings/2015/","year":2015,"location":"Buenos Aires, Argentina","dates":"25–31 July 2015","editors":"Qiang Yang and Michael Wooldridge","isbn":"978-1-57735-738-4","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Planning","track":"Main Track","number":217,"pages":{"first":1516,"last":1521},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}