By Topic

Solving a generalized constrained optimization problem with both logic AND and OR relationships by a mathematical transformation and its application to robot motion planning

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yongji Wang ; Ocean Syst. Lab., Heriot-Watt Univ., Edinburgh, UK ; D. M. Lane

The logic relationship among the equality and inequality constraints in a standard constrained optimization problem (SCOP) is the logical AND. Various efficient, convergent and robust algorithms have been developed for such a SCOP. Motivated by a practical application, a more general constrained optimization problem (GCOP) with not only logic AND but also OR relationships is proposed in this paper. In order to solve such a generalized problem, a mathematical transformation which can transfer a set of inequalities with logic OR into one inequality is developed. This transformation provides a necessary and sufficient condition which enables us to use the algorithms developed for SCOPs to solve the generalized optimization problems. The research is motivated by the requirements of developing an efficient, robust, and reliable navigation algorithm for a mobile robot such as an autonomous underwater vehicle (AUV). The original contributions of the paper include threefold: first, from the viewpoint of optimization theory, this paper, to the authors' best knowledge, is the first one to propose such a GCOP. Second, a method is developed to solve such a GCOP. Third, from the viewpoint of robot path planning, this paper presents a new way of using classical optimization approach to solve robot path planning

Published in:

IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews)  (Volume:30 ,  Issue: 4 )