Related papers: Orbits, schemes and dynamic programming procedures…
In real life, mostly problems are dynamic. Many algorithms have been proposed to handle the static problems, but these algorithms do not handle or poorly handle the dynamic environment problems. Although, many algorithms have been proposed…
Separation of variables by means of the orbit method is implemented to integrable systems on coadjoint orbits in an $\mathfrak{sl}(4)$ loop algebra. This is a development and a kind of explanation for Sklyanin's procedure of separation of…
Projection methods are popular algorithms for iteratively solving feasibility problems in Euclidean or even Hilbert spaces. They employ (selections of) nearest point mappings to generate sequences that are designed to approximate a point in…
In this paper, we will study the statistical behaviors of orbits. Firstly, we will show that for a dynamical systems have the shadowing property or almost specification property, the set of nonrecurrent points has full topological entropy.…
In this work, we introduce a new circuit optimization technique to reduce the number of T gates in Clifford+T circuits by treating T gates conjugated by Clifford gates as $\frac{\pi}{4}$-rotations around Pauli operators. The tested…
Approaching a tumbling target safely is a critical challenge in space debris removal missions utilizing robotic manipulators onboard servicing satellites. In this work, we propose a trajectory planning method based on nonlinear optimization…
By introducing simple topological constraints and applying a binary decomposition method, we show the existence of a set of prograde double-double orbits for any rotation angle $\theta \in (0, \pi/7]$ in the equal-mass four-body problem. A…
In 1981 Antonyan classified the orbits of SL$(8,\mathbb{C})$ on $\bigwedge^4 \mathbb{C}^8$. This is an example of a $\theta$-group action as introduced and studied by Vinberg. The orbits of a $\theta$-group are divided into three classes:…
Many real-world problems are composed of several interacting components. In order to facilitate research on such interactions, the Traveling Thief Problem (TTP) was created in 2013 as the combination of two well-understood combinatorial…
Particle Swarm Optimization is a global optimizer in the sense that it has the ability to escape poor local optima. However, if the spread of information within the population is not adequately performed, premature convergence may occur.…
We study the problem of optimal multi-robot path planning on graphs (MPP) over four distinct minimization objectives: the total arrival time, the makespan (last arrival time), the total distance, and the maximum (single-robot traveled)…
Meta-heuristics are frequently used to tackle NP-hard combinatorial optimization problems. With this paper we contribute to the understanding of the success of 2-opt based local search algorithms for solving the traveling salesman problem…
As the number of uncontrollable objects in low earth orbit is rising, the thread of collisions and thus the breakdown of working satellites becomes worth analyzing. Consequently, projects on removing objects from the important orbits are…
The numerical optimized shooting method for finding periodic orbits in nonlinear dynamical systems was employed to determine the existence of periodic orbits in the well-known R\"ossler system. By optimizing the period $T$ and the three…
An effective method for optimizing path planning for a specific model of a 6-degree-of-freedom (6-DOF) robot manipulator is presented as part of the motion planning of the manipulator using computer algebra. We assume that we are given a…
Autonomous spacecraft maneuver planning using an evolutionary algorithmic approach is investigated. Simulated spacecraft were placed into four different initial orbits. Each was allowed a string of thirty delta-v impulse maneuvers in six…
A new algorithm for numerical integration of the rigid-body equations of motion is proposed. The algorithm uses the leapfrog scheme and the quantities involved are angular velocities and orientational variables which can be expressed in…
Three algorithms of Gram-Schmidt type are given that produce an orthogonal decomposition of finite $d$-dimensional symmetric, alternating, or Hermitian forms over division rings. The first uses $d^3/3+O(d^2)$ ring operations with very…
In this paper, the study of the global orbit pattern (gop) formed by all the periodic orbits of discrete dynamical systems on a finite set $X$ allows us to describe precisely the behaviour of such systems. We can predict by means of closed…
This paper presents a trajectory optimization and control approach for the guidance of an orbital four-arm robot in extravehicular activities. The robot operates near the target spacecraft, enabling its arm's end-effectors to reach the…