Polynomial-time algorithm for computing a shortest path of bounded curvature amidst moderate obstacles

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 1996, Pages 242-251

  Boissonnat, Jean Daniel ^a   Lazard, Sylvain ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL GEOMETRY; COMPUTATIONAL METHODS; CONSTRAINT THEORY; CONTROL THEORY; MARKOV PROCESSES; MAXIMUM PRINCIPLE; MOTION PLANNING; POLYNOMIALS; SET THEORY;

MODERATE OBSTACLES; POLYNOMIAL TIME ALGORITHM; SHORTEST PATH OF BOUNDED CURVATURE;

ALGORITHMS;

EID: 0029703025     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)