{"id":"W2140995153","doi":"10.1115/imece2010-38914","title":"An Optimal Orthogonal Recharging Route Planner: A Multi-Robots, Multi-Rendezvous Recharging Scheme","year":2010,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Rendezvous; Robot; Tree traversal; Planner; Computer science; Scheme (mathematics); Orthogonal array; Work (physics); Real-time computing; Simulation; Mathematical optimization; Engineering; Mathematics; Artificial intelligence; 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":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001002146,0.000306442,0.000262671,0.0002990557,0.0004150549,0.0006202259,0.001492613,0.0002073024,0.0003799156],"category_scores_gemma":[0.0001185797,0.0002802723,0.0001029132,0.0005473394,0.00007284662,0.001662693,0.0003747516,0.000848727,0.0002122311],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004266384,"about_ca_system_score_gemma":0.0002044636,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000631153,"about_ca_topic_score_gemma":0.0001454107,"domain_scores_codex":[0.9972959,0.0001373509,0.0004307513,0.0008807155,0.0004743192,0.000781025],"domain_scores_gemma":[0.9980971,0.00008012172,0.0001307623,0.0009665038,0.000235973,0.0004895462],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001512246,0.00363523,0.01779701,0.0001327866,0.0002509661,0.0004338581,0.01147825,0.1520388,0.2302738,0.2876182,0.002949347,0.2932406],"study_design_scores_gemma":[0.001101829,0.00007089533,0.0006374805,0.00001845157,0.000002926618,0.00006084991,0.00006617805,0.9922267,0.002600328,0.00004560002,0.002747172,0.000421558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0132583,0.00002908323,0.9825922,0.0009602706,0.0006607092,0.0003354675,0.000009114149,0.001001063,0.001153752],"genre_scores_gemma":[0.09522972,0.00001949277,0.9017603,0.000641964,0.000114434,0.00003754451,0.0000379144,0.00003373545,0.002124904],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.840188,"threshold_uncertainty_score":0.999965,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04297016576045565,"score_gpt":0.3196854649808724,"score_spread":0.2767152992204168,"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."}}