{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006470633,0.001113929,0.0009072553,0.0006755005,0.0005527326,0.0006681631,0.001486304,0.0008839449,0.002154543],"category_scores_gemma":[0.001389709,0.000743406,0.0009104134,0.0007890802,0.001080912,0.0008464624,0.001040205,0.001409033,0.000453597],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007018723,"about_ca_system_score_gemma":0.001063464,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002421366,"about_ca_topic_score_gemma":0.002183002,"domain_scores_codex":[0.9995127,0.0001387249,0.00002037988,0.00006457166,0.0002226534,0.00004101068],"domain_scores_gemma":[0.999633,0.0002241277,0.00003975138,0.00002927013,0.00005985394,0.00001395728],"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.0000210555,0.00002206447,0.00008182614,0.00007033521,0.00002586622,0.00004536451,0.00007334694,0.9144731,0.002568701,0.03416387,0.0005996228,0.04785494],"study_design_scores_gemma":[0.0000113527,0.00003849848,0.00003389802,0.00001231836,0.000006101996,0.00002816961,0.000009976136,0.9771653,0.001222401,0.01887753,0.002582562,0.00001181331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006972959,0.00005292339,0.9980787,0.00003209489,0.000006209637,0.00001479871,0.000004731504,0.00007763353,0.001035669],"genre_scores_gemma":[0.09500839,0.0004007847,0.9010978,0.00005811314,0.00003522334,0.0003863714,0.00005376289,0.0001750501,0.002784624],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002421366,"threshold_uncertainty_score":0.007207632,"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."}}