Multiple shooting approach for computing approximately shortest paths on convex polytopes (Q507990): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57659426, #quickstatements; #temporary_batch_1712186161777
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Discrete Geodesic Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating shortest paths on a convex polytope in three dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing approximate shortest paths on convex polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths on polyhedral surfaces and terrains / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for shortest-path motion in three dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Shortest Paths in Polyhedral Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5559978 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On shooting methods for boundary value problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3857636 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Block-structured quadratic programming for the direct multiple shooting method for optimal control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Direct multiple shooting method for solving approximate shortest path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3028682 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metric spaces, convexity and nonpositive curvature / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Shortest Descending Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudo-geodesics on three-dimensional surfaces and pseudo-geodesic meshes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4251963 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiently determining a locally exact shortest path on polyhedral surfaces / rank
 
Normal rank

Latest revision as of 10:39, 13 July 2024

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