{"id":"W4289785486","doi":"10.48550/arxiv.2208.01222","title":"Optimal and Bounded-Suboptimal Multi-Goal Task Assignment and Path Finding","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Southern California; Simon Fraser University; National Science Foundation","keywords":"Task (project management); Benchmark (surveying); Path (computing); Bounded function; Sequence (biology); Computer science; Assignment problem; Weapon target assignment problem; Mathematical optimization; Generalized assignment problem; Variety (cybernetics); Algorithm; Mathematics; Artificial intelligence","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001522241,0.001339703,0.001083601,0.0007669561,0.001039912,0.001434537,0.002232397,0.002173306,0.004578756],"category_scores_gemma":[0.008363229,0.0006071471,0.0007788085,0.001460222,0.00167197,0.002750341,0.002060768,0.001941456,0.0007464695],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001849107,"about_ca_system_score_gemma":0.004273249,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006921784,"about_ca_topic_score_gemma":0.008157399,"domain_scores_codex":[0.9980983,0.0005606044,0.00007769423,0.0005657856,0.000384069,0.0003134792],"domain_scores_gemma":[0.9964697,0.00218471,0.0003218947,0.0006359774,0.0002467874,0.0001408768],"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.0001144878,0.0001495782,0.0006494487,0.0002369045,0.0000301319,0.00007840898,0.00009915436,0.876058,0.001600684,0.05128677,0.006240977,0.06345548],"study_design_scores_gemma":[0.00003555565,0.00005792846,0.0001847548,0.00002219637,0.00001023465,0.00007105778,0.00005909978,0.9357918,0.001383766,0.05932372,0.003049579,0.00001026831],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0269859,0.0005606927,0.9591916,0.0009508174,0.00008626028,0.0001551385,0.0003468881,0.001046857,0.01067581],"genre_scores_gemma":[0.3158221,0.0003738763,0.6797208,0.0002072269,0.00004824264,0.0002393932,0.0007384641,0.0002258593,0.002624032],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006921784,"threshold_uncertainty_score":0.0153175,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07614609090562321,"score_gpt":0.2082556388280741,"score_spread":0.1321095479224509,"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."}}