首页 /研究 /NP-completeness of optimal planning problem for modular robots
OTHER

NP-completeness of optimal planning problem for modular robots

Zipeng Ye, Minjing Yu, Yong‐Jin Liu

发表年份
2019
引用次数
9

关键词

Computer scienceRobotSelf-reconfiguring modular robotModular designMotion planningCompleteness (order theory)Mathematical proofMathematical optimizationControl reconfigurationA priori and a posteriori

相关论文

查看 OTHER 分类全部论文