Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
High-order quadrature on multi-component domains implicitly defined by multivariate polynomials
RI Saye - Journal of Computational Physics, 2022 - Elsevier
A high-order quadrature algorithm is presented for computing integrals over curved surfaces
and volumes whose geometry is implicitly defined by the level sets of (one or more) …
and volumes whose geometry is implicitly defined by the level sets of (one or more) …
Robust optimization for MPC
This chapter aims to give a concise overview of numerical methods and algorithms for
implementing robust model predictive control (MPC). We introduce the mathematical …
implementing robust model predictive control (MPC). We introduce the mathematical …
Towards rigorous robust optimal control via generalized high‐order moment expansion
This study is concerned with the rigorous solution of worst‐case robust optimal control
problems having bounded time‐varying uncertainty and nonlinear dynamics with affine …
problems having bounded time‐varying uncertainty and nonlinear dynamics with affine …
Global optimization in Hilbert space
We propose a complete-search algorithm for solving a class of non-convex, possibly infinite-
dimensional, optimization problems to global optimality. We assume that the optimization …
dimensional, optimization problems to global optimality. We assume that the optimization …
Computing ellipsoidal robust forward invariant tubes for nonlinear MPC
Min-max differential inequalities (DIs) can be used to characterize robust forward invariant
tubes with convex cross-section for a large class of nonlinear control systems. The …
tubes with convex cross-section for a large class of nonlinear control systems. The …
Sensitivity analysis of uncertain dynamic systems using set-valued integration
We present an extension of set-valued integration to enable efficient sensitivity analysis of
parameter-dependent ordinary differential equation (ODE) systems, using both the forward …
parameter-dependent ordinary differential equation (ODE) systems, using both the forward …
Branch-and-lift algorithm for obstacle avoidance control
Obstacle avoidance problems are a class of non-convex optimal control problems for which
derivative-based optimization algorithms often fail to locate global minima. The goal of this …
derivative-based optimization algorithms often fail to locate global minima. The goal of this …
A connected component labeling algorithm for implicitly defined domains
RI Saye - … in Applied Mathematics and Computational Science, 2023 - msp.org
A connected component labeling algorithm is developed for implicitly defined domains
specified by multivariate polynomials. The algorithm operates by recursively subdividing the …
specified by multivariate polynomials. The algorithm operates by recursively subdividing the …
A connected component labeling algorithm for implicitly-defined domains
RI Saye - arxiv preprint arxiv:2205.14885, 2022 - arxiv.org
A connected component labeling algorithm is developed for implicitly-defined domains
specified by multivariate polynomials. The algorithm operates by recursively subdividing the …
specified by multivariate polynomials. The algorithm operates by recursively subdividing the …
Optimizing cuckoo feature selection algorithm with the new initialization strategy and fitness function
Y Wang, Z Li, H Yu, L Deng - International Conference on Cloud …, 2018 - Springer
In machine learning and data mining tasks, feature selection is an important process of data
preprocessing. Recent studies have shown that Binary Cuckoo Search Algorithm for Feature …
preprocessing. Recent studies have shown that Binary Cuckoo Search Algorithm for Feature …