Sciweavers

100 search results - page 2 / 20
» A Penalty Function Method for Constrained Motion Planning
Sort
View
CORR
2010
Springer
168views Education» more  CORR 2010»
13 years 7 months ago
Penalty Decomposition Methods for Rank Minimization
In this paper we consider general rank minimization problems with rank appearing in either objective function or constraint. We first show that a class of matrix optimization prob...
Zhaosong Lu, Yong Zhang
ICRA
2005
IEEE
118views Robotics» more  ICRA 2005»
14 years 1 months ago
Planning for Steerable Bevel-tip Needle Insertion Through 2D Soft Tissue with Obstacles
— We explore motion planning for a new class of highly flexible bevel-tip medical needles that can be steered to previously unreachable targets in soft tissue. Planning for thes...
Ron Alterovitz, Kenneth Y. Goldberg, Allison M. Ok...
JGO
2008
111views more  JGO 2008»
13 years 7 months ago
A geometric framework for nonconvex optimization duality using augmented lagrangian functions
We provide a unifying geometric framework for the analysis of general classes of duality schemes and penalty methods for nonconvex constrained optimization problems. We present a ...
Angelia Nedic, Asuman E. Ozdaglar
AROBOTS
2002
98views more  AROBOTS 2002»
13 years 7 months ago
Dynamically-Stable Motion Planning for Humanoid Robots
We present an approach to path planning for humanoid robots that computes dynamically-stable, collision-free trajectories from full-body posture goals. Given a geometric model of t...
James J. Kuffner Jr., Satoshi Kagami, Koichi Nishi...
PPSN
2004
Springer
14 years 28 days ago
Constrained Evolutionary Optimization by Approximate Ranking and Surrogate Models
Abstract. The paper describes an evolutionary algorithm for the general nonlinear programming problem using a surrogate model. Surrogate models are used in optimization when model ...
Thomas Philip Runarsson