{"id":"W4248150365","doi":"10.1109/iros.2016.7759623","title":"An anticipative kinematic limitation avoidance algorithm for collaborative robots: Two-dimensional case","year":2016,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"","keywords":"Kinematics; Robot; Computer science; Task (project management); Obstacle avoidance; Obstacle; Robot kinematics; Position (finance); Collision avoidance; Principal (computer security); Artificial intelligence; Simulation; Control theory (sociology); Control engineering; Algorithm; Engineering; Mobile robot; Control (management); Collision","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":[],"consensus_categories":[],"category_scores_codex":[0.0005526898,0.0002354043,0.0002808269,0.0001474709,0.0002552646,0.0001157162,0.0004479341,0.00006567864,0.00001144981],"category_scores_gemma":[0.000244401,0.0001578715,0.00005276515,0.0005160835,0.00008874689,0.001299752,0.00007854948,0.00006795638,0.0000911293],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000892291,"about_ca_system_score_gemma":0.000172767,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002586157,"about_ca_topic_score_gemma":0.000009347483,"domain_scores_codex":[0.9980442,0.0002075081,0.0003739423,0.000626273,0.0003315909,0.0004164846],"domain_scores_gemma":[0.9971621,0.00120043,0.0002109994,0.0005527558,0.0006825873,0.000191112],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005143242,0.001112078,0.000383143,0.00006566423,0.0002939809,0.002759387,0.0114515,0.1550024,0.01410228,0.05874591,0.007791707,0.7482405],"study_design_scores_gemma":[0.001441626,0.0004498473,0.0003681901,0.00009377179,0.00001497075,0.0003737779,0.0001763844,0.9912642,0.002781143,0.002696055,0.00002191439,0.0003181355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007551271,0.00002876942,0.9900084,0.0009500232,0.0003561481,0.0006272093,0.00004932348,0.0002690181,0.0001598078],"genre_scores_gemma":[0.07520454,9.414672e-7,0.9237819,0.0002890048,0.0001063441,0.0001510272,0.00001096312,0.00001703812,0.0004382906],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8362617,"threshold_uncertainty_score":0.6437812,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03592314913863721,"score_gpt":0.31716236608721,"score_spread":0.2812392169485728,"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."}}