English
Related papers

Related papers: Differentiable Collision Detection: a Randomized S…

200 papers

Differentiable physics is a powerful tool in computer vision and robotics for scene understanding and reasoning about interactions. Existing approaches have frequently been limited to objects with simple shape or shapes that are known in…

Computer Vision and Pattern Recognition · Computer Science 2022-01-11 Michael Strecke , Joerg Stueckler

This paper presents a novel method for reformulating non-differentiable collision avoidance constraints into smooth nonlinear constraints using strong duality of convex optimization. We focus on a controlled object whose goal is to avoid…

Optimization and Control · Mathematics 2018-06-12 Xiaojing Zhang , Alexander Liniger , Francesco Borrelli

Most camera lens systems are designed in isolation, separately from downstream computer vision methods. Recently, joint optimization approaches that design lenses alongside other components of the image acquisition and processing pipeline…

Computer Vision and Pattern Recognition · Computer Science 2023-03-29 Geoffroi Côté , Fahim Mannan , Simon Thibault , Jean-François Lalonde , Felix Heide

Collision detection is essential to virtually all robotics applications. However, traditional geometric collision detection methods generally require pre-existing workspace geometry representations; thus, they are unable to infer the…

Robotics · Computer Science 2023-09-15 Gabriel Guo , Judah Goldfeder , Aniv Ray , Tony Dear , Hod Lipson

A class of non-smooth and non-convex optimization problems with penalty constraints linked to variational inequalities (VI) is studied with respect to its shape differentiability. The specific problem stemming from quasi-brittle fracture…

Optimization and Control · Mathematics 2022-05-09 Victor A. Kovtunenko , Karl Kunisch

We present a novel approach to perform probabilistic collision detection between a high-DOF robot and high-DOF obstacles in dynamic, uncertain environments. In dynamic environments with a high-DOF robot and moving obstacles, our approach…

Robotics · Computer Science 2016-07-19 Chonhyon Park , Jae Sung Park , Dinesh Manocha

This paper presents a method to compute differentiable collision-free parametric corridors. In contrast to existing solutions that decompose the obstacle-free space into multiple convex sets, the continuous corridors computed by our method…

Robotics · Computer Science 2024-07-18 Jon Arrizabalaga , Zachary Manchester , Markus Ryll

Due to their flexibility, dexterity, and compact size, Continuum Manipulators (CMs) can enhance minimally invasive interventions. In these procedures, the CM may be operated in proximity of sensitive organs; therefore, requiring accurate…

Robotics · Computer Science 2019-08-14 Shahriar Sefati , Shahin Sefati , Iulian Iordachita , Russell H. Taylor , Mehran Armand

We present a continuous-time collision detection algorithm for quickly detecting whether certain polynomial trajectories in time intersect with convex obstacles. The algorithm is used in conjunction with an existing multicopter trajectory…

Robotics · Computer Science 2019-07-22 Nathan Bucki , Mark W. Mueller

The objective of trajectory optimization algorithms is to achieve an optimal collision-free path between a start and goal state. In real-world scenarios where environments can be complex and non-homogeneous, a robot needs to be able to…

Robotics · Computer Science 2022-02-22 Yuheng Zhi , Nikhil Das , Michael Yip

Smooth parametrization consists in a subdivision of the mathematical objects under consideration into simple pieces, and then parametric representation of each piece, while keeping control of high order derivatives. The main goal of the…

Computational Geometry · Computer Science 2014-07-14 Y. Yomdin

Automatic differentiation, as implemented today, does not have a simple mathematical model adapted to the needs of modern machine learning. In this work we articulate the relationships between differentiation of programs as implemented in…

Machine Learning · Computer Science 2020-10-30 Jerome Bolte , Edouard Pauwels

We consider geometric collision-detection problems for modular reconfigurable robots. Assuming the nodes (modules) are connected squares on a grid, we investigate the complexity of deciding whether collisions may occur, or can be avoided,…

Computational Geometry · Computer Science 2023-05-03 Siddharth Gupta , Marc van Kreveld , Othon Michail , Andreas Padalkin

We present a differentiable dynamics solver that is able to handle frictional contact for rigid and deformable objects within a unified framework. Through a principled mollification of normal and tangential contact forces, our method…

Automatic segmentation of an image to identify all meaningful parts is one of the most challenging as well as useful tasks in a number of application areas. This is widely studied. Selective segmentation, less studied, aims to use limited…

Numerical Analysis · Mathematics 2019-07-08 Michael Roberts , Ke Chen , Klaus L. Irion

In this paper, we consider the minimization of a $C^2-$smooth and strongly convex objective depending on a given parameter, which is usually found in many practical applications. We suppose that we desire to solve the problem with some…

Optimization and Control · Mathematics 2025-03-14 Jean-Jacques Godeme

This paper proposes a new set of conditions for exactly representing collision avoidance constraints within optimization-based motion planning algorithms. The conditions are continuously differentiable and therefore suitable for use with…

Robotics · Computer Science 2023-02-21 James Guthrie

Collision detection is one of the most time-consuming operations during motion planning. Thus, there is an increasing interest in exploring machine learning techniques to speed up collision detection and sampling-based motion planning. A…

Robotics · Computer Science 2024-03-14 Dominik Joho , Jonas Schwinn , Kirill Safronov

We present a differentiable formulation of rigid-body contact dynamics for objects and robots represented as compositions of convex primitives. Existing optimization-based approaches simulating contact between convex primitives rely on a…

This paper deals with convex nonsmooth optimization problems. We introduce a general smooth approximation framework for the original function and apply random (accelerated) coordinate descent methods for minimizing the corresponding smooth…

Optimization and Control · Mathematics 2024-01-10 Flavia Chorobura , Ion Necoara