Reachability by paths of bounded curvature in a convex polygon (Q425619): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2213465260 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1008.4244 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Curvature-Constrained Shortest Paths in a Convex Polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234081 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Curvature-Constrained Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for computing the Voronoi diagram of a convex polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Complete Approximation Algorithm for Shortest Bounded-Curvature Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths of bounded curvature in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for computing a convex and simple path of bounded curvature in a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial-Time Algorithm for Computing Shortest Paths of Bounded Curvature Amidst Moderate Obstacles / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for kinodynamic planning in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the medial axis of a simple polygon in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kinodynamic motion planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning constrained motion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing curves without Delaunay computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3136887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3259413 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal paths for a car that goes both forwards and backwards / rank
 
Normal rank
Property / cites work
 
Property / cites work: Motion planning in the presence of moving obstacles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4499928 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traveling Salesperson Problems for the Dubins Vehicle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385513 / rank
 
Normal rank

Latest revision as of 07:20, 5 July 2024

scientific article
Language Label Description Also known as
English
Reachability by paths of bounded curvature in a convex polygon
scientific article

    Statements

    Reachability by paths of bounded curvature in a convex polygon (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 June 2012
    0 references
    motion planning
    0 references
    bounded curvature
    0 references
    convex polygon
    0 references

    Identifiers