A Method of Minimum-Time Formation Guidance Based on Optimal Solutions of Single Fixed-Wing Aircraft by using Homotopy Method

2017 ◽  
Vol 16 (0) ◽  
pp. 109-114 ◽  
Author(s):  
Hiroshi FUKUMOTO ◽  
Seiya UENO
Keyword(s):  
Homotopy Method ◽  
Minimum Time ◽  
Optimal Solutions

scholarly journals Optimization for Far-distance Cooperative Rendezvous with Multiple Direction-fixed Thrusts

2021 ◽  
Vol 2068 (1) ◽  
pp. 012021
Author(s):  
Fei Ren
Keyword(s):  
Hybrid Algorithm ◽  
Optimization Method ◽  
Homotopy Method ◽  
Optimal Solutions ◽  
Low Thrust ◽  
Rendezvous Problem ◽  
Cooperative Rendezvous ◽  
Radial Thrust ◽  
Bang Bang Control ◽  
High Thrust

Abstract The continuous-thrust far-distance cooperative rendezvous problem between two spacecraft is investigated. The indirect optimization method, based on Pontryagin’s maximum principle (PMP), is applied to optimize fuel consumption. To overcome the difficulty in nonsmooth integration caused by the bang-bang control, the homotopy method is adopted to solve the fuel-optimal problem from a related energy-optimal problem. The quantum-behaved particle swarm optimization (QPSO) algorithm is used to obtain the energy-optimal solutions. The energy-optimal solutions are used as the initial values for the homotopic procedure to obtain the fuel-optimal solutions and optimal bang-bang control law. A hybrid algorithm combined homotopy method and sequential quadratic programming (SQP) algorithm is proposed. This hybrid algorithm can effectively obtain feasible optimal solutions even though the indirect optimization method exhibits a narrow convergence domain. Simulations of high-thrust and low-thrust rendezvous problems are provided and the proposed hybrid algorithm is verified. Moreover, the necessity of radial thrust is investigated.

Decentralized Sub-Optimal Minimum-Time Consensus

2014 ◽  
Author(s):  
Eloy Garcia ◽  
Yongcan Cao ◽  
David W. Casbeer
Keyword(s):  
Resource Utilization ◽  
Minimum Time ◽  
Convergence Time ◽  
Optimal Solutions ◽  
Communication Graphs ◽  
Global Performance ◽  
Efficient Resource ◽  
Multi Agent ◽  
Approximate Optimal Solutions ◽  
Selection Of

In many multi-agent scenarios, agents must balance both local and global performance and collaboration objectives with the constraints of efficient resource utilization. Here, consensus problems with fixed communication graphs are considered, where agents strive to reach a common decision value in minimum time while simultaneously minimizing a performance cost that measures the deviation of the decision value from the desired value. The paper offers preliminary results on the selection of meaningful decision values that approximate optimal solutions. The proposed approach shows a fast convergence time and also reduces the overall number of information transmissions by the agents in the network.

Developing Schedule With Linear Programming (Case Study: STTF II Project Komplek Sukamukti Banjaran)

2020 ◽  
Vol 4 (02) ◽  
pp. 34-45
Author(s):  
Naufal Dzikri Afifi ◽  
Ika Arum Puspita ◽  
Mohammad Deni Akbar
Keyword(s):  
Linear Programming ◽  
Objective Function ◽  
Project Scheduling ◽  
Time Limit ◽  
Minimum Time ◽  
Service Cost ◽  
Trade Off ◽  
Overtime Work ◽  
The Cost

Shift to The Front II Komplek Sukamukti Banjaran Project is one of the projects implemented by one of the companies engaged in telecommunications. In its implementation, each project including Shift to The Front II Komplek Sukamukti Banjaran has a time limit specified in the contract. Project scheduling is an important role in predicting both the cost and time in a project. Every project should be able to complete the project before or just in the time specified in the contract. Delay in a project can be anticipated by accelerating the duration of completion by using the crashing method with the application of linear programming. Linear programming will help iteration in the calculation of crashing because if linear programming not used, iteration will be repeated. The objective function in this scheduling is to minimize the cost. This study aims to find a trade-off between the costs and the minimum time expected to complete this project. The acceleration of the duration of this study was carried out using the addition of 4 hours of overtime work, 3 hours of overtime work, 2 hours of overtime work, and 1 hour of overtime work. The normal time for this project is 35 days with a service fee of Rp. 52,335,690. From the results of the crashing analysis, the alternative chosen is to add 1 hour of overtime to 34 days with a total service cost of Rp. 52,375,492. This acceleration will affect the entire project because there are 33 different locations worked on Shift to The Front II and if all these locations can be accelerated then the duration of completion of the entire project will be effective

Sign in / Sign up

Export Citation Format

Share Document