Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “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.

At least 163 records · Page 9

Path optimization with limited sensing ability

We propose a computational strategy to find the optimal path for a mobile sensor with limited coverage to traverse a cluttered region. The goal is to find one of the shortest feasible paths to achieve the complete scan of the environment. We pose the problem in the level set framework, and first consider a related question of placing multiple stationary sensors to obtain the full surveillance of the environment. By connecting the stationary locations using the nearest neighbor strategy, we form the initial guess for the path planning problem of the mobile sensor. Then the path is optimized by reducing its length, via solving a system of ordinary differential equations (ODEs), while maintaining the complete scan of the environment. Furthermore, we use intermittent diffusion, which converts the ODEs into stochastic differential equations (SDEs), to find an optimal path whose length is globally minimal. To improve the computation efficiency, we introduce two techniques, one to remove redundant connecting points to reduce the dimension of the system, and the other to deal with the entangled path so the solution can escape the local traps. Numerical examples are shown to illustrate the effectiveness of the proposed method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Extending wire-arc directed energy deposition using non-gravity aligned (NGA) torch methods

For standard Additive Manufacturing (AM) processes, traditional path planning typically relies on a 2.5-dimensional approach. In wire-arc directed energy deposition (DED), commonly referred to as wire-arc additive manufacturing (WAAM), this 2.5D approach inherently limits final near net shape due to the stair-step effect and restricts the maximum overhang angle achievable without part degradation. To achieve better near net shape and part quality, a 3D planning approach that modulates the tool tip position and angle without process changes is demonstrated in components containing up to 105° of unsupported overhang. The experimental methods are validated with half and fully enclosed cylinder sections containing 90° of overhang. The non-gravity aligned methods are then applied to a commercial WAAM system for a composite tool mold demonstrator part. As a result, the methods developed in this paper enable expansion of WAAM system capabilities to parts containing large overhangs without compromising the net shape or material structure of the resulting parts and without the need for a part positioner.

Additive manufacturing↗

Planning for execution monitoring on a planetary rover

A planetary rover will be traversing largely unknown and often unknowable terrain. In addition to geometric obstacles such as cliffs, rocks, and holes, it may also have to deal with non-geometric hazards such as soft soil and surface breakthroughs which often cannot be detected until rover is in imminent danger. Therefore, the rover must monitor its progress throughout a traverse, making sure to stay on course and to detect and act on any previously unseen hazards. Its onboard planning system must decide what sensors to monitor, what landmarks to take position readings from, and what actions to take if something should go wrong. The planning systems being developed for the Pathfinder Planetary Rover to perform these execution monitoring tasks are discussed. This system includes a network of planners to perform path planning, expectation generation, path analysis, sensor and reaction selection, and resource allocation.

Gat, Erann↗

Search Problems in Mission Planning and Navigation of Autonomous Aircraft

An architecture for the control of an autonomous aircraft is presented. The architecture is a hierarchical system representing an anthropomorphic breakdown of the control problem into planner, navigator, and pilot systems. The planner system determines high level global plans from overall mission objectives. This abstract mission planning is investigated by focusing on the Traveling Salesman Problem with variations on local and global constraints. Tree search techniques are applied including the breadth first, depth first, and best first algorithms. The minimum-column and row entries for the Traveling Salesman Problem cost matrix provides a powerful heuristic to guide these search techniques. Mission planning subgoals are directed from the planner to the navigator for planning routes in mountainous terrain with threats. Terrain/threat information is abstracted into a graph of possible paths for which graph searches are performed. It is shown that paths can be well represented by a search graph based on the Voronoi diagram of points representing the vertices of mountain boundaries. A comparison of Dijkstra's dynamic programming algorithm and the A* graph search algorithm from artificial intelligence/operations research is performed for several navigation path planning examples. These examples illustrate paths that minimize a combination of distance and exposure to threats. Finally, the pilot system synthesizes the flight trajectory by creating the control commands to fly the aircraft.

Krozel, James A.↗

Navigation of military and space unmanned ground vehicles in unstructured terrains

