{"id":"W2944974408","doi":"10.1007/s10878-019-00413-1","title":"An evolutionary approach for the target search problem in uncertain environment","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"Defence Research and Development Canada; Université Laval","funders":"","keywords":"Theory of computation; Evolutionary algorithm; Mathematical optimization; Computer science; Mathematical economics; Mathematics; Theoretical computer science; Algorithm","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low","status":"direct model label, unvalidated"},{"model":"gpt","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low","status":"direct model label, unvalidated"}],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006651091,0.0006023087,0.0008348754,0.001086923,0.0005606819,0.0007528476,0.001528422,0.001714237,0.002582105],"category_scores_gemma":[0.002442397,0.0005383372,0.0009114627,0.001265711,0.0007568547,0.001070239,0.001207764,0.001151413,0.0002376171],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006572524,"about_ca_system_score_gemma":0.000731934,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003437452,"about_ca_topic_score_gemma":0.002848436,"domain_scores_codex":[0.9997119,0.0000794052,0.00001315377,0.00004285289,0.0001170597,0.0000356117],"domain_scores_gemma":[0.9994917,0.0003109972,0.0000322683,0.00001991623,0.0001141045,0.00003095418],"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.00002032318,0.00004095216,0.0002815574,0.00005836433,0.00004370457,0.0001120388,0.00006872273,0.9102756,0.00123496,0.04623257,0.0007296005,0.04090174],"study_design_scores_gemma":[0.000006825294,0.00001629233,0.00006066685,0.000007378431,0.000007249845,0.00003182669,0.000008259134,0.9914021,0.0001072213,0.007803347,0.0005447092,0.000004101322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008099476,0.0002075807,0.9874939,0.0001920232,0.00004598776,0.00002494466,0.00001501623,0.0000337141,0.003887199],"genre_scores_gemma":[0.3495414,0.0007787381,0.6397359,0.0002477968,0.0001283219,0.0002787279,0.0001017797,0.0001011992,0.009086095],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003437452,"threshold_uncertainty_score":0.008638024,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01441698364284747,"score_gpt":0.2473417136439673,"score_spread":0.2329247300011199,"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."}}