22,559 research outputs found
Combining Homotopy Methods and Numerical Optimal Control to Solve Motion Planning Problems
This paper presents a systematic approach for computing local solutions to
motion planning problems in non-convex environments using numerical optimal
control techniques. It extends the range of use of state-of-the-art numerical
optimal control tools to problem classes where these tools have previously not
been applicable. Today these problems are typically solved using motion
planners based on randomized or graph search. The general principle is to
define a homotopy that perturbs, or preferably relaxes, the original problem to
an easily solved problem. By combining a Sequential Quadratic Programming (SQP)
method with a homotopy approach that gradually transforms the problem from a
relaxed one to the original one, practically relevant locally optimal solutions
to the motion planning problem can be computed. The approach is demonstrated in
motion planning problems in challenging 2D and 3D environments, where the
presented method significantly outperforms a state-of-the-art open-source
optimizing sampled-based planner commonly used as benchmark
Automated sequence and motion planning for robotic spatial extrusion of 3D trusses
While robotic spatial extrusion has demonstrated a new and efficient means to
fabricate 3D truss structures in architectural scale, a major challenge remains
in automatically planning extrusion sequence and robotic motion for trusses
with unconstrained topologies. This paper presents the first attempt in the
field to rigorously formulate the extrusion sequence and motion planning (SAMP)
problem, using a CSP encoding. Furthermore, this research proposes a new
hierarchical planning framework to solve the extrusion SAMP problems that
usually have a long planning horizon and 3D configuration complexity. By
decoupling sequence and motion planning, the planning framework is able to
efficiently solve the extrusion sequence, end-effector poses, joint
configurations, and transition trajectories for spatial trusses with
nonstandard topologies. This paper also presents the first detailed computation
data to reveal the runtime bottleneck on solving SAMP problems, which provides
insight and comparing baseline for future algorithmic development. Together
with the algorithmic results, this paper also presents an open-source and
modularized software implementation called Choreo that is machine-agnostic. To
demonstrate the power of this algorithmic framework, three case studies,
including real fabrication and simulation results, are presented.Comment: 24 pages, 16 figure
Contact-Implicit Trajectory Optimization Based on a Variable Smooth Contact Model and Successive Convexification
In this paper, we propose a contact-implicit trajectory optimization (CITO)
method based on a variable smooth contact model (VSCM) and successive
convexification (SCvx). The VSCM facilitates the convergence of gradient-based
optimization without compromising physical fidelity. On the other hand, the
proposed SCvx-based approach combines the advantages of direct and shooting
methods for CITO. For evaluations, we consider non-prehensile manipulation
tasks. The proposed method is compared to a version based on iterative linear
quadratic regulator (iLQR) on a planar example. The results demonstrate that
both methods can find physically-consistent motions that complete the tasks
without a meaningful initial guess owing to the VSCM. The proposed SCvx-based
method outperforms the iLQR-based method in terms of convergence, computation
time, and the quality of motions found. Finally, the proposed SCvx-based method
is tested on a standard robot platform and shown to perform efficiently for a
real-world application.Comment: Accepted for publication in ICRA 201
- …