{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009145714,0.001074182,0.001453315,0.000790428,0.001109014,0.001134174,0.002696297,0.002334157,0.004794407],"category_scores_gemma":[0.003425688,0.0005894203,0.0007745248,0.001218157,0.001059887,0.002310767,0.001362089,0.0008810045,0.000642383],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007230517,"about_ca_system_score_gemma":0.0006016733,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002725325,"about_ca_topic_score_gemma":0.003137218,"domain_scores_codex":[0.9993452,0.000209226,0.00002643852,0.0001731839,0.0001145246,0.0001314448],"domain_scores_gemma":[0.9992853,0.0003798665,0.0001044349,0.00009650551,0.00004217276,0.00009176691],"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.0002290323,0.000167116,0.0007323569,0.0002732172,0.00005628066,0.0004698877,0.0002208356,0.9129507,0.00619551,0.02545814,0.002021598,0.05122537],"study_design_scores_gemma":[0.0000523543,0.0001297436,0.0003902655,0.00002036503,0.00002067581,0.0002868605,0.0002057845,0.9677045,0.003322678,0.02485261,0.002988123,0.00002599146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07659569,0.0002196869,0.9177033,0.0003892037,0.0000449715,0.0001208528,0.0001798016,0.0004155856,0.004330925],"genre_scores_gemma":[0.5191767,0.0002638775,0.471922,0.00009272083,0.00004199884,0.0002459152,0.0003897996,0.0001925767,0.007674335],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004794407,"threshold_uncertainty_score":0.01603895,"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."}}