An Autonomous Adaptive Scheduling Agent for Period Searching
Eric S. Saunders, Tim Naylor, Alasdair Allan

TL;DR
This paper presents an autonomous software agent that adaptively schedules observations of periodic phenomena using robotic telescopes, optimizing data collection in uncertain environments.
Contribution
It introduces a novel adaptive scheduling algorithm that combines geometric sampling with proactive strategies for robotic telescope networks.
Findings
Effective coverage of period ranges achieved
Proactive scheduling improves data quality
Algorithm adapts to changing environments
Abstract
We describe the design and implementation of an autonomous adaptive software agent that addresses the practical problem of observing undersampled, periodic, time-varying phenomena using a network of HTN-compliant robotic telescopes. The algorithm governing the behaviour of the agent uses an optimal geometric sampling technique to cover the period range of interest, but additionally implements proactive behaviour that maximises the optimality of the dataset in the face of an uncertain and changing operating environment.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
