Completeness of randomized kinodynamic planners with state-based steering
The panorama of probabilistic completeness results for kinodynamic planners is still confusing. Most existing completeness proofs require strong assumptions that are difficult, if not impossible, to verify in practice. To make completeness results more useful, it is thus sensible to establish a clas...
Main Authors: | , , |
---|---|
Other Authors: | |
Format: | Conference Paper |
Language: | English |
Published: |
2017
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/83223 http://hdl.handle.net/10220/42491 |