Negative Instance for the Edge Patrolling Beacon Problem
Zachary Abel, Hugo A. Akitaya, Erik D. Demaine, Martin L. Demaine,, Adam Hesterberg, Matias Korman, Jason S. Ku, Jayson Lynch

TL;DR
This paper disproves a previous conjecture by constructing specific polygons where an infinite-strength magnetic beacon cannot capture a moving iron ball, challenging assumptions in the edge patrolling beacon problem.
Contribution
It provides the first counterexamples showing that a ball-capturing beacon strategy does not always exist, refuting prior conjectures.
Findings
Counterexamples in orthogonal polygons
Counterexamples in general-position polygons
Disproof of the conjecture that such strategies always exist
Abstract
Can an infinite-strength magnetic beacon always ``catch'' an iron ball, when the beacon is a point required to be remain nonstrictly outside a polygon, and the ball is a point always moving instantaneously and maximally toward the beacon subject to staying nonstrictly within the same polygon? Kouhestani and Rappaport [JCDCG 2017] gave an algorithm for determining whether a ball-capturing beacon strategy exists, while conjecturing that such a strategy always exists. We disprove this conjecture by constructing orthogonal and general-position polygons in which the ball and the beacon can never be united.
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.
