DISCRETE Fourier transforms, PROBLEM solving, DECISION making, ALGORITHMS, MATHEMATICAL analysis
Abstract
Many planning problems for robots are of considerable interest. In this paper, we consider the discrete minimum constraint removal motion planning problem that can be used for a motion planning formulation with explanations for failure. We consider an efficient approach to solve the problem. In particular, we consider an explicit reduction from the decision version of the problem to the satisfiability problem. We present the results of computational experiments for different satisfiability algorithms. [ABSTRACT FROM AUTHOR]
PROBLEM solving, ROBOTICS, COMPUTER research, MATHEMATICAL analysis, ALGORITHMS
Abstract
Problems of swarm robotics are extensively studied in contemporary robotics. In this paper, we consider the problem of robot swarms control with only global signals. We propose an efficient approach to solve the problem. In particular, we consider an explicit reduction from the decision version of the problem to the satisfiability problem. For different satisfiability algorithms, we present the results of computational experiments. [ABSTRACT FROM AUTHOR]
Keyzer, Michiel A. and van Wesenbeeck, Cornelia F. A.
Subjects
TRANSPORT theory, ALGORITHMS, MATHEMATICAL analysis, PROBLEM solving, MATHEMATICS theorems
Abstract
This paper presents a gradient-related algorithm for solving large scale, spatially explicit, welfare models with transportation. It introduces the theory, describes the different components of the algorithm, and reports on experience gained in applying it. [ABSTRACT FROM AUTHOR]
MATRICES (Mathematics), PROBLEM solving, ALGORITHMS, PARAMETER estimation, MATHEMATICAL analysis
Abstract
The simultaneous diagonalization problem of various size matrices is considered. We propose an algorithm for the problem that always finds a solution if one exists. The algorithm uses an algorithm for the simultaneous diagonalization of square matrices as a subroutine. [ABSTRACT FROM AUTHOR]