{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002037669,0.001235747,0.001845278,0.001707347,0.0006165169,0.002339293,0.002448473,0.001782185,0.005725673],"category_scores_gemma":[0.005984629,0.001092046,0.001305179,0.0024204,0.001511214,0.003218781,0.001726167,0.003343811,0.0006592536],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002472308,"about_ca_system_score_gemma":0.002365832,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004692923,"about_ca_topic_score_gemma":0.00468202,"domain_scores_codex":[0.9986557,0.000499388,0.00005440501,0.0001851543,0.0004990892,0.0001062719],"domain_scores_gemma":[0.9971913,0.002234171,0.0001620394,0.0001022238,0.0002301692,0.00008015177],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003144591,0.00005490214,0.00008196973,0.000106675,0.00002742504,0.00003736524,0.00004139364,0.8450701,0.0003491688,0.1344024,0.0015545,0.01824254],"study_design_scores_gemma":[0.000006915937,0.00001576352,0.00001818099,0.00001167639,0.000005972689,0.000008042422,0.000005002218,0.9634452,0.00007646332,0.03588248,0.0005182461,0.000005954013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001568444,0.0002393633,0.9936993,0.0003324772,0.00004896121,0.00003032941,0.00006957252,0.0000520361,0.003959456],"genre_scores_gemma":[0.3064874,0.001604359,0.6787723,0.0004666519,0.0003710542,0.000543939,0.0003959343,0.0002099259,0.01114838],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005725673,"threshold_uncertainty_score":0.01915431,"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."}}