{"id":"W2053680637","doi":"10.1007/s11590-015-0874-7","title":"An information theoretic based integer linear programming approach for the discrete search path planning problem","year":2015,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université TÉLUQ; Université du Québec à Montréal; Defence Research and Development Canada","funders":"","keywords":"Mathematical optimization; Computer science; Motion planning; Heuristics; Integer programming; Heuristic; Entropy (arrow of time); Mathematics; Artificial intelligence","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.001395452,0.0001613554,0.0001201792,0.0001703537,0.0003169084,0.0007842688,0.0007744303,0.00006242877,0.000006942732],"category_scores_gemma":[0.00009105037,0.0001142222,0.0000542267,0.0005534575,0.00009941668,0.002094218,0.00008392899,0.0001794856,0.000005625175],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006591673,"about_ca_system_score_gemma":0.000137073,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009540416,"about_ca_topic_score_gemma":1.083697e-7,"domain_scores_codex":[0.9983854,0.000188178,0.0003131207,0.000271612,0.0004752312,0.0003664509],"domain_scores_gemma":[0.9987579,0.0001163408,0.0001248734,0.0004702629,0.0003587604,0.0001718733],"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.00002210822,0.00002978943,0.00008442353,0.00002956481,0.000008663084,3.155595e-7,0.002826318,0.9877267,0.000009406926,0.005565107,0.0006557241,0.003041893],"study_design_scores_gemma":[0.0006816826,0.0001205813,0.000005520313,0.00001720137,0.000006860921,0.00000222032,0.0003963239,0.9964412,0.00004808241,0.00003560435,0.002078805,0.0001659188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003596568,0.0000119137,0.9927231,0.005154429,0.00009024619,0.001303627,0.000004552423,0.0002389365,0.0004372262],"genre_scores_gemma":[0.04460956,0.000002517141,0.9517764,0.002905487,0.00006395033,0.0003020165,0.0003012223,0.00001874771,0.00002006522],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04457359,"threshold_uncertainty_score":0.7562722,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03145900289209521,"score_gpt":0.2827877760298572,"score_spread":0.251328773137762,"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."}}