{"id":"W2057598075","doi":"10.1109/cisda.2012.6291538","title":"Toward optimizing static target search path planning","year":2012,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Montréal; Defence Research and Development Canada; Université TÉLUQ; Institut National d'Optique","funders":"","keywords":"Mathematical optimization; Heuristics; Computer science; Motion planning; Heuristic; Integer programming; Path (computing); Relaxation (psychology); Linear programming; 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.0007850503,0.0001513447,0.0001725699,0.0001165482,0.0001233949,0.0001524059,0.0007358075,0.00005219812,0.00004042461],"category_scores_gemma":[0.00005072439,0.0001305275,0.0000419223,0.000309494,0.00002655273,0.0009063015,0.0003200019,0.0002132105,0.0002802183],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005333549,"about_ca_system_score_gemma":0.00006357765,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002505539,"about_ca_topic_score_gemma":7.032721e-9,"domain_scores_codex":[0.998207,0.00009597604,0.0002081435,0.0002781923,0.0004298412,0.0007808158],"domain_scores_gemma":[0.9990305,0.0001729948,0.00004528529,0.0004287765,0.00004585618,0.0002766044],"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.00002091269,0.0007132406,0.1162274,0.0002656952,0.0002357967,0.0007560816,0.1230765,0.5890483,0.002047973,0.07704202,0.04742271,0.04314333],"study_design_scores_gemma":[0.0002436218,0.00006207633,0.004978264,0.00004697885,0.000003896605,0.00008289955,0.0005018719,0.9911668,0.001429099,0.0003222685,0.0008494607,0.0003128135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003124265,0.0002390939,0.9866332,0.0004368513,0.0005776956,0.0001029833,0.000001152588,0.0003844287,0.008500274],"genre_scores_gemma":[0.2477051,0.00000154982,0.7515175,0.0003150035,0.0001066755,0.000006216385,0.000002788789,0.00001024724,0.0003349089],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4021184,"threshold_uncertainty_score":0.5322759,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07820885651380662,"score_gpt":0.3075316787737843,"score_spread":0.2293228222599777,"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."}}