{"id":{"repo_id":"vt","oai_identifier":"oai:vtechworks.lib.vt.edu:10919/54374"},"canonical_url":"https://search.dev.ndltd.org/etd/vt/oai:vtechworks.lib.vt.edu:10919/54374","repository":{"repo_id":"vt","name":"Virginia Tech","base_url":"https://vtechworks.lib.vt.edu/oai/request"},"display":{"title":"Improved convergence for optimization of evasive maneuvering","abstract":"Consider the problem of developing an algorithm that computes optimal preprogrammed evasive maneuvers for a Maneuvering Reentry Vehicle (MaRV) attacking a target defended with Anti-Ballistic Missiles (ABMs). The problem is large in terms of the number of optimization parameters, and perhaps in terms of the number of nonlinear constraints. Since both MaRV and ABM trajectories are expensive to compute, rapid convergence of the optimization algorithm is of prime concern. This paper examines a discontinuity in the cost function that degrades both the speed and the reliability of optimizer convergence. A solution is offered, proposing that the optimization algorithm be operated in a new parameter space, in which the discontinuity occurs at infinity. Effectively, the mapping prevents the optimization algorithm from crossing the discontinuity thereby improving optimizer convergence. Results comparing convergence with and without the parameter mapping demonstrate the effectiveness of the procedure.","abstract_html":"Consider the problem of developing an algorithm that computes optimal preprogrammed evasive maneuvers for a Maneuvering Reentry Vehicle (MaRV) attacking a target defended with Anti-Ballistic Missiles (ABMs). The problem is large in terms of the number of optimization parameters, and perhaps in terms of the number of nonlinear constraints. Since both MaRV and ABM trajectories are expensive to compute, rapid convergence of the optimization algorithm is of prime concern. This paper examines a discontinuity in the cost function that degrades both the speed and the reliability of optimizer convergence. A solution is offered, proposing that the optimization algorithm be operated in a new parameter space, in which the discontinuity occurs at infinity. Effectively, the mapping prevents the optimization algorithm from crossing the discontinuity thereby improving optimizer convergence. Results comparing convergence with and without the parameter mapping demonstrate the effectiveness of the procedure.","abstract_has_math":false,"creators":["Duffy, Niall J."],"institution":"Virginia Polytechnic Institute and State University","degree_name":"Master of Science","degree_level":"masters","degree_discipline":"Aerospace Engineering","degree_department":"Aerospace Engineering","school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":1988,"date_issued":"1988","date_published":"1988","updated_at":"2026-07-22T22:20:37Z","subjects":[],"languages":["en_US"],"rights":["In Copyright"],"rights_urls":["http://rightsstatements.org/vocab/InC/1.0/"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/10919/54374","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.department","label":"Department","values":["Aerospace Engineering"]},{"key":"dc:creator","label":"Author","values":["Duffy, Niall J."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2015-07-10T18:50:59Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2015-07-10T18:50:59Z"]},{"key":"dc:date.issued","label":"Date","values":["1988"]},{"key":"dc:publisher","label":"Institution","values":["Virginia Polytechnic Institute and State University"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"dc:type.dcmitype","label":"Dc Type Dcmitype","values":["Text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Aerospace Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["masters"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Virginia Polytechnic Institute and State University"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]},{"key":"dc:rights","label":"Dc Rights","values":["In Copyright"]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://rightsstatements.org/vocab/InC/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/10919/54374"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Consider the problem of developing an algorithm that computes optimal preprogrammed evasive maneuvers for a Maneuvering Reentry Vehicle (MaRV) attacking a target defended with Anti-Ballistic Missiles (ABMs). The problem is large in terms of the number of optimization parameters, and perhaps in terms of the number of nonlinear constraints. Since both MaRV and ABM trajectories are expensive to compute, rapid convergence of the optimization algorithm is of prime concern. This paper examines a discontinuity in the cost function that degrades both the speed and the reliability of optimizer convergence. A solution is offered, proposing that the optimization algorithm be operated in a new parameter space, in which the discontinuity occurs at infinity. Effectively, the mapping prevents the optimization algorithm from crossing the discontinuity thereby improving optimizer convergence. Results comparing convergence with and without the parameter mapping demonstrate the effectiveness of the procedure."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Master of Science"]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Improved convergence for optimization of evasive maneuvering"]}]}],"canonical_facts":{"dc:contributor.department":["Aerospace Engineering"],"dc:creator":["Duffy, Niall J."],"dc:date.accessioned":["2015-07-10T18:50:59Z"],"dc:date.available":["2015-07-10T18:50:59Z"],"dc:date.issued":["1988"],"dc:description.abstract":["Consider the problem of developing an algorithm that computes optimal preprogrammed evasive maneuvers for a Maneuvering Reentry Vehicle (MaRV) attacking a target defended with Anti-Ballistic Missiles (ABMs). The problem is large in terms of the number of optimization parameters, and perhaps in terms of the number of nonlinear constraints. Since both MaRV and ABM trajectories are expensive to compute, rapid convergence of the optimization algorithm is of prime concern. This paper examines a discontinuity in the cost function that degrades both the speed and the reliability of optimizer convergence. A solution is offered, proposing that the optimization algorithm be operated in a new parameter space, in which the discontinuity occurs at infinity. Effectively, the mapping prevents the optimization algorithm from crossing the discontinuity thereby improving optimizer convergence. Results comparing convergence with and without the parameter mapping demonstrate the effectiveness of the procedure."],"dc:description.degree":["Master of Science"],"dc:format.mimetype":["application/pdf"],"dc:identifier.uri":["http://hdl.handle.net/10919/54374"],"dc:language.iso":["en_US"],"dc:publisher":["Virginia Polytechnic Institute and State University"],"dc:rights":["In Copyright"],"dc:rights.uri":["http://rightsstatements.org/vocab/InC/1.0/"],"dc:title":["Improved convergence for optimization of evasive maneuvering"],"dc:type":["Thesis"],"dc:type.dcmitype":["Text"],"thesis:degree_discipline":["Aerospace Engineering"],"thesis:degree_level":["masters"],"thesis:degree_name":["Master of Science"],"thesis:institution_name":["Virginia Polytechnic Institute and State University"]},"updated_at":"2026-07-22T22:20:37Z"}