4,334 research outputs found
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
Combining Subgoal Graphs with Reinforcement Learning to Build a Rational Pathfinder
In this paper, we present a hierarchical path planning framework called SG-RL
(subgoal graphs-reinforcement learning), to plan rational paths for agents
maneuvering in continuous and uncertain environments. By "rational", we mean
(1) efficient path planning to eliminate first-move lags; (2) collision-free
and smooth for agents with kinematic constraints satisfied. SG-RL works in a
two-level manner. At the first level, SG-RL uses a geometric path-planning
method, i.e., Simple Subgoal Graphs (SSG), to efficiently find optimal abstract
paths, also called subgoal sequences. At the second level, SG-RL uses an RL
method, i.e., Least-Squares Policy Iteration (LSPI), to learn near-optimal
motion-planning policies which can generate kinematically feasible and
collision-free trajectories between adjacent subgoals. The first advantage of
the proposed method is that SSG can solve the limitations of sparse reward and
local minima trap for RL agents; thus, LSPI can be used to generate paths in
complex environments. The second advantage is that, when the environment
changes slightly (i.e., unexpected obstacles appearing), SG-RL does not need to
reconstruct subgoal graphs and replan subgoal sequences using SSG, since LSPI
can deal with uncertainties by exploiting its generalization ability to handle
changes in environments. Simulation experiments in representative scenarios
demonstrate that, compared with existing methods, SG-RL can work well on
large-scale maps with relatively low action-switching frequencies and shorter
path lengths, and SG-RL can deal with small changes in environments. We further
demonstrate that the design of reward functions and the types of training
environments are important factors for learning feasible policies.Comment: 20 page
A Hierarchal Planning Framework for AUV Mission Management in a Spatio-Temporal Varying Ocean
The purpose of this paper is to provide a hierarchical dynamic mission
planning framework for a single autonomous underwater vehicle (AUV) to
accomplish task-assign process in a limited time interval while operating in an
uncertain undersea environment, where spatio-temporal variability of the
operating field is taken into account. To this end, a high level reactive
mission planner and a low level motion planning system are constructed. The
high level system is responsible for task priority assignment and guiding the
vehicle toward a target of interest considering on-time termination of the
mission. The lower layer is in charge of generating optimal trajectories based
on sequence of tasks and dynamicity of operating terrain. The mission planner
is able to reactively re-arrange the tasks based on mission/terrain updates
while the low level planner is capable of coping unexpected changes of the
terrain by correcting the old path and re-generating a new trajectory. As a
result, the vehicle is able to undertake the maximum number of tasks with
certain degree of maneuverability having situational awareness of the operating
field. The computational engine of the mentioned framework is based on the
biogeography based optimization (BBO) algorithm that is capable of providing
efficient solutions. To evaluate the performance of the proposed framework,
firstly, a realistic model of undersea environment is provided based on
realistic map data, and then several scenarios, treated as real experiments,
are designed through the simulation study. Additionally, to show the robustness
and reliability of the framework, Monte-Carlo simulation is carried out and
statistical analysis is performed. The results of simulations indicate the
significant potential of the two-level hierarchical mission planning system in
mission success and its applicability for real-time implementation
Real-Time Planning with Multi-Fidelity Models for Agile Flights in Unknown Environments
Autonomous navigation through unknown environments is a challenging task that
entails real-time localization, perception, planning, and control. UAVs with
this capability have begun to emerge in the literature with advances in
lightweight sensing and computing. Although the planning methodologies vary
from platform to platform, many algorithms adopt a hierarchical planning
architecture where a slow, low-fidelity global planner guides a fast,
high-fidelity local planner. However, in unknown environments, this approach
can lead to erratic or unstable behavior due to the interaction between the
global planner, whose solution is changing constantly, and the local planner; a
consequence of not capturing higher-order dynamics in the global plan. This
work proposes a planning framework in which multi-fidelity models are used to
reduce the discrepancy between the local and global planner. Our approach uses
high-, medium-, and low-fidelity models to compose a path that captures
higher-order dynamics while remaining computationally tractable. In addition,
we address the interaction between a fast planner and a slower mapper by
considering the sensor data not yet fused into the map during the collision
check. This novel mapping and planning framework for agile flights is validated
in simulation and hardware experiments, showing replanning times of 5-40 ms in
cluttered environments.Comment: ICRA 201
- …