{"id":"W2937446061","doi":"10.48550/arxiv.1904.04374","title":"Collision-aware Task Assignment for Multi-Robot Systems","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Bidding; Robot; Collision avoidance; Task (project management); Collision; Computer science; Function (biology); Reduction (mathematics); Binary number; Mathematical optimization; Distributed computing; Artificial intelligence; Engineering; Mathematics; Computer security","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"],"consensus_categories":[],"category_scores_codex":[0.0004102055,0.00031415,0.0003968293,0.0002637314,0.0002045384,0.0003428407,0.00197259,0.0003304907,0.00001414301],"category_scores_gemma":[0.00003421563,0.0003383833,0.0002239513,0.0003905575,0.00005412796,0.0003446563,0.001738936,0.0003731782,0.0001662682],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000372302,"about_ca_system_score_gemma":0.0003873016,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009232932,"about_ca_topic_score_gemma":0.000009057164,"domain_scores_codex":[0.9977362,0.000178766,0.0002648502,0.001212951,0.0001636632,0.0004435416],"domain_scores_gemma":[0.9976107,0.0001581256,0.0002859252,0.001317728,0.0003973336,0.0002301196],"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.0000122559,0.0001034335,0.0003074938,0.0001802203,0.00006121169,0.00002488704,0.0001197176,0.9528462,0.000012515,0.04471618,0.001532978,0.00008294874],"study_design_scores_gemma":[0.0009682319,0.0000814203,0.00007108338,0.0001542079,0.00002488672,0.000001494405,0.0000797037,0.9941272,0.0000274901,0.0007656447,0.003302071,0.0003966368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0008334842,0.00006752458,0.9946407,0.0001117147,0.001649038,0.001819238,0.00007908503,0.0002478152,0.0005514194],"genre_scores_gemma":[0.9693239,0.0001782908,0.01557732,0.0001022805,0.00006300565,0.00001386162,0.00007306576,0.00002959396,0.01463872],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9790633,"threshold_uncertainty_score":0.9999068,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1685055988817857,"score_gpt":0.2322477806151436,"score_spread":0.06374218173335788,"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."}}