{"id":"W2110926800","doi":"10.1109/robot.1996.506579","title":"Iterative dynamic programming: an approach to minimum energy trajectory planning for robotic manipulators","year":2002,"lang":"en","type":"article","venue":"","topic":"Robotic Mechanisms and Dynamics","field":"Engineering","cited_by":103,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Dynamic programming; Computer science; Maxima and minima; Mathematical optimization; Curse of dimensionality; Trajectory; Iterative and incremental development; Computation; Iterative method; Algorithm; Mathematics; Artificial intelligence","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.00006685282,0.0002420261,0.0002423683,0.0001396196,0.00008139757,0.0000868166,0.0001684178,0.0001104766,0.00003123217],"category_scores_gemma":[0.000007646589,0.0002294977,0.00007501664,0.0001653092,0.00001109984,0.0001457943,0.00001673512,0.00008182637,0.000007317264],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008029769,"about_ca_system_score_gemma":0.000004322218,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006123501,"about_ca_topic_score_gemma":0.0000112947,"domain_scores_codex":[0.9988757,0.00001372016,0.0002429709,0.0003106591,0.0001283066,0.0004286074],"domain_scores_gemma":[0.999463,0.00003082285,0.00002095382,0.0002432216,0.00002744085,0.0002145368],"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.000004180308,0.00007817282,0.00001090192,0.0000475602,0.00003281654,0.000002569797,0.0008867744,0.9748645,0.0003660255,0.0175613,0.0002253565,0.005919874],"study_design_scores_gemma":[0.0002297602,0.000157596,0.00004075023,0.00001477828,0.00001854074,0.000009735554,0.0004036736,0.998119,0.00006462299,0.0002602144,0.0003579986,0.0003233044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0046893,0.00009670007,0.9889663,0.00001292713,0.000290035,0.0003538824,0.000002128732,0.0004475166,0.00514121],"genre_scores_gemma":[0.5402866,0.000002543542,0.457916,0.00007748532,0.00006065388,0.0001544016,0.00003773345,0.00007101479,0.001393532],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5355973,"threshold_uncertainty_score":0.9358646,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03164783068906468,"score_gpt":0.2362625010880998,"score_spread":0.2046146703990352,"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."}}