{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006625481,0.0007271892,0.000648018,0.0006139071,0.0003426828,0.0007437812,0.0007279984,0.0006537448,0.001713673],"category_scores_gemma":[0.002261385,0.0004841245,0.0003429106,0.0007286901,0.0006331743,0.0008615588,0.0007951641,0.0007533772,0.0003260535],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008353784,"about_ca_system_score_gemma":0.001655708,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006827754,"about_ca_topic_score_gemma":0.005682691,"domain_scores_codex":[0.9996834,0.00008949137,0.00000974471,0.0000581565,0.0001085991,0.00005062183],"domain_scores_gemma":[0.9995389,0.0002486776,0.00005795483,0.00003695484,0.00008946897,0.0000280771],"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.00001782733,0.00001112383,0.0001364869,0.00002372329,0.000005156943,0.00001661224,0.0000169681,0.983416,0.0006552532,0.003603257,0.0003910077,0.01170651],"study_design_scores_gemma":[0.000002956256,0.00001122003,0.00003567387,0.000002413272,0.000001916268,0.000004938202,0.000009823683,0.9971674,0.0002004078,0.002283134,0.0002787194,0.000001344747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03203503,0.000224537,0.9618891,0.0001479704,0.00002333196,0.00003782203,0.00005610862,0.0004229346,0.005163184],"genre_scores_gemma":[0.6876323,0.0004585988,0.3076166,0.00008965165,0.00003303971,0.0001450783,0.0002245798,0.0001466975,0.00365341],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006827754,"threshold_uncertainty_score":0.01357597,"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."}}