Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-15T04:57:40.681Z Has data issue: false hasContentIssue false

Worst-case analysis of moving obstacle avoidance systems for unmanned vehicles

Published online by Cambridge University Press:  15 April 2014

Sivaranjini Srikanthakumar*
Affiliation:
Department of Aeronautical and Automotive Engineering, Loughborough University, Leicestershire LE11 3TU, UK
Wen-Hua Chen
Affiliation:
Department of Aeronautical and Automotive Engineering, Loughborough University, Leicestershire LE11 3TU, UK
*
*Corresponding author. E-mail: sivaranjinisk@yahoo.co.uk
Rights & Permissions [Opens in a new window]

Summary

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

This paper investigates worst-case analysis of a moving obstacle avoidance algorithm for unmanned vehicles in a dynamic environment in the presence of uncertainties and variations. Automatic worst-case search algorithms are developed based on optimization techniques, and illustrated by a Pioneer robot with a moving obstacle avoidance algorithm developed using the potential field method. The uncertainties in physical parameters, sensor measurements, and even the model structure of the robot are taken into account in the worst-case analysis. The minimum distance to a moving obstacle is considered as an objective function in automatic search process. It is demonstrated that a local nonlinear optimization method may not be adequate, and global optimization techniques are necessary to provide reliable worst-case analysis. The Monte Carlo simulation is carried out to demonstrate that the proposed automatic search methods provide a significant advantage over random sampling approaches.

Information

Type
Articles
Copyright
Copyright © Cambridge University Press 2014