Development of unmanned vehicles for local navigation in terrains unstructured by humans is reviewed. Modes of navigation include teleoperation or remote control, computer assisted remote driving (CARD), and semiautonomous navigation (SAN). A first implementation of a CARD system was successfully tested using the Robotic Technology Test Vehicle developed by Jet Propulsion Laboratory. Stereo pictures were transmitted to a remotely located human operator, who performed the sensing, perception, and planning functions of navigation. A computer provided range and angle measurements and the path plan was transmitted to the vehicle which autonomously executed the path. This implementation is to be enhanced by providing passive stereo vision and a reflex control system for autonomously stopping the vehicle if blocked by an obstacle. SAN achievements include implementation of a navigation testbed on a six wheel, three-body articulated rover vehicle, development of SAN algorithms and code, integration of SAN software onto the vehicle, and a successful feasibility demonstration that represents a step forward towards the technology required for long-range exploration of the lunar or Martian surface. The vehicle includes a passive stereo vision system with real-time area-based stereo image correlation, a terrain matcher, a path planner, and a path execution planner.

Lescoe, Paul↗

ATHLETE's Feet: Mu1ti-Resolution Planning for a Hexapod Robot

ATHLETE is a large six-legged tele-operated robot. Each foot is a wheel; travel can be achieved by walking, rolling, or some combination of the two. Operators control ATHLETE by selecting parameterized commands from a command dictionary. While rolling can be done efficiently with a single command, any motion involving steps is cumbersome - walking a few meters through difficult terrain can take hours. Our goal is to improve operator efficiency by automatically generating sequences of motion commands. There is increasing uncertainty regarding ATHLETE s actual configuration over time and decreasing quality of terrain data farther away from the current position. This, combined with the complexity that results from 36 degrees of kinematic freedom, led to an architecture that interleaves planning and execution at multiple levels, ranging from traditional configuration space motion planning algorithms for immediate moves to higher level task and path planning algorithms for overall travel. The modularity of the architecture also simplifies the development process and allows the operator to interact with and control the system at varying levels of autonomy depending on terrain and need.

Smith, Tristan B.↗

Terrain Adaptive Navigation for Mars Rovers

A navigation system for Mars rovers in very rough terrain has been designed, implemented, and tested on a research rover in Mars analog terrain. This navigation system consists of several technologies that are integrated to increase the capabilities compared to current rover navigation algorithms. These technologies include: goodness maps and terrain triage, terrain classification, remote slip prediction, path planning, high-fidelity traversability analysis (HFTA), and slip-compensated path following. The focus of this paper is not on the component technologies, but rather on the integration of these components. Results from the onboard integration of several of the key technologies described here are shown. Additionally, the results from independent demonstrations of several of these technologies are shown. Future work will include the demonstration of the entire integrated system described here.

traversabiity analysis↗

Utilizing semantic networks to database and retrieve generalized stochastic colored Petri nets

Previous work has introduced the Planning Coordinator (PCOORD), a coordinator functioning within the hierarchy of the Intelligent Machine Mode. Within the structure of the Planning Coordinator resides the Primitive Structure Database (PSDB) functioning to provide the primitive structures utilized by the Planning Coordinator in the establishing of error recovery or on-line path plans. This report further explores the Primitive Structure Database and establishes the potential of utilizing semantic networks as a means of efficiently storing and retrieving the Generalized Stochastic Colored Petri Nets from which the error recovery plans are derived.

Farah, Jeffrey J.↗

Intelligent UAS Sense-and-Avoid Utilizing Global Constraints

Sense-and-avoid (SAA) is a critical research topic for enabling the operation of Unmanned Aircraft Systems (UAS) in civilian airspace. SAA involves two planning related problems: 1) plan-recognition to predict the future trajectory of nearby aircraft, and 2) path planning to avoid conflicts with nearby aircraft that pose a threat. We have designed and built components of a novel intelligent sense-and-avoid (iSAA) reasoning framework that takes into account information about aircraft type, transponder code, communications, local routes, airports, airspace, terrain, and weather to more accurately predict near- and medium-term trajectories of nearby aircraft. By using this additional information both the on-board control software and the ground-based UAS operator can make more informed, intelligent decisions to effectively predict and avoid conflicts and maintain separation. While this capability benefits all categories of UASs operating under both Instrument Flight Rules (IFR) and Visual Flight Rules (VFR), it is absolutely essential for allowing smaller UASs to operate VFR at low altitude in uncontrolled airspace for operations such as survey work, wildlife tracking, aerial photography, utilities inspection, crop dusting, and package delivery.

