{"id":"W4389778286","doi":"10.1016/j.actaastro.2023.12.024","title":"Traveling Salesman Problem of optimal debris removal sequence using non-population gradient search","year":2023,"lang":"en","type":"article","venue":"Acta Astronautica","topic":"Space Satellite Systems and Control","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University","funders":"National Natural Science Foundation of China","keywords":"Travelling salesman problem; Sequence (biology); Population; Rendezvous; Mathematical optimization; Estimator; Mathematics; Kalman filter; Metric (unit); Trajectory; Spacecraft; Integer (computer science); Space debris; Computer science; Algorithm; Statistics; Engineering; Physics; Aerospace engineering","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002705672,0.0001453671,0.0002225424,0.0001177932,0.0000597499,0.00002330139,0.0001247028,0.00006909581,0.00001522495],"category_scores_gemma":[0.000006904445,0.000148526,0.00007141216,0.0003370088,0.00002736712,0.0001103152,0.0000305329,0.0001434862,0.00002114289],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009947345,"about_ca_system_score_gemma":0.00002631825,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002197617,"about_ca_topic_score_gemma":0.00001644961,"domain_scores_codex":[0.9988213,0.00002557981,0.0003062212,0.0001867564,0.0002527863,0.0004074042],"domain_scores_gemma":[0.9996,0.00003478868,0.00003855886,0.0002030621,0.00004210064,0.00008148321],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002572792,0.00001950323,0.006640081,0.0002760804,0.0001167611,0.00003255945,0.001301018,0.4917919,0.4723599,0.0004557631,0.00005899394,0.02692168],"study_design_scores_gemma":[0.0003216079,0.000049382,0.02425583,0.000143885,0.00002918115,0.00002725644,0.0003154278,0.9694759,0.004621768,0.00003114255,0.0005525301,0.0001761224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9903291,0.00005265141,0.008674975,0.00005550331,0.0001248248,0.0002630487,0.00001357832,0.0001503026,0.0003360194],"genre_scores_gemma":[0.9884506,0.00001376849,0.01131392,0.000002633317,0.0000859823,0.000008405932,0.0000306775,0.00003973229,0.00005428994],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.477684,"threshold_uncertainty_score":0.6056713,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02728615454541062,"score_gpt":0.260443076391968,"score_spread":0.2331569218465574,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}