The Find-Path Problem in the Plane
| dc.date.accessioned | 2004-10-01T20:17:35Z | |
| dc.date.accessioned | 2018-11-24T10:09:50Z | |
| dc.date.available | 2004-10-01T20:17:35Z | |
| dc.date.available | 2018-11-24T10:09:50Z | |
| dc.date.issued | 1984-02-01 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/5632 | |
| dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/1721.1/5632 | |
| dc.description.abstract | This paper presents a fast heuristic algorithm for planning collision-free paths of a moving robot in a cluttered planar workspace. The algorithm is based on describing the free space between the obstacles as a network of linked cones. Cones capture the freeways and the bottle-necks between the obstacles. Links capture the connectivity of the free space. Paths are computed by intersecting the valid configuration volumes of the moving robot inside these cones and inside the regions described by the links. | en_US |
| dc.format.extent | 70 p. | en_US |
| dc.format.extent | 9100769 bytes | |
| dc.format.extent | 7163918 bytes | |
| dc.language.iso | en_US | |
| dc.title | The Find-Path Problem in the Plane | en_US |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
| AIM-760.pdf | 7.163Mb | application/pdf | View/ |
| AIM-760.ps | 9.100Mb | application/postscript | View/ |