{"id":"W2808619761","doi":"10.1108/ir-11-2017-0200","title":"Energy-optimal motion planning of a biped pole-climbing robot with kinodynamic constraints","year":2018,"lang":"en","type":"article","venue":"Industrial Robot the international journal of robotics research and application","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Motion planning; Robot; Computer science; Kinematics; Energy consumption; Trajectory; Climbing; Obstacle; Mobile robot; Control theory (sociology); Mathematical optimization; Control engineering; Simulation; Artificial intelligence; Engineering; Mathematics; Control (management)","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.00203242,0.0001527527,0.0002412027,0.00047679,0.0002283075,0.0002675797,0.001637113,0.0001323319,0.000003972803],"category_scores_gemma":[0.0002600494,0.0001084947,0.00005170451,0.000568819,0.0007148676,0.0004084466,0.0003052402,0.0006170527,0.000003751485],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001500521,"about_ca_system_score_gemma":0.0003585778,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000891644,"about_ca_topic_score_gemma":0.000003952382,"domain_scores_codex":[0.9970399,0.0001946033,0.0006154175,0.000274693,0.001541426,0.0003340312],"domain_scores_gemma":[0.9963756,0.0005991206,0.0006571009,0.0003160739,0.001901679,0.0001503771],"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.0009553916,0.0005007807,0.00496825,0.00001387698,0.0006007749,0.0001155037,0.001472041,0.5931427,0.04795836,0.04920295,0.0008402069,0.3002291],"study_design_scores_gemma":[0.003679733,0.002375614,0.003162647,0.0006881641,0.00004488714,0.001271945,0.0005742691,0.9596968,0.0215467,0.006281697,0.0003212364,0.0003562639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02100807,0.00006715839,0.9747198,0.003426373,0.0003821207,0.0001675491,0.000004034541,0.00001757096,0.0002073093],"genre_scores_gemma":[0.9349964,0.00002275178,0.06402736,0.00004450102,0.0008375708,0.000007074893,0.000005870844,0.00001259211,0.00004583375],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9139884,"threshold_uncertainty_score":0.4424284,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09203694439260827,"score_gpt":0.3539974542441305,"score_spread":0.2619605098515222,"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."}}