Journal article · 2026 · Open access
Optimal any-angle path planning in static and dynamic environments
Artificial Intelligence, 361, 104642 · Published 8 October 2026 · DOI 10.1016/j.artint.2026.104642
In brief
“Optimal any-angle path planning in static and dynamic environments” is a 2026 journal article by Yiyuan Zou and Clark Borst, published in Artificial Intelligence. OpenAlex counts 0 citations as of 17 November 2026. It is open access under a CC BY licence: the full text is free to read at Artificial Intelligence.
- Citations
- 0
- References
- 43
- Authors
- 2
Abstract
Any-angle path planning extends traditional graph-based path planning by allowing movement between any pair of vertices, rather than being restricted by predefined edges. It can find straighter and shorter paths in continuous space with graphs, making it particularly suitable for navigation in open areas such as airspaces, warehouses, and oceans. Many any-angle path-planning algorithms have been proposed, but only a few can guarantee optimal solutions, especially in the presence of dynamic obstacles. To address this challenge, this article focuses on optimal any-angle path planning on grids and introduces two general techniques that accelerate computation while preserving optimality in both static and dynamic environments (where dynamic environments refer to those with moving obstacles in this article): 1) elliptical forward expansion, which leverages ellipse-based neighborhoods to restrict the search space, and 2) field of view, which replaces traditional line-of-sight methods to speed up visibility checks. To integrate these two techniques, inverted and forward scanning are introduced, denoted as “-i” and “-f” for the corresponding algorithmic variants. Inverted scanning establishes visual connections from open nodes, whereas forward scanning initiates scans from closed nodes. Building on the proposed techniques, Zeta* and Zeta*-SIPP are developed for static and dynamic environments respectively. Zeta*, when combined with forward scanning (i.e., Zeta*-f), is similar to the state-of-the-art algorithm Anya and attains comparable performance. However, unlike Anya, Zeta* can be readily extended to other settings, such as dynamic environments (e.g., Zeta*-SIPP). Zeta*-SIPP, which extends Zeta* by integrating Safe Interval Path Planning (SIPP), can find time-optimal any-angle paths in environments with dynamic obstacles. Benchmarking results show that Zeta*-SIPP achieves more than an order-of-magnitude speedup over the state-of-the-art optimal planner TO-AA-SIPP when using either scanning method (i.e., Zeta*-SIPP-i or Zeta*-SIPP-f). Overall, this research identifies the key requirements for achieving optimal any-angle path planning and introduces a unified approach suitable for different environments.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Zou, Y., & Borst, C. (2026). Optimal any-angle path planning in static and dynamic environments. Artificial Intelligence, 361, 104642. https://doi.org/10.1016/j.artint.2026.104642
MLA 9
Zou, Yiyuan, and Clark Borst. “Optimal any-angle path planning in static and dynamic environments.” Artificial Intelligence, vol. 361, 2026, p. 104642. https://doi.org/10.1016/j.artint.2026.104642.
Chicago
Zou, Yiyuan and Clark Borst. 2026. “Optimal any-angle path planning in static and dynamic environments.” Artificial Intelligence 361: 104642. https://doi.org/10.1016/j.artint.2026.104642.
Harvard
Zou, Y. and Borst, C. (2026) ‘Optimal any-angle path planning in static and dynamic environments’, Artificial Intelligence, 361, p. 104642. doi:10.1016/j.artint.2026.104642.
IEEE
Y. Zou and C. Borst, “Optimal any-angle path planning in static and dynamic environments,” Artificial Intelligence, vol. 361, p. 104642, 2026, doi: 10.1016/j.artint.2026.104642.
BibTeX
@article{zou2026optimal,
title = {{Optimal any-angle path planning in static and dynamic environments}},
author = {Zou, Yiyuan and Borst, Clark},
journal = {Artificial Intelligence},
year = {2026},
volume = {361},
pages = {104642},
doi = {10.1016/j.artint.2026.104642},
url = {https://doi.org/10.1016/j.artint.2026.104642}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Physical Sciences › Engineering › Control and Systems Engineering › Robotic Path Planning Algorithms
- optimal path planning
- dynamic obstacles
- Zeta
- grid-based path planning
- time-optimal paths
Work with this paper
Most-cited papers in Engineering
- A Closed‐form Equation for Predicting the Hydraulic Conductivity of Unsaturated SoilsMartinus Th. van Genuchten · Soil Science Society of America Journal · 1980 · 28,197 citations
- An improved technique for determining hardness and elastic modulus using load and displacement sensing indentation experimentsW. C. Oliver, George M. Pharr · Journal of materials research/Pratt's guide to venture capital sources · 1992 · 27,379 citations
- Digital communicationsOwen Bishop · Routledge eBooks · 2007 · 24,890 citations
- The empirical mode decomposition and the Hilbert spectrum for nonlinear and non-stationary time series analysisNorden Eh Huang, Zhengwei Shen, Steven R. Long and 6 more · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · 1998 · 24,008 citations
- Numerical Heat Transfer and Fluid FlowSuhas V. Patankar · CRC Press eBooks · 2018 · 23,491 citations
Questions about this paper
How do I cite this paper in APA style?
Zou, Y., & Borst, C. (2026). Optimal any-angle path planning in static and dynamic environments. Artificial Intelligence, 361, 104642. https://doi.org/10.1016/j.artint.2026.104642
How many times has this paper been cited?
0 times, according to OpenAlex on 17 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at Artificial Intelligence: sign in and open the PDF from this page.
Who wrote this paper?
Yiyuan Zou, Clark Borst.
What is the DOI of this paper?
10.1016/j.artint.2026.104642, permanently at https://doi.org/10.1016/j.artint.2026.104642. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 17 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.