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↗

DOE OSTI2021

Overview of the Process Automation and Control Group (E-3) [Slides]

Process Automation and Control (E-3) is a part of the Weapons Associate Laboratory Directorate (DDW) which includes Weapons Engineering Directorate (WE) and the Engineering Technology and Design (E) Division. There are three teams: Fabrication and Assembly, Process Controls, and Automation and Robotics. After an overview of the group, information is provided about an internship and how to apply.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

DOE OSTI2021

Using ROS for Robotic Control [Slides]

The use of robots is important, to help prevent people from being exposed to hazardous materials within a glovebox. The research proposal for the summer was to make a pick and place demo for a seven degrees-of-freedom Motoman Sia5d robot. The Robot Operating System (ROS) was used and the knowledge of C++ and Linux had to be applied. The robot was used to pick up and sort four objects (cylinder, sphere, rectangular prism, and cone) within a virtual environment.

42 ENGINEERING↗

DOE OSTI2020

Multi-agent motion planning with sporadic communications for collision avoidance

Here, a novel multi-vehicle motion planning and collision avoidance algorithm is proposed and analyzed. The algorithm aims to reduce the amount of onboard calculations and inter-agent communications needed for each vehicle to successfully navigate through an environment with static obstacles and reach their goals. To this end, each agent first calculates a path to the goal by means of an asymptotically optimal rapidly-exploring random tree (RRT*) with respect to the static obstacles. Then, other agents are treated as dynamic obstacles and potential collisions are determined by means of collision cones. Collision cones depend on the position and velocity from other agents and are grown conservatively between inter-agent communications. Based on the available information, each agent determines if a deconfliction maneuver is needed, if it can continue along its current path, or if communication is needed to make a decision about a conflict. With probability one, our algorithm guarantees that the agents keep from colliding with each other. Under an assumption on the existence of a solution for a vehicle to its goal, this algorithm also solves the planning problem with probability one. Simulations illustrate a group of agents successfully reaching their goal configurations and examine how the uncertainty affects the communication frequency of the multi-agent system.

33 ADVANCED PROPULSION SYSTEMS↗

DOE OSTI2019

Augmented Reality for Enabling Smart Nuclear Infrastructure

This work presents a novel, comprehensive framework that leverages emerging augmented reality headset technology to enable smart nuclear industrial infrastructure that a human can easily interact with to improve their performance in terms of safety, security, and productivity. Nuclear industrial operations require some of the most complicated infrastructure that must be managed today. Nuclear infrastructure and their associated industrial operations typically features stringent requirements associated with seismic, personnel management (e.g., access control, equipment access), safety (e.g., radiation, criticality, mechanical, electrical, spark, and chemical hazards), security (cyber/physical), and sometimes international treaties for nuclear non-proliferation. Furthermore, a wide variety of manufacturing and maintenance operations take place within these facilities further complicating their management. Nuclear facilities require very thorough and stringent documentation of the operations occurring within these facilities as well as maintaining a tight chain-of-custody for the materials being stored within the facility. The emergence of augmented reality and a variety of Internet of Things (IoT) devices offers a possible solution to help mitigate these challenges. This work provides a demonstration of a prototype smart nuclear infrastructure system that leverages augmented reality to illustrate the advantages of this system. It will also present example augmented reality tools that can be leveraged to create the next generation of smart nuclear infrastructure. The discussion will layout future directions of research for this class of work.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2018

LANL Robotics

No abstract provided.

42 ENGINEERING↗

DOE OSTI2018

Limited range spatial load balancing in non-convex environments using sampling-based motion planners

This paper analyzes the limited range, spatial load balancing problem for agents deployed in non-convex environments and subject to differential constraints which restricts how the agents can move. First, the (unlimited range) spatial load balancing problem is introduced and the minimization problem with area constraints is defined. Then, to extend the problem for limited ranges, two cost functions and a sub-partition are defined. The problems are then analyzed and the results prove the existence of a partition that satisfies the area constraints. The non-convex environment makes the problem difficult to solve in continuous-space. Therefore, a probabilistic roadmap is used to approximate agents’ cells via a graph. A distributed algorithm is proven to converge to an approximate solution. Lastly, the convergence of the algorithm is shown in simulation.

42 ENGINEERING↗

DOE OSTI2017

Sampling-Based Motion Planning Algorithms for Replanning and Spatial Load Balancing

The common theme of this dissertation is sampling-based motion planning with the two key contributions being in the area of replanning and spatial load balancing for robotic systems. Here, we begin by recalling two sampling-based motion planners: the asymptotically optimal rapidly-exploring random tree (RRT*), and the asymptotically optimal probabilistic roadmap (PRM*). We also provide a brief background on collision cones and the Distributed Reactive Collision Avoidance (DRCA) algorithm. The next four chapters detail novel contributions for motion replanning in environments with unexpected static obstacles, for multi-agent collision avoidance, and spatial load balancing. First, we show improved performance of the RRT* when using the proposed Grandparent-Connection (GP) or Focused-Refinement (FR) algorithms. Next, the Goal Tree algorithm for replanning with unexpected static obstacles is detailed and proven to be asymptotically optimal. A multi-agent collision avoidance problem in obstacle environments is approached via the RRT*, leading to the novel Sampling-Based Collision Avoidance (SBCA) algorithm. The SBCA algorithm is proven to guarantee collision free trajectories for all of the agents, even when subject to uncertainties in the knowledge of the other agents’ positions and velocities. Given that a solution exists, we prove that livelocks and deadlock will lead to the cost to the goal being decreased. We introduce a new deconfliction maneuver that decreases the cost-to-come at each step. This new maneuver removes the possibility of livelocks and allows a result to be formed that proves convergence to the goal configurations. Finally, we present a limited range Graph-based Spatial Load Balancing (GSLB) algorithm which fairly divides a non-convex space among multiple agents that are subject to differential constraints and have a limited travel distance. The GSLB is proven to converge to a solution when maximizing the area covered by the agents. The analysis for each of the above mentioned algorithms is confirmed in simulations.

97 MATHEMATICS AND COMPUTING↗