Adaptive Hybrid Sampling for Probabilistic Roadmap Planning
| dc.contributor.author | David HSU | en_US |
| dc.contributor.author | Zheng SUN | en_US |
| dc.date.accessioned | 2004-10-21T14:28:52Z | en_US |
| dc.date.accessioned | 2017-01-23T06:59:50Z | |
| dc.date.available | 2004-10-21T14:28:52Z | en_US |
| dc.date.available | 2017-01-23T06:59:50Z | |
| dc.date.issued | 2004-05-01T00:00:00Z | en_US |
| dc.description.abstract | Several sophisticated sampling strategies have been proposed recently to address the narrow passage problem for probabilistic roadmap (PRM)planning. They all have unique strengths and weaknesses in different environments, but none seems sufficient on its own in general. In this paper, we propose a systematic approach for adaptively combining multiple sampling strategies for PRM planning. Using this approach, we describe three adaptive hybrid sampling strategies. Two are motivated by theoretical results from the computational learning theory. Another one is simple and performs well in practice. We tested them on robots with two to eight degrees of freedom in planar workspaces. In these preliminary tests, the adaptive hybrid sampling strategies showed consistently good performance, compared with fixed-weight hybrid sampling strategies. | en_US |
| dc.format.extent | 458367 bytes | en_US |
| dc.format.mimetype | application/pdf | en_US |
| dc.identifier.uri | https://dl.comp.nus.edu.sg/xmlui/handle/1900.100/1448 | en_US |
| dc.language.iso | en | en_US |
| dc.relation.ispartofseries | TRA5/04 | en_US |
| dc.title | Adaptive Hybrid Sampling for Probabilistic Roadmap Planning | en_US |
| dc.type | Technical Report | en_US |