Search results for "algorithm"
showing 10 items of 4887 documents
Efficient simulation of the random-cluster model
2013
The simulation of spin models close to critical points of continuous phase transitions is heavily impeded by the occurrence of critical slowing down. A number of cluster algorithms, usually based on the Fortuin-Kasteleyn representation of the Potts model, and suitable generalizations for continuous-spin models have been used to increase simulation efficiency. The first algorithm making use of this representation, suggested by Sweeny in 1983, has not found widespread adoption due to problems in its implementation. However, it has been recently shown that it is indeed more efficient in reducing critical slowing down than the more well-known algorithm due to Swendsen and Wang. Here, we present…
Discrete Learning Control with Application to Hydraulic Actuators
2015
In this paper the robustness of a class of learning control algorithms to state disturbances, output noise, and errors in initial conditions is studied. We present a simple learning algorithm and exhibit, via a concise proof, bounds on the asymptotic trajectory errors for the learned input and the corresponding state and output trajectories. Furthermore, these bounds are continuous functions of the bounds on the initial condition errors, state disturbance, and output noise, and the bounds are zero in the absence of these disturbances.
A Control Algorithm for Active/Passive Hydraulic Winches Used in Active Heave Compensation
2019
Abstract The most common active heave compensated offshore cranes have hydraulic winch systems. This paper investigates an active/passive hydraulic winch system with variable-displacement motors and variable-displacement pumps. The paper addresses the challenges when the active motors are set with a low displacement. The active motor displacement is shown to have significant impact on the dynamics of the closed loop hydraulic system. The classical control strategy for this type of system do not address these challenges and will in certain situations have significantly reduced performance. Therefor, a new control method is presented that utilize the variable displacement of the pumps and mot…
A navigation and control algorithm for the position tracking of underwater vehicles
2014
In this paper we consider position control of underwater vehicles through inversion of differential kinematics based on uncalibrated, relative to the water, velocity sensors and unknown marine current. An estimation algorithm, based on the above measurements, estimates calibration parameters and marine current, assuring convergence of the estimated velocities to the true quantities. A kinematic control algorithm assures convergence to zero of the position tracking error. An extension of the basic estimation algorithm has been considered, in which position measurements are considered sampled at low rate and randomly spaced in time. Computer simulations are given of the proposed position trac…
On the Extension of the DIRECT Algorithm to Multiple Objectives
2020
AbstractDeterministic global optimization algorithms like Piyavskii–Shubert, direct, ego and many more, have a recognized standing, for problems with many local optima. Although many single objective optimization algorithms have been extended to multiple objectives, completely deterministic algorithms for nonlinear problems with guarantees of convergence to global Pareto optimality are still missing. For instance, deterministic algorithms usually make use of some form of scalarization, which may lead to incomplete representations of the Pareto optimal set. Thus, all global Pareto optima may not be obtained, especially in nonconvex cases. On the other hand, algorithms attempting to produce r…
A product space reformulation with reduced dimension for splitting algorithms
2021
AbstractIn this paper we propose a product space reformulation to transform monotone inclusions described by finitely many operators on a Hilbert space into equivalent two-operator problems. Our approach relies on Pierra’s classical reformulation with a different decomposition, which results in a reduction of the dimension of the outcoming product Hilbert space. We discuss the case of not necessarily convex feasibility and best approximation problems. By applying existing splitting methods to the proposed reformulation we obtain new parallel variants of them with a reduction in the number of variables. The convergence of the new algorithms is straightforwardly derived with no further assump…
Heuristic algorithms for a storage location assignment problem in a chaotic warehouse
2014
The extensive application of emerging technologies is revolutionizing warehouse management. These technologies facilitate working with complex and powerful warehouse management models in which products do not have assigned fixed locations (random storage). Random storage allows the utilization of the available space to be optimized. In this context, and motivated by a real problem, this article presents a model that looks for the optimal allocation of goods in order to maximize the storage space availability within the restrictions of the warehouse. For the proposed model a construction method, a local search algorithm and different metaheuristics have been developed. The introduced algorit…
Computing Euclidean Steiner trees over segments
2020
In the classical Euclidean Steiner minimum tree (SMT) problem, we are given a set of points in the Euclidean plane and we are supposed to find the minimum length tree that connects all these points, allowing the addition of arbitrary additional points. We investigate the variant of the problem where the input is a set of line segments. We allow these segments to have length 0, i.e., they are points and hence we generalize the classical problem. Furthermore, they are allowed to intersect such that we can model polygonal input. As in the GeoSteiner approach of Juhl et al. (Math Program Comput 10(2):487–532, 2018) for the classical case, we use a two-phase approach where we construct a superse…
Guidance Trajectories for Spacecraft Rendezvous
2007
In a previous paper of Miele et al. (J. Optim. Theory Appl. 132(1), 2007), we employed the single-subarc sequential gradient-restoration algorithm to optimize the three-dimensional rendezvous between a target spacecraft in a planar circular orbit and a chaser spacecraft with an initial separation distance and separation velocity. The achieved continuous solutions are characterized by two, three, or four subarcs depending on the performance index (time, fuel) and the constraints. In this paper, based on the solutions in Miele et al. (J. Optim. Theory Appl. 132(1), 2007), we employ the multiple-subarc sequential gradient-restoration algorithm to produce pieced guidance trajectories implementa…
Multi-Dimensional Pattern Matching with Dimensional Wildcards: Data Structures and Optimal On-Line Search Algorithms
1997
We introduce a new multidimensional pattern matching problem that is a natural generalization of string matching, a well studied problem1. The motivation for its algorithmic study is mainly theoretical. LetA1:n1,?,1:nd be a text matrix withN=n1?ndentries andB1:m1,?,1:mr be a pattern matrix withM=m1?mrentries, whered?r?1 (the matrix entries are taken from an ordered alphabet ?). We study the problem of checking whether somer-dimensional submatrix ofAis equal toB(i.e., adecisionquery).Acan be preprocessed andBis given on-line. We define a new data structure for preprocessingAand propose CRCW-PRAM algorithms that build it inO(logN) time withN2/nmaxprocessors, wherenmax=max(n1,?,nd), such that …