{"id":"W2985558354","doi":"10.1109/mrs.2019.8901079","title":"On Minimum Time Multi-Robot Planning with Guarantees on the Total Collected Reward","year":2019,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Robot; Computer science; Mobile robot; Motion planning; Value (mathematics); Approximation algorithm; Mathematical optimization; Algorithm; Artificial intelligence; Mathematics; Machine learning","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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001750276,0.0001097265,0.0001072989,0.00007847874,0.0001274823,0.0001727577,0.0004325037,0.00003483034,0.0004012801],"category_scores_gemma":[0.00003487647,0.0000584299,0.00002658955,0.000380656,0.00002674018,0.0001305465,0.00007744465,0.0001373672,0.001185932],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000020742,"about_ca_system_score_gemma":0.00005729745,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008183675,"about_ca_topic_score_gemma":0.000001552265,"domain_scores_codex":[0.9990037,0.00008143869,0.0001108846,0.0002752028,0.0003032553,0.0002255067],"domain_scores_gemma":[0.9991601,0.0002786031,0.00003885348,0.0004055026,0.00006771924,0.00004927768],"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.0004550273,0.0007275749,0.0008900897,0.00002720411,0.0001432588,0.00005124092,0.007566772,0.8169599,0.00751413,0.1037484,0.06038891,0.001527544],"study_design_scores_gemma":[0.0008277469,0.0007553876,0.001627512,0.00006726896,0.000001192203,0.000007129178,0.0000501376,0.9953334,0.0008543151,0.00006903351,0.0002562422,0.0001506827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3002499,0.00001683913,0.5457106,0.008849325,0.0003123694,0.001666065,0.000003617998,0.0007517116,0.1424395],"genre_scores_gemma":[0.842525,0.000001534038,0.04713034,0.002367771,0.00001971203,0.00002370081,0.000004233876,0.00001814366,0.1079096],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5422751,"threshold_uncertainty_score":0.9995918,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02079273884856707,"score_gpt":0.2439213876007203,"score_spread":0.2231286487521532,"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."}}