Direct multiple shooting method for solving approximate shortest path problems (Q1936137)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Direct multiple shooting method for solving approximate shortest path problems |
scientific article; zbMATH DE number 6138047
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Direct multiple shooting method for solving approximate shortest path problems |
scientific article; zbMATH DE number 6138047 |
Statements
Direct multiple shooting method for solving approximate shortest path problems (English)
0 references
21 February 2013
0 references
The authors use the idea of the direct multiple shooting method to introduce an algorithm for solving some approximate shortest path problems in motion planning. The algorithm is based on a direct multiple shooting discretization that includes a collinear condition, multiple shooting structure, and approximation conditions.
0 references
approximation algorithm
0 references
direct multiple shooting method
0 references
memory usage
0 references
motion planning
0 references
running time
0 references
shortest path
0 references
