Pages that link to "Item:Q2706133"
From MaRDI portal
The following pages link to Approximation algorithms for curvature-constrained shortest paths (Q2706133):
Displaying 16 items.
- Approximating minimum bending energy path in a simple corridor (Q390148) (← links)
- Reachability by paths of bounded curvature in a convex polygon (Q425619) (← links)
- Monte Carlo algorithm for trajectory optimization based on Markovian readings (Q434185) (← links)
- A survey of motion planning algorithms from the perspective of autonomous UAV guidance (Q614803) (← links)
- An algorithm for computing a convex and simple path of bounded curvature in a simple polygon (Q699767) (← links)
- Shortest path planning for a tethered robot (Q904114) (← links)
- Curvature-constrained traveling salesman tours for aerial surveillance in scenarios with obstacles (Q1754047) (← links)
- A geometric approach to shortest bounded curvature paths (Q1784346) (← links)
- Approximation of convex curves with application to the bicriterial minimum cost flow problem (Q1825606) (← links)
- The cost of bounded curvature (Q1947977) (← links)
- Unconstrained and curvature-constrained shortest-path distances and their approximation (Q2421590) (← links)
- (Q2753947) (← links)
- Bounded-curvature shortest paths through a sequence of points using convex optimization (Q2840989) (← links)
- A Model for Optimal Human Navigation with Stochastic Effects (Q5117979) (← links)
- Modeling and Optimal Control of an Octopus Tentacle (Q5208648) (← links)
- What goes around comes around: covering tours and cycle covers with turn costs (Q6635695) (← links)
