Multiple shooting approach for computing approximately shortest paths on convex polytopes (Q507990)

From MaRDI portal
Revision as of 01:17, 4 April 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q57659426, #quickstatements; #temporary_batch_1712186161777)
scientific article
Language Label Description Also known as
English
Multiple shooting approach for computing approximately shortest paths on convex polytopes
scientific article

    Statements

    Multiple shooting approach for computing approximately shortest paths on convex polytopes (English)
    0 references
    0 references
    0 references
    0 references
    9 February 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    approximate shortest path
    0 references
    convex polytope
    0 references
    Euclidean shortest path
    0 references
    multiple shooting
    0 references
    boundary value problems
    0 references
    iterative algorithm
    0 references
    0 references
    0 references