Andere Kunden interessierten sich auch für
![Optimizing Mean Mission Duration for Multiple-Payload Satellites]( "Optimizing Mean Mission Duration for Multiple-Payload Satellites")
Optimizing Mean Mission Duration for Multiple-Payload Satellites60,99 €![Requirements for Common Bomber Mission Planning Environment]( "Requirements for Common Bomber Mission Planning Environment")
Requirements for Common Bomber Mission Planning Environment60,99 €![Improving Detailed Integration in Close Air Support Planning and Execution]( "Improving Detailed Integration in Close Air Support Planning and Execution")
Improving Detailed Integration in Close Air Support Planning and Execution60,99 €![Multi-Objective Mission Route Planning Using Particle Swarm Optimization]( "Multi-Objective Mission Route Planning Using Particle Swarm Optimization")
Multi-Objective Mission Route Planning Using Particle Swarm Optimization61,99 €![Mission Route Planning with Multiple Aircraft and Targets Using Parallel A* Algorithm]( "Mission Route Planning with Multiple Aircraft and Targets Using Parallel A* Algorithm")
Mission Route Planning with Multiple Aircraft and Targets Using Parallel A* Algorithm61,99 €![Constellation Design of Geosynchronous Navigation Satellites Which Maximizes Availability and Accuracy Over a Specified Region of the Earth]( "Constellation Design of Geosynchronous Navigation Satellites Which Maximizes Availability and Accuracy Over a Specified Region of the Earth")
Constellation Design of Geosynchronous Navigation Satellites Which Maximizes Availability and Accuracy Over a Specified Region of the Earth61,99 €![Methods to Improve the Maintenance of the Earth Catalog of Satellites during Severe Solar Storms]( "Methods to Improve the Maintenance of the Earth Catalog of Satellites during Severe Solar Storms")
Methods to Improve the Maintenance of the Earth Catalog of Satellites during Severe Solar Storms60,99 €
Given an initial orbit and a set of other orbits of interest, the lowest change in velocity "path" between them is of high value. Software was developed to visualize the change in velocity required from a user defined window of burn to a user defined window of intercept. The time between burn and intercept is unrestricted. Multiple intercepts require searching an n! solution space, research then is focused on ways to pick optimal choices without fully calculating out the cost of doing all possible combinations. Some code was translated from BASIC and teh rest was newly develooped in MATLAB. The code was validated using orbits with known intercept solutions.