AND/OR search techniques for chance constrained motion primitive path planning
Not Available
Gutow, Geordan (ORCID:0000000221376280)↗
SEARCH · Engineering Papers
Results for “motion and path planning”
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Motion Primitive Path Planning Under Uncertainty for High-Speed Vehicles.
Abstract not provided.
Gutow, Geordan↗
Adversarial Sampling-Based Motion Planning
In this report there are many scenarios in which a mobile agent may not want its path to be predictable. Examples include preserving privacy or confusing an adversary. However, this desire for deception can conflict with the need for a low path cost. Optimal plans such as those produced by RRT* may have low path cost, but their optimality makes them predictable. Similarly, a deceptive path that features numerous zig-zags may take too long to reach the goal. We address this trade-off by drawing inspiration from adversarial machine learning. We propose a new planning algorithm, which we title Adversarial RRT*. Adversarial RRT* attempts to deceive machine learning classifiers by incorporating a predicted measure of deception into the planner cost function. Adversarial RRT* considers both path cost and a measure of predicted deceptiveness in order to produce a trajectory with low path cost that still has deceptive properties. We demonstrate the performance of Adversarial RRT*, with two measures of deception, using a simulated Dubins vehicle. We show how Adversarial RRT* can decrease cumulative RNN accuracy across paths to 10%, compared to 46% cumulative accuracy on near-optimal RRT* paths, while keeping path length within 16% of optimal. We also present an example demonstration where the Adversarial RRT* planner attempts to safely deliver a high value package while an adversary observes the path and tries to intercept the package.
42 ENGINEERING↗
Bounds on Optimal Revisit Times in Persistent Monitoring Missions With a Distinct and Remote Service Station</strong
We report persistent monitoring missions require an up-to-date knowledge of the changing state of the underlying environment. Unmannned aerial vehicles (UAVs) can be gainfully employed to continually visit a set of targets representing tasks (and locations) in the environment and collect data therein for long time periods. The enduring nature of these missions requires the UAV to be regularly recharged at a service station. In this article, we consider the case in which the service station is not colocated with any of the targets. An efficient monitoring requires the revisit time, defined as the maximum of the time elapsed between successive revisits to targets, to be minimized. Here, we consider the problem of determining UAV routes that lead to the minimum revisit time. The problem is NP-hard, and its computational difficulty increases with the fuel capacity of the UAV. We develop an algorithm to construct near-optimal solutions to the problem quickly when the fuel capacity exceeds a threshold. We also develop lower bounds to the optimal revisit time and use these bounds to demonstrate (through numerical simulations) that the constructed solutions are, on an average, at most 0.01% away from the optimum.
42 ENGINEERING↗
Development of NDE/NDT Tools for High-Volume & High-Speed Inspection of CFRP Structures in Automotive Manufacturing
Main advantages of the air-coupled ultrasound testing (ACUT) and electromagnetic testing (EMT) techniques for NDE of CFRP composites were non-contact sensing, scalability for high-speed inspection, cost-effectiveness, and non-hazardous operation. Despite these advantages, no systems that would satisfy the project requirements were commercially available. Hence, one of the major efforts of the Michigan State University (MSU) team at the initial stage of the project was to close this technological gap by developing, optimizing, and validating array sensors that would provide sufficient sensitivity, spatial coverage, and resolution for robust defect detection. Optimization of the ACUT and EMT sensor designs was performed using experimentally validated finite element models. Initial experiments using array probes were conducted on relatively flat CFRP samples. In parallel, the MSU team designed and assembled a portable platform with two robotic arms. The robots were equipped with newly designed sensors that enabled high-speed NDE of curved CFRP parts. Presently, the developed robotic platform can be used as a demo/template NDE system, which is easily adaptable to manufacturing environments and in-line NDE. The ACUT NDE system developed by the MSU team used a high-power 4-channel pulser receiver for parallel data acquisition. The array probes were designed by stacking commercially available ACUT transducers, which operated in the frequency range between 100 kHz and 500 kHz. MSU optimized the excitation procedure and developed wave focusing cones so as to reduce the crosstalk between the transducers and to provide higher pulse repletion frequency (PRF). The through-transmission (TT) and single-side access (SSA) inspection modes were successfully implemented. In the TT-ACUT, structural defects in CFRP were detected by passing ultrasonic waves through the test part. Hence, the ACUT transmitters and receivers needed to be placed on the opposite sides of the test part. In the SSA-ACUT, guided waves (GW) were excited in the test part using the transmitters and were sensed by the receivers from the same side. Multi-channel TT-ACUT and SSA-ACUT provided high-speed NDE, and were successfully validated on CFRP test samples with interlaminar delaminations and other embedded defects The EM techniques developed by the MSU team included: 1) eddy current testing (ECT), 2) capacitive imaging (CI) and hybrid dual-mode imaging. In ECT, structural damage was detected in CFRP using coils sensor arrays. In ECT, the excitation magnetic field is generated by passing an alternating current through a coil, which is placed above the test sample. The excitation field penetrates the conductive sample and induces the eddy currents in its transect. In turn, the eddy currents generate the reaction field, which affects the total field sensed by a coil. Hence, the presence of structural flaws will alter the eddy current flow and the picked-up signal. ECT is mostly sensitive to local changes of the electric conductivity of the test sample, and CFRPs are mostly conductive in the direction of carbon fibers. Hence, ECT was well suited for the detection of fiber damage/fiber irregularities. The MSU team developed printed circuit boards (PCB) with coil sensor arrays optimized for NDE of CFRP. Unlike most commercial probes designed for ECT of metallic structures, the MSU array probes were designed for operation in [1-10] MHz frequency range, which was optimal for low-conductive CFRP. Multiple sensing topologies (coil groups excitation/sensing arrangements) were implemented and successfully validated. Capacitive Imaging (CI) technique developed by MSU was complementary to ECT. In contrast to ECT, which was sensitive to local changes of the electrical conductivity, the CI was sensitive to local changes of the dielectric constant. Therefore, CI could provide information about matrix damage/matrix irregularities in CFRP. The MSU CI sensor arrays were made of multiple circular or rectangular open-plate capacitors printed on PCB. Sensors of this type are not commercially available. In addition to ECT and CI, the MSU team developed a hybrid (dual-mode) inductive/capacitive measurement technique that synergistically combined the benefits of inductive and capacitive sensing for rapid NDE of fiber reinforced polymer (FRP) composite structures. Fiber damage and fiber irregularities in FRPs were detected by configuring hybrid sensors as coil sensors. Similarly, matrix damage, matrix irregularities and interlaminar delaminations were detected by configuring hybrid sensors as capacitive sensors. ECT and CI were performed sequentially by means of electronic switching. Hence, eliminating the need for mounting two separate sensor arrays on the probe. Portable robotic platform was developed by MSU for multi-technique high-speed NDE of CFRP test parts. The platform had two 6-axis robots, which enabled inspection of curved parts in approximately a 6×6×6 ft 3 active scan area. On the software side, the MSU team integrated scripts for NDE hardware control with scripts for robot motion control. MSU also implemented automated path planning for the robots, reconstruction of part’s surfaces via stereovision, 3D rendering of inspection data, and image processing algorithms for enhanced defect detection. Automotive composite parts manufactured by Plasan Composites from Phase I were used to validate the ACUT and EMT techniques on representative testbeds. Among those parts were three X-braces for a Dodge Viper, one composite calibration plaque with known defects at known locations, and four other test sections, including sections from a front splitter, a corner section from a composite hood, and a high-pressure RTM panel made using non crimp fabric. Other test samples included CFRP and GFRP calibration plates with fiber/matrix defects fabricated at MSU/CVRC.
36 MATERIALS SCIENCE↗
3. Motion Platforms and Kinematic Arrangements
Within a machine, mechanisms and motion are organized in what is known as a “kinematic arrangement,” which helps classify machines based on how they move. The most common kinematic arrangements for additive manufacturing systems are Cartesian, followed by delta, and then six-degrees-of-freedom robotic arms. However, there are a multitude of less common systems, such as the SCARA, polar robots, cable driven parallel robots, mobile platforms, and multi-agent systems. This chapter surveys these various kinematic arrangements to give a broad understanding of the mechanisms underlying motion within additive manufacturing systems. Understanding these mechanisms and their resulting motion provides a framework for discussing path planning for all scales and families of additive manufacturing.
Wang, Peter↗
Timber Harvesting Economics in Early Commercial Thinning and Group Selection Prescriptions
Forest management decisions that consider both short- and long-term objectives are becoming more challenging and costly, due to market uncertainty, labor shortages, and the evolving forest industry. Under such unpredictable circumstances, a better understanding of the production economics of various silvicultural prescriptions is crucial in implementing sound forest management activities. The objectives of this study were to: a) estimate stump to landing productivity and cost for Early Commercial Thinning (ECT) and Group Selection (GS) prescriptions; and b) compare the harvest system cost ($/PMH) using machine rate and PATH (Planning and Analysis in Timber Harvesting) methods. Detailed time-motion studies were conducted in the spruce-fir forest of Northern Maine, USA, during the summer of 2019. The results, as expected, indicated the harvesting costs were 23% higher for ECT (21.08 $/m3) compared to GS (16.32 $/m3). The average productivity of the harvester and forwarder were reduced by 15 and 37%, respectively, for ECT compared to GS. The estimated harvesting system cost ($/PMH) was 4% higher as indicated by PATH compared to machine rate method. Higher operational productivity in GS can be attributed to the larger volume of logs, and shorter travel loaded distance than ECT. These findings can help forest managers make more informed decisions while implementing appropriate silvicultural prescriptions under varying conditions based on management objectives and market conditions.
Forestry↗
Intern Poster Session 08/13: Autonomous Nuclear Robotics: Applications in nuclear waste inspection and hot cell experiments
The nuclear industry is experiencing renewed interest in autonomous robotics, yet most deployed systems remain teleoperated with limited autonomy. This work presents two contributions toward fully autonomous nuclear robotic systems: autonomous waste inspection at the Hanford Site and an autonomous hot cell laboratory framework. Inspections of Hanford's underground waste storage tanks are performed manually at significant cost and personnel exposure. We developed a reinforcement-learning (RL) training pipeline for a custom-built inspection arm. In parallel, we are designing an autonomous laboratory framework for post-irradiation examination in hot cells at the Specimen Preparation Laboratory (SPL) that integrates computer vision, task and motion planning, hardware execution, and operator-in-the-loop control. These systems demonstrate a path toward safer, more efficient nuclear operations by reducing human exposure while maintaining rigorous human oversight at critical decision points.
11 - NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
Multi-Resolution UAV Path Replanning for Inspection of Tailings Dams
Autonomous inspection of large and complex structures with a commercial unmanned aerial vehicle (UAV) is a challenging problem that has been addressed in recent years. In this paper, we address the global motion planning problem of creating autonomous inspection missions for UAVs considering photogrammetry constraints. We focus on the inspection of large tailings dams, which are dam structures used to store waste byproducts of mining. Our method uses a prior sparse point cloud of the dam to generate a voxel grid, where paths satisfying photogrammetry constraints are tested for collisions. We then apply the A* algorithm as a local planner to avoid obstacles within the global mission. Moreover, we address the problem of changing routes online by using octree-based multi-resolution grids for efficient and fast pathfinding. Our results, obtained using tridimensional maps of an actual coal mine tailings dam, show that using octrees for multi-resolution motion planning is faster than using a fixed voxel grid in online missions while inspecting large structures.
42 ENGINEERING↗
Autonomous Emergency Landing for Fixed-Wing Aircraft with Energy-Constrained Closed-Loop Prediction
Here this paper presents a new approach for autonomous motion planning for aircraft suffering from a loss-of-thrust emergency. Specifically, we show how modifications to the Closed-Loop Rapidly exploring Random Trees (CL-RRT) framework combined with controlled energy dissipation can enable rapid and effective kinodynamic motion planning. This CL-RRT Glide algorithm uses closed-loop prediction not only for node connections but also to estimate the remaining energy and prune infeasible paths. This greatly speeds up the search process, which is essential for emergency situations. In addition, we improve the ability of the gliding aircraft to reach a goal position and energy state. We do so by creating a Dissipative Total Energy Control Scheme (TECS). Dissipative TECS enables the glider to lose excess altitude in order to reach a desired energy level. Simulation results illustrate how the proposed methods enable faster motion planning. We also integrate the system into a small unmanned aerial vehicle system and experimentally demonstrate autonomous glide planning and execution during a motor-failure event. This type of algorithm can primarily benefit unmanned aircraft but can also serve to assist pilots in stressful emergency situations.
42 ENGINEERING↗
Selecting Minimal Motion Primitive Libraries with Genetic Algorithms
Motion primitives allow for application of discrete search algorithms to rapidly produce trajectories in complex continuous space. The maneuver automaton (MA) provides an elegant formulation for creating a primitive library based on trims and maneuvers. However, performance is fundamentally limited by the contents of the primitive library. If the library is too sparse, performance can be poor in terms of path cost, whereas a library that is too large can increase run time. This work outlines new methods for using genetic algorithms to prune a primitive library. The proposed methods balance the path cost and planning time while maintaining the reachability of the MA. The genetic algorithm in this paper evaluates and mutates populations of motion primitive libraries to optimize both objectives. Here, we illustrate the performance of these methods with a simulated study using a nonlinear medium-fidelity F-16 model. We optimize a library with the presented algorithm for obstacle-free navigation and a nap-of-the-Earth navigation task. In the obstacle-free navigation task, we show a tradeoff of a 10.16% higher planning cost for a 96.63% improvement in run time. In the nap-of-the-Earth task, we show a tradeoff of a 9.712% higher planning cost for a 92.06% improvement in run time.
42 ENGINEERING↗
Quantum Search Approaches to Sampling-Based Motion Planning
In this paper, we present a novel formulation of traditional sampling-based motion planners as database-oracle structures that can be solved via quantum search algorithms. We consider two complementary scenarios: for simpler sparse environments, we formulate the Quantum Full Path Search Algorithm (q-FPS), which creates a superposition of full random path solutions, manipulates probability amplitudes with Quantum Amplitude Amplification (QAA), and quantum measures a single obstacle free full path solution. For dense unstructured environments, we formulate the Quantum Rapidly Exploring Random Tree algorithm, q-RRT, that creates quantum superpositions of possible parent-child connections, manipulates probability amplitudes with QAA, and quantum measures a single reachable state, which is added to a tree. As performance depends on the number of oracle calls and the probability of measuring good quantum states, we quantify how these errors factor into the probabilistic completeness properties of the algorithm. We then numerically estimate the expected number of database solutions to provide an approximation of the optimal number of oracle calls in the algorithm. We compare the q-RRT algorithm with a classical implementation and verify quadratic run-time speedup in the largest connected component of a 2D dense random lattice. We conclude by evaluating a proposed approach to limit the expected number of database solutions and thus limit the optimal number of oracle calls to a given number.
97 MATHEMATICS AND COMPUTING↗
Mechanical systems and kinematics
Kinematics is the study of how motion is achieved without reference to the forces that create the motion. This includes the basic structures of all robotic systems, such as links and joints, as well as their mathematical representations. This chapter will provide a brief overview of the types of motion used in additive manufacturing (AM) systems, as well as the mathematical equations that govern them. Rotations are explained using both Euler rotations and quaternions. Combined rotation and translations are shown using homogeneous transform matrices. The robot Jacobian, which relates joint velocities to the end effector translational velocities, is explained with an example calculation. This section will give the reader the basic mathematical foundation in kinematics that is necessary to understand the mechanical underpinnings of path planning for AM systems.
Wang, Peter↗
Distributionally Safe Path Planning: Wasserstein Safe RRT
In this paper, we propose a Wasserstein metric-based random path planning algorithm. Wasserstein Safe RRT (W-Safe RRT) provides finite-sample probabilistic guarantees on the safety of a returned path in an uncertain obstacle environment. Vehicle and obstacle states are modeled as distributions based upon state and model observations. Additionally, we define limits on distributional sampling error so the Wasserstein distance between a vehicle state distribution and obstacle distributions can be bounded. This enables the algorithm to return safe paths with a confidence bound through combining finite sampling error bounds with calculations of the Wasserstein distance between discrete distributions. W-Safe RRT is compared against a baseline minimum encompassing ball algorithm, which ensures balls that minimally encompass discrete state and obstacle distributions do not overlap. The improved performance is verified in a 3D environment using single, multi, and rotating non-convex obstacle cases, with and without forced obstacle error in adversarial directions, showing that W-Safe RRT can handle poorly modeled complex environments.
42 ENGINEERING↗
Design and Closed‐Loop Motion Planning of an Untethered Swimming Soft Robot Using 2D Discrete Elastic Rods Simulations
Despite tremendous progress in the development of untethered soft robots in recent years, existing systems lack the mobility, model‐based control, and motion planning capabilities of their piecewise rigid counterparts. As in conventional robotic systems, the development of versatile locomotion of soft robots is aided by the integration of hardware design and control with modeling tools that account for their unique mechanics and environmental interactions. Here, a framework for physics‐based modeling, motion planning, and control of a fully untethered swimming soft robot is introduced. This framework enables offline co‐design in the simulation of robot parameters and gaits to produce effective open‐loop behaviors and enables closed‐loop planning over motion primitives for feedback control of a frog‐inspired soft robot testbed. This pipeline uses a discrete elastic rods (DERs) physics engine that discretizes the soft robot as many stretchable and bendable rods. On hardware, an untethered aquatic soft robot that performs frog‐like rowing behaviors is engineered. Hardware validation verifies that the simulation has sufficient accuracy to find the best candidates for sets of parameters offline. The simulator is then used to generate a trajectory library of the robot's motion in simulation that is used in real‐time closed‐loop path following experiments on hardware.
Huang, Xiaonan↗
A GPU-based Approach for Path Planning Optimization via Travel Length Reduction
Typically, before constructing an object with an additive manufacturing system, the 3D object must be sent through a process called slicing. Slicing converts a 3D object commonly in the form of an STL file into a set of layers by horizontally intersecting a plane with the object at various heights. At each height, called a layer, multiple 2D polygons can be generated. Each polygon represents a boundary for solid geometry and is called an island. Each island is then comprised of multiple path types in an attempt to optimally fill the polygon. To move between each island and each islands’ paths, travels are inserted. Travels are simply motion by the system to move from one area of construction to another. Travels do not contribute to the construction of the object, and so, are considered wasted motion. In large-scale additive manufacturing, objects can be quite large and the distance between islands can be large as well. As a result, these travels can waste a significant amount of time. Ideally, travels would be as short as possible, however, computing global minimal travel paths is computationally expensive. To combat this problem, researchers at Oak Ridge National Lab developed a GPU-based approach to travel insertion based on a unique factoradic representation. This representation was then utilized by the GPU to solve the Traveling Salesman Problem (TSP). This algorithm was able to compute global minimal travel paths quickly resulting in faster object construction. A general investigation was also carried out to determine when a GPU vs CPU implementation would be beneficial.
Borish, Michael↗
Utilizing Reinforcement Learning to Continuously Improve a Primitive-Based Motion Planner
We report in this paper describes how the performance of motion primitive-based planning algorithms can be improved using reinforcement learning. Specifically, we describe and evaluate a framework that autonomously improves the performance of a primitive-based motion planner. The improvement process consists of three phases: exploration, extraction, and reward updates. This process can be iterated continuously to provide successive improvement. The exploration step generates new trajectories, and the extraction step identifies new primitives from these trajectories. These primitives are then used to update rewards for continued exploration. This framework required novel shaping rewards, development of a primitive extraction algorithm, and modification of the Hybrid A* algorithm. The framework is tested on a navigation task using a nonlinear F-16 model. The framework autonomously added 91 motion primitives to the primitive library and reduced average path cost by 21.6 seconds, or 35.75% of the original cost. The learned primitives are applied to an obstacle field navigation task, which was not used in training, and reduced path cost by 16.3 seconds, or 24.1%. Additionally, two heuristics for the modified Hybrid A* algorithm are designed to improve effective branching factor.
42 ENGINEERING↗
Dynamic Charging Rendezvous and Motion Planning for a Multi-AGV Team Including a Mobile Charging Host
Teams of automated battery-powered electric vehicles have the potential to execute complex mission tasks in off-road environments for agriculture, military, and other applications. Limited onboard energy reserves hinder their adoption in large-scale resource-constrained environments, where recharging is a necessity. It may be infeasible to install a network of static charging stations in off-road environments. For this reason, dedicated mobile host vehicles with charging capabilities are proposed as a means to increase range and capabilities of the multivehicle team. Here, in this study, we consider an ad hoc planning framework, where results from a high-confidence trajectory planner are leveraged to plan charging rendezvous between a host and other worker vehicles in a receding horizon fashion to provide high confidence that energy reserves will not be prematurely exhausted. The core problem is posed so as to minimize the impact of recharging on the mission in terms of task delays, overall energy utilization, and costs of fast charging. Through extensive Monte Carlo simulations of an off-road mission, we show a decrease in task delays without substantial increases in energy needs by updating the charging rendezvous plan during the mission. However, if updates are made too often, model mismatch may cause unnecessary cycling and mission failure.
Energy constraints↗