{"id":"W2330511976","doi":"10.1007/s10479-016-2145-0","title":"Static target search path planning optimization with heterogeneous agents","year":2016,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"ca_institutions":"Defence Research and Development Canada","funders":"Defence Research and Development Canada","keywords":"Mathematical optimization; Computer science; Motion planning; Integer programming; Key (lock); Relaxation (psychology); Theory of computation; Path (computing); Quadratic programming; Quadratic equation; Computational complexity theory; Mathematics; Algorithm; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":true,"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.001564757,0.001131442,0.001379507,0.0008656337,0.0007236208,0.001287233,0.001765689,0.001382778,0.001954555],"category_scores_gemma":[0.003480367,0.00109267,0.0008724661,0.001255794,0.001051203,0.001870925,0.00218979,0.001037203,0.0002969956],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00113068,"about_ca_system_score_gemma":0.001016997,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005458899,"about_ca_topic_score_gemma":0.003634679,"domain_scores_codex":[0.9992678,0.000243463,0.0000379395,0.0001823774,0.0001590492,0.0001094869],"domain_scores_gemma":[0.9989207,0.0006777075,0.0001167222,0.00009693529,0.0001157778,0.0000722862],"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.0000636513,0.00002844101,0.0001729991,0.00001930797,0.00002624507,0.000040448,0.00001845277,0.9843571,0.0004037745,0.003429332,0.0002542938,0.01118587],"study_design_scores_gemma":[0.000007310583,0.00001631721,0.00003904784,0.000001466047,0.000005141573,0.000004850283,0.000004869313,0.9974367,0.0001056447,0.002293045,0.00008372945,0.000001810361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05414813,0.0002609489,0.9401665,0.0001830403,0.00005572405,0.00005911459,0.0000556969,0.0001530681,0.004917738],"genre_scores_gemma":[0.8591112,0.0001910334,0.1348672,0.00008030685,0.00006600131,0.0001979593,0.0001293492,0.00006282909,0.005294054],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005458899,"threshold_uncertainty_score":0.01085424,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2427331212066753,"score_gpt":0.4363235730292383,"score_spread":0.193590451822563,"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."}}