Orbit Plan Method for General Rendezvous Problems

2014 ◽  
Vol 543-547 ◽  
pp. 1385-1388
Author(s):  
Xu Min Song ◽  
Yong Chen ◽  
Qi Lin
Keyword(s):  
Optimization Problem ◽  
Planning Problem ◽  
Shooting Technique ◽  
Lambert Problem ◽  
Orbit Perturbation ◽  
Eccentric Orbits ◽  
Rendezvous Problem ◽  
Transfer Orbit ◽  
Adaptive Simulated Annealing ◽  
Annealing Method

The orbit plan method of rendezvous mission was studied in this paper. We are concerned with the general rendezvous problem between two satellites which may be in non-coplanar, eccentric orbits, considering orbit perturbation and rendezvous time limitation. The planning problem was modeled as a nonlinear optimization problem, and the adaptive simulated annealing method was used to get the global solution. The Lambert algorithm was used to compute the transfer orbit, so that the endpoint constraint of rendezvous was eliminated. A shooting technique was used to solve the perturbed lambert problem. The method was validated by simulation results.

Trajectory Optimization Applied to Space Rendezvous

2013 ◽  
Vol 756-759 ◽  
pp. 3466-3470
Author(s):  
Xu Min Song ◽  
Qi Lin
Keyword(s):  
Simulated Annealing ◽  
Optimization Model ◽  
Trajectory Optimization ◽  
Optimization Problem ◽  
Optimization Method ◽  
Nonlinear Constraints ◽  
Design Variables ◽  
Adaptive Simulated Annealing ◽  
Simulation Results

The trajcetory plan problem of spece reandezvous mission was studied in this paper using nolinear optimization method. The optimization model was built based on the Hills equations. And by analysis property of the design variables, a transform was put forward , which eliminated the equation and nonlinear constraints as well as decreaseing the problem dimensions. The optimization problem was solved using Adaptive Simulated Annealing (ASA) method, and the rendezvous trajectory was designed.The method was validated by simulation results.

scholarly journals Optimal design of a DC MHD pump by simulated annealing method

2014 ◽  
Vol 11 (2) ◽  
pp. 339-350
Author(s):  
Khadidja Bouali ◽  
Fatima Kadid ◽  
Rachid Abdessemed
Keyword(s):  
Simulated Annealing ◽  
Optimal Design ◽  
Objective Function ◽  
Design Problem ◽  
Design Methodology ◽  
Optimization Problem ◽  
Optimization Procedure ◽  
Simulated Annealing Method ◽  
Direct Interpretation ◽  
Annealing Method

In this paper a design methodology of a magnetohydrodynamic pump is proposed. The methodology is based on direct interpretation of the design problem as an optimization problem. The simulated annealing method is used for an optimal design of a DC MHD pump. The optimization procedure uses an objective function which can be the minimum of the mass. The constraints are both of geometrics and electromagnetic in type. The obtained results are reported.

scholarly journals Trajectory optimization of UAV based on Hp-adaptive Radau pseudospectral method

2021 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Yi Cui ◽  
Xintong Fang ◽  
Gaoqi Liu ◽  
Bin Li
Keyword(s):  
Trajectory Planning ◽  
Trajectory Optimization ◽  
Optimization Problem ◽  
Tracking Error ◽  
Pseudospectral Method ◽  
Planning Problem ◽  
A Algorithm ◽  
Planning Scheme ◽  
Path Search ◽  
Simulation Results

<p style='text-indent:20px;'>Unmanned Aerial Vehicles (UAVs) have been extensively studied to complete the missions in recent years. The UAV trajectory planning is an important area. Different from the commonly used methods based on path search, which are difficult to consider the UAV state and dynamics constraints, so that the planned trajectory cannot be tracked completely. The UAV trajectory planning problem is considered as an optimization problem for research, considering the dynamics constraints of the UAV and the terrain obstacle constraints during flight. An hp-adaptive Radau pseudospectral method based UAV trajectory planning scheme is proposed by taking the UAV dynamics into account. Numerical experiments are carried out to show the effectiveness and superior of the proposed method. Simulation results show that the proposed method outperform the well-known RRT* and A* algorithm in terms of tracking error.</p>

