Moon Landing Trajectory Optimization
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2016, Vol 7, Issue 3
Abstract
Trajectory optimization is a crucial process during the planning phase of a spacecraft landing mission. Once a trajectory is determined, guidance algorithms are created to guide the vehicle along the given trajectory. Because fuel mass is a major driver of the total vehicle mass, and thus mission cost, the objective of most guidance algorithms is to minimize the required fuel consumption. Most of the existing algorithms are termed as “near-optimal” regarding fuel expenditure. The question arises as to how close to optimal are these guidance algorithms. To answer this question, numerical trajectory optimization techniques are often required. With the emergence of improved processing power and the application of new methods, more direct approaches may be employed to achieve high accuracy without the associated difficulties in computation or pre-existing knowledge of the solution. An example of such an approach is DIDO optimization. This technique is applied in the current research to find these minimum fuel optimal trajectories.
Authors and Affiliations
Ibrahim MEHEDI, Md. Shofiqul ISLAM
Keywords
Related Articles
- EP ID EP128221
- DOI 10.14569/IJACSA.2016.070341
- Views 87
- Downloads 0
Web Server Performance Evaluation in a Virtualisation Environment
Operational and investment costs are reduced by resource sharing in virtual machine (VM) environments, which also results in an overhead for hosted services. VM machine performance is important because of resource conten...
A New Hybrid Network Sniffer Model Based on Pcap Language and Sockets (Pcapsocks)
Nowadays, the protection and the security of data transited within computer networks represent a real challenge for developers of computer applications and network administrators. The Intrusion Detection System and Intru...
Analysis and Selection of Features for Gesture Recognition Based on a Micro Wearable Device
More and More researchers concerned about designing a health supporting system for elders that is light weight, no disturbing to user, and low computing complexity. In the paper, we introduced a micro wearable dev...
Solving the Free Clustered TSP Using a Memetic Algorithm
The free clustered travelling salesman problem (FCTSP) is an extension of the classical travelling salesman problem where the set of vertices is partitioned into clusters, and the task is to find a minimum cost Hamiltoni...
Negotiation as a Collaborative Tool for Determining Permissions and Detection of Malicious Applications
In Android OS users find it very difficult to understand and comprehend its permission mechanism. Frequently, users tend to ignore permission negotiations dialogs during installation of an application. Users, who pay att...