Space-filling curves for numerical approximation and visualization of solutions to systems of nonlinear inequalities with applications in robotics

Abstract The problem of approximating and visualizing the solution set of systems of nonlinear inequalities can be frequently met in practice, in particular, when it is required to find the working space of some robots. In this paper, a method using Peano-Hilbert space-filling curves for the dimensionality reduction has been proposed for functions satisfying the Lipschitz condition. Theoretical properties of the introduced algorithm showing advantages of this reduction in the context of the present problem have been established and convergence properties of this method have been studied. A number of experiments executed on test functions and problems regarding finding workspace of robots confirm theoretical results and show a promising character of the new methodology.

[1]  Mikhail Posypkin,et al.  Approaches to the Determination of the Working Area of Parallel Robots and the Analysis of Their Geometric Characteristics , 2019 .

[2]  Julius Zilinskas,et al.  Globally-biased Disimpl algorithm for expensive global optimization , 2014, Journal of Global Optimization.

[3]  Abdolreza Gharahsofloo,et al.  An Efficient Algorithm for Workspace Generation of Delta Robot , 2015 .

[4]  Yaroslav D. Sergeyev,et al.  Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Holder constants , 2015, Commun. Nonlinear Sci. Numer. Simul..

[5]  Vladimir A. Grishagin,et al.  Convergence conditions and numerical comparison of global optimization methods based on dimensionality reduction schemes , 2018, Appl. Math. Comput..

[6]  Marco Gaviano,et al.  A global minimization algorithm for Lipschitz functions , 2007, Optim. Lett..

[7]  Y. Sergeyev,et al.  Tuning fuzzy power-system stabilizers in multi-machine systems by global optimization algorithms based on efficient domain partitions , 2008 .

[8]  Yaroslav D. Sergeyev,et al.  Deterministic approaches for solving practical black-box global optimization problems , 2015, Adv. Eng. Softw..

[9]  Remigijus Paulavičius,et al.  Simplicial Global Optimization , 2014 .

[10]  Vladimir A. Grishagin,et al.  Adaptive nested optimization scheme for multidimensional global search , 2016, J. Glob. Optim..

[11]  Vladimir A. Grishagin,et al.  Local Tuning in Nested Scheme of Global Optimization , 2015, ICCS.

[12]  Mikhail Posypkin,et al.  Nonuniform covering method as applied to multicriteria optimization problems with guaranteed accuracy , 2013 .

[13]  Yaroslav D. Sergeyev,et al.  On Acceleration of Derivative-Free Univariate Lipschitz Global Optimization Methods , 2019, NUMTA.

[14]  Artem Maminov,et al.  Constrained Multi-objective Robot’s Design Optimization , 2020, 2020 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering (EIConRus).

[15]  R. Cavoretto,et al.  On the search of the shape parameter in radial basis functions using univariate global optimization methods , 2019, Journal of Global Optimization.

[16]  Remigijus Paulavičius,et al.  Globally-biased BIRECT algorithm with local accelerators for expensive global optimization , 2020, Expert Syst. Appl..

[17]  Yaroslav D. Sergeyev,et al.  Index branch-and-bound algorithm for Lipschitz univariate global optimization with multiextremal constraints , 2001, J. Glob. Optim..

[18]  A. A. Zhigli︠a︡vskiĭ,et al.  Stochastic Global Optimization , 2007 .

[19]  G. K. Kamenev.  Efficiency of the estimate refinement method for polyhedral approximation of multidimensional balls , 2016 .

[20]  Yaroslav D. Sergeyev,et al.  Acceleration of Univariate Global Optimization Algorithms Working with Lipschitz Functions and Lipschitz First Derivatives , 2013, SIAM J. Optim..

[21]  Roman G. Strongin,et al.  Global Optimization: Fractal Approach and Non-redundant Parallelism , 2003, J. Glob. Optim..

[22]  Mikhail Posypkin,et al.  Approximating a solution set of nonlinear inequalities , 2018, J. Glob. Optim..

[23]  H. Sagan.  Space-filling curves , 1994 .

[24]  Arthur R. Butz,et al.  Space Filling Curves and Mathematical Programming , 1968, Inf. Control..

[25]  V. Garanzha,et al.  Generation of three-dimensional delaunay meshes from weakly structured and inconsistent data , 2012 .

[26]  Yaroslav D. Sergeyev,et al.  Novel local tuning techniques for speeding up one-dimensional algorithms in expensive global optimization using Lipschitz derivatives , 2021, J. Comput. Appl. Math..

[27]  Ya D Sergeyev,et al.  On the efficiency of nature-inspired metaheuristics in expensive global optimization with limited budget , 2018, Scientific Reports.

[28]  Detong Zhu,et al.  A filter algorithm for nonlinear systems of equalities and inequalities , 2012, Appl. Math. Comput..

[29]  Yaroslav D. Sergeyev,et al.  Ill-conditioning provoked by scaling in univariate global optimization and its handling on the infinity computer , 2019 .

[30]  Y. Evtushenko.  Numerical methods for finding global extrema (Case of a non-uniform mesh) , 1971 .

[31]  Yaroslav D. Sergeyev,et al.  Lipschitz global optimization methods in control problems , 2013, Autom. Remote. Control..

[32]  Vladimir A. Grishagin,et al.  Global search acceleration in the nested optimization scheme , 2016 .

[33]  J D Pinter,et al.  Global Optimization in Action—Continuous and Lipschitz Optimization: Algorithms, Implementations and Applications , 2010 .

[34]  Yaroslav D. Sergeyev,et al.  A two-phase approach in a global optimization algorithm using multiple estimates of hölder constants , 2019 .

[35]  Ying Zhang,et al.  A nonmonotone smoothing-type algorithm for solving a system of equalities and inequalities , 2010, J. Comput. Appl. Math..

[36]  Changfeng Ma,et al.  A smoothing self-adaptive Levenberg-Marquardt algorithm for solving system of nonlinear inequalities , 2010, Appl. Math. Comput..

[37]  Roman G. Strongin,et al.  Solving a set of global optimization problems by the parallel technique with uniform convergence , 2017, Journal of Global Optimization.

[38]  Yaroslav D. Sergeyev,et al.  Safe global optimization of expensive noisy black-box functions in the $δ$-Lipschitz framework , 2019, Soft Comput..

[39]  Alexander V. Lotov,et al.  The modified method of refined bounds for polyhedral approximation of convex polytopes , 2008 .

[40]  A. A. Zhigli︠a︡vskiĭ,et al.  Theory of Global Random Search , 1991 .

[41]  G. K. Kamenev.  Method for polyhedral approximation of a ball with an optimal order of growth of the facet structure cardinality , 2014 .

[42]  Y. D. Sergeyev,et al.  Global Optimization with Non-Convex Constraints - Sequential and Parallel Algorithms (Nonconvex Optimization and its Applications Volume 45) (Nonconvex Optimization and Its Applications) , 2000 .

[43]  James M. Calvin,et al.  An Adaptive Univariate Global Optimization Algorithm and Its Convergence Rate for Twice Continuously Differentiable Functions , 2012, J. Optim. Theory Appl..

[44]  Yaroslav D. Sergeyev,et al.  GOSH: derivative-free global optimization using multi-dimensional space-filling curves , 2018, J. Glob. Optim..

[45]  Roman G. Strongin,et al.  Introduction to Global Optimization Exploiting Space-Filling Curves , 2013 .