Cooperative Task Assignment and Trajectory Planning of Unmanned Systems Via HFLC and PSO

2019 ◽  
Vol 07 (02) ◽  
pp. 65-81 ◽  
Author(s):  
Ahmed T. Hafez ◽  
Mohamed A. Kamel
Keyword(s):  
Trajectory Planning ◽  
Optimization Problem ◽  
Fuzzy Logic Controller ◽  
Hybrid Approach ◽  
Task Assignment ◽  
Time Discretization ◽  
Planning Problem ◽  
Dynamic Constraints ◽  
Ground Station ◽  
Novel Approach

This paper investigates the problems of cooperative task assignment and trajectory planning for teams of cooperative unmanned aerial vehicles (UAVs). A novel approach of hierarchical fuzzy logic controller (HFLC) and particle swarm optimization (PSO) is proposed. Initially, teams of UAVs are moving in a pre-defined formation covering a specified area. When one or more targets are detected, the teams send a package of information to the ground station (GS) including the target’s degree of threat, degree of importance, and the separating distance between each team and each detected target. Based on the gathered information, the ground station assigns the teams to the targets. HFLC is implemented in the GS to solve the assignment problem ensuring that each team is assigned to a unique target. Next, each team plans its own path by formulating the path planning problem as an optimization problem. The objective in this case is to minimize the time to reach their destination considering the UAVs dynamic constraints and collision avoidance between teams. A hybrid approach of control parametrization and time discretization (CPTD) and PSO is proposed to solve this optimization problem. Finally, numerical simulations demonstrate the effectiveness of the proposed algorithm.

scholarly journals A Knowledge-Based Simulated Annealing Algorithm to Multiple Satellites Mission Planning Problems

2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Da-Wei Jin ◽  
Li-Ning Xing
Keyword(s):  
Simulated Annealing ◽  
Optimization Problem ◽  
Simulated Annealing Algorithm ◽  
Mission Planning ◽  
Knowledge Based ◽  
Combination Optimization ◽  
Annealing Algorithm ◽  
The Given ◽  
Planning Problems ◽  
Annealing Method

The multiple satellites mission planning is a complex combination optimization problem. A knowledge-based simulated annealing algorithm is proposed to the multiple satellites mission planning problems. The experimental results suggest that the proposed algorithm is effective to the given problem. The knowledge-based simulated annealing method will provide a useful reference for the improvement of existing optimization approaches.

Extension of the spacecraft launch windows to determinate accessible areas on the Venus surface in the frame of the Venera-D project

2020 ◽  
Author(s):  
N.A. Eismont ◽  
V.V. Koryanov ◽  
K.S. Fedyaev ◽  
S.A. Bober ◽  
V.A. Zubko ◽  
...  
Keyword(s):  
Initial Data ◽  
Lambert Problem ◽  
The Earth ◽  
Transfer Orbit ◽  
Venus Atmosphere

The paper considers the problem of finding accessible areas on the Venus surface and the prospect of their increasing by extension of launch windows during the period from 2026 to 2031; taking into account the restrictions on the payload weight and the maximum overload level affecting the lander during the descent in the Venus atmosphere. The project of the Venera-D mission is used as the initial data for the work. The possibility of reaching the planet on the first and second half-turns of the heliocentric transfer orbit is analyzed. As an example, the effect of the launch window expansion for 2031 on the nature of changes in the accessible landing areas is considered. Possible payload weight expenses for launch window expansion are estimated. The launch windows are selected by solving the Lambert problem, where the transit spacecraft momentum near the Earth for the flight to Venus along the first and second half-orbit paths at the period from 2026 to 2042 is calculated. The accessible landing area is shown when increasing the launch windows initially adopted for 2031.The estimation of payload weight expenses for increasing the launch windows is performed.

