A polynomial-time algorithm for computing shortest paths of bounded curvature amidst moderate obstacles
Data and Resources
Additional Info
| Field | Value |
|---|---|
| Source | ISSN: 0218-1959 |
| Author | Boissonnat, Jean-Daniel, Lazard, Sylvain |
| Maintainer | CCSD |
| Last Updated | May 5, 2026, 10:28 (UTC) |
| Created | May 5, 2026, 10:28 (UTC) |
| Identifier | inria-00099509 |
| Language | en |
| Rights | https://about.hal.science/hal-authorisation-v1/ |
| contributor | Geometry, Algorithms and Robotics (PRISME) ; Centre Inria d'Université Côte d'Azur ; Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria) |
| creator | Boissonnat, Jean-Daniel |
| date | 2003-05-05T00:00:00 |
| harvest_object_id | cd5c6eca-bd14-4b98-a695-9d70a4fab147 |
| harvest_source_id | 3374d638-d20b-4672-ba96-a23232d55657 |
| harvest_source_title | test moissonnage SELUNE |
| metadata_modified | 2025-11-04T00:00:00 |
| relation | info:eu-repo/semantics/altIdentifier/doi/10.1142/S0218195903001128 |
| set_spec | type:ART |