Many-core Algorithms for Combinatorial Optimization

Combinatorial Optimization is becoming ever more crucial, in these days. From natural sciences to economics, passing through urban centers administration and personnel management, methodologies and algorithms with a strong theoretical background and a consolidated real-word effectiveness is more and more requested, in order to find, quickly, good solutions to complex strategical problems. Resource optimization is, nowadays, a fundamental ground for building the basements of successful projects. From the theoretical point of view, Combinatorial Optimization rests on stable and strong foundations, that allow researchers to face ever more challenging problems. However, from the application point of view, it seems that the rate of theoretical developments cannot cope with that enjoyed by modern hardware technologies, especially with reference to the one of processors industry. In this work we propose new parallel algorithms, designed for exploiting the new parallel architectures available on the market. We found that, exposing the inherent parallelism of some resolution techniques (like Dynamic Programming), the computational benefits are remarkable, lowering the execution times by more than an order of magnitude, and allowing to address instances with dimensions not possible before. We approached four Combinatorial Optimization’s notable problems: Packing Problem, Vehicle Routing Problem, Single Source Shortest Path Problem and a Network Design problem. For each of these problems we propose a collection of effective parallel solution algorithms, either for solving the full problem (Guillotine Cuts and SSSPP) or for enhancing a fundamental part of the solution method (VRP and ND). We endorse our claim by presenting computational results for all problems, either on standard benchmarks from the literature or, when possible, on data from real-world applications, where speed-ups of one order of magnitude are usually attained, not uncommonly scaling up to 40 X factors.

Mechanical design and hybrid control strategies for overconstrained cable-driven parallel robots

Cable-driven parallel robots offer significant advantages in terms of workspace dimensions and payload capability. They are attractive for many industrial tasks to be performed on a large scale, such as handling and manufacturing, without a substantial increase in costs and mechanical complexity with respect to a small-scale application. However, since cables can only sustain tensile stresses, cable tensions must be kept within positive limits during the end-effector motion. This problem can be managed by overconstraining the end-effector and controlling cable tensions. Tension control is typically achieved by mounting a load sensor on all cables, and using specific control algorithms to avoid cable slackness or breakage while the end-effector is controlled in a desired position. These algorithms require multiple cascade control loops and they can be complex and computationally demanding. To simplify the control of overconstrained cable-driven parallel robots, this Thesis proposes suitable mechanical design and hybrid control strategies. It is shown how a convenient design of the cable guidance system allows kinematic modeling to be simplified, without introducing geometric approximations. This guidance system employs swiveling pulleys equipped with position and tension sensors and provides a parallelogram arrangement of cables. Furthermore, a hybrid force/position control in the robot joint space is adopted. According to this strategy, a particular set of cables is chosen to be tension-controlled, whereas the other cables are length-controlled. The force-controlled cables are selected based on the computation of a novel index called force-distribution sensitivity to cable-tension errors. This index aims to evaluate the maximum expected cable-tension error in the length-controlled cables if a unit tension error is committed in the force-controlled cables. In practice, the computation of the force-distribution sensitivity allows determining which cables are best to be force-controlled, to ensure the lowest error in the overall force distribution when a hybrid force/position joint-space strategy is used.

Contributions to the performance analysis of continuum parallel robots

Continuum parallel robots (CPRs) are manipulators employing multiple flexible beams arranged in parallel and connected to a rigid end-effector. CPRs promise higher payload and accuracy than serial CRs while keeping great flexibility. As the risk of injury during accidental contacts between a human and a CPR should be reduced, CPRs may be used in large-scale collaborative tasks or assisted robotic surgery. There exist various CPR designs, but the prototype conception is rarely based on performance considerations, and the CPRs realization in mainly based on intuitions or rigid-link parallel manipulators architectures. This thesis focuses on the performance analysis of CPRs, and the tools needed for such evaluation, such as workspace computation algorithms. In particular, workspace computation strategies for CPRs are essential for the performance assessment, since the CPRs workspace may be used as a performance index or it can serve for optimal-design tools. Two new workspace computation algorithms are proposed in this manuscript, the former focusing on the workspace volume computation and the certification of its numerical results, while the latter aims at computing the workspace boundary only. Due to the elastic nature of CPRs, a key performance indicator for these robots is the stability of their equilibrium configurations. This thesis proposes the experimental validation of the equilibrium stability assessment on a real prototype, demonstrating limitations of some commonly used assumptions. Additionally, a performance index measuring the distance to instability is originally proposed in this manuscript. Differently from the majority of the existing approaches, the clear advantage of the proposed index is a sound physical meaning; accordingly, the index can be used for a more straightforward performance quantification, and to derive robot specifications.