scholarly journals Biobjective UAV/UGV Collaborative Rendezvous Planning in Persistent Intelligent Task-Based Wireless Communication

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Qin Wang ◽  
Hua Chen ◽  
Junwei Tian ◽  
Jia Wang ◽  
Yu Su
Keyword(s):  
Wireless Communication ◽  
Path Length ◽  
Optimization Problem ◽  
Experimental Result ◽  
Planning Problem ◽  
Unmanned Ground Vehicle ◽  
Cooperative System ◽  
Ground Vehicle ◽  
Aerial Vehicle ◽  
The Mathematical Model

This paper addresses a multiobjective Unmanned Aerial Vehicle (UAV) and Unmanned Ground Vehicle (UGVs) collaboration scheduling problem in which UAVs must be recharged periodically during a persistent task, such as wireless communication and making aerial panoramic VR video by UAV. The proposal is to introduce a UGV/UAV cooperative system in which UAVs should be recharged by UGVs periodically, and also, the UGVs have to visit their task points expect for the recharge points. The objective of the problem is to schedule and plan paths with the tradeoff of path length and makespan for UAVs and UGVs. The mathematical model which can be considered a combinatorial multiobjective optimization problem is presented firstly, and the solution of the problem is composed of presubsolution and postsubsolution. The multiobjective adaptive large neighborhood is hybrid with the Pareto local search (MOALP) to resolve the problem. The experimental result shows that the proposed algorithm outperforms the compared algorithms on the rendezvous planning problem for UAVs and UGVs working collaboratively in intelligent tasks.

scholarly journals Fuzzy polychromatic sets constraint model for route planning problem

2020 ◽  
Vol 17 (5) ◽  
pp. 172988142095924
Author(s):  
Cai Chao ◽  
Gong Zhi Xing ◽  
Qin Xiao Wei ◽  
Zhou Qiu Shi ◽  
Sun Xi Xia
Keyword(s):  
Mutual Coupling ◽  
Optimization Problem ◽  
Route Planning ◽  
Planning System ◽  
Planning Problem ◽  
Multiobjective Optimization Problem ◽  
Constraint Condition ◽  
Operation Rules ◽  
Aerial Vehicle ◽  
Constraint Model

Unmanned aerial vehicle route planning is a complex multiconstrained multiobjective optimization problem. Due to the complexity of various constraints and the mutual coupling between them, the expression of constraint conditions is not universal and normative. The development, maintenance, and upgrading of an existing route planning system are very difficult. In this article, by establishing the polychromatic sets of aircraft, aircraft equipment, and flight actions, creating the fuzzy relational matrix between equipment and actions and between actions and actions, this article realizes the standardized and generalized expression of the constraint condition of the route planning problem. Then the analysis and inspection of the constraint conditions are realized by the polychromatic sets operation rules.

Minimum jerk for trajectory planning and control

Robotica ◽  
1994 ◽  
Vol 12 (2) ◽  
pp. 109-113 ◽  
Author(s):  
K.J. Kyriakopoulos ◽  
G.N. Saridis
Keyword(s):  
Trajectory Planning ◽  
Tracking Control ◽  
Optimization Problem ◽  
Control Algorithms ◽  
Planning Problem ◽  
Cartesian Space ◽  
Planning And Control ◽  
Minimum Jerk ◽  
And Control ◽  
Trajectory Planning And Control

SUMMARYIt has been experimentally verified that the jerk of the desired trajectory adversely affects the performance of the tracking control algorithms for robotic manipulators. In this paper, we investigate the reasons behind this effect, and state the trajectory planning problem as an optimization problem that minimizes a norm of joint jerk over a prespecified Cartesian space trajectory. The necessary conditions are derived and a numerical algorithm is presented.

Sign in / Sign up

Export Citation Format

Share Document