{"id":"W2106599774","doi":"10.1109/robot.2007.363760","title":"The Frugal Feeding Problem: Energy-efficient, multi-robot, multi-place rendezvous","year":2007,"lang":"en","type":"article","venue":"Proceedings - IEEE International Conference on Robotics and Automation/Proceedings","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rendezvous; Travelling salesman problem; Robot; Heuristics; Mathematical optimization; Computer science; Set (abstract data type); Mobile robot; Set cover problem; Robot kinematics; Energy (signal processing); Euclidean geometry; Artificial intelligence; Algorithm; Mathematics; Engineering","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001826051,0.0006327618,0.0004201196,0.0005620503,0.001156466,0.002715745,0.00210684,0.0002764691,0.000007985539],"category_scores_gemma":[0.0003310241,0.0005300628,0.0001361516,0.0007696477,0.0002726645,0.00118116,0.0004464414,0.0006629283,0.00004126034],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003161319,"about_ca_system_score_gemma":0.0001293332,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004300682,"about_ca_topic_score_gemma":0.000006153794,"domain_scores_codex":[0.9952976,0.000008729893,0.001056148,0.001210884,0.001399301,0.001027323],"domain_scores_gemma":[0.9962843,0.0002113207,0.0008818298,0.000188698,0.0020421,0.0003917684],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006311568,0.0004314978,0.002221478,0.00008637075,0.0001723416,0.00001804427,0.003375148,0.008670892,0.01323617,0.9544429,0.002774042,0.01450805],"study_design_scores_gemma":[0.001063504,0.0001552871,0.004617584,0.0003269433,0.00002612214,0.0001561348,0.0008112412,0.9864907,0.002818745,0.002124664,0.0007410597,0.0006680324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02422866,0.0001308194,0.9388097,0.009362005,0.003017724,0.0007517362,0.00001516549,0.00144175,0.02224244],"genre_scores_gemma":[0.6787671,0.0001043531,0.3182763,0.0004293315,0.0003785846,0.00006336643,0.000007768791,0.00005421746,0.001918992],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9778198,"threshold_uncertainty_score":0.9997151,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04697058972676788,"score_gpt":0.2972693068909485,"score_spread":0.2502987171641807,"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."}}