A Mathematical Theory of Co-Design

One of the challenges of modern engineering, and robotics in particular, is designing complex systems, composed of many subsystems, rigorously and with optimality guarantees. This paper introduces a theory of co-design that describes "design problems", defined as tuples of "functionality space", "implementation space", and "resources space", together with a feasibility relation that relates the three spaces. Design problems can be interconnected together to create "co-design problems", which describe possibly recursive co-design constraints among subsystems. A co-design problem induces a family of optimization problems of the type "find the minimal resources needed to implement a given functionality"; the solution is an antichain (Pareto front) of resources. A special class of co-design problems are Monotone Co-Design Problems (MCDPs), for which functionality and resources are complete partial orders and the feasibility relation is monotone and Scott continuous. The induced optimization problems are multi-objective, nonconvex, nondifferentiable, noncontinuous, and not even defined on continuous spaces; yet, there exists a complete solution. The antichain of minimal resources can be characterized as a least fixed point, and it can be computed using Kleene's algorithm. The computation needed to solve a co-design problem can be bounded by a function of a graph property that quantifies the interdependence of the subproblems. These results make us much more optimistic about the problem of designing complex systems in a rigorous way.

[1]  Steven M. LaValle,et al.  Sensing and Filtering: A Fresh Perspective Based on Preimages and Information Spaces , 2012, Found. Trends Robotics.

[2]  Michael A. Arbib,et al.  Algebraic Approaches to Program Semantics , 1986, Texts and Monographs in Computer Science.

[3]  Andrea Censi,et al.  Handling Uncertainty in Monotone Co-Design Problems , 2016, ArXiv.

[4]  D. S. Parker.  Partial Order Programming. , 1989 .

[5]  V. Rich.  Personal communication , 1989, Nature.

[6]  Liam Paull,et al.  Area coverage planning that accounts for pose uncertainty with an AUV seabed surveying application , 2014, 2014 IEEE International Conference on Robotics and Automation (ICRA).

[7]  Andrea Censi,et al.  Monotone co-design problems; or, everything is the same , 2016, 2016 American Control Conference (ACC).

[8]  Nam P. Suh,et al.  Axiomatic Design: Advances and Applications , 2001 .

[9]  K. Hofmann,et al.  Continuous Lattices and Domains , 2003 .

[10]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[11]  Paul H. J. Kelly,et al.  Comparative design space exploration of dense and semi-dense SLAM , 2016, 2016 IEEE International Conference on Robotics and Automation (ICRA).

[12]  Viggo Stoltenberg-hansen,et al.  In: Handbook of Logic in Computer Science , 1995 .

[13]  Brian A. Davey,et al.  An Introduction to Lattices and Order , 1989 .

[14]  Stefano Soatto,et al.  Steps Towards a Theory of Visual Information: Active Perception, Signal-to-Symbol Conversion and the Interplay Between Sensing and Control , 2011, ArXiv.

[15]  François Bourdoncle,et al.  Efficient chaotic iteration strategies with widenings , 1993, Formal Methods in Programming and Their Applications.

[16]  Steven Roman,et al.  Lattices and ordered sets , 2008 .

[17]  Stephen P. Boyd,et al.  Recent Advances in Learning and Control , 2008, Lecture Notes in Control and Information Sciences.

[18]  Liz Sonenberg,et al.  Fixed Point Theorems and Semantics: A Folk Tale , 1982, Inf. Process. Lett..

[19]  Petr A. Golovach,et al.  An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets , 2014, Algorithmica.

[20]  Samson Abramsky,et al.  Domain theory , 1995, LICS 1995.

[21]  Wolfgang Beitz,et al.  Engineering Design: A Systematic Approach , 1984 .

[22]  Andrei Baranga,et al.  The contraction principle as a particular case of Kleene's fixed point theorem , 1991, Discret. Math..

[23]  Camil Demetrescu,et al.  Combinatorial algorithms for feedback problems in directed graphs , 2003, Inf. Process. Lett..

[24]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[25]  Magnus Egerstedt,et al.  Motion Description Languages for Multi-Modal Control in Robotics , 2003, Control Problems in Robotics.

[26]  Jason M. O'Kane,et al.  Comparing the Power of Robots , 2008, Int. J. Robotics Res..

[27]  Agostino Cortesi,et al.  Widening and narrowing operators for abstract interpretation , 2011, Comput. Lang. Syst. Struct..

[28]  C. Mathieu,et al.  How to Rank with Fewer Errors A PTAS for Feedback Arc Set in Tournaments , 2009 .

[29]  Edward A. Lee,et al.  Introduction to Embedded Systems - A Cyber-Physical Systems Approach , 2013 .

[30]  Andrea Censi,et al.  A Class of Co-Design Problems With Cyclic Constraints and Their Solution , 2017, IEEE Robotics and Automation Letters.

[31]  David I. Spivak.  Category Theory for the Sciences , 2014 .

[32]  Patrick Cousot,et al.  Abstract interpretation: past, present and future , 2014, CSL-LICS.

[33]  Hermann Schichl,et al.  An Exact Method for the Minimum Feedback Arc Set Problem , 2021, ACM J. Exp. Algorithmics.

[34]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[35]  Shuvra S. Bhattacharyya,et al.  Embedded Multiprocessors: Scheduling and Synchronization , 2000 .