unmanned aircraft systems↗

Algorithm Plans Collision-Free Path for Robotic Manipulator

An algorithm has been developed to enable a computer aboard a robot to autonomously plan the path of the manipulator arm of the robot to avoid collisions between the arm and any obstacle, which could be another part of the robot or an external object in the vicinity of the robot. In simplified terms, the algorithm generates trial path segments and tests each segment for potential collisions in an iterative process that ends when a sequence of collision-free segments reaches from the starting point to the destination. The main advantage of this algorithm, relative to prior such algorithms, is computational efficiency: the algorithm is designed to make minimal demands upon the limited computational resources available aboard a robot. This path-planning algorithm utilizes a modified version of the collision-detection method described in "Improved Collision-Detection Method for Robotic Manipulator" (NPO-30356), NASA Tech Briefs, Vol. 27, No. 3 (June 2003), page 72. The method involves utilization of mathematical models of the robot constructed prior to operation and similar models of external objects constructed automatically from sensory data acquired during operation. This method incorporates a previously developed method, known in the art as the method of oriented bounding boxes (OBBs), in which an object is represented approximately, for computational purposes, by a box that encloses its outer boundary. Because many parts of a robotic manipulator are cylindrical, the OBB method has been extended in this method to enable the approximate representation of cylindrical parts by use of octagonal or other multiple-OBB assemblies denoted oriented bounding prisms (OBPs). A multiresolution OBB/OBP representation of the robot and its manipulator arm and a multiresolution OBB representation of external objects (including terrain) are constructed and used in a process in which collisions at successively finer resolutions are detected through computational detection of overlaps between the corresponding OBB and OBP models. For computational efficiency, the process is started at the coarsest resolution and stopped as soon as possible, preferably before reaching the finest resolution. At the coarsest resolution, there is a single OBB enclosing all relevant external objects and a single OBB enclosing the entire robot. At the next finer level of resolution, the coarsest-resolution OBB is divided into two OBBs, and so forth. If no collision is detected at the coarsest resolution, then there is no need for further computation to detect collisions. If a collision is detected at the coarsest resolution, then tests for collisions are performed at the next finer level of resolution. This process is continued to successively finer resolutions until either no more collisions are detected or the finest resolution is reached.

Backes, Paul↗

Hybrid AI/Cognitive Tactical Behavior Framework for LVC (LDRD Project Final Report)

This Lab-Directed Research and Development (LDRD) sought to develop technology that enhances scenario construction speed, entity behavior robustness, and scalability in Live-Virtual-Constructive (LVC) simulation. We investigated issues in both simulation architecture and behavior modeling. We developed path-planning technology that improves the ability to express intent in the planning task while still permitting an efficient search algorithm. An LVC simulation demonstrated how this enables 'one-click' layout of squad tactical paths, as well as dynamic re-planning for simulated squads and for real and simulated mobile robots. We identified human response latencies that can be exploited in parallel/distributed architectures. We did an experimental study to determine where parallelization would be productive in Umbra-based force-on-force (FOF) simulations. We developed and implemented a data-driven simulation composition approach that solves entity class hierarchy issues and supports assurance of simulation fairness. Finally, we proposed a flexible framework to enable integration of multiple behavior modeling components that model working memory phenomena with different degrees of sophistication.

99 GENERAL AND MISCELLANEOUS↗

Gamma-ray raster imaging with robotic data collection. FY18 report

This project has developed an alternative imaging capability for measuring radioactive materials in situ. This approach uses a robotic-mounted gamma-ray detector which can move around an area of interest, sampling the space at a high frequency. By rastering across the area, an image can be created with no collimation and a high efficiency. A regression model was developed to map out material distribution as the robot moves through the environment. An informative path planning algorithm was also developed to maximize the information collected throughout the movement path. The use of a robotic mount allows data collection for long periods of time unattended, and it will also eliminate uncertainties in positioning typically introduced by personnel. This approach will be particularly relevant for gloveboxes, shielded cells, or process piping which may have complex, non-uniform distributions of material.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Applications of artificial intelligence to space station and automated software techniques: High level robot command language

