1,409 research outputs found
Topology-Guided Path Integral Approach for Stochastic Optimal Control in Cluttered Environment
This paper addresses planning and control of robot motion under uncertainty
that is formulated as a continuous-time, continuous-space stochastic optimal
control problem, by developing a topology-guided path integral control method.
The path integral control framework, which forms the backbone of the proposed
method, re-writes the Hamilton-Jacobi-Bellman equation as a statistical
inference problem; the resulting inference problem is solved by a sampling
procedure that computes the distribution of controlled trajectories around the
trajectory by the passive dynamics. For motion control of robots in a highly
cluttered environment, however, this sampling can easily be trapped in a local
minimum unless the sample size is very large, since the global optimality of
local minima depends on the degree of uncertainty. Thus, a homology-embedded
sampling-based planner that identifies many (potentially) local-minimum
trajectories in different homology classes is developed to aid the sampling
process. In combination with a receding-horizon fashion of the optimal control
the proposed method produces a dynamically feasible and collision-free motion
plans without being trapped in a local minimum. Numerical examples on a
synthetic toy problem and on quadrotor control in a complex obstacle field
demonstrate the validity of the proposed method.Comment: arXiv admin note: text overlap with arXiv:1510.0534
Asymptotically-Optimal Topological Nearest-Neighbor Filtering
Nearest-neighbor finding is a major bottleneck for sampling-based motion planning algorithms. The cost of finding nearest neighbors grows with the size of the roadmap, leading to a significant computational bottleneck for problems which require many configurations to find a solution. In this work, we develop a method of mapping configurations of a jointed robot to neighborhoods in the workspace that supports fast search for configurations in nearby neighborhoods. This expedites nearest-neighbor search by locating a small set of the most likely candidates for connecting to the query with a local plan. We show that this filtering technique can preserve asymptotically-optimal guarantees with modest requirements on the distance metric. We demonstrate the method’s efficacy in planning problems for rigid bodies and both fixed and mobile-base manipulators
Sampling-Based Temporal Logic Path Planning
In this paper, we propose a sampling-based motion planning algorithm that
finds an infinite path satisfying a Linear Temporal Logic (LTL) formula over a
set of properties satisfied by some regions in a given environment. The
algorithm has three main features. First, it is incremental, in the sense that
the procedure for finding a satisfying path at each iteration scales only with
the number of new samples generated at that iteration. Second, the underlying
graph is sparse, which guarantees the low complexity of the overall method.
Third, it is probabilistically complete. Examples illustrating the usefulness
and the performance of the method are included.Comment: 8 pages, 4 figures; extended version of the paper presented at IROS
201
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
- …