Piecewise linear paths among convex obstacles
نویسندگان
چکیده
منابع مشابه
Convex piecewise-linear fitting
We consider the problem of fitting a convex piecewise-linear function, with some specified form, to given multi-dimensional data. Except for a few special cases, this problem is hard to solve exactly, so we focus on heuristic methods that find locally optimal fits. The method we describe, which is a variation on the K-means algorithm for clustering, seems to work well in practice, at least on d...
متن کاملnetwork optimization with piecewise linear convex costs
the problem of finding the minimum cost multi-commodity flow in an undirected and completenetwork is studied when the link costs are piecewise linear and convex. the arc-path model and overflowmodel are presented to formulate the problem. the results suggest that the new overflow model outperformsthe classical arc-path model for this problem. the classical revised simplex, frank and wolf and a ...
متن کاملApproximate Euclidean shortest paths amid convex obstacles
We develop algorithms and data structures for the approximate Euclidean shortest path problem amid a set P of k convex obstacles in R and R, with a total of n faces. The running time of our algorithms is linear in n, and the size and query time of our data structure are independent of n. We follow a “core-set” based approach, i.e., we quickly compute a small sketch Q of P whose size is independ...
متن کاملSmoothing of Piecewise Linear Paths
The pointwise traversal of a given path is a popular task in the area of robotics, e.g. in mobile, industrial or surgical robotics. The easiest method to describe paths is by a sequence of linear segments, and for many tasks the precision of a path approximated by linear segments is sufficient. The movements to be accomplished by a mobile robot or the robot’s end-effector are described by a seq...
متن کاملPiecewise Linear Regularized Solution Paths
We consider the generic regularized optimization problem β̂(λ) = arg minβ L(y,Xβ) + λJ (β). Efron, Hastie, Johnstone and Tibshirani [Ann. Statist. 32 (2004) 407–499] have shown that for the LASSO—that is, if L is squared error loss and J (β)= ‖β‖1 is the 1 norm of β—the optimal coefficient path is piecewise linear, that is, ∂β̂(λ)/∂λ is piecewise constant. We derive a general characterization of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 1995
ISSN: 0179-5376,1432-0444
DOI: 10.1007/bf02570694