相关论文: An Algorithmic Study of Manufacturing Paperclips a…
Reinforcement learning has been successfully applied to the problem of tuning PID controllers in several applications. The existing methods often utilize function approximation, such as neural networks, to update the controller parameters…
The mechanics of complex soft matter often cannot be understood in the classical physical frame of flexible polymers or rigid rods. The underlying constituents are semiflexible polymers, whose finite bending stiffness ($\kappa$) leads to…
Latest research in industrial robotics is aimed at making human robot collaboration possible seamlessly. For this purpose, industrial robots are expected to work on the fly in unstructured and cluttered environments and hence the subject of…
The viscous flow of polymer chains in dense melts is dominated by topological constraints whenever the single chain contour length, N, becomes larger than the characteristic scale Ne, defining comprehensively the macroscopic rheological…
Robots' behavior and performance are determined both by hardware and software. The design process of robotic systems is a complex journey that involves multiple phases. Throughout this process, the aim is to tackle various criteria…
We conjecture that a convex polytope is uniquely determined up to isometry by its edge-graph, edge lengths and the collection of distances of its vertices to some arbitrary interior point, across all dimensions and all combinatorial types.…
Structural pruning enables model acceleration by removing structurally-grouped parameters from neural networks. However, the parameter-grouping patterns vary widely across different models, making architecture-specific pruners, which rely…
Detectability of failures of linear programming (LP) decoding and the potential for improvement by adding new constraints motivate the use of an adaptive approach in selecting the constraints for the underlying LP problem. In this paper, we…
The problem of minimizing the number of bidirectional SONET rings required to support a given traffic demand has been studied by several researchers. Here we study the related ``ring grooming problem'' of minimizing the number of add/drop…
We address the satisfiability problem for string constraints that combine relational constraints represented by transducers, word equations, and string length constraints. This problem is undecidable in general. Therefore, we propose a new…
Given an undirected graph G, the edge orientation problem asks for assigning a direction to each edge to convert G into a directed graph. The aim is to minimize the maximum out degree of a vertex in the resulting directed graph. This…
Autonomous assembly is a crucial capability for robots in many applications. For this task, several problems such as obstacle avoidance, motion planning, and actuator control have been extensively studied in robotics. However, when it comes…
We introduce a parallel machine scheduling problem in which the processing times of jobs are not given in advance but are determined by a system of linear constraints. The objective is to minimize the makespan, i.e., the maximum job…
Past work on optimizing fabrication plans given a carpentry design can provide Pareto-optimal plans trading off between material waste, fabrication time, precision, and other considerations. However, when developing fabrication plans,…
This paper studies the growing domain of Robotic Process Automation (RPA) problems. Motivated by scheduling problems arising in RPA, we study the parameterized complexity of the single-machine problem $1|\text{prec},r_j,d_j|*$. We focus on…
Additive manufacturing using 2-Photon Polymerization (2PP, aka direct laser writing DLW) enables the fabrication of almost arbitrary complex 3D structures from the meso to the submicron scale. However, deviations between the anticipated…
We present algorithmic results for the parallel assembly of many micro-scale objects in two and three dimensions from tiny particles, which has been proposed in the context of programmable matter and self-assembly for building high-yield…
In this paper, we consider the knot matching problem arising in computational forestry. The knot matching problem is an important problem that needs to be solved to advance the state of the art in automatic strength prediction of lumber. We…
Structured prediction is a powerful framework for coping with joint prediction of interacting outputs. A central difficulty in using this framework is that often the correct label dependence structure is unknown. At the same time, we would…
A flip in a plane spanning tree $T$ is the operation of removing one edge from $T$ and adding another edge such that the resulting structure is again a plane spanning tree. For trees on a set of points in convex position we study two…