{"id":"W2976416243","doi":"10.1109/lra.2019.2944060","title":"Homotopic Approach for Robot Allocation Optimization Coupled With Path Constraints","year":2019,"lang":"en","type":"article","venue":"IEEE Robotics and Automation Letters","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"National Natural Science Foundation of China","keywords":"Path (computing); Task (project management); Computer science; Mathematical optimization; Motion planning; Robot; Process (computing); Transformation (genetics); Distributed computing; Homotopy; Artificial intelligence; Mathematics; Engineering; Computer network","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005267436,0.0009593506,0.0007763296,0.0005779135,0.000521921,0.000797415,0.0007769942,0.0007561737,0.003061355],"category_scores_gemma":[0.0008655504,0.0004277574,0.0006491056,0.0005691883,0.0008526256,0.0009689539,0.001262442,0.001121811,0.0003176438],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008667657,"about_ca_system_score_gemma":0.001006365,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003906052,"about_ca_topic_score_gemma":0.002502562,"domain_scores_codex":[0.9996984,0.0001053417,0.00001198137,0.00006760724,0.00008065194,0.00003596721],"domain_scores_gemma":[0.9997088,0.0001490866,0.0000413242,0.00002679287,0.00004880236,0.00002501181],"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.00002758218,0.00002047699,0.0001542625,0.00005651108,0.00003039003,0.00009720201,0.00005684567,0.939982,0.00222682,0.04122683,0.0006634771,0.01545757],"study_design_scores_gemma":[0.00000425206,0.00001785039,0.00003511089,0.000002759497,0.0000038461,0.00001036749,0.000008949892,0.9901665,0.0001951555,0.009106447,0.0004453582,0.000003403747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0083004,0.0001569169,0.9880481,0.0001014532,0.00002931782,0.00002142815,0.00001760141,0.00005886584,0.003266053],"genre_scores_gemma":[0.7412318,0.0006681947,0.2445077,0.0001751953,0.00009424067,0.0003781581,0.000124982,0.0001425657,0.01267704],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003906052,"threshold_uncertainty_score":0.01024127,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01078955747547306,"score_gpt":0.2124348639474545,"score_spread":0.2016453064719815,"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."}}