{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004628007,0.0004804579,0.0006145296,0.0003516142,0.0003478205,0.0004253498,0.001104185,0.000639607,0.001969543],"category_scores_gemma":[0.0006914252,0.000224624,0.0002933586,0.000434915,0.0004083525,0.0005426544,0.0007859115,0.0004235727,0.000372391],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004368671,"about_ca_system_score_gemma":0.001175262,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002924292,"about_ca_topic_score_gemma":0.003857882,"domain_scores_codex":[0.9997368,0.0000658502,0.00001104158,0.00007647365,0.00006343862,0.00004635987],"domain_scores_gemma":[0.9998054,0.00004992248,0.00004775318,0.00003928054,0.0000334805,0.00002409439],"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.0002554674,0.00008784104,0.0004860924,0.0001400245,0.00003220057,0.0001462793,0.0001362639,0.8045198,0.01604158,0.01576066,0.001972633,0.1604212],"study_design_scores_gemma":[0.00003541517,0.0001108147,0.0001589125,0.000004936514,0.000008837555,0.00006659092,0.00003230923,0.992554,0.002654608,0.002355332,0.002004262,0.00001383122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02198176,0.00009685625,0.9746187,0.00008428686,0.00001734946,0.00006657085,0.00004965665,0.0004693403,0.002615388],"genre_scores_gemma":[0.5110788,0.0001103379,0.4832308,0.00003421215,0.00001156477,0.0001209238,0.000101951,0.00005291802,0.005258328],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002924292,"threshold_uncertainty_score":0.006588817,"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."}}