The Logarithmic Spiral Conjecture
Steven R. Finch
TL;DR
This paper discusses the potential effectiveness of using a logarithmic spiral strategy for searching for a line in a plane, proposing it as a promising approach despite lacking formal proof.
Contribution
It introduces the logarithmic spiral conjecture as a strategic approach for planar line search problems, highlighting its potential without formal validation.
Findings
Suggests logarithmic spiral as an optimal search strategy
Proposes the conjecture as a promising unproven method
Highlights need for formal proof of the strategy's effectiveness
Abstract
When searching for a planar line, if given no further information, one should adopt a logarithmic spiral strategy (although unproven).
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.
Taxonomy
TopicsOptimization and Search Problems · semigroups and automata theory · Optimization and Packing Problems