arXiv (All)
open access
Optimal any-angle path planning in static and dynamic environments
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
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Optimized Trajectory Planning for USVs Under Ocean Currents#168795
- Design of methods and tools for the optimal planning of maritime terminal processes#350915
- Joint trajectory design and radio resource management for UAV-aided vehicular networks#260107
- Stochastic Control and Free Boundary Problems for Sailboat Trajectory Optimization#1361933
- Autonomous path planning for on-orbit servicing vehicles#652631
Record · ID 1343631
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive