An algorithm for shortest-path motion in three dimensions
From MaRDI portal
Publication:1082820
DOI10.1016/0020-0190(85)90029-8zbMath0603.68070OpenAlexW2024693023MaRDI QIDQ1082820
Publication date: 1985
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(85)90029-8
Related Items (28)
Shortest paths in the plane with convex polygonal obstacles ⋮ An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces ⋮ Flying over a polyhedral terrain ⋮ Optimal piecewise linear motion of an object among obstacles ⋮ Navigating Weighted Regions with Scattered Skinny Tetrahedra ⋮ An approximation algorithm for computing shortest paths in weighted 3-d domains ⋮ An algorithmic approach to some problems in terrain navigation ⋮ Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon ⋮ A survey of motion planning and related geometric algorithms ⋮ Practical methods for approximating shortest paths on a convex polytope in \(\mathbb{R}^3\) ⋮ A Near-Optimal Algorithm for Shortest Paths Among Curved Obstacles in the Plane ⋮ A Model for Optimal Human Navigation with Stochastic Effects ⋮ ENERGY-AWARE STAGE ILLUMINATION ⋮ On maximum flows in polyhedral domains ⋮ Visibility graphs and obstacle-avoiding shortest paths ⋮ \(L_ 1\) shortest paths among polygonal obstacles in the plane ⋮ Towards exact geometric computation ⋮ Search for shortest path around semialgebraic obstacles in the plane ⋮ Multiple shooting approach for computing approximately shortest paths on convex polytopes ⋮ GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST ⋮ The application of \(\psi\)-transform for determining a near-optimal path in the presence of polyhedral obstacles ⋮ Continuous alternation: the complexity of pursuit in continuous domains ⋮ Approximation algorithms for shortest descending paths in terrains ⋮ Time-minimal paths amidst moving obstacles in three dimensions ⋮ EXACT AND APPROXIMATION ALGORITHMS FOR FINDING AN OPTIMAL BRIDGE CONNECTING TWO SIMPLE POLYGONS ⋮ The shortest path AMID 3-D polyhedral obstacles ⋮ Shortest paths without a map ⋮ Approximate kinodynamic planning using \(L_ 2\)-norm dynamic bounds
Cites Work
This page was built for publication: An algorithm for shortest-path motion in three dimensions
