Hostname: page-component-cd9895bd7-8ctnn Total loading time: 0 Render date: 2024-12-18T18:13:14.077Z Has data issue: false hasContentIssue false

A rapid method for planning paths in three dimensions for a small aerial robot

Published online by Cambridge University Press:  01 March 2001

M. Williams
Affiliation:
School of Informatics, University of Wales, Dean Street, Bangor, Gwynedd LL57 1UT, UK
D.I. Jones
Affiliation:
School of Informatics, University of Wales, Dean Street, Bangor, Gwynedd LL57 1UT, UK

Abstract

This paper describes a path planning method for a small autonomous aerial vehicle to be used for inspecting overhead electricity power lines. A computational algorithm is described which converts a standard three dimensional array representation of one or more obstacles in the vehicle's environment into an octree and a connectivity graph. This achieves a significant reduction in computer memory usage and an increase in execution speed when the graph is searched. Path planning is based on a three-dimensional extension of the distance transform. Test results demonstrate rapid and effective operation of the planner within different workspaces.

Type
Research Article
Copyright
© 2001 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)