scholarly journals A Study on the Solution of the Extrapolation Distance Problem Using U1 Method

2021 ◽  
Author(s):  
Cevat AKSU ◽  
Hakan ÖZTÜRK
Keyword(s):  
Distance Problem

scholarly journals An improved FPT algorithm for the flip distance problem

2021 ◽  
pp. 104708
Author(s):  
Qilong Feng ◽  
Shaohua Li ◽  
Xiangzhong Meng ◽  
Jianxin Wang
Keyword(s):  
Fpt Algorithm ◽  
Distance Problem ◽  
Flip Distance

A Maxmin Distance Problem

1972 ◽  
Vol 94 (2) ◽  
pp. 155-158 ◽  
Author(s):  
R. Aggarwal ◽  
G. Leitmann
Keyword(s):  
Minimum Distance ◽  
Terminal State ◽  
Initial State ◽  
Closed Set ◽  
Distance Problem

The problem of maximizing the minimum distance of a dynamical system’s state from a given closed set, while transferring the system from a given initial state to a given terminal state, is considered. Two different methods of solution of this problem are given.

A General Method for Computing the Distance Between Two Moving Objects Using Optimization Techniques

1992 ◽  
Author(s):  
Ou Ma ◽  
Meyer Nahon
Keyword(s):  
Quadratic Programming ◽  
Moving Objects ◽  
Optimization Techniques ◽  
Quadratic Constraints ◽  
Space Manipulators ◽  
Programming Techniques ◽  
Distance Problem ◽  
A Minor ◽  
Bounding Surfaces ◽  
General Method

Abstract Presented in this paper is a general method used to find the distance between two moving objects. This distance is defined as the length of the shortest path from one object to the other. The objects are assumed to be composed of arbitrary quadratic surface segments. The distance problem is formulated as a quadratic programming problem with linear and/or quadratic constraints, which is solved by efficient and robust quadratic programming techniques. Attention is focused on implementation in order to achieve computational efficiency for real-time applications. Computing tests show that the computational speed of this method is of linear order in terms of the total number of bounding surfaces of the two objects. It is also shown that, with a minor modification, this method can be used to calculate the interference between objects. A corresponding general software code has been implemented, and will be used for kinematics and dynamics modelling and simulation of space manipulators including situations with transient topologies, contact of environment, and capture/release of payloads.

scholarly journals Analysis of Low-and High-Resolution Observations of High-Velocity Clouds

1989 ◽  
Vol 120 ◽  
pp. 416-423
Author(s):  
Bart P. Wakker
Keyword(s):  
High Velocity ◽  
Galactic Center ◽  
Neutral Hydrogen ◽  
Current Status ◽  
Galactic Rotation ◽  
Single Model ◽  
Neutral Gas ◽  
The Galaxy ◽  
High Velocity Clouds ◽  
Distance Problem

For almost three decades neutral hydrogen moving at velocities unexplicable by galactic rotation has been observed. These so-called high-velocity clouds (HVCs) have been invoked as evidence for infall of neutral gas to the galaxy, as manifestations of a galactic fountain, as energy source for the formation of supershells, etc. No general consensus about their origin has presently been reached. However, it is becoming clear that no single model will suffice to explain all HVCs. A number of clouds may consist of material streaming toward the galactic center, as Mirabel (this conference) has advocated for several years, though their origin still remains unclear. A better understanding is mainly hampered by the fact that the distance remains unknown. An overview of the current status of the distance problem is given by van Woerden elsewhere in this volume.

Sign in / Sign up

Export Citation Format

Share Document