{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004679309,0.0004146541,0.0004101255,0.0002789281,0.0004882658,0.0003236236,0.001210699,0.0002279408,0.00002310107],"category_scores_gemma":[0.00003400107,0.0005047965,0.0001024431,0.0003105654,0.0001822687,0.000375449,0.00558659,0.0009173858,0.0000112635],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003307932,"about_ca_system_score_gemma":0.000203058,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001046561,"about_ca_topic_score_gemma":0.00000162418,"domain_scores_codex":[0.9972699,0.0002037585,0.0002246163,0.001590969,0.0001890506,0.0005217344],"domain_scores_gemma":[0.9984046,0.0001505252,0.0002646377,0.000845365,0.00004711958,0.0002878128],"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.00003470642,0.0001815219,0.01540694,0.0001090863,0.0001880212,0.002893635,0.00176052,0.9583021,0.00007035127,0.01953346,0.0002329561,0.00128668],"study_design_scores_gemma":[0.0008132371,0.0001343383,0.007051908,0.0000642376,0.00006259012,0.00004834361,0.0002064107,0.9895631,0.00001256524,0.001141892,0.0003208496,0.0005805428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2678945,0.0001684887,0.7305496,0.00006513049,0.0005277833,0.0002642157,0.00003198077,0.0001949404,0.0003032705],"genre_scores_gemma":[0.818103,0.0001384003,0.1805573,0.00006154173,0.00004970802,0.000003101468,0.00002098564,0.00002367299,0.001042304],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5502084,"threshold_uncertainty_score":0.9997404,"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."}}