Hostname: page-component-8448b6f56d-c47g7 Total loading time: 0 Render date: 2024-04-18T00:45:02.258Z Has data issue: false hasContentIssue false

Two novel approaches for unmanned underwater vehicle path planning: constrained optimisation and semi-infinite constrained optimisation

Published online by Cambridge University Press:  01 March 2000

Yongji Wang
Affiliation:
Centre for Systems and Control, Department of Mechanical Engineering, Glasgow University, Glasgow G12 8QQ, Scotland, (UK) E-mail: ywang@mech.gla.ac.uk
David M. Lane
Affiliation:
Ocean Systems Laboratory, Department of Computing & Electrical Engineering, Heriot-Watt University, Edinburgh, EH14 5AS, Scotland, (UK): E-mail: dml@cee.hw.ac.uk, gjf@cee.hw.ac.uk
Gavin J. Falconer
Affiliation:
Ocean Systems Laboratory, Department of Computing & Electrical Engineering, Heriot-Watt University, Edinburgh, EH14 5AS, Scotland, (UK): E-mail: dml@cee.hw.ac.uk, gjf@cee.hw.ac.uk

Abstract

In this paper, two novel approaches to unmanned underwater vehicle path planning are presented. The main idea of the first approach, referred to as Constrained Optimisation (CO) is to represent the free space of the workspace as a set of inequality constraints using vehicle configuration variables. The second approach converts robot path planning into a Semi-infinite Constrained Optimisation (SCO) problem. The function interpolation technique is adopted to satisfy the start and goal configuration requirements. Mathematical foundations for Constructive Solid Geometry (CSG), Boolean operations and approximation techniques are also presented to reduce the number of constraints, and to avoid local minima. The advantages of these approaches are that the mature techniques developed in optimisation theory which guarantee convergence, efficiency and numerical robustness can be directly applied to the robot path planning problem. Simulation results have been presented.

Type
Research Article
Copyright
© 2000 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.)