Abstract
AbstractSequential sampling methods are often used to estimate functions describing models subjected to time‐intensive simulations or expensive experiments. These methods provide guidelines for point selection in the domain to capture maximum information about the function. However, in most sequential sampling methods, determining a new point is a time‐consuming process. In this paper, we propose a new method, named Sieve, to sequentially select points of an initially unknown function based on the definition of proper intervals. In contrast with existing methods, Sieve does not involve function estimation at each iteration. Therefore, it presents a greater computational efficiency for achieving a given accuracy in estimation. Sieve brings in tools from computational geometry to subdivide regions of the domain efficiently. Further, we validate our proposed method through numerical simulations and two case studies on the calibration of internal combustion engines and the optimal exploration of an unknown environment by a mobile robot.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.