The Open-Path Area algorithm described searches a region scanned by a laser range finder for the most open path that will allow a robot of a specified width to move the furthest distance. Range data are mapped into an array space in which the column indices are the beam numbers and the rows are the range values divided into an arbitrary number of bins. The path to be searched is ...
Reports by Author
