Sciweavers

9 search results - page 1 / 2
» Piecewise linear paths among convex obstacles
Sort
View
STOC
1993
ACM
76views Algorithms» more  STOC 1993»
15 years 2 months ago
Piecewise linear paths among convex obstacles
Let B be a set of n arbitrary possibly intersecting convex obstacles in Rd. It is shown that any two points which can be connected by a path avoiding the obstacles can also be c...
Mark de Berg, Jirí Matousek, Otfried Schwar...
ICRA
2007
IEEE
154views Robotics» more  ICRA 2007»
15 years 4 months ago
Minimum Wheel-Rotation Paths for Differential Drive Mobile Robots Among Piecewise Smooth Obstacles
— Computing optimal paths for mobile robots is an interesting and important problem. This paper presents a method to compute the shortest path for a differential-drive mobile rob...
Hamid Reza Chitsaz, Steven M. LaValle
ATMOS
2010
163views Optimization» more  ATMOS 2010»
14 years 9 months ago
Railway Track Allocation by Rapid Branching
The track allocation problem, also known as train routing problem or train timetabling problem, is to find a conflict-free set of train routes of maximum value in a railway netw...
Ralf Borndörfer, Thomas Schlechte, Steffen We...
IOR
2008
109views more  IOR 2008»
14 years 10 months ago
Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
In 1958, Wagner and Whitin published a seminal paper on the deterministic uncapacitated lot-sizing problem, a fundamental model that is embedded in many practical production plann...
Yongpei Guan, Andrew J. Miller
FOCM
2002
97views more  FOCM 2002»
14 years 10 months ago
On the Riemannian Geometry Defined by Self-Concordant Barriers and Interior-Point Methods
We consider the Riemannian geometry defined on a convex set by the Hessian of a selfconcordant barrier function, and its associated geodesic curves. These provide guidance for the...
Yu. E. Nesterov, Michael J. Todd