多目标搜索在欧几里德空间与射线射击（完整版）
Multi-Target Search in Euclidean Space with Ray Shooting (Full Version)
摘要：
欧几里德最短路径问题（ESPP）是一个研究得很好的问题，有许多实际应用。最近，一种新的有效的在线方法，RayScan，已经开发出来，基于射线拍摄和多边形扫描。在本文中，我们将展示如何通过仔细推理多边形扫描来改进RayScan。我们还研究了RayScan如何应用于单源多目标场景，其中扫描期间的逻辑用于减少所需的射线拍摄数量。这种改进也有助于单一目标的情况。我们将改进的RayScan+与最先进的ESPP算法进行了比较，说明了它更好的情况。
英文摘要：
The Euclidean shortest path problem (ESPP) is a well studied problem with many practical applications. Recently a new efficient online approach to this problem, RayScan, has been developed, based on ray shooting and polygon scanning. In this paper we show how we can improve RayScan by carefully reasoning about polygon scans. We also look into how RayScan could be applied in the single-source multi-target scenario, where logic during scanning is used to reduce the number of rays shots required. This improvement also helps in the single target case. We compare the improved RayScan+ against the state-of-the-art ESPP algorithm, illustrating the situations where it is better.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
