The minimax path in a search for a circle in a plane

Brian Gluss

Naval Research Logistics Quarterly, 1961, vol. 8, issue 4, 357-360

Abstract: The problem has been considered by Isbell of determining the path that minimizes the maximum distance along the path to a line in the same plane whose distance from the starting point of the search is known, while its direction is unknown. We consider in this article the analogous problem for the search for a circle of known radius, of known distance from a starting point in its plane. It is further shown that Isbell's solution is a limiting case of the problem posed as the radius of the circle tends to infinity. The problem appears to be of some practical significance, since it is equivalent to that of searching for an object a given distance away which will be spotted when we get sufficiently close—that is, within a specific radius.

Date: 1961
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800080404

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:8:y:1961:i:4:p:357-360

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().