Motion planning around obstacles with convex optimization

T Marcucci, M Petersen, D von Wrangel, R Tedrake - Science robotics, 2023 - science.org
From quadrotors delivering packages in urban areas to robot arms moving in confined
warehouses, motion planning around obstacles is a core challenge in modern robotics …

Part‐based mesh segmentation: a survey

RSV Rodrigues, JFM Morgado… - Computer Graphics …, 2018 - Wiley Online Library
This paper surveys mesh segmentation techniques and algorithms, with a focus on part‐
based segmentation, that is, segmentation that divides a mesh (featuring a 3D object) into …

Optimization-based locomotion planning, estimation, and control design for the atlas humanoid robot

S Kuindersma, R Deits, M Fallon, A Valenzuela… - Autonomous …, 2016 - Springer
This paper describes a collection of optimization algorithms for achieving dynamic planning,
control, and state estimation for a bipedal robot designed to operate reliably in complex …

[KİTAP][B] The algorithm design manual

SS Skiena - 2008 - Springer
This newly expanded and updated second edition of the best-selling classic continues to
take the" mystery" out of designing algorithms, and analyzing their efficacy and efficiency …

Computing large convex regions of obstacle-free space through semidefinite programming

R Deits, R Tedrake - Algorithmic Foundations of Robotics XI: Selected …, 2015 - Springer
This paper presents iris (Iterative Regional Inflation by Semidefinite programming), a new
method for quickly computing large polytopic and ellipsoidal regions of obstacle-free space …

Consistent mesh partitioning and skeletonisation using the shape diameter function

L Shapira, A Shamir, D Cohen-Or - The Visual Computer, 2008 - Springer
Mesh partitioning and skeletonisation are fundamental for many computer graphics and
animation techniques. Because of the close link between an object's skeleton and its …

Fast path planning through large collections of safe boxes

T Marcucci, P Nobel, R Tedrake… - IEEE Transactions on …, 2024 - ieeexplore.ieee.org
We present a fast algorithm for the design of smooth paths (or trajectories) that are
constrained to lie in a collection of axis-aligned boxes. We consider the case where the …

On computing map** of 3d objects: A survey

X Li, SS Iyengar - ACM Computing Surveys (CSUR), 2014 - dl.acm.org
We review the computation of 3D geometric data map**, which establishes one-to-one
correspondence between or among spatial/spatiotemporal objects. Effective map** …

Constructing IGA-suitable planar parameterization from complex CAD boundary by domain partition and global/local optimization

G Xu, M Li, B Mourrain, T Rabczuk, J Xu… - Computer Methods in …, 2018 - Elsevier
In this paper, we propose a general framework for constructing IGA-suitable planar B-spline
parameterizations from given complex CAD boundaries. Instead of the computational …

A system to detect rooms in architectural floor plan images

S Macé, H Locteau, E Valveny, S Tabbone - Proceedings of the 9th IAPR …, 2010 - dl.acm.org
In this article, a system to detect rooms in architectural floor plan images is described. We
first present a primitive extraction algorithm for line detection. It is based on an original …