The objective is to develop a system that will allow a person not necessarily skilled in the art of programming robots to quickly and naturally create the necessary data and commands to enable a robot to perform a desired task. The system will use a menu driven graphical user interface. This interface will allow the user to input data to select objects to be moved. There will be an imbedded expert system to process the knowledge about objects and the robot to determine how they are to be moved. There will be automatic path planning to avoid obstacles in the work space and to create a near optimum path. The system will contain the software to generate the required robot instructions.

Mckee, James W.↗

6. Closed-Loop Toolpath Generation

Closed-loop paths, also known as closed-loop contours, are paths that start and stop at the same point and are typically used to define the perimeter or outermost boundary of the polygon that represents a given layer of an object, referred to as the “layer polygon.” Finding the location of a closed-loop path involves applying two offsetting steps to the edge of the layer polygon. The offsetting steps respectively serve to (1) find the area that contains the toolpath and (2) find the centerline of that area, to define the path itself. After finding the perimeter path, the remaining geometry from the layer polygon can be used for additional path-planning steps. This chapter will discuss how the location for a closed-loop path is found, including various problem scenarios, and the different types of closed-loop paths used in additive manufacturing.

Roschli, Alex↗

Time optimal paths and acceleration lines of robotic manipulators

The concept of acceleration lines and their correlation with time-optimal paths of robotic manipulators is presented. The acceleration lines represent the directions of maximum tip acceleration from a point in the manipulator work-space, starting at a zero velocity. These lines can suggest the number and shapes of time-optimal paths for a class of manipulators. It is shown that nonsingular time-optimal paths are tangent to one of the acceleration lines near the end-points. A procedure for obtaining near-optimal paths, utilizing the acceleration lines, is developed. These paths are obtained by connecting the end-points with B splines tangent to the acceleration lines. The near-minimum paths are shown to yield better traveling times than the straight-line path between the same end-points. The near-minimum paths can be used as initial conditions in existing optimization methods to speed-up convergence and computation time. This method can be used for online robot path planning and for interactive designs of robotic-cell layouts. Examples of time-optimal paths of a two-link manipulator, obtained by other optimization procedures and their acceleration lines, are shown.

Shiller, Zvi↗

Planar slicing for nonextrusion AM processes

Extrusion-based AM processes, including material extrusion and directed energy deposition, construct objects by continuously depositing a relatively small amount of molten feedstock to a specific location. Nonextrusion AM processes, on the other hand, tend to form each layer by linearly or areally projecting either energy onto a vat of photocurable liquid or a binding agent into a bed of loose powder. Such systems vary significantly from extrusion-based AM processes but do share similarities. The general approach to path planning is the same, but nonextrusion processes typically favor the use of bitmap representations, instead of polygons, for pathing computation and do not use a g-code file to command the printer. In this chapter, a high-level discussion of these differences will be covered.

Macdonald, Eric↗

Airline meteorological requirements

A brief review of airline meteorological/flight planning is presented. The effects of variations in meteorological parameters upon flight and operational costs are reviewed. Flight path planning through the use of meteorological information is briefly discussed.

Chandler, C. L.↗

Graphical interfaces for cooperative planning systems

Based on a cognitive task analysis of 5 airline flight crews in a simulator study, researchers have designed a testbed for studying computer aids for en route flight path planning. This testbed runs on a Mac II controlling three color monitors, and is being used to study the design of aids for both dispatchers and flight crews. Specifically, the research focuses on design concepts for developing cooperative problem-solving systems. We use en route flight planning (selecting alternate routes or destinations due to unanticipated weather, traffic, malfunctions, etc.) as the context for studying the design of such systems. Researchers are currently exploring three questions in this test environment: (1) When interacting with a flight planning aid, how does the role of the pilot influence overall system performance; (2) Can the architecture for a cooperative planning system be built around Sacerdoti's (1983) concept of an abstraction hierarchy, where the pilot can interact with the system at many different levels of detail (but where the computer aid by default handles lower level details that the pilot has chosen not to deat with); and (3) Can graphical displays and direct manipulation of these displays provide perceptual enhancements (Larkin and Simon, 1987) of the pilot's problem-solving activities. Information is given in viewgraph form.

Smith, Philip J.↗