Pages that link to "Item:Q2883544"
From MaRDI portal
The following pages link to Discrete optimization methods to determine trajectories for Dubins' vehicles (Q2883544):
Displaying 13 items.
- A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem (Q1026674) (← links)
- Bi-objective data gathering path planning for vehicles with bounded curvature (Q1652333) (← links)
- Curvature-constrained traveling salesman tours for aerial surveillance in scenarios with obstacles (Q1754047) (← links)
- Geometric and LP-based heuristics for angular travelling salesman problems in the plane (Q2003422) (← links)
- Shortest Dubins paths through three points (Q2280708) (← links)
- Motion planning algorithms for the Dubins Travelling Salesperson Problem (Q2409439) (← links)
- Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics (Q2636833) (← links)
- Discrete approximations to optimal trajectories using direct transcription and nonlinear programming (Q4014591) (← links)
- Trajectory optimization based on differential inclusion (Revised) (Q4307958) (← links)
- Trajectory generation for the N-trailer problem using Goursat normal form (Q4841484) (← links)
- Hybrid encoding based differential evolution algorithms for Dubins traveling salesman problem with neighborhood (Q5171587) (← links)
- (Q6124757) (← links)
- A tabu search with geometry‐based sparsification methods for angular traveling salesman problems (Q6180041) (← links)