Worst-case analysis of moving obstacle avoidance systems for unmanned vehicles
Open Access
- 15 April 2014
- journal article
- research article
- Published by Cambridge University Press (CUP) in Robotica
- Vol. 33 (4) , 807-827
Abstract
SUMMARY: 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.Keywords
This publication has 8 references indexed in Scilit:
- Optimization-Based Safety Analysis of Obstacle Avoidance Systems for Unmanned Aerial VehiclesJournal of Intelligent & Robotic Systems, 2011
- UAV collision avoidance based on geometric approach2008
- The GLOBAL optimization method revisitedOptimization Letters, 2007
- Nonlinear Analysis and Synthesis Techniques for Aircraft Control2007
- Introduction to Optimum Design with MATLAB2004
- Dynamic Motion Planning for Mobile Robots Using Potential Field MethodAutonomous Robots, 2002
- Direct Global Optimization Algorithm2001
- A stochastic method for global optimizationMathematical Programming, 1982