A Class of Co-Design Problems With Cyclic Constraints and Their Solution
A Class of Co-Design Problems With Cyclic Constraints and Their Solution
复制标题
一类带循环约束的协同设计问题及其求解
DOI:
10.1109/lra.2016.2535127
复制
发表时间:
2017
影响因子:
5.2
通讯作者:
A. Censi
中科院分区:
文献类型:
--
作者:
A. Censi
Co-design problems in the field of robotics involve the tradeoff of “resources” usage, such as cost, execution time, and energy, with mission performance, under recursive constraints that involve energetics, mechanics, computation, and communication. This letter shows that a large class of codesign problems have a common structure, as they are described by two posets, representing functionality, and resources. The codesign constraints can be expressed as two maps in opposite directions between the two posets. Finding the most resource-economical feasible solution is equivalent to finding the least fixed point of the composition of those two maps. If the two maps are monotone, results from order theory allow concluding uniqueness and systematically deriving an optimal design or a certificate for infeasibility.