Path Planning For A Class Of Cutting Operations

NASA Astrophysics Data System (ADS)

Tavora, Jose

1989-03-01

Optimizing processing time in some contour-cutting operations requires solving the so-called no-load path problem. This problem is formulated and an approximate resolution method (based on heuristic search techniques) is described. Results for real-life instances (clothing layouts in the apparel industry) are presented and evaluated.

Autonomous search and surveillance with small fixed wing aircraft

NASA Astrophysics Data System (ADS)

McGee, Timothy Garland

Small unmanned aerial vehicles (UAVs) have the potential to act as low cost tools in a variety of both civilian and military applications including traffic monitoring, border patrol, and search and rescue. While most current operational UAV systems require human operators, advances in autonomy will allow these systems to reach their full potential as sensor platforms. This dissertation specifically focuses on developing advanced control, path planning, search, and image processing techniques that allow small fixed wing aircraft to autonomously collect data. The problems explored were motivated by experience with the development and experimental flight testing of a fleet of small autonomous fixed wing aircraft. These issues, which have not been fully addressed in past work done on ground vehicles or autonomous helicopters, include the influence of wind and turning rate constraints, the non-negligible velocity of ground targets relative to the aircraft velocity, and limitations on sensor size and processing power on small vehicles. Several contributions for the autonomous operation of small fixed wing aircraft are presented. Several sliding surface controllers are designed which extend previous techniques to include variable sliding surface coefficients and the use of spatial vehicle dynamics. These advances eliminate potential singularities in the control laws to follow spatially defined paths and allow smooth transition between controllers. The optimal solution for the problem of path planning through an ordered set of points for an aircraft with a bounded turning rate in the presence of a constant wind is then discussed. Path planning strategies are also explored to guarantee that a searcher will travel within sensing distance of a mobile ground target. This work assumes only a maximum velocity of the target and is designed to succeed for any possible path of the target. Closed-loop approximations of both the path planning and search techniques, using the sliding surface controllers already discussed, are also studied. Finally, a novel method is presented to detect obstacles by segmenting an image into sky and non-sky regions. The feasibility of this method is demonstrated experimentally on an aircraft test bed.

Robot path planning using expert systems and machine vision

NASA Astrophysics Data System (ADS)

Malone, Denis E.; Friedrich, Werner E.

1992-02-01

This paper describes a system developed for the robotic processing of naturally variable products. In order to plan the robot motion path it was necessary to use a sensor system, in this case a machine vision system, to observe the variations occurring in workpieces and interpret this with a knowledge based expert system. The knowledge base was acquired by carrying out an in-depth study of the product using examination procedures not available in the robotic workplace and relates the nature of the required path to the information obtainable from the machine vision system. The practical application of this system to the processing of fish fillets is described and used to illustrate the techniques.

Planning minimum-energy paths in an off-road environment with anisotropic traversal costs and motion constraints. Doctoral thesis

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ross, R.S.

1989-06-01

For a vehicle operating across arbitrarily-contoured terrain, finding the most fuel-efficient route between two points can be viewed as a high-level global path-planning problem with traversal costs and stability dependent on the direction of travel (anisotropic). The problem assumes a two-dimensional polygonal map of homogeneous cost regions for terrain representation constructed from elevation information. The anisotropic energy cost of vehicle motion has a non-braking component dependent on horizontal distance, a braking component dependent on vertical distance, and a constant path-independent component. The behavior of minimum-energy paths is then proved to be restricted to a small, but optimal set of traversalmore » types. An optimal-path-planning algorithm, using a heuristic search technique, reduces the infinite number of paths between the start and goal points to a finite number by generating sequences of goal-feasible window lists from analyzing the polygonal map and applying pruning criteria. The pruning criteria consist of visibility analysis, heading analysis, and region-boundary constraints. Each goal-feasible window lists specifies an associated convex optimization problem, and the best of all locally-optimal paths through the goal-feasible window lists is the globally-optimal path. These ideas have been implemented in a computer program, with results showing considerably better performance than the exponential average-case behavior predicted.« less

Comparison of tablet-based strategies for incision planning in laser microsurgery

NASA Astrophysics Data System (ADS)

Schoob, Andreas; Lekon, Stefan; Kundrat, Dennis; Kahrs, Lüder A.; Mattos, Leonardo S.; Ortmaier, Tobias

2015-03-01

Recent research has revealed that incision planning in laser surgery deploying stylus and tablet outperforms state-of-the-art micro-manipulator-based laser control. Providing more detailed quantitation regarding that approach, a comparative study of six tablet-based strategies for laser path planning is presented. Reference strategy is defined by monoscopic visualization and continuous path drawing on a graphics tablet. Further concepts deploying stereoscopic or a synthesized laser view, point-based path definition, real-time teleoperation or a pen display are compared with the reference scenario. Volunteers were asked to redraw and ablate stamped lines on a sample. Performance is assessed by measuring planning accuracy, completion time and ease of use. Results demonstrate that significant differences exist between proposed concepts. The reference strategy provides more accurate incision planning than the stereo or laser view scenario. Real-time teleoperation performs best with respect to completion time without indicating any significant deviation in accuracy and usability. Point-based planning as well as the pen display provide most accurate planning and increased ease of use compared to the reference strategy. As a result, combining the pen display approach with point-based planning has potential to become a powerful strategy because of benefiting from improved hand-eye-coordination on the one hand and from a simple but accurate technique for path definition on the other hand. These findings as well as the overall usability scale indicating high acceptance and consistence of proposed strategies motivate further advanced tablet-based planning in laser microsurgery.

Potential dosimetric benefit of dose-warping based 4D planning compared to conventional 3D planning in liver stereotactic body radiotherapy (SBRT)

NASA Astrophysics Data System (ADS)

Yeo, U. J.; Taylor, M. L.; Kron, T.; Pham, D.; Siva, S.; Franich, R. D.

2013-06-01

Respiratory motion induces dosimetric uncertainties for thoracic and abdominal cancer radiotherapy (RT) due to deforming and moving anatomy. This study investigates the extent of dosimetric differences between conventional 3D treatment planning and path-integrated 4D treatment planning in liver stereotactic body radiotherapy (SBRT). Respiratory-correlated 4DCT image sets with 10 phases were acquired for patients with liver tumours. Path-integrated 4D dose accumulation was performed using dose-warping techniques based on deformable image registration. Dose-volume histogram analysis demonstrated that the 3D planning approach overestimated doses to targets by up to 24% and underestimated dose to normal liver by ~4.5%, compared to the 4D planning methodology. Therefore, 4D planning has the potential to quantify such issues of under- and/or over-dosage and improve treatment accuracy.

Visual terrain mapping for traversable path planning of mobile robots

NASA Astrophysics Data System (ADS)

Shirkhodaie, Amir; Amrani, Rachida; Tunstel, Edward W.

2004-10-01

In this paper, we have primarily discussed technical challenges and navigational skill requirements of mobile robots for traversability path planning in natural terrain environments similar to Mars surface terrains. We have described different methods for detection of salient terrain features based on imaging texture analysis techniques. We have also presented three competing techniques for terrain traversability assessment of mobile robots navigating in unstructured natural terrain environments. These three techniques include: a rule-based terrain classifier, a neural network-based terrain classifier, and a fuzzy-logic terrain classifier. Each proposed terrain classifier divides a region of natural terrain into finite sub-terrain regions and classifies terrain condition exclusively within each sub-terrain region based on terrain visual clues. The Kalman Filtering technique is applied for aggregative fusion of sub-terrain assessment results. The last two terrain classifiers are shown to have remarkable capability for terrain traversability assessment of natural terrains. We have conducted a comparative performance evaluation of all three terrain classifiers and presented the results in this paper.

Autonomous Vehicle Mission Planning Using AI (Artificial Intelligence) Techniques.

DTIC Science & Technology

1985-12-01

it uses are declarative patterns that encode facts about how goals may give rise to - . plans. The program processes a story a sentence at a time...the planning process. By separating the knowledge about how to plan from the specific domain knowledge, an understander can use this knowledge about how ...path planning program developed in a previous thesis effort will be incorporated into the overall program in order to demonstrate the operating system

Planning collision free paths for two cooperating robots using a divide-and-conquer C-space traversal heuristic

NASA Technical Reports Server (NTRS)

Weaver, Johnathan M.

1993-01-01

A method was developed to plan feasible and obstacle-avoiding paths for two spatial robots working cooperatively in a known static environment. Cooperating spatial robots as referred to herein are robots which work in 6D task space while simultaneously grasping and manipulating a common, rigid payload. The approach is configuration space (c-space) based and performs selective rather than exhaustive c-space mapping. No expensive precomputations are required. A novel, divide-and-conquer type of heuristic is used to guide the selective mapping process. The heuristic does not involve any robot, environment, or task specific assumptions. A technique was also developed which enables solution of the cooperating redundant robot path planning problem without requiring the use of inverse kinematics for a redundant robot. The path planning strategy involves first attempting to traverse along the configuration space vector from the start point towards the goal point. If an unsafe region is encountered, an intermediate via point is identified by conducting a systematic search in the hyperplane orthogonal to and bisecting the unsafe region of the vector. This process is repeatedly applied until a solution to the global path planning problem is obtained. The basic concept behind this strategy is that better local decisions at the beginning of the trouble region may be made if a possible way around the 'center' of the trouble region is known. Thus, rather than attempting paths which look promising locally (at the beginning of a trouble region) but which may not yield overall results, the heuristic attempts local strategies that appear promising for circumventing the unsafe region.

Integrate Evaluation into the Planning Process.

ERIC Educational Resources Information Center

Camp, William

1985-01-01

In an attempt to correct for limitations in the Program Evaluation and Review Technique-Critical Path Method (PERT-CPM), the Graphical Evaluation and Review Technique (GERT) has been developed. This management tool allows for evaluation during the facilities' development process. Two figures and two references are provided. (DCS)

Path planning on satellite images for unmanned surface vehicles

NASA Astrophysics Data System (ADS)

Yang, Joe-Ming; Tseng, Chien-Ming; Tseng, P. S.

2015-01-01

In recent years, the development of autonomous surface vehicles has been a field of increasing research interest. There are two major areas in this field: control theory and path planning. This study focuses on path planning, and two objectives are discussed: path planning for Unmanned Surface Vehicles (USVs) and implementation of path planning in a real map. In this paper, satellite thermal images are converted into binary images which are used as the maps for the Finite Angle A* algorithm (FAA*), an advanced A* algorithm that is used to determine safer and suboptimal paths for USVs. To plan a collision-free path, the algorithm proposed in this article considers the dimensions of surface vehicles. Furthermore, the turning ability of a surface vehicle is also considered, and a constraint condition is introduced to improve the quality of the path planning algorithm, which makes the traveled path smoother. This study also shows a path planning experiment performed on a real satellite thermal image, and the path planning results can be used by an USV.

Hierarchical Motion Planning for Autonomous Aerial and Terrestrial Vehicles

NASA Astrophysics Data System (ADS)

Cowlagi, Raghvendra V.

Autonomous mobile robots---both aerial and terrestrial vehicles---have gained immense importance due to the broad spectrum of their potential military and civilian applications. One of the indispensable requirements for the autonomy of a mobile vehicle is the vehicle's capability of planning and executing its motion, that is, finding appropriate control inputs for the vehicle such that the resulting vehicle motion satisfies the requirements of the vehicular task. The motion planning and control problem is inherently complex because it involves two disparate sub-problems: (1) satisfaction of the vehicular task requirements, which requires tools from combinatorics and/or formal methods, and (2) design of the vehicle control laws, which requires tools from dynamical systems and control theory. Accordingly, this problem is usually decomposed and solved over two levels of hierarchy. The higher level, called the geometric path planning level, finds a geometric path that satisfies the vehicular task requirements, e.g., obstacle avoidance. The lower level, called the trajectory planning level, involves sufficient smoothening of this geometric path followed by a suitable time parametrization to obtain a reference trajectory for the vehicle. Although simple and efficient, such hierarchical decomposition suffers a serious drawback: the geometric path planner has no information of the kinematical and dynamical constraints of the vehicle. Consequently, the geometric planner may produce paths that the trajectory planner cannot transform into a feasible reference trajectory. Two main ideas appear in the literature to remedy this problem: (a) randomized sampling-based planning, which eliminates the geometric planner altogether by planning in the vehicle state space, and (b) geometric planning supported by feedback control laws. The former class of methods suffer from a lack of optimality of the resultant trajectory, while the latter class of methods makes a restrictive assumption concerning the vehicle kinematical model. We propose a hierarchical motion planning framework based on a novel mode of interaction between these two levels of planning. This interaction rests on the solution of a special shortest-path problem on graphs, namely, one using costs defined on multiple edge transitions in the path instead of the usual single edge transition costs. These costs are provided by a local trajectory generation algorithm, which we implement using model predictive control and the concept of effective target sets for simplifying the non-convex constraints involved in the problem. The proposed motion planner ensures "consistency" between the two levels of planning, i.e., a guarantee that the higher level geometric path is always associated with a kinematically and dynamically feasible trajectory. The main contributions of this thesis are: 1. A motion planning framework based on history-dependent costs (H-costs) in cell decomposition graphs for incorporating vehicle dynamical constraints: this framework offers distinct advantages in comparison with the competing approaches of discretization of the state space, of randomized sampling-based motion planning, and of local feedback-based, decoupled hierarchical motion planning, 2. An efficient and flexible algorithm for finding optimal H-cost paths, 3. A precise and general formulation of a local trajectory problem (the tile motion planning problem) that allows independent development of the discrete planner and the trajectory planner, while maintaining "compatibility" between the two planners, 4. A local trajectory generation algorithm using mpc, and the application of the concept of effective target sets for a significant simplification of the local trajectory generation problem, 5. The geometric analysis of curvature-bounded traversal of rectangular channels, leading to less conservative results in comparison with a result reported in the literature, and also to the efficient construction of effective target sets for the solution of the tile motion planning problem, 6. A wavelet-based multi-resolution path planning scheme, and a proof of completeness of the proposed scheme: such proofs are altogether absent from other works on multi-resolution path planning, 7. A technique for extracting all information about cells---namely, the locations, the sizes, and the associated image intensities---directly from the set of significant detail coefficients considered for path planning at a given iteration, and 8. The extension of the multi-resolution path planning scheme to include vehicle dynamical constraints using the aforementioned history-dependent costs approach. The future work includes an implementation of the proposed framework involving a discrete planner that solves classical planning problems more general than the single-query path planning problem considered thus far, and involving trajectory generation schemes for realistic vehicle dynamical models such as the bicycle model.

A Mobile Sensing Approach for Regional Surveillance of Fugitive Methane Emissions in Oil and Gas Production.

PubMed

Albertson, John D; Harvey, Tierney; Foderaro, Greg; Zhu, Pingping; Zhou, Xiaochi; Ferrari, Silvia; Amin, M Shahrooz; Modrak, Mark; Brantley, Halley; Thoma, Eben D

2016-03-01

This paper addresses the need for surveillance of fugitive methane emissions over broad geographical regions. Most existing techniques suffer from being either extensive (but qualitative) or quantitative (but intensive with poor scalability). A total of two novel advancements are made here. First, a recursive Bayesian method is presented for probabilistically characterizing fugitive point-sources from mobile sensor data. This approach is made possible by a new cross-plume integrated dispersion formulation that overcomes much of the need for time-averaging concentration data. The method is tested here against a limited data set of controlled methane release and shown to perform well. We then present an information-theoretic approach to plan the paths of the sensor-equipped vehicle, where the path is chosen so as to maximize expected reduction in integrated target source rate uncertainty in the region, subject to given starting and ending positions and prevailing meteorological conditions. The information-driven sensor path planning algorithm is tested and shown to provide robust results across a wide range of conditions. An overall system concept is presented for optionally piggybacking of these techniques onto normal industry maintenance operations using sensor-equipped work trucks.

MRI-based dynamic tracking of an untethered ferromagnetic microcapsule navigating in liquid

NASA Astrophysics Data System (ADS)

Dahmen, Christian; Belharet, Karim; Folio, David; Ferreira, Antoine; Fatikow, Sergej

2016-04-01

The propulsion of ferromagnetic objects by means of MRI gradients is a promising approach to enable new forms of therapy. In this work, necessary techniques are presented to make this approach work. This includes path planning algorithms working on MRI data, ferromagnetic artifact imaging and a tracking algorithm which delivers position feedback for the ferromagnetic objects, and a propulsion sequence to enable interleaved magnetic propulsion and imaging. Using a dedicated software environment, integrating path-planning methods and real-time tracking, a clinical MRI system is adapted to provide this new functionality for controlled interventional targeted therapeutic applications. Through MRI-based sensing analysis, this article aims to propose a framework to plan a robust pathway to enhance the navigation ability to reach deep locations in the human body. The proposed approaches are validated with different experiments.

Calibration of neural networks using genetic algorithms, with application to optimal path planning

NASA Technical Reports Server (NTRS)

Smith, Terence R.; Pitney, Gilbert A.; Greenwood, Daniel

1987-01-01

Genetic algorithms (GA) are used to search the synaptic weight space of artificial neural systems (ANS) for weight vectors that optimize some network performance function. GAs do not suffer from some of the architectural constraints involved with other techniques and it is straightforward to incorporate terms into the performance function concerning the metastructure of the ANS. Hence GAs offer a remarkably general approach to calibrating ANS. GAs are applied to the problem of calibrating an ANS that finds optimal paths over a given surface. This problem involves training an ANS on a relatively small set of paths and then examining whether the calibrated ANS is able to find good paths between arbitrary start and end points on the surface.

Finding Out Critical Points For Real-Time Path Planning

NASA Astrophysics Data System (ADS)

Chen, Wei

1989-03-01

Path planning for a mobile robot is a classic topic, but the path planning under real-time environment is a different issue. The system sources including sampling time, processing time, processes communicating time, and memory space are very limited for this type of application. This paper presents a method which abstracts the world representation from the sensory data and makes the decision as to which point will be a potentially critical point to span the world map by using incomplete knowledge about physical world and heuristic rule. Without any previous knowledge or map of the workspace, the robot will determine the world map by roving through the workspace. The computational complexity for building and searching such a map is not more than O( n2 ) The find-path problem is well-known in robotics. Given an object with an initial location and orientation, a goal location and orientation, and a set of obstacles located in space, the problem is to find a continuous path for the object from the initial position to the goal position which avoids collisions with obstacles along the way. There are a lot of methods to find a collision-free path in given environment. Techniques for solving this problem can be classified into three approaches: 1) the configuration space approach [1],[2],[3] which represents the polygonal obstacles by vertices in a graph. The idea is to determine those parts of the free space which a reference point of the moving object can occupy without colliding with any obstacles. A path is then found for the reference point through this truly free space. Dealing with rotations turns out to be a major difficulty with the approach, requiring complex geometric algorithms which are computationally expensive. 2) the direct representation of the free space using basic shape primitives such as convex polygons [4] and overlapping generalized cones [5]. 3) the combination of technique 1 and 2 [6] by which the space is divided into the primary convex region, overlap region and obstacle region, then obstacle boundaries with attribute values are represented by the vertices of the hypergraph. The primary convex region and overlap region are represented by hyperedges, the centroids of overlap form the critical points. The difficulty is generating segment graph and estimating of minimum path width. The all techniques mentioned above need previous knowledge about the world to make path planning and the computational cost is not low. They are not available in an unknow and uncertain environment. Due to limited system resources such as CPU time, memory size and knowledge about the special application in an intelligent system (such as mobile robot), it is necessary to use algorithms that provide the good decision which is feasible with the available resources in real time rather than the best answer that could be achieved in unlimited time with unlimited resources. A real-time path planner should meet following requirements: - Quickly abstract the representation of the world from the sensory data without any previous knowledge about the robot environment. - Easily update the world model to spell out the global-path map and to reflect changes in the robot environment. - Must make a decision of where the robot must go and which direction the range sensor should point to in real time with limited resources. The method presented here assumes that the data from range sensors has been processed by signal process unite. The path planner will guide the scan of range sensor, find critical points, make decision where the robot should go and which point is poten- tial critical point, generate the path map and monitor the robot moves to the given point. The program runs recursively until the goal is reached or the whole workspace is roved through.

TH-EF-BRB-04: 4π Dynamic Conformal Arc Therapy Dynamic Conformal Arc Therapy (DCAT) for SBRT

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chiu, T; Long, T; Tian, Z.

2016-06-15

Purpose: To develop an efficient and effective trajectory optimization methodology for 4π dynamic conformal arc treatment (4π DCAT) with synchronized gantry and couch motion; and to investigate potential clinical benefits for stereotactic body radiation therapy (SBRT) to breast, lung, liver and spine tumors. Methods: The entire optimization framework for 4π DCAT inverse planning consists of two parts: 1) integer programming algorithm and 2) particle swarm optimization (PSO) algorithm. The integer programming is designed to find an optimal solution for arc delivery trajectory with both couch and gantry rotation, while PSO minimize a non-convex objective function based on the selected trajectorymore » and dose-volume constraints. In this study, control point interaction is explicitly taken into account. Beam trajectory was modeled as a series of control points connected together to form a deliverable path. With linear treatment planning objectives, a mixed-integer program (MIP) was formulated. Under mild assumptions, the MIP is tractable. Assigning monitor units to control points along the path can be integrated into the model and done by PSO. The developed 4π DCAT inverse planning strategy is evaluated on SBRT cases and compared to clinically treated plans. Results: The resultant dose distribution of this technique was evaluated between 3D conformal treatment plan generated by Pinnacle treatment planning system and 4π DCAT on a lung SBRT patient case. Both plans share the same scale of MU, 3038 and 2822 correspondingly to 3D conformal plan and 4π DCAT. The mean doses for most of OARs were greatly reduced at 32% (cord), 70% (esophagus), 2.8% (lung) and 42.4% (stomach). Conclusion: Initial results in this study show the proposed 4π DCAT treatment technique can achieve better OAR sparing and lower MUs, which indicates that the developed technique is promising for high dose SBRT to reduce the risk of secondary cancer.« less

Two arm robot path planning in a static environment using polytopes and string stretching. Thesis

NASA Technical Reports Server (NTRS)

Schima, Francis J., III

1990-01-01

The two arm robot path planning problem has been analyzed and reduced into components to be simplified. This thesis examines one component in which two Puma-560 robot arms are simultaneously holding a single object. The problem is to find a path between two points around obstacles which is relatively fast and minimizes the distance. The thesis involves creating a structure on which to form an advanced path planning algorithm which could ideally find the optimum path. An actual path planning method is implemented which is simple though effective in most common situations. Given the limits of computer technology, a 'good' path is currently found. Objects in the workspace are modeled with polytopes. These are used because they can be used for rapid collision detection and still provide a representation which is adequate for path planning.

Computational path planner for product assembly in complex environments

NASA Astrophysics Data System (ADS)

Shang, Wei; Liu, Jianhua; Ning, Ruxin; Liu, Mi

2013-03-01

Assembly path planning is a crucial problem in assembly related design and manufacturing processes. Sampling based motion planning algorithms are used for computational assembly path planning. However, the performance of such algorithms may degrade much in environments with complex product structure, narrow passages or other challenging scenarios. A computational path planner for automatic assembly path planning in complex 3D environments is presented. The global planning process is divided into three phases based on the environment and specific algorithms are proposed and utilized in each phase to solve the challenging issues. A novel ray test based stochastic collision detection method is proposed to evaluate the intersection between two polyhedral objects. This method avoids fake collisions in conventional methods and degrades the geometric constraint when a part has to be removed with surface contact with other parts. A refined history based rapidly-exploring random tree (RRT) algorithm which bias the growth of the tree based on its planning history is proposed and employed in the planning phase where the path is simple but the space is highly constrained. A novel adaptive RRT algorithm is developed for the path planning problem with challenging scenarios and uncertain environment. With extending values assigned on each tree node and extending schemes applied, the tree can adapts its growth to explore complex environments more efficiently. Experiments on the key algorithms are carried out and comparisons are made between the conventional path planning algorithms and the presented ones. The comparing results show that based on the proposed algorithms, the path planner can compute assembly path in challenging complex environments more efficiently and with higher success. This research provides the references to the study of computational assembly path planning under complex environments.

Feasible Path Generation Using Bezier Curves for Car-Like Vehicle

NASA Astrophysics Data System (ADS)

Latip, Nor Badariyah Abdul; Omar, Rosli

2017-08-01

When planning a collision-free path for an autonomous vehicle, the main criteria that have to be considered are the shortest distance, lower computation time and completeness, i.e. a path can be found if one exists. Besides that, a feasible path for the autonomous vehicle is also crucial to guarantee that the vehicle can reach the target destination considering its kinematic constraints such as non-holonomic and minimum turning radius. In order to address these constraints, Bezier curves is applied. In this paper, Bezier curves are modeled and simulated using Matlab software and the feasibility of the resulting path is analyzed. Bezier curve is derived from a piece-wise linear pre-planned path. It is found that the Bezier curves has the capability of making the planned path feasible and could be embedded in a path planning algorithm for an autonomous vehicle with kinematic constraints. It is concluded that the length of segments of the pre-planned path have to be greater than a nominal value, derived from the vehicle wheelbase, maximum steering angle and maximum speed to ensure the path for the autonomous car is feasible.

Needle-tissue interactive mechanism and steering control in image-guided robot-assisted minimally invasive surgery: a review.

PubMed

Li, Pan; Yang, Zhiyong; Jiang, Shan

2018-06-01

Image-guided robot-assisted minimally invasive surgery is an important medicine procedure used for biopsy or local target therapy. In order to reach the target region not accessible using traditional techniques, long and thin flexible needles are inserted into the soft tissue which has large deformation and nonlinear characteristics. However, the detection results and therapeutic effect are directly influenced by the targeting accuracy of needle steering. For this reason, the needle-tissue interactive mechanism, path planning, and steering control are investigated in this review by searching literatures in the last 10 years, which results in a comprehensive overview of the existing techniques with the main accomplishments, limitations, and recommendations. Through comprehensive analyses, surgical simulation for insertion into multi-layer inhomogeneous tissue is verified as a primary and propositional aspect to be explored, which accurately predicts the nonlinear needle deflection and tissue deformation. Investigation of the path planning of flexible needles is recommended to an anatomical or a deformable environment which has characteristics of the tissue deformation. Nonholonomic modeling combined with duty-cycled spinning for needle steering, which tracks the tip position in real time and compensates for the deviation error, is recommended as a future research focus in the steering control in anatomical and deformable environments. Graphical abstract a Insertion force when the needle is inserted into soft tissue. b Needle deflection model when the needle is inserted into soft tissue [68]. c Path planning in anatomical environments [92]. d Duty-cycled spinning incorporated in nonholonomic needle steering [64].

International Conference on Antennas and Propagation (ICAP 89), 6th, University of Warwick, Coventry, England, Apr. 4-7, 1989, Proceedings. Part 1 - Antennas. Part 2 - Propagation

NASA Astrophysics Data System (ADS)

Various papers on antennas and propagation are presented. The general topics addressed include: phased arrays; reflector antennas; slant path propagation; propagation data for HF radio systems performance; satellite and earth station antennas; radio propagation in the troposphere; propagation data for HF radio systems performance; microstrip antennas; rain radio meteorology; conformal antennas; horns and feed antennas; low elevation slant path propagation; radio millimeter wave propagation; array antennas; propagation effects on satellite mobile, satellite broadcast, and aeronautical systems; ionospheric irregularities and motions; adaptive antennas; transient response; measurement techniques; clear air radio meteorology; ionospheric and propagation modeling; millimeter wave and lens antennas; electromagnetic theory and numerical techniques; VHF propagation modeling, system planning methods; radio propagation theoretical techniques; scattering and diffraction; transhorizon rain scatter effects; ELF-VHF and broadcast antennas; clear air millimeter propagation; scattering and frequency-selective surfaces; antenna technology; clear air transhorizon propagation.

Research on global path planning based on ant colony optimization for AUV

NASA Astrophysics Data System (ADS)

Wang, Hong-Jian; Xiong, Wei

2009-03-01

Path planning is an important issue for autonomous underwater vehicles (AUVs) traversing an unknown environment such as a sea floor, a jungle, or the outer celestial planets. For this paper, global path planning using large-scale chart data was studied, and the principles of ant colony optimization (ACO) were applied. This paper introduced the idea of a visibility graph based on the grid workspace model. It also brought a series of pheromone updating rules for the ACO planning algorithm. The operational steps of the ACO algorithm are proposed as a model for a global path planning method for AUV. To mimic the process of smoothing a planned path, a cutting operator and an insertion-point operator were designed. Simulation results demonstrated that the ACO algorithm is suitable for global path planning. The system has many advantages, including that the operating path of the AUV can be quickly optimized, and it is shorter, safer, and smoother. The prototype system successfully demonstrated the feasibility of the concept, proving it can be applied to surveys of unstructured unmanned environments.

UAV path planning using artificial potential field method updated by optimal control theory

NASA Astrophysics Data System (ADS)

Chen, Yong-bo; Luo, Guan-chen; Mei, Yue-song; Yu, Jian-qiao; Su, Xiao-long

2016-04-01

The unmanned aerial vehicle (UAV) path planning problem is an important assignment in the UAV mission planning. Based on the artificial potential field (APF) UAV path planning method, it is reconstructed into the constrained optimisation problem by introducing an additional control force. The constrained optimisation problem is translated into the unconstrained optimisation problem with the help of slack variables in this paper. The functional optimisation method is applied to reform this problem into an optimal control problem. The whole transformation process is deduced in detail, based on a discrete UAV dynamic model. Then, the path planning problem is solved with the help of the optimal control method. The path following process based on the six degrees of freedom simulation model of the quadrotor helicopters is introduced to verify the practicability of this method. Finally, the simulation results show that the improved method is more effective in planning path. In the planning space, the length of the calculated path is shorter and smoother than that using traditional APF method. In addition, the improved method can solve the dead point problem effectively.

Coordinating robot motion, sensing, and control in plans. LDRD project final report

DOE Office of Scientific and Technical Information (OSTI.GOV)

Xavier, P.G.; Brown, R.G.; Watterberg, P.A.

1997-08-01

The goal of this project was to develop a framework for robotic planning and execution that provides a continuum of adaptability with respect to model incompleteness, model error, and sensing error. For example, dividing robot motion into gross-motion planning, fine-motion planning, and sensor-augmented control had yielded productive research and solutions to individual problems. Unfortunately, these techniques could only be combined by hand with ad hoc methods and were restricted to systems where all kinematics are completely modeled in planning. The original intent was to develop methods for understanding and autonomously synthesizing plans that coordinate motion, sensing, and control. The projectmore » considered this problem from several perspectives. Results included (1) theoretical methods to combine and extend gross-motion and fine-motion planning; (2) preliminary work in flexible-object manipulation and an implementable algorithm for planning shortest paths through obstacles for the free-end of an anchored cable; (3) development and implementation of a fast swept-body distance algorithm; and (4) integration of Sandia`s C-Space Toolkit geometry engine and SANDROS motion planer and improvements, which yielded a system practical for everyday motion planning, with path-segment planning at interactive speeds. Results (3) and (4) have either led to follow-on work or are being used in current projects, and they believe that (2) will eventually be also.« less

Mixed-Initiative Development of Plans With Expressive Temporal Constraints

DTIC Science & Technology

2007-06-14

added.m One technique that is commonly used in DTP solving, incremen- tal full-path consistency, exploits this property by maintaining a stack of the...Giordano. " M. Pollack was elected to the CRA (Computing Research Association) Board of Directors, 2007-2009. " M. Moffitt won the IBM 2007 Josef Raviv

The Application of Project Management Techniques to College and University Admissions Activities.

ERIC Educational Resources Information Center

Bickers, Doyle

1993-01-01

The process of project management is illustrated through application to one activity, development of a new brochure, within the admissions program of a fictional college. The project life cycle is described, and a work responsibility schedule, project completion schedule, and critical path chart are used as planning and implementation tools. (MSE)

Assessment of variability in cerebral vasculature for neuro-anatomical surgery planning in rodent brain

NASA Astrophysics Data System (ADS)

Rangarajan, J. R.; Van Kuyck, K.; Himmelreich, U.; Nuttin, B.; Maes, F.; Suetens, P.

2011-03-01

Clinical and pre-clinical studies show that deep brain stimulation (DBS) of targeted brain regions by neurosurgical techniques ameliorate psychiatric disorder such as anorexia nervosa. Neurosurgical interventions in preclinical rodent brain are mostly accomplished manually with a 2D atlas. Considering both the large number of animals subjected to stereotactic surgical experiments and the associated imaging cost, feasibility of sophisticated pre-operative imaging based surgical path planning and/or robotic guidance is limited. Here, we spatially normalize vasculature information and assess the intra-strain variability in cerebral vasculature for a neurosurgery planning. By co-registering and subsequently building a probabilistic vasculature template in a standard space, we evaluate the risk of a user defined electrode trajectory damaging a blood vessel on its path. The use of such a method may not only be confined to DBS therapy in small animals, but also could be readily applicable to a wide range of stereotactic small animal surgeries like targeted injection of contrast agents and cell labeling applications.

The application of Markov decision process in restaurant delivery robot

NASA Astrophysics Data System (ADS)

Wang, Yong; Hu, Zhen; Wang, Ying

2017-05-01

As the restaurant delivery robot is often in a dynamic and complex environment, including the chairs inadvertently moved to the channel and customers coming and going. The traditional path planning algorithm is not very ideal. To solve this problem, this paper proposes the Markov dynamic state immediate reward (MDR) path planning algorithm according to the traditional Markov decision process. First of all, it uses MDR to plan a global path, then navigates along this path. When the sensor detects there is no obstructions in front state, increase its immediate state reward value; when the sensor detects there is an obstacle in front, plan a global path that can avoid obstacle with the current position as the new starting point and reduce its state immediate reward value. This continues until the target is reached. When the robot learns for a period of time, it can avoid those places where obstacles are often present when planning the path. By analyzing the simulation experiment, the algorithm has achieved good results in the global path planning under the dynamic environment.

Planning 3-D collision-free paths using spheres

NASA Technical Reports Server (NTRS)

Bonner, Susan; Kelley, Robert B.

1989-01-01

A scheme for the representation of objects, the Successive Spherical Approximation (SSA), facilitates the rapid planning of collision-free paths in a 3-D, dynamic environment. The hierarchical nature of the SSA allows collision-free paths to be determined efficiently while still providing for the exact representation of dynamic objects. The concept of a freespace cell is introduced to allow human 3-D conceptual knowledge to be used in facilitating satisfying choices for paths. Collisions can be detected at a rate better than 1 second per environment object per path. This speed enables the path planning process to apply a hierarchy of rules to create a heuristically satisfying collision-free path.

Methodology for Augmenting Existing Paths with Additional Parallel Transects

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wilson, John E.

2013-09-30

Visual Sample Plan (VSP) is sample planning software that is used, among other purposes, to plan transect sampling paths to detect areas that were potentially used for munition training. This module was developed for application on a large site where existing roads and trails were to be used as primary sampling paths. Gap areas between these primary paths needed to found and covered with parallel transect paths. These gap areas represent areas on the site that are more than a specified distance from a primary path. These added parallel paths needed to optionally be connected together into a single path—themore » shortest path possible. The paths also needed to optionally be attached to existing primary paths, again with the shortest possible path. Finally, the process must be repeatable and predictable so that the same inputs (primary paths, specified distance, and path options) will result in the same set of new paths every time. This methodology was developed to meet those specifications.« less

A Method on Dynamic Path Planning for Robotic Manipulator Autonomous Obstacle Avoidance Based on an Improved RRT Algorithm.

PubMed

Wei, Kun; Ren, Bingyin

2018-02-13

In a future intelligent factory, a robotic manipulator must work efficiently and safely in a Human-Robot collaborative and dynamic unstructured environment. Autonomous path planning is the most important issue which must be resolved first in the process of improving robotic manipulator intelligence. Among the path-planning methods, the Rapidly Exploring Random Tree (RRT) algorithm based on random sampling has been widely applied in dynamic path planning for a high-dimensional robotic manipulator, especially in a complex environment because of its probability completeness, perfect expansion, and fast exploring speed over other planning methods. However, the existing RRT algorithm has a limitation in path planning for a robotic manipulator in a dynamic unstructured environment. Therefore, an autonomous obstacle avoidance dynamic path-planning method for a robotic manipulator based on an improved RRT algorithm, called Smoothly RRT (S-RRT), is proposed. This method that targets a directional node extends and can increase the sampling speed and efficiency of RRT dramatically. A path optimization strategy based on the maximum curvature constraint is presented to generate a smooth and curved continuous executable path for a robotic manipulator. Finally, the correctness, effectiveness, and practicability of the proposed method are demonstrated and validated via a MATLAB static simulation and a Robot Operating System (ROS) dynamic simulation environment as well as a real autonomous obstacle avoidance experiment in a dynamic unstructured environment for a robotic manipulator. The proposed method not only provides great practical engineering significance for a robotic manipulator's obstacle avoidance in an intelligent factory, but also theoretical reference value for other type of robots' path planning.

A two-stage path planning approach for multiple car-like robots based on PH curves and a modified harmony search algorithm

NASA Astrophysics Data System (ADS)

Zeng, Wenhui; Yi, Jin; Rao, Xiao; Zheng, Yun

2017-11-01

In this article, collision-avoidance path planning for multiple car-like robots with variable motion is formulated as a two-stage objective optimization problem minimizing both the total length of all paths and the task's completion time. Accordingly, a new approach based on Pythagorean Hodograph (PH) curves and Modified Harmony Search algorithm is proposed to solve the two-stage path-planning problem subject to kinematic constraints such as velocity, acceleration, and minimum turning radius. First, a method of path planning based on PH curves for a single robot is proposed. Second, a mathematical model of the two-stage path-planning problem for multiple car-like robots with variable motion subject to kinematic constraints is constructed that the first-stage minimizes the total length of all paths and the second-stage minimizes the task's completion time. Finally, a modified harmony search algorithm is applied to solve the two-stage optimization problem. A set of experiments demonstrate the effectiveness of the proposed approach.

Simulating Mission Command for Planning and Analysis

DTIC Science & Technology

2015-06-01

mission plan. 14. SUBJECT TERMS Mission Planning, CPM , PERT, Simulation, DES, Simkit, Triangle Distribution, Critical Path 15. NUMBER OF...Battalion Task Force CO Company CPM Critical Path Method DES Discrete Event Simulation FA BAT Field Artillery Battalion FEL Future Event List FIST...management tools that can be utilized to find the critical path in military projects. These are the Critical Path Method ( CPM ) and the Program Evaluation and

Grid Visualization Tool

NASA Technical Reports Server (NTRS)

Chouinard, Caroline; Fisher, Forest; Estlin, Tara; Gaines, Daniel; Schaffer, Steven

2005-01-01

The Grid Visualization Tool (GVT) is a computer program for displaying the path of a mobile robotic explorer (rover) on a terrain map. The GVT reads a map-data file in either portable graymap (PGM) or portable pixmap (PPM) format, representing a gray-scale or color map image, respectively. The GVT also accepts input from path-planning and activity-planning software. From these inputs, the GVT generates a map overlaid with one or more rover path(s), waypoints, locations of targets to be explored, and/or target-status information (indicating success or failure in exploring each target). The display can also indicate different types of paths or path segments, such as the path actually traveled versus a planned path or the path traveled to the present position versus planned future movement along a path. The program provides for updating of the display in real time to facilitate visualization of progress. The size of the display and the map scale can be changed as desired by the user. The GVT was written in the C++ language using the Open Graphics Library (OpenGL) software. It has been compiled for both Sun Solaris and Linux operating systems.

Airborne Collision Detection and Avoidance for Small UAS Sense and Avoid Systems

NASA Astrophysics Data System (ADS)

Sahawneh, Laith Rasmi

The increasing demand to integrate unmanned aircraft systems (UAS) into the national airspace is motivated by the rapid growth of the UAS industry, especially small UAS weighing less than 55 pounds. Their use however has been limited by the Federal Aviation Administration regulations due to collision risk they pose, safety and regulatory concerns. Therefore, before civil aviation authorities can approve routine UAS flight operations, UAS must be equipped with sense-and-avoid technology comparable to the see-and-avoid requirements for manned aircraft. The sense-and-avoid problem includes several important aspects including regulatory and system-level requirements, design specifications and performance standards, intruder detecting and tracking, collision risk assessment, and finally path planning and collision avoidance. In this dissertation, our primary focus is on developing an collision detection, risk assessment and avoidance framework that is computationally affordable and suitable to run on-board small UAS. To begin with, we address the minimum sensing range for the sense-and-avoid (SAA) system. We present an approximate close form analytical solution to compute the minimum sensing range to safely avoid an imminent collision. The approach is then demonstrated using a radar sensor prototype that achieves the required minimum sensing range. In the area of collision risk assessment and collision prediction, we present two approaches to estimate the collision risk of an encounter scenario. The first is a deterministic approach similar to those been developed for Traffic Alert and Collision Avoidance (TCAS) in manned aviation. We extend the approach to account for uncertainties of state estimates by deriving an analytic expression to propagate the error variance using Taylor series approximation. To address unanticipated intruders maneuvers, we propose an innovative probabilistic approach to quantify likely intruder trajectories and estimate the probability of collision risk using the uncorrelated encounter model (UEM) developed by MIT Lincoln Laboratory. We evaluate the proposed approach using Monte Carlo simulations and compare the performance with linearly extrapolated collision detection logic. For the path planning and collision avoidance part, we present multiple reactive path planning algorithms. We first propose a collision avoidance algorithm based on a simulated chain that responds to a virtual force field produced by encountering intruders. The key feature of the proposed approach is to model the future motion of both the intruder and the ownship using a chain of waypoints that are equally spaced in time. This timing information is used to continuously re-plan paths that minimize the probability of collision. Second, we present an innovative collision avoidance logic using an ownship centered coordinate system. The technique builds a graph in the local-level frame and uses the Dijkstra's algorithm to find the least cost path. An advantage of this approach is that collision avoidance is inherently a local phenomenon and can be more naturally represented in the local coordinates than the global coordinates. Finally, we propose a two step path planner for ground-based SAA systems. In the first step, an initial suboptimal path is generated using A* search. In the second step, using the A* solution as an initial condition, a chain of unit masses connected by springs and dampers evolves in a simulated force field. The chain is described by a set of ordinary differential equations that is driven by virtual forces to find the steady-state equilibrium. The simulation results show that the proposed approach produces collision-free plans while minimizing the path length. To move towards a deployable system, we apply collision detection and avoidance techniques to a variety of simulation and sensor modalities including camera, radar and ADS-B along with suitable tracking schemes. Keywords: unmanned aircraft system, small UAS, sense and avoid, minimum sensing range, airborne collision detection and avoidance, collision detection, collision risk assessment, collision avoidance, conflict detection, conflict avoidance, path planning.

PERT and CPM: A Comparison with Implications for Education.

ERIC Educational Resources Information Center

Ragan, Stephen W.

Two systematic ways of analyzing and planning the components of a program or project, both used extensively by industry and government, are discussed in this paper. The methods are Program Evaluation and Review Technique (PERT) Networks and Critical Path Method (CPM) Arrow Diagrams. The purposes of this paper are (1) to explore the need for…

Interactive multi-objective path planning through a palette-based user interface

NASA Astrophysics Data System (ADS)

Shaikh, Meher T.; Goodrich, Michael A.; Yi, Daqing; Hoehne, Joseph

2016-05-01

n a problem where a human uses supervisory control to manage robot path-planning, there are times when human does the path planning, and if satisfied commits those paths to be executed by the robot, and the robot executes that plan. In planning a path, the robot often uses an optimization algorithm that maximizes or minimizes an objective. When a human is assigned the task of path planning for robot, the human may care about multiple objectives. This work proposes a graphical user interface (GUI) designed for interactive robot path-planning when an operator may prefer one objective over others or care about how multiple objectives are traded off. The GUI represents multiple objectives using the metaphor of an artist's palette. A distinct color is used to represent each objective, and tradeoffs among objectives are balanced in a manner that an artist mixes colors to get the desired shade of color. Thus, human intent is analogous to the artist's shade of color. We call the GUI an "Adverb Palette" where the word "Adverb" represents a specific type of objective for the path, such as the adverbs "quickly" and "safely" in the commands: "travel the path quickly", "make the journey safely". The novel interactive interface provides the user an opportunity to evaluate various alternatives (that tradeoff between different objectives) by allowing her to visualize the instantaneous outcomes that result from her actions on the interface. In addition to assisting analysis of various solutions given by an optimization algorithm, the palette has additional feature of allowing the user to define and visualize her own paths, by means of waypoints (guiding locations) thereby spanning variety for planning. The goal of the Adverb Palette is thus to provide a way for the user and robot to find an acceptable solution even though they use very different representations of the problem. Subjective evaluations suggest that even non-experts in robotics can carry out the planning tasks with a great deal of flexibility using the adverb palette.

Automated Planning and Scheduling for Planetary Rover Distributed Operations

NASA Technical Reports Server (NTRS)

Backes, Paul G.; Rabideau, Gregg; Tso, Kam S.; Chien, Steve

1999-01-01

Automated planning and Scheduling, including automated path planning, has been integrated with an Internet-based distributed operations system for planetary rover operations. The resulting prototype system enables faster generation of valid rover command sequences by a distributed planetary rover operations team. The Web Interface for Telescience (WITS) provides Internet-based distributed collaboration, the Automated Scheduling and Planning Environment (ASPEN) provides automated planning and scheduling, and an automated path planner provided path planning. The system was demonstrated on the Rocky 7 research rover at JPL.

Cooperative path planning for multi-USV based on improved artificial bee colony algorithm

NASA Astrophysics Data System (ADS)

Cao, Lu; Chen, Qiwei

2018-03-01

Due to the complex constraints, more uncertain factors and critical real-time demand of path planning for multiple unmanned surface vehicle (multi-USV), an improved artificial bee colony (I-ABC) algorithm were proposed to solve the model of cooperative path planning for multi-USV. First the Voronoi diagram of battle field space is conceived to generate the optimal area of USVs paths. Then the chaotic searching algorithm is used to initialize the collection of paths, which is regard as foods of the ABC algorithm. With the limited data, the initial collection can search the optimal area of paths perfectly. Finally simulations of the multi-USV path planning under various threats have been carried out. Simulation results verify that the I-ABC algorithm can improve the diversity of nectar source and the convergence rate of algorithm. It can increase the adaptability of dynamic battlefield and unexpected threats for USV.

Terrain classification in navigation of an autonomous mobile robot

NASA Astrophysics Data System (ADS)

Dodds, David R.

1991-03-01

In this paper we describe a method of path planning that integrates terrain classification (by means of fractals) the certainty grid method of spatial representation Kehtarnavaz Griswold collision-zones Dubois Prade fuzzy temporal and spatial knowledge and non-point sized qualitative navigational planning. An initially planned (" end-to-end" ) path is piece-wise modified to accommodate known and inferred moving obstacles and includes attention to time-varying multiple subgoals which may influence a section of path at a time after the robot has begun traversing that planned path.

Planning paths through a spatial hierarchy - Eliminating stair-stepping effects

NASA Technical Reports Server (NTRS)

Slack, Marc G.

1989-01-01

Stair-stepping effects are a result of the loss of spatial continuity resulting from the decomposition of space into a grid. This paper presents a path planning algorithm which eliminates stair-stepping effects induced by the grid-based spatial representation. The algorithm exploits a hierarchical spatial model to efficiently plan paths for a mobile robot operating in dynamic domains. The spatial model and path planning algorithm map to a parallel machine, allowing the system to operate incrementally, thereby accounting for unexpected events in the operating space.

Remote sensing for industrial applications in the energy business: digital territorial data integration for planning of overhead power transmission lines (OHTLs)

NASA Astrophysics Data System (ADS)

Terrazzino, Alfonso; Volponi, Silvia; Borgogno Mondino, Enrico

2001-12-01

An investigation has been carried out, concerning remote sensing techniques, in order to assess their potential application to the energy system business: the most interesting results concern a new approach, based on digital data from remote sensing, to infrastructures with a large territorial distribution: in particular OverHead Transmission Lines, for the high voltage transmission and distribution of electricity on large distances. Remote sensing could in principle be applied to all the phases of the system lifetime, from planning to design, to construction, management, monitoring and maintenance. In this article, a remote sensing based approach is presented, targeted to the line planning: optimization of OHTLs path and layout, according to different parameters (technical, environmental and industrial). Planning new OHTLs is of particular interest in emerging markets, where typically the cartography is missing or available only on low accuracy scale (1:50.000 and lower), often not updated. Multi- spectral images can be used to generate thematic maps of the region of interest for the planning (soil coverage). Digital Elevation Models (DEMs), allow the planners to easily access the morphologic information of the surface. Other auxiliary information from local laws, environmental instances, international (IEC) standards can be integrated in order to perform an accurate optimized path choice and preliminary spotting of the OHTLs. This operation is carried out by an ABB proprietary optimization algorithm: the output is a preliminary path that bests fits the optimization parameters of the line in a life cycle approach.

Path optimization with limited sensing ability

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kang, Sung Ha, E-mail: kang@math.gatech.edu; Kim, Seong Jun, E-mail: skim396@math.gatech.edu; Zhou, Haomin, E-mail: hmzhou@math.gatech.edu

2015-10-15

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 reducingmore » 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.« less

Treatment Planning and Image Guidance for Radiofrequency Ablations of Large Tumors

PubMed Central

Ren, Hongliang; Campos-Nanez, Enrique; Yaniv, Ziv; Banovac, Filip; Abeledo, Hernan; Hata, Nobuhiko; Cleary, Kevin

2014-01-01

This article addresses the two key challenges in computer-assisted percutaneous tumor ablation: planning multiple overlapping ablations for large tumors while avoiding critical structures, and executing the prescribed plan. Towards semi-automatic treatment planning for image-guided surgical interventions, we develop a systematic approach to the needle-based ablation placement task, ranging from pre-operative planning algorithms to an intra-operative execution platform. The planning system incorporates clinical constraints on ablations and trajectories using a multiple objective optimization formulation, which consists of optimal path selection and ablation coverage optimization based on integer programming. The system implementation is presented and validated in phantom studies and on an animal model. The presented system can potentially be further extended for other ablation techniques such as cryotherapy. PMID:24235279

Rotational-path decomposition based recursive planning for spacecraft attitude reorientation

NASA Astrophysics Data System (ADS)

Xu, Rui; Wang, Hui; Xu, Wenming; Cui, Pingyuan; Zhu, Shengying

2018-02-01

The spacecraft reorientation is a common task in many space missions. With multiple pointing constraints, it is greatly difficult to solve the constrained spacecraft reorientation planning problem. To deal with this problem, an efficient rotational-path decomposition based recursive planning (RDRP) method is proposed in this paper. The uniform pointing-constraint-ignored attitude rotation planning process is designed to solve all rotations without considering pointing constraints. Then the whole path is checked node by node. If any pointing constraint is violated, the nearest critical increment approach will be used to generate feasible alternative nodes in the process of rotational-path decomposition. As the planning path of each subdivision may still violate pointing constraints, multiple decomposition is needed and the reorientation planning is designed as a recursive manner. Simulation results demonstrate the effectiveness of the proposed method. The proposed method has been successfully applied in two SPARK microsatellites to solve onboard constrained attitude reorientation planning problem, which were developed by the Shanghai Engineering Center for Microsatellites and launched on 22 December 2016.

Obstacle Avoidance On Roadways Using Range Data

NASA Astrophysics Data System (ADS)

Dunlay, R. Terry; Morgenthaler, David G.

1987-02-01

This report describes range data based obstacle avoidance techniques developed for use on an autonomous road-following robot vehicle. The purpose of these techniques is to detect and locate obstacles present in a road environment for navigation of a robot vehicle equipped with an active laser-based range sensor. Techniques are presented for obstacle detection, obstacle location, and coordinate transformations needed in the construction of Scene Models (symbolic structures representing the 3-D obstacle boundaries used by the vehicle's Navigator for path planning). These techniques have been successfully tested on an outdoor robotic vehicle, the Autonomous Land Vehicle (ALV), at speeds up to 3.5 km/hour.

Autonomous Navigation by a Mobile Robot

NASA Technical Reports Server (NTRS)

Huntsberger, Terrance; Aghazarian, Hrand

2005-01-01

ROAMAN is a computer program for autonomous navigation of a mobile robot on a long (as much as hundreds of meters) traversal of terrain. Developed for use aboard a robotic vehicle (rover) exploring the surface of a remote planet, ROAMAN could also be adapted to similar use on terrestrial mobile robots. ROAMAN implements a combination of algorithms for (1) long-range path planning based on images acquired by mast-mounted, wide-baseline stereoscopic cameras, and (2) local path planning based on images acquired by body-mounted, narrow-baseline stereoscopic cameras. The long-range path-planning algorithm autonomously generates a series of waypoints that are passed to the local path-planning algorithm, which plans obstacle-avoiding legs between the waypoints. Both the long- and short-range algorithms use an occupancy-grid representation in computations to detect obstacles and plan paths. Maps that are maintained by the long- and short-range portions of the software are not shared because substantial localization errors can accumulate during any long traverse. ROAMAN is not guaranteed to generate an optimal shortest path, but does maintain the safety of the rover.

Simulation techniques in hyperthermia treatment planning

PubMed Central

Paulides, MM; Stauffer, PR; Neufeld, E; Maccarini, P; Kyriakou, A; Canters, RAM; Diederich, C; Bakker, JF; Van Rhoon, GC

2013-01-01

Clinical trials have shown that hyperthermia (HT), i.e. an increase of tissue temperature to 39-44°C, significantly enhance radiotherapy and chemotherapy effectiveness (1). Driven by the developments in computational techniques and computing power, personalized hyperthermia treatment planning (HTP) has matured and has become a powerful tool for optimizing treatment quality. Electromagnetic, ultrasound, and thermal simulations using realistic clinical setups are now being performed to achieve patient-specific treatment optimization. In addition, extensive studies aimed to properly implement novel HT tools and techniques, and to assess the quality of HT, are becoming more common. In this paper, we review the simulation tools and techniques developed for clinical hyperthermia, and evaluate their current status on the path from “model” to “clinic”. In addition, we illustrate the major techniques employed for validation and optimization. HTP has become an essential tool for improvement, control, and assessment of HT treatment quality. As such, it plays a pivotal role in the quest to establish HT as an efficacious addition to multi-modality treatment of cancer. PMID:23672453

New Technique for Retrieving Liquid Water Path over Land using Satellite Microwave Observations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Deeter, M.N.; Vivekanandan, J.

2005-03-18

We present a new methodology for retrieving liquid water path over land using satellite microwave observations. As input, the technique exploits the Advanced Microwave Scanning Radiometer for earth observing plan (EOS) (AMSR-E) polarization-difference signals at 37 and 89 GHz. Regression analysis performed on model simulations indicates that over variable atmospheric and surface conditions the polarization-difference signals can be simply parameterized in terms of the surface emissivity polarization difference ({Delta}{var_epsilon}), surface temperature, liquid water path (LWP), and precipitable water vapor (PWV). The resulting polarization-difference parameterization (PDP) enables fast and direct (noniterative) retrievals of LWP with minimal requirements for ancillary data. Single-more » and dual-channel retrieval methods are described and demonstrated. Data gridding is used to reduce the effects of instrumental noise. The methodology is demonstrated using AMSR-E observations over the Atmospheric Radiation Measurement (ARM) Southern Great Plains (SGP) site during a six day period in November and December, 2003. Single- and dual-channel retrieval results mostly agree with ground-based microwave retrievals of LWP to within approximately 0.04 mm.« less

The use of computer graphic simulation in the development of on-orbit tele-robotic systems

NASA Technical Reports Server (NTRS)

Fernandez, Ken; Hinman, Elaine

1987-01-01

This paper describes the use of computer graphic simulation techniques to resolve critical design and operational issues for robotic systems used for on-orbit operations. These issues are robot motion control, robot path-planning/verification, and robot dynamics. The major design issues in developing effective telerobotic systems are discussed, and the use of ROBOSIM, a NASA-developed computer graphic simulation tool, to address these issues is presented. Simulation plans for the Space Station and the Orbital Maneuvering Vehicle are presented and discussed.

Path Planning for Non-Circular, Non-Holonomic Robots in Highly Cluttered Environments.

PubMed

Samaniego, Ricardo; Lopez, Joaquin; Vazquez, Fernando

2017-08-15

This paper presents an algorithm for finding a solution to the problem of planning a feasible path for a slender autonomous mobile robot in a large and cluttered environment. The presented approach is based on performing a graph search on a kinodynamic-feasible lattice state space of high resolution; however, the technique is applicable to many search algorithms. With the purpose of allowing the algorithm to consider paths that take the robot through narrow passes and close to obstacles, high resolutions are used for the lattice space and the control set. This introduces new challenges because one of the most computationally expensive parts of path search based planning algorithms is calculating the cost of each one of the actions or steps that could potentially be part of the trajectory. The reason for this is that the evaluation of each one of these actions involves convolving the robot's footprint with a portion of a local map to evaluate the possibility of a collision, an operation that grows exponentially as the resolution is increased. The novel approach presented here reduces the need for these convolutions by using a set of offline precomputed maps that are updated, by means of a partial convolution, as new information arrives from sensors or other sources. Not only does this improve run-time performance, but it also provides support for dynamic search in changing environments. A set of alternative fast convolution methods are also proposed, depending on whether the environment is cluttered with obstacles or not. Finally, we provide both theoretical and experimental results from different experiments and applications.

Path Planning for Robot based on Chaotic Artificial Potential Field Method

NASA Astrophysics Data System (ADS)

Zhang, Cheng

2018-03-01

Robot path planning in unknown environments is one of the hot research topics in the field of robot control. Aiming at the shortcomings of traditional artificial potential field methods, we propose a new path planning for Robot based on chaotic artificial potential field method. The path planning adopts the potential function as the objective function and introduces the robot direction of movement as the control variables, which combines the improved artificial potential field method with chaotic optimization algorithm. Simulations have been carried out and the results demonstrate that the superior practicality and high efficiency of the proposed method.

Differential-Evolution Control Parameter Optimization for Unmanned Aerial Vehicle Path Planning

PubMed Central

Kok, Kai Yit; Rajendran, Parvathy

2016-01-01

The differential evolution algorithm has been widely applied on unmanned aerial vehicle (UAV) path planning. At present, four random tuning parameters exist for differential evolution algorithm, namely, population size, differential weight, crossover, and generation number. These tuning parameters are required, together with user setting on path and computational cost weightage. However, the optimum settings of these tuning parameters vary according to application. Instead of trial and error, this paper presents an optimization method of differential evolution algorithm for tuning the parameters of UAV path planning. The parameters that this research focuses on are population size, differential weight, crossover, and generation number. The developed algorithm enables the user to simply define the weightage desired between the path and computational cost to converge with the minimum generation required based on user requirement. In conclusion, the proposed optimization of tuning parameters in differential evolution algorithm for UAV path planning expedites and improves the final output path and computational cost. PMID:26943630

Restoring Anterior Aesthetics by a Rotational Path Cast Partial Denture: An Overlooked Technique

PubMed Central

Bhat, Bala Saraswati; Arora, Himanshu

2016-01-01

Cast Partial Dentures (CPD) has long been known to restore missing teeth in patients with minimal invasion on hard and soft tissues. Although satisfactory otherwise, the main concern in CPD is the anterior display of metal. Also the technique sensitive lab procedures, together with the esthetic concern have built an iceberg around the frequent utilization of this treatment modality. With the advent of various techniques to get rid of the metallic display, it was predicted to have more CPD’s done in the dental arena. But the conceptual technicalities of the procedure took away the limelight from this treatment modality and focused on the fixed prosthodontics. Although feasible in a large number of patients, fixed prosthesis still has areas of restriction. It is here, when we apply our knowledge and skill of esthetic CPD. Esthetic CPD eliminates the metal display by utilizing desirable undercuts. The engaging action of the framework into these undercuts paves way for a rotational motion to seat the remaining prosthesis. Hence dual path of insertion helps eliminating the anterior clasp. In this case report dual path of insertion is discussed for replacing anterior teeth in an old male patient who had mild esthetic concerns. Following the conservative approach of CPD (over FPD) esthetic and restorative treatment was planned with patient’s consent. PMID:27437375

Optimal Path Planning Program for Autonomous Speed Sprayer in Orchard Using Order-Picking Algorithm

NASA Astrophysics Data System (ADS)

Park, T. S.; Park, S. J.; Hwang, K. Y.; Cho, S. I.

This study was conducted to develop a software program which computes optimal path for autonomous navigation in orchard, especially for speed sprayer. Possibilities of autonomous navigation in orchard were shown by other researches which have minimized distance error between planned path and performed path. But, research of planning an optimal path for speed sprayer in orchard is hardly founded. In this study, a digital map and a database for orchard which contains GPS coordinate information (coordinates of trees and boundary of orchard) and entity information (heights and widths of trees, radius of main stem of trees, disease of trees) was designed. An orderpicking algorithm which has been used for management of warehouse was used to calculate optimum path based on the digital map. Database for digital map was created by using Microsoft Access and graphic interface for database was made by using Microsoft Visual C++ 6.0. It was possible to search and display information about boundary of an orchard, locations of trees, daily plan for scattering chemicals and plan optimal path on different orchard based on digital map, on each circumstance (starting speed sprayer in different location, scattering chemicals for only selected trees).

DOE Office of Scientific and Technical Information (OSTI.GOV)

Russell, J.S.

Several factors in the development of the East Wilmington oil field by THUMS Long Beach Co. are described. These include: critical path scheduling, complex stratigraphy, reservoir engineering, drilling program, production methods, pressure maintenance, crude oil processing, automation, transportation facilities, service lines, and electrical facilities. The complexity and closely scheduled operational events interwoven in the THUMS project demands a method for the carefully planned sequence of jobs to be done, beginning with island construction up through routine production and to the LACT system. These demanding requirements necessitated the use of a critical path scheduling program. It was decided to use themore » program evaluation technique. This technique is used to assign responsibilities for individual assignments to time assignments, and to keep the overall program on schedule. The stratigraphy of East Wilmington complicates all engineering functions associated with recovery methods and reservoir evaluation. At least 5 major faults are anticipated.« less

A novel representation for planning 3-D collision-free paths

NASA Technical Reports Server (NTRS)

Bonner, Susan; Kelley, Robert B.

1990-01-01

A new scheme for the representation of objects, the successive spherical approximation (SSA), facilitates the rapid planning of collision-free paths in a dynamic three-dimensional environment. The hierarchical nature of the SSA allows collisions to be determined efficiently while still providing an exact representation of objects. The rapidity with which collisions can be detected, less than 1 sec per environment object per path, makes it possible to use a generate-and-test path-planning strategy driven by human conceptual knowledge to determine collision-free paths in a matter of seconds on a Sun 3/180 computer. A hierarchy of rules, based on the concept of a free space cell, is used to find heuristically satisfying collision-free paths in a structured environment.

A bat algorithm with mutation for UCAV path planning.

PubMed

Wang, Gaige; Guo, Lihong; Duan, Hong; Liu, Luo; Wang, Heqi

2012-01-01

Path planning for uninhabited combat air vehicle (UCAV) is a complicated high dimension optimization problem, which mainly centralizes on optimizing the flight route considering the different kinds of constrains under complicated battle field environments. Original bat algorithm (BA) is used to solve the UCAV path planning problem. Furthermore, a new bat algorithm with mutation (BAM) is proposed to solve the UCAV path planning problem, and a modification is applied to mutate between bats during the process of the new solutions updating. Then, the UCAV can find the safe path by connecting the chosen nodes of the coordinates while avoiding the threat areas and costing minimum fuel. This new approach can accelerate the global convergence speed while preserving the strong robustness of the basic BA. The realization procedure for original BA and this improved metaheuristic approach BAM is also presented. To prove the performance of this proposed metaheuristic method, BAM is compared with BA and other population-based optimization methods, such as ACO, BBO, DE, ES, GA, PBIL, PSO, and SGA. The experiment shows that the proposed approach is more effective and feasible in UCAV path planning than the other models.

Autonomous Motion Planning Using a Predictive Temporal Method

DTIC Science & Technology

2009-01-01

interception test. ......150 5-20 Target and solution path heading angles for target interception test. ..............................151 10 LIST...environment as a series of distances and angles . Regardless of the technique, this knowledge of the surrounding area is crucial for the issue of...to, the rather simplistic vector driver algorithms which compute the angle between the current vehicle heading and the heading to the goal and

Application of ant colony algorithm in path planning of the data center room robot

NASA Astrophysics Data System (ADS)

Wang, Yong; Ma, Jianming; Wang, Ying

2017-05-01

According to the Internet Data Center (IDC) room patrol robot as the background, the robot in the search path of autonomous obstacle avoidance and path planning ability, worked out in advance of the robot room patrol mission. The simulation experimental results show that the improved ant colony algorithm for IDC room patrol robot obstacle avoidance planning, makes the robot along an optimal or suboptimal and safe obstacle avoidance path to reach the target point to complete the task. To prove the feasibility of the method.

Research and application of genetic algorithm in path planning of logistics distribution vehicle

NASA Astrophysics Data System (ADS)

Wang, Yong; Zhou, Heng; Wang, Ying

2017-08-01

The core of the logistics distribution system is the vehicle routing planning, research path planning problem, provide a better solution has become an important issue. In order to provide the decision support for logistics and distribution operations, this paper studies the problem of vehicle routing with capacity constraints (CVRP). By establishing a mathematical model, the genetic algorithm is used to plan the path of the logistics vehicle to meet the minimum logistics and transportation costs.

Interactive mission planning for a Space Shuttle flight experiment - A case history

NASA Technical Reports Server (NTRS)

Harris, H. M.

1986-01-01

Scientific experiments which use the Space Shuttle as a platform require the development of new operations techniques for the command and control of the instrument. Principal among these is the ability to simulate the complex maneuvers of the orbiter's path realistically. Computer generated graphics provide a window into the actual and predicted performance of the instrument and allow sophisticated control of the instrument under varying conditions. In October of 1984 the Shuttle carried a synthetic aperture radar built by JPL for the purpose of recording images of the earth surface. The mission deviated from planned operation in almost every conceivable way and provided an exacting test bed for concepts of interactive mission planning.

Path-Following Solutions Of Nonlinear Equations

NASA Technical Reports Server (NTRS)

Barger, Raymond L.; Walters, Robert W.

1989-01-01

Report describes some path-following techniques for solution of nonlinear equations and compares with other methods. Use of multipurpose techniques applicable at more than one stage of path-following computation results in system relatively simple to understand, program, and use. Comparison of techniques with method of parametric differentiation (MPD) reveals definite advantages for path-following methods. Emphasis in investigation on multiuse techniques being applied at more than one stage of path-following computation. Incorporation of multipurpose techniques results in concise computer code relatively simple to use.

Kinematic path planning for space-based robotics

NASA Astrophysics Data System (ADS)

Seereeram, Sanjeev; Wen, John T.

1998-01-01

Future space robotics tasks require manipulators of significant dexterity, achievable through kinematic redundancy and modular reconfigurability, but with a corresponding complexity of motion planning. Existing research aims for full autonomy and completeness, at the expense of efficiency, generality or even user friendliness. Commercial simulators require user-taught joint paths-a significant burden for assembly tasks subject to collision avoidance, kinematic and dynamic constraints. Our research has developed a Kinematic Path Planning (KPP) algorithm which bridges the gap between research and industry to produce a powerful and useful product. KPP consists of three key components: path-space iterative search, probabilistic refinement, and an operator guidance interface. The KPP algorithm has been successfully applied to the SSRMS for PMA relocation and dual-arm truss assembly tasks. Other KPP capabilities include Cartesian path following, hybrid Cartesian endpoint/intermediate via-point planning, redundancy resolution and path optimization. KPP incorporates supervisory (operator) input at any detail to influence the solution, yielding desirable/predictable paths for multi-jointed arms, avoiding obstacles and obeying manipulator limits. This software will eventually form a marketable robotic planner suitable for commercialization in conjunction with existing robotic CAD/CAM packages.

Customer satisfaction planning and industrial engineering move hospital towards in-house stockless program.

PubMed

Burton, R; Mauk, D

1993-03-01

By integrating customer satisfaction planning and industrial engineering techniques when examining internal costs and efficiencies, materiel managers are able to better realize what concepts will best meet their customers' needs. Defining your customer(s), applying industrial engineering techniques, completing work sampling studies, itemizing recommendations and benefits to each alternative, performing feasibility and cost-analysis matrixes and utilizing resources through productivity monitoring will get you on the right path toward selecting concepts to use. This article reviews the above procedures as they applied to one hospital's decision-making process to determine whether to incorporate a stockless inventory program. Through an analysis of customer demand, the hospital realized that stockless was the way to go, but not by outsourcing the function--the hospital incorporated an in-house stockless inventory program.

Path planning algorithms for assembly sequence planning. [in robot kinematics

NASA Technical Reports Server (NTRS)

Krishnan, S. S.; Sanderson, Arthur C.

1991-01-01

Planning for manipulation in complex environments often requires reasoning about the geometric and mechanical constraints which are posed by the task. In planning assembly operations, the automatic generation of operations sequences depends on the geometric feasibility of paths which permit parts to be joined into subassemblies. Feasible locations and collision-free paths must be present for part motions, robot and grasping motions, and fixtures. This paper describes an approach to reasoning about the feasibility of straight-line paths among three-dimensional polyhedral parts using an algebra of polyhedral cones. A second method recasts the feasibility conditions as constraints in a nonlinear optimization framework. Both algorithms have been implemented and results are presented.

Reconstruction for proton computed tomography by tracing proton trajectories: A Monte Carlo study

DOE Office of Scientific and Technical Information (OSTI.GOV)

Li Tianfang; Liang Zhengrong; Singanallur, Jayalakshmi V.

Proton computed tomography (pCT) has been explored in the past decades because of its unique imaging characteristics, low radiation dose, and its possible use for treatment planning and on-line target localization in proton therapy. However, reconstruction of pCT images is challenging because the proton path within the object to be imaged is statistically affected by multiple Coulomb scattering. In this paper, we employ GEANT4-based Monte Carlo simulations of the two-dimensional pCT reconstruction of an elliptical phantom to investigate the possible use of the algebraic reconstruction technique (ART) with three different path-estimation methods for pCT reconstruction. The first method assumes amore » straight-line path (SLP) connecting the proton entry and exit positions, the second method adapts the most-likely path (MLP) theoretically determined for a uniform medium, and the third method employs a cubic spline path (CSP). The ART reconstructions showed progressive improvement of spatial resolution when going from the SLP [2 line pairs (lp) cm{sup -1}] to the curved CSP and MLP path estimates (5 lp cm{sup -1}). The MLP-based ART algorithm had the fastest convergence and smallest residual error of all three estimates. This work demonstrates the advantage of tracking curved proton paths in conjunction with the ART algorithm and curved path estimates.« less

Integrated assignment and path planning

NASA Astrophysics Data System (ADS)

Murphey, Robert A.

2005-11-01

A surge of interest in unmanned systems has exposed many new and challenging research problems across many fields of engineering and mathematics. These systems have the potential of transforming our society by replacing dangerous and dirty jobs with networks of moving machines. This vision is fundamentally separate from the modern view of robotics in that sophisticated behavior is realizable not by increasing individual vehicle complexity, but instead through collaborative teaming that relies on collective perception, abstraction, decision making, and manipulation. Obvious examples where collective robotics will make an impact include planetary exploration, space structure assembly, remote and undersea mining, hazardous material handling and clean-up, and search and rescue. Nonetheless, the phenomenon driving this technology trend is the increasing reliance of the US military on unmanned vehicles, specifically, aircraft. Only a few years ago, following years of resistance to the use of unmanned systems, the military and civilian leadership in the United States reversed itself and have recently demonstrated surprisingly broad acceptance of increasingly pervasive use of unmanned platforms in defense surveillance, and even attack. However, as rapidly as unmanned systems have gained acceptance, the defense research community has discovered the technical pitfalls that lie ahead, especially for operating collective groups of unmanned platforms. A great deal of talent and energy has been devoted to solving these technical problems, which tend to fall into two categories: resource allocation of vehicles to objectives, and path planning of vehicle trajectories. An extensive amount of research has been conducted in each direction, yet, surprisingly, very little work has considered the integrated problem of assignment and path planning. This dissertation presents a framework for studying integrated assignment and path planning and then moves on to suggest an exact mathematical model and solution techniques. The approach adopted is based upon the very flexible New Product Development model but also blends many features from other approaches. Solution methods using branch and bound and construction heuristics are developed and tested on several example problems, including a military scenario featuring unmanned air vehicles.

Sense and avoid technologies with applications to unmanned aircraft systems: Review and prospects

NASA Astrophysics Data System (ADS)

Yu, Xiang; Zhang, Youmin

2015-04-01

Unmanned Aircraft Systems (UASs) are becoming ever more promising over the last decade. The Sense and Avoid (S&A) system plays a profoundly important role in integrating UASs into the National Airspace System (NAS) with reliable and safe operations. After analyzing the manner of S&A system, this paper systematically presents an overview on the recent progress in S&A technologies in the sequence of fundamental functions/components of S&A in sensing techniques, decision making, path planning, and path following. The approaches to these four aspects are outlined and summarized, based on which the existing challenges and potential solutions are highlighted for facilitating the development of S&A systems.

MO-F-CAMPUS-T-05: SQL Database Queries to Determine Treatment Planning Resource Usage

DOE Office of Scientific and Technical Information (OSTI.GOV)

Fox, C; Gladstone, D

2015-06-15

Purpose: A radiation oncology clinic’s treatment capacity is traditionally thought to be limited by the number of machines in the clinic. As the number of fractions per course decrease and the number of adaptive plans increase, the question of how many treatment plans a clinic can plan becomes increasingly important. This work seeks to lay the ground work for assessing treatment planning resource usage. Methods: Care path templates were created using the Aria 11 care path interface. Care path tasks included key steps in the treatment planning process from the completion of CT simulation through the first radiation treatment. SQLmore » Server Management Studio was used to run SQL queries to extract task completion time stamps along with care path template information and diagnosis codes from the Aria database. 6 months of planning cycles were evaluated. Elapsed time was evaluated in terms of work hours within Monday – Friday, 7am to 5pm. Results: For the 195 validated treatment planning cycles, the average time for planning and MD review was 22.8 hours. Of those cases 33 were categorized as urgent. The average planning time for urgent plans was 5 hours. A strong correlation between diagnosis code and range of elapsed planning time was as well as between elapsed time and select diagnosis codes was observed. It was also observed that tasks were more likely to be completed on the date due than the time that they were due. Follow-up confirmed that most users did not look at the due time. Conclusion: Evaluation of elapsed planning time and other tasks suggest that care paths should be adjusted to allow for different contouring and planning times for certain diagnosis codes and urgent cases. Additional clinic training around task due times vs dates or a structuring of care paths around due dates is also needed.« less

A Bat Algorithm with Mutation for UCAV Path Planning

PubMed Central

Wang, Gaige; Guo, Lihong; Duan, Hong; Liu, Luo; Wang, Heqi

2012-01-01

Path planning for uninhabited combat air vehicle (UCAV) is a complicated high dimension optimization problem, which mainly centralizes on optimizing the flight route considering the different kinds of constrains under complicated battle field environments. Original bat algorithm (BA) is used to solve the UCAV path planning problem. Furthermore, a new bat algorithm with mutation (BAM) is proposed to solve the UCAV path planning problem, and a modification is applied to mutate between bats during the process of the new solutions updating. Then, the UCAV can find the safe path by connecting the chosen nodes of the coordinates while avoiding the threat areas and costing minimum fuel. This new approach can accelerate the global convergence speed while preserving the strong robustness of the basic BA. The realization procedure for original BA and this improved metaheuristic approach BAM is also presented. To prove the performance of this proposed metaheuristic method, BAM is compared with BA and other population-based optimization methods, such as ACO, BBO, DE, ES, GA, PBIL, PSO, and SGA. The experiment shows that the proposed approach is more effective and feasible in UCAV path planning than the other models. PMID:23365518

Curvature Continuous and Bounded Path Planning for Fixed-Wing UAVs

PubMed Central

Jiang, Peng; Li, Deshi; Sun, Tao

2017-01-01

Unmanned Aerial Vehicles (UAVs) play an important role in applications such as data collection and target reconnaissance. An accurate and optimal path can effectively increase the mission success rate in the case of small UAVs. Although path planning for UAVs is similar to that for traditional mobile robots, the special kinematic characteristics of UAVs (such as their minimum turning radius) have not been taken into account in previous studies. In this paper, we propose a locally-adjustable, continuous-curvature, bounded path-planning algorithm for fixed-wing UAVs. To deal with the curvature discontinuity problem, an optimal interpolation algorithm and a key-point shift algorithm are proposed based on the derivation of a curvature continuity condition. To meet the upper bound for curvature and to render the curvature extrema controllable, a local replanning scheme is designed by combining arcs and Bezier curves with monotonic curvature. In particular, a path transition mechanism is built for the replanning phase using minimum curvature circles for a planning philosophy. Numerical results demonstrate that the analytical planning algorithm can effectively generate continuous-curvature paths, while satisfying the curvature upper bound constraint and allowing UAVs to pass through all predefined waypoints in the desired mission region. PMID:28925960

Curvature Continuous and Bounded Path Planning for Fixed-Wing UAVs.

PubMed

Wang, Xiaoliang; Jiang, Peng; Li, Deshi; Sun, Tao

2017-09-19

Unmanned Aerial Vehicles (UAVs) play an important role in applications such as data collection and target reconnaissance. An accurate and optimal path can effectively increase the mission success rate in the case of small UAVs. Although path planning for UAVs is similar to that for traditional mobile robots, the special kinematic characteristics of UAVs (such as their minimum turning radius) have not been taken into account in previous studies. In this paper, we propose a locally-adjustable, continuous-curvature, bounded path-planning algorithm for fixed-wing UAVs. To deal with the curvature discontinuity problem, an optimal interpolation algorithm and a key-point shift algorithm are proposed based on the derivation of a curvature continuity condition. To meet the upper bound for curvature and to render the curvature extrema controllable, a local replanning scheme is designed by combining arcs and Bezier curves with monotonic curvature. In particular, a path transition mechanism is built for the replanning phase using minimum curvature circles for a planning philosophy. Numerical results demonstrate that the analytical planning algorithm can effectively generate continuous-curvature paths, while satisfying the curvature upper bound constraint and allowing UAVs to pass through all predefined waypoints in the desired mission region.

Constrained VPH+: a local path planning algorithm for a bio-inspired crawling robot with customized ultrasonic scanning sensor.

PubMed

Rao, Akshay; Elara, Mohan Rajesh; Elangovan, Karthikeyan

This paper aims to develop a local path planning algorithm for a bio-inspired, reconfigurable crawling robot. A detailed description of the robotic platform is first provided, and the suitability for deployment of each of the current state-of-the-art local path planners is analyzed after an extensive literature review. The Enhanced Vector Polar Histogram algorithm is described and reformulated to better fit the requirements of the platform. The algorithm is deployed on the robotic platform in crawling configuration and favorably compared with other state-of-the-art local path planning algorithms.

Path Searching Based Fault Automated Recovery Scheme for Distribution Grid with DG

NASA Astrophysics Data System (ADS)

Xia, Lin; Qun, Wang; Hui, Xue; Simeng, Zhu

2016-12-01

Applying the method of path searching based on distribution network topology in setting software has a good effect, and the path searching method containing DG power source is also applicable to the automatic generation and division of planned islands after the fault. This paper applies path searching algorithm in the automatic division of planned islands after faults: starting from the switch of fault isolation, ending in each power source, and according to the line load that the searching path traverses and the load integrated by important optimized searching path, forming optimized division scheme of planned islands that uses each DG as power source and is balanced to local important load. Finally, COBASE software and distribution network automation software applied are used to illustrate the effectiveness of the realization of such automatic restoration program.

Assessing the Performance of Human-Automation Collaborative Planning Systems

DTIC Science & Technology

2011-06-01

process- ing and incorporating vast amounts of incoming information into their solutions. How- ever, these algorithms are brittle and unable to account for...planning system, a descriptive Mission Performance measure may address the total travel time on the path or the cost of the path (e.g. total work...minimizing costs or collisions [4, 32, 33]. Error measures for such a path planning system may track how many collisions occur or how much threat

Optimal Paths in Gliding Flight

NASA Astrophysics Data System (ADS)

Wolek, Artur

Underwater gliders are robust and long endurance ocean sampling platforms that are increasingly being deployed in coastal regions. This new environment is characterized by shallow waters and significant currents that can challenge the mobility of these efficient (but traditionally slow moving) vehicles. This dissertation aims to improve the performance of shallow water underwater gliders through path planning. The path planning problem is formulated for a dynamic particle (or "kinematic car") model. The objective is to identify the path which satisfies specified boundary conditions and minimizes a particular cost. Several cost functions are considered. The problem is addressed using optimal control theory. The length scales of interest for path planning are within a few turn radii. First, an approach is developed for planning minimum-time paths, for a fixed speed glider, that are sub-optimal but are guaranteed to be feasible in the presence of unknown time-varying currents. Next the minimum-time problem for a glider with speed controls, that may vary between the stall speed and the maximum speed, is solved. Last, optimal paths that minimize change in depth (equivalently, maximize range) are investigated. Recognizing that path planning alone cannot overcome all of the challenges associated with significant currents and shallow waters, the design of a novel underwater glider with improved capabilities is explored. A glider with a pneumatic buoyancy engine (allowing large, rapid buoyancy changes) and a cylindrical moving mass mechanism (generating large pitch and roll moments) is designed, manufactured, and tested to demonstrate potential improvements in speed and maneuverability.

A Hybrid Metaheuristic DE/CS Algorithm for UCAV Three-Dimension Path Planning

PubMed Central

Wang, Gaige; Guo, Lihong; Duan, Hong; Wang, Heqi; Liu, Luo; Shao, Mingzhen

2012-01-01

Three-dimension path planning for uninhabited combat air vehicle (UCAV) is a complicated high-dimension optimization problem, which primarily centralizes on optimizing the flight route considering the different kinds of constrains under complicated battle field environments. A new hybrid metaheuristic differential evolution (DE) and cuckoo search (CS) algorithm is proposed to solve the UCAV three-dimension path planning problem. DE is applied to optimize the process of selecting cuckoos of the improved CS model during the process of cuckoo updating in nest. The cuckoos can act as an agent in searching the optimal UCAV path. And then, the UCAV can find the safe path by connecting the chosen nodes of the coordinates while avoiding the threat areas and costing minimum fuel. This new approach can accelerate the global convergence speed while preserving the strong robustness of the basic CS. The realization procedure for this hybrid metaheuristic approach DE/CS is also presented. In order to make the optimized UCAV path more feasible, the B-Spline curve is adopted for smoothing the path. To prove the performance of this proposed hybrid metaheuristic method, it is compared with basic CS algorithm. The experiment shows that the proposed approach is more effective and feasible in UCAV three-dimension path planning than the basic CS model. PMID:23193383

A hybrid metaheuristic DE/CS algorithm for UCAV three-dimension path planning.

PubMed

Wang, Gaige; Guo, Lihong; Duan, Hong; Wang, Heqi; Liu, Luo; Shao, Mingzhen

2012-01-01

Three-dimension path planning for uninhabited combat air vehicle (UCAV) is a complicated high-dimension optimization problem, which primarily centralizes on optimizing the flight route considering the different kinds of constrains under complicated battle field environments. A new hybrid metaheuristic differential evolution (DE) and cuckoo search (CS) algorithm is proposed to solve the UCAV three-dimension path planning problem. DE is applied to optimize the process of selecting cuckoos of the improved CS model during the process of cuckoo updating in nest. The cuckoos can act as an agent in searching the optimal UCAV path. And then, the UCAV can find the safe path by connecting the chosen nodes of the coordinates while avoiding the threat areas and costing minimum fuel. This new approach can accelerate the global convergence speed while preserving the strong robustness of the basic CS. The realization procedure for this hybrid metaheuristic approach DE/CS is also presented. In order to make the optimized UCAV path more feasible, the B-Spline curve is adopted for smoothing the path. To prove the performance of this proposed hybrid metaheuristic method, it is compared with basic CS algorithm. The experiment shows that the proposed approach is more effective and feasible in UCAV three-dimension path planning than the basic CS model.

Alternative Constraint Handling Technique for Four-Bar Linkage Path Generation

NASA Astrophysics Data System (ADS)

Sleesongsom, S.; Bureerat, S.

2018-03-01

This paper proposes an extension of a new concept for path generation from our previous work by adding a new constraint handling technique. The propose technique was initially designed for problems without prescribed timing by avoiding the timing constraint, while remain constraints are solving with a new constraint handling technique. The technique is one kind of penalty technique. The comparative study is optimisation of path generation problems are solved using self-adaptive population size teaching-learning based optimization (SAP-TLBO) and original TLBO. In this study, two traditional path generation test problem are used to test the proposed technique. The results show that the new technique can be applied with the path generation problem without prescribed timing and gives better results than the previous technique. Furthermore, SAP-TLBO outperforms the original one.

Evolutionistic or revolutionary paths? A PACS maturity model for strategic situational planning.

PubMed

van de Wetering, Rogier; Batenburg, Ronald; Lederman, Reeva

2010-07-01

While many hospitals are re-evaluating their current Picture Archiving and Communication System (PACS), few have a mature strategy for PACS deployment. Furthermore, strategies for implementation, strategic and situational planning methods for the evolution of PACS maturity are scarce in the scientific literature. Consequently, in this paper we propose a strategic planning method for PACS deployment. This method builds upon a PACS maturity model (PMM), based on the elaboration of the strategic alignment concept and the maturity growth path concept previously developed in the PACS domain. First, we review the literature on strategic planning for information systems and information technology and PACS maturity. Secondly, the PMM is extended by applying four different strategic perspectives of the Strategic Alignment Framework whereupon two types of growth paths (evolutionistic and revolutionary) are applied that focus on a roadmap for PMM. This roadmap builds a path to get from one level of maturity and evolve to the next. An extended method for PACS strategic planning is developed. This method defines eight distinctive strategies for PACS strategic situational planning that allow decision-makers in hospitals to decide which approach best suits their hospitals' current situation and future ambition and what in principle is needed to evolve through the different maturity levels. The proposed method allows hospitals to strategically plan for PACS maturation. It is situational in that the required investments and activities depend on the alignment between the hospital strategy and the selected growth path. The inclusion of both strategic alignment and maturity growth path concepts make the planning method rigorous, and provide a framework for further empirical research and clinical practice.

A path planning method used in fluid jet polishing eliminating lightweight mirror imprinting effect

NASA Astrophysics Data System (ADS)

Li, Wenzong; Fan, Bin; Shi, Chunyan; Wang, Jia; Zhuo, Bin

2014-08-01

With the development of space technology, the design of optical system tends to large aperture lightweight mirror with high dimension-thickness ratio. However, when the lightweight mirror PV value is less than λ/10 , the surface will show wavy imprinting effect obviously. Imprinting effect introduced by head-tool pressure has become a technological barrier in high-precision lightweight mirror manufacturing. Fluid jet polishing can exclude outside pressure. Presently, machining tracks often used are grating type path, screw type path and pseudo-random path. On the edge of imprinting error, the speed of adjacent path points changes too fast, which causes the machine hard to reflect quickly, brings about new path error, and increases the polishing time due to superfluous path. This paper presents a new planning path method to eliminate imprinting effect. Simulation results show that the path of the improved grating path can better eliminate imprinting effect compared to the general path.

A method for verification of treatment delivery in HDR prostate brachytherapy using a flat panel detector for both imaging and source tracking.

PubMed

Smith, Ryan L; Haworth, Annette; Panettieri, Vanessa; Millar, Jeremy L; Franich, Rick D

2016-05-01

Verification of high dose rate (HDR) brachytherapy treatment delivery is an important step, but is generally difficult to achieve. A technique is required to monitor the treatment as it is delivered, allowing comparison with the treatment plan and error detection. In this work, we demonstrate a method for monitoring the treatment as it is delivered and directly comparing the delivered treatment with the treatment plan in the clinical workspace. This treatment verification system is based on a flat panel detector (FPD) used for both pre-treatment imaging and source tracking. A phantom study was conducted to establish the resolution and precision of the system. A pretreatment radiograph of a phantom containing brachytherapy catheters is acquired and registration between the measurement and treatment planning system (TPS) is performed using implanted fiducial markers. The measured catheter paths immediately prior to treatment were then compared with the plan. During treatment delivery, the position of the (192)Ir source is determined at each dwell position by measuring the exit radiation with the FPD and directly compared to the planned source dwell positions. The registration between the two corresponding sets of fiducial markers in the TPS and radiograph yielded a registration error (residual) of 1.0 mm. The measured catheter paths agreed with the planned catheter paths on average to within 0.5 mm. The source positions measured with the FPD matched the planned source positions for all dwells on average within 0.6 mm (s.d. 0.3, min. 0.1, max. 1.4 mm). We have demonstrated a method for directly comparing the treatment plan with the delivered treatment that can be easily implemented in the clinical workspace. Pretreatment imaging was performed, enabling visualization of the implant before treatment delivery and identification of possible catheter displacement. Treatment delivery verification was performed by measuring the source position as each dwell was delivered. This approach using a FPD for imaging and source tracking provides a noninvasive method of acquiring extensive information for verification in HDR prostate brachytherapy.

A method for verification of treatment delivery in HDR prostate brachytherapy using a flat panel detector for both imaging and source tracking

DOE Office of Scientific and Technical Information (OSTI.GOV)

Smith, Ryan L., E-mail: ryan.smith@wbrc.org.au; Millar, Jeremy L.; Franich, Rick D.

Purpose: Verification of high dose rate (HDR) brachytherapy treatment delivery is an important step, but is generally difficult to achieve. A technique is required to monitor the treatment as it is delivered, allowing comparison with the treatment plan and error detection. In this work, we demonstrate a method for monitoring the treatment as it is delivered and directly comparing the delivered treatment with the treatment plan in the clinical workspace. This treatment verification system is based on a flat panel detector (FPD) used for both pre-treatment imaging and source tracking. Methods: A phantom study was conducted to establish the resolutionmore » and precision of the system. A pretreatment radiograph of a phantom containing brachytherapy catheters is acquired and registration between the measurement and treatment planning system (TPS) is performed using implanted fiducial markers. The measured catheter paths immediately prior to treatment were then compared with the plan. During treatment delivery, the position of the {sup 192}Ir source is determined at each dwell position by measuring the exit radiation with the FPD and directly compared to the planned source dwell positions. Results: The registration between the two corresponding sets of fiducial markers in the TPS and radiograph yielded a registration error (residual) of 1.0 mm. The measured catheter paths agreed with the planned catheter paths on average to within 0.5 mm. The source positions measured with the FPD matched the planned source positions for all dwells on average within 0.6 mm (s.d. 0.3, min. 0.1, max. 1.4 mm). Conclusions: We have demonstrated a method for directly comparing the treatment plan with the delivered treatment that can be easily implemented in the clinical workspace. Pretreatment imaging was performed, enabling visualization of the implant before treatment delivery and identification of possible catheter displacement. Treatment delivery verification was performed by measuring the source position as each dwell was delivered. This approach using a FPD for imaging and source tracking provides a noninvasive method of acquiring extensive information for verification in HDR prostate brachytherapy.« less

Dynamic path planning for mobile robot based on particle swarm optimization

NASA Astrophysics Data System (ADS)

Wang, Yong; Cai, Feng; Wang, Ying

2017-08-01

In the contemporary, robots are used in many fields, such as cleaning, medical treatment, space exploration, disaster relief and so on. The dynamic path planning of robot without collision is becoming more and more the focus of people's attention. A new method of path planning is proposed in this paper. Firstly, the motion space model of the robot is established by using the MAKLINK graph method. Then the A* algorithm is used to get the shortest path from the start point to the end point. Secondly, this paper proposes an effective method to detect and avoid obstacles. When an obstacle is detected on the shortest path, the robot will choose the nearest safety point to move. Moreover, calculate the next point which is nearest to the target. Finally, the particle swarm optimization algorithm is used to optimize the path. The experimental results can prove that the proposed method is more effective.

Some path-following techniques for solution of nonlinear equations and comparison with parametric differentiation

NASA Technical Reports Server (NTRS)

Barger, R. L.; Walters, R. W.

1986-01-01

Some path-following techniques are described and compared with other methods. Use of multipurpose techniques that can be used at more than one stage of the path-following computation results in a system that is relatively simple to understand, program, and use. Comparison of path-following methods with the method of parametric differentiation reveals definite advantages for the path-following methods. The fact that parametric differentiation has found a broader range of applications indicates that path-following methods have been underutilized.

Optimal guidance with obstacle avoidance for nap-of-the-earth flight

NASA Technical Reports Server (NTRS)

Pekelsma, Nicholas J.

1988-01-01

The development of automatic guidance is discussed for helicopter Nap-of-the-Earth (NOE) and near-NOE flight. It deals with algorithm refinements relating to automated real-time flight path planning and to mission planning. With regard to path planning, it relates rotorcraft trajectory characteristics to the NOE computation scheme and addresses real-time computing issues and both ride quality issues and pilot-vehicle interfaces. The automated mission planning algorithm refinements include route optimization, automatic waypoint generation, interactive applications, and provisions for integrating the results into the real-time path planning software. A microcomputer based mission planning workstation was developed and is described. Further, the application of Defense Mapping Agency (DMA) digital terrain to both the mission planning workstation and to automatic guidance is both discussed and illustrated.

Mission-directed path planning for planetary rover exploration

NASA Astrophysics Data System (ADS)

Tompkins, Paul

2005-07-01

Robotic rovers uniquely benefit planetary exploration---they enable regional exploration with the precision of in-situ measurements, a combination impossible from an orbiting spacecraft or fixed lander. Mission planning for planetary rover exploration currently utilizes sophisticated software for activity planning and scheduling, but simplified path planning and execution approaches tailored for localized operations to individual targets. This approach is insufficient for the investigation of multiple, regionally distributed targets in a single command cycle. Path planning tailored for this task must consider the impact of large scale terrain on power, speed and regional access; the effect of route timing on resource availability; the limitations of finite resource capacity and other operational constraints on vehicle range and timing; and the mutual influence between traverses and upstream and downstream stationary activities. Encapsulating this reasoning in an efficient autonomous planner would allow a rover to continue operating rationally despite significant deviations from an initial plan. This research presents mission-directed path planning that enables an autonomous, strategic reasoning capability for robotic explorers. Planning operates in a space of position, time and energy. Unlike previous hierarchical approaches, it treats these dimensions simultaneously to enable globally-optimal solutions. The approach calls on a near incremental search algorithm designed for planning and re-planning under global constraints, in spaces of higher than two dimensions. Solutions under this method specify routes that avoid terrain obstacles, optimize the collection and use of rechargable energy, satisfy local and global mission constraints, and account for the time and energy of interleaved mission activities. Furthermore, the approach efficiently re-plans in response to updates in vehicle state and world models, and is well suited to online operation aboard a robot. Simulations exhibit that the new methodology succeeds where conventional path planners would fail. Three planetary-relevant field experiments demonstrate the power of mission-directed path planning in directing actual exploration robots. Offline mission-directed planning sustained a solar-powered rover in a 24-hour sun-synchronous traverse. Online planning and re-planning enabled full navigational autonomy of over 1 kilometer, and supported the execution of science activities distributed over hundreds of meters.

The people side of MRP (materiel requirements planning).

PubMed

Lunn, T

1994-05-01

A montage of ideas and concepts have been successfully used to train and motivate people to use MRP II systems more effectively. This is important today because many companies are striving to achieve World Class Manufacturing status. Closed loop Materiel Requirements Planning (MRP) systems are an integral part of the process of continuous improvement. Successfully using a formal management planning system, such as MRP II, is a fundamental stepping stone on the path toward World Class Excellence. Included in this article are techniques that companies use to reduce lead time, simplify bills of materiel, and improve schedule adherence. These and other steps all depend on the people who use the system. The focus will be on how companies use the MRP tool more effectively.

Robot path planning using a genetic algorithm

NASA Technical Reports Server (NTRS)

Cleghorn, Timothy F.; Baffes, Paul T.; Wang, Liu

1988-01-01

Robot path planning can refer either to a mobile vehicle such as a Mars Rover, or to an end effector on an arm moving through a cluttered workspace. In both instances there may exist many solutions, some of which are better than others, either in terms of distance traversed, energy expended, or joint angle or reach capabilities. A path planning program has been developed based upon a genetic algorithm. This program assumes global knowledge of the terrain or workspace, and provides a family of good paths between the initial and final points. Initially, a set of valid random paths are constructed. Successive generations of valid paths are obtained using one of several possible reproduction strategies similar to those found in biological communities. A fitness function is defined to describe the goodness of the path, in this case including length, slope, and obstacle avoidance considerations. It was found that with some reproduction strategies, the average value of the fitness function improved for successive generations, and that by saving the best paths of each generation, one could quite rapidly obtain a collection of good candidate solutions.

A template for integrated community sustainability planning.

PubMed

Ling, Christopher; Hanna, Kevin; Dale, Ann

2009-08-01

This article describes a template for implementing an integrated community sustainability plan. The template emphasizes community engagement and outlines the components of a basic framework for integrating ecological, social and economic dynamics into a community plan. The framework is a series of steps that support a sustainable community development process. While it reflects the Canadian experience, the tools and techniques have applied value for a range of environmental planning contexts around the world. The research is case study based and draws from a diverse range of communities representing many types of infrastructure, demographics and ecological and geographical contexts. A critical path for moving local governments to sustainable community development is the creation and implementation of integrated planning approaches. To be effective and to be implemented, a requisite shift to sustainability requires active community engagement processes, political will, and a commitment to political and administrative accountability, and measurement.

Three-Dimensional Path Planning for Uninhabited Combat Aerial Vehicle Based on Predator-Prey Pigeon-Inspired Optimization in Dynamic Environment.

PubMed

Zhang, Bo; Duan, Haibin

2017-01-01

Three-dimension path planning of uninhabited combat aerial vehicle (UCAV) is a complicated optimal problem, which mainly focused on optimizing the flight route considering the different types of constrains under complex combating environment. A novel predator-prey pigeon-inspired optimization (PPPIO) is proposed to solve the UCAV three-dimension path planning problem in dynamic environment. Pigeon-inspired optimization (PIO) is a new bio-inspired optimization algorithm. In this algorithm, map and compass operator model and landmark operator model are used to search the best result of a function. The prey-predator concept is adopted to improve global best properties and enhance the convergence speed. The characteristics of the optimal path are presented in the form of a cost function. The comparative simulation results show that our proposed PPPIO algorithm is more efficient than the basic PIO, particle swarm optimization (PSO), and different evolution (DE) in solving UCAV three-dimensional path planning problems.

Computer graphics testbed to simulate and test vision systems for space applications

NASA Technical Reports Server (NTRS)

Cheatham, John B.

1991-01-01

Artificial intelligence concepts are applied to robotics. Artificial neural networks, expert systems and laser imaging techniques for autonomous space robots are being studied. A computer graphics laser range finder simulator developed by Wu has been used by Weiland and Norwood to study use of artificial neural networks for path planning and obstacle avoidance. Interest is expressed in applications of CLIPS, NETS, and Fuzzy Control. These applications are applied to robot navigation.

Integration of Hierarchical Goal Network Planning and Autonomous Path Planning

DTIC Science & Technology

2016-03-01

Conference on Robotics and Automation (ICRA); 2010 May 3– 7; Anchorage, AK. p. 2902–2908. 4. Ayan NF, Kuter U, Yaman F, Goldman RP. Hotride...DISTRIBUTION/AVAILABILITY STATEMENT Approved for public release; distribution unlimited. 13. SUPPLEMENTARY NOTES 14. ABSTRACT Automated planning has...world robotic systems. This report documents work to integrate a hierarchical goal network planning algorithm with low-level path planning. The system

Open source Modeling and optimization tools for Planning

DOE Office of Scientific and Technical Information (OSTI.GOV)

Peles, S.

Open source modeling and optimization tools for planning The existing tools and software used for planning and analysis in California are either expensive, difficult to use, or not generally accessible to a large number of participants. These limitations restrict the availability of participants for larger scale energy and grid studies in the state. The proposed initiative would build upon federal and state investments in open source software, and create and improve open source tools for use in the state planning and analysis activities. Computational analysis and simulation frameworks in development at national labs and universities can be brought forward tomore » complement existing tools. An open source platform would provide a path for novel techniques and strategies to be brought into the larger community and reviewed by a broad set of stakeholders.« less

Efficient Skeletonization of Volumetric Objects.

PubMed

Zhou, Yong; Toga, Arthur W

1999-07-01

Skeletonization promises to become a powerful tool for compact shape description, path planning, and other applications. However, current techniques can seldom efficiently process real, complicated 3D data sets, such as MRI and CT data of human organs. In this paper, we present an efficient voxel-coding based algorithm for Skeletonization of 3D voxelized objects. The skeletons are interpreted as connected centerlines. consisting of sequences of medial points of consecutive clusters. These centerlines are initially extracted as paths of voxels, followed by medial point replacement, refinement, smoothness, and connection operations. The voxel-coding techniques have been proposed for each of these operations in a uniform and systematic fashion. In addition to preserving basic connectivity and centeredness, the algorithm is characterized by straightforward computation, no sensitivity to object boundary complexity, explicit extraction of ready-to-parameterize and branch-controlled skeletons, and efficient object hole detection. These issues are rarely discussed in traditional methods. A range of 3D medical MRI and CT data sets were used for testing the algorithm, demonstrating its utility.

Sensor-Oriented Path Planning for Multiregion Surveillance with a Single Lightweight UAV SAR

PubMed Central

Li, Jincheng; Chen, Jie; Wang, Pengbo; Li, Chunsheng

2018-01-01

In the surveillance of interested regions by unmanned aerial vehicle (UAV), system performance relies greatly on the motion control strategy of the UAV and the operation characteristics of the onboard sensors. This paper investigates the 2D path planning problem for the lightweight UAV synthetic aperture radar (SAR) system in an environment of multiple regions of interest (ROIs), the sizes of which are comparable to the radar swath width. Taking into account the special requirements of the SAR system on the motion of the platform, we model path planning for UAV SAR as a constrained multiobjective optimization problem (MOP). Based on the fact that the UAV route can be designed in the map image, an image-based path planner is proposed in this paper. First, the neighboring ROIs are merged by the morphological operation. Then, the parts of routes for data collection of the ROIs can be located according to the geometric features of the ROIs and the observation geometry of UAV SAR. Lastly, the route segments for ROIs surveillance are connected by a path planning algorithm named the sampling-based sparse A* search (SSAS) algorithm. Simulation experiments in real scenarios demonstrate that the proposed sensor-oriented path planner can improve the reconnaissance performance of lightweight UAV SAR greatly compared with the conventional zigzag path planner. PMID:29439447

Sensor-Oriented Path Planning for Multiregion Surveillance with a Single Lightweight UAV SAR.

PubMed

Li, Jincheng; Chen, Jie; Wang, Pengbo; Li, Chunsheng

2018-02-11

In the surveillance of interested regions by unmanned aerial vehicle (UAV), system performance relies greatly on the motion control strategy of the UAV and the operation characteristics of the onboard sensors. This paper investigates the 2D path planning problem for the lightweight UAV synthetic aperture radar (SAR) system in an environment of multiple regions of interest (ROIs), the sizes of which are comparable to the radar swath width. Taking into account the special requirements of the SAR system on the motion of the platform, we model path planning for UAV SAR as a constrained multiobjective optimization problem (MOP). Based on the fact that the UAV route can be designed in the map image, an image-based path planner is proposed in this paper. First, the neighboring ROIs are merged by the morphological operation. Then, the parts of routes for data collection of the ROIs can be located according to the geometric features of the ROIs and the observation geometry of UAV SAR. Lastly, the route segments for ROIs surveillance are connected by a path planning algorithm named the sampling-based sparse A* search (SSAS) algorithm. Simulation experiments in real scenarios demonstrate that the proposed sensor-oriented path planner can improve the reconnaissance performance of lightweight UAV SAR greatly compared with the conventional zigzag path planner.

An Application of Self-Organizing Map for Multirobot Multigoal Path Planning with Minmax Objective.

PubMed

Faigl, Jan

2016-01-01

In this paper, Self-Organizing Map (SOM) for the Multiple Traveling Salesman Problem (MTSP) with minmax objective is applied to the robotic problem of multigoal path planning in the polygonal domain. The main difficulty of such SOM deployment is determination of collision-free paths among obstacles that is required to evaluate the neuron-city distances in the winner selection phase of unsupervised learning. Moreover, a collision-free path is also needed in the adaptation phase, where neurons are adapted towards the presented input signal (city) to the network. Simple approximations of the shortest path are utilized to address this issue and solve the robotic MTSP by SOM. Suitability of the proposed approximations is verified in the context of cooperative inspection, where cities represent sensing locations that guarantee to "see" the whole robots' workspace. The inspection task formulated as the MTSP-Minmax is solved by the proposed SOM approach and compared with the combinatorial heuristic GENIUS. The results indicate that the proposed approach provides competitive results to GENIUS and support applicability of SOM for robotic multigoal path planning with a group of cooperating mobile robots. The proposed combination of approximate shortest paths with unsupervised learning opens further applications of SOM in the field of robotic planning.

An Application of Self-Organizing Map for Multirobot Multigoal Path Planning with Minmax Objective

PubMed Central

Faigl, Jan

2016-01-01

In this paper, Self-Organizing Map (SOM) for the Multiple Traveling Salesman Problem (MTSP) with minmax objective is applied to the robotic problem of multigoal path planning in the polygonal domain. The main difficulty of such SOM deployment is determination of collision-free paths among obstacles that is required to evaluate the neuron-city distances in the winner selection phase of unsupervised learning. Moreover, a collision-free path is also needed in the adaptation phase, where neurons are adapted towards the presented input signal (city) to the network. Simple approximations of the shortest path are utilized to address this issue and solve the robotic MTSP by SOM. Suitability of the proposed approximations is verified in the context of cooperative inspection, where cities represent sensing locations that guarantee to “see” the whole robots' workspace. The inspection task formulated as the MTSP-Minmax is solved by the proposed SOM approach and compared with the combinatorial heuristic GENIUS. The results indicate that the proposed approach provides competitive results to GENIUS and support applicability of SOM for robotic multigoal path planning with a group of cooperating mobile robots. The proposed combination of approximate shortest paths with unsupervised learning opens further applications of SOM in the field of robotic planning. PMID:27340395

Plan demographics, participants' saving behavior, and target-date fund investments.

PubMed

Park, Youngkyun

2009-05-01

This analysis explores (1) whether plan demographic characteristics would affect individual participant contribution rates and target-date fund investments and (2) equity glide paths for participants in relation to plan demographics by considering target replacement income and its success rate. PLAN DEMOGRAPHIC CHARACTERISTICS IN PARTICIPANT CONTRIBUTION RATES: This study finds empirical evidence that 401(k) plan participants' contribution rates differ by plan demographics based on participants' income and/or tenure. In particular, participants in 401(k) plans dominated by those with low income and short tenure tend to contribute less than those in plans dominated by participants with high income and long tenure. Future research will explore how participant contribution behavior may also be influenced by incentives provided by employers through matching formulae. PLAN DEMOGRAPHIC CHARACTERISTICS IN TARGET-DATE FUND INVESTMENTS: The study also finds empirical evidence that participants' investments in target-date funds with different equity allocations differ by plan demographics based on participants' income and/or tenure. In particular, target-date fund users with 90 percent or more of their account balances in target-date funds who are in 401(k) plans dominated by low-income and short-tenure participants tend to hold target-date funds with lower equity allocations, compared with their counterparts in plans dominated by high-income and long-tenure participants. Future research will focus on the extent to which these characteristics might influence the selection of target-date funds by plan sponsors. EQUITY GLIDE PATHS: Several stylized equity glide paths as well as alternative asset allocations are compared for participants at various starting ages to demonstrate the interaction between plan demographics and equity glide paths/asset allocations in terms of success rates in meeting various replacement income targets. The equity glide path/asset allocation providing the highest success rate at a particular replacement rate target will vary with the assumed starting date of the participant (see Figure 17). Given the highly stylized nature of the simulations in this Issue Brief it is important to note that the results are not intended to provide a single equity glide path solution in relation to plan demographics. Instead, they serve as a framework to be considered when plan sponsors make a selection concerning which target-date funds to include in their plan. IMPORTANCE OF PARTICIPANT CONTRIBUTION RATES: This analysis finds that although target-date funds with different equity glide paths affect the retirement income replacement success rate, participant contribution rates corresponding to different plan demographic characteristics have a stronger impact. AUTO FEATURES OF THE PPA: This Issue Brief provides a stylized study using observed contribution rates as of the 2007 plan year. However, with the passage of the Pension Protection Act of 2006 and its likely impact on plan design in the future (increased utilization of automatic enrollment and automatic contribution escalations), it is likely that contribution rates among the participants may become more homogenous. In such a scenario, it may be more likely that a single equity glide path would meet a wide range of demographic profiles.

Vehicle path-planning in three dimensions using optics analogs for optimizing visibility and energy cost

NASA Technical Reports Server (NTRS)

Rowe, Neil C.; Lewis, David H.

1989-01-01

Path planning is an important issue for space robotics. Finding safe and energy-efficient paths in the presence of obstacles and other constraints can be complex although important. High-level (large-scale) path planning for robotic vehicles was investigated in three-dimensional space with obstacles, accounting for: (1) energy costs proportional to path length; (2) turn costs where paths change trajectory abruptly; and (3) safety costs for the danger associated with traversing a particular path due to visibility or invisibility from a fixed set of observers. Paths optimal with respect to these cost factors are found. Autonomous or semi-autonomous vehicles were considered operating either in a space environment around satellites and space platforms, or aircraft, spacecraft, or smart missiles operating just above lunar and planetary surfaces. One class of applications concerns minimizing detection, as for example determining the best way to make complex modifications to a satellite without being observed by hostile sensors; another example is verifying there are no paths (holes) through a space defense system. Another class of applications concerns maximizing detection, as finding a good trajectory between mountain ranges of a planet while staying reasonably close to the surface, or finding paths for a flight between two locations that maximize the average number of triangulation points available at any time along the path.

Path Planning Algorithms for Autonomous Border Patrol Vehicles

NASA Astrophysics Data System (ADS)

Lau, George Tin Lam

This thesis presents an online path planning algorithm developed for unmanned vehicles in charge of autonomous border patrol. In this Pursuit-Evasion game, the unmanned vehicle is required to capture multiple trespassers on its own before any of them reach a target safe house where they are safe from capture. The problem formulation is based on Isaacs' Target Guarding problem, but extended to the case of multiple evaders. The proposed path planning method is based on Rapidly-exploring random trees (RRT) and is capable of producing trajectories within several seconds to capture 2 or 3 evaders. Simulations are carried out to demonstrate that the resulting trajectories approach the optimal solution produced by a nonlinear programming-based numerical optimal control solver. Experiments are also conducted on unmanned ground vehicles to show the feasibility of implementing the proposed online path planning algorithm on physical applications.

Dual stage potential field method for robotic path planning

NASA Astrophysics Data System (ADS)

Singh, Pradyumna Kumar; Parida, Pramod Kumar

2018-04-01

Path planning for autonomous mobile robots are the root for all autonomous mobile systems. Various methods are used for optimization of path to be followed by the autonomous mobile robots. Artificial potential field based path planning method is one of the most used methods for the researchers. Various algorithms have been proposed using the potential field approach. But in most of the common problems are encounters while heading towards the goal or target. i.e. local minima problem, zero potential regions problem, complex shaped obstacles problem, target near obstacle problem. In this paper we provide a new algorithm in which two types of potential functions are used one after another. The former one is to use to get the probable points and later one for getting the optimum path. In this algorithm we consider only the static obstacle and goal.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Khan, S; Chin, E; Xing, L

Purpose: The integration of couch motion during arc delivery is necessitated to enable irradiation trajectories such as coronal arcs, and to enhance the geometrical sampling for dynamic deliveries to the highest extent. To enable such capability, a platform of Trajectory Modulated Arc Therapy (TMAT) is developed in conjunction with standardized noncollisional dynamic path-set for irradiation of intracranial lesions. Methods: A generalized path-set was constructed through the combination of sagittal arcs (45 degrees from the CAX), axial arcs, and coronal arcs produced through modulation of the dynamic rotation of couch. The standardized path was implemented in a contiguous manner enabling themore » formation of fully automated sub-trajectories to provide maximal geometrical convergence with minimal number of arcs. Progressive sampling technique is used for direct aperture optimization of the MLCs and the selection of couch positions across the control points. Dosimetry of the resulting plans was assessed relative to clinically delivered plans. Using the TrueBeam Developer Mode, plan deliverability was tested. Results: Treatment planning of TMAT sub-trajectories for central, anterior and posterior tumor sites with volumes ranging from 4.75cc to 107cc demonstrated radically reduced doses to the critical OARs when compared to the clinically treated VMAT. Specifically, percentage reduction in mean dose for critical organs such as brainstem, cochlea, and optic nerve are found to be as low as 74±15%, 50±26% and 74±30% respectively as compared to VMAT. Conformity Index, defined as the ratio of tumor volume (VPTV) and 100% dose volume (V(D100%)), was reduced up to 12% while the Gradient Index, defined as V(D100%)/V(D50%), was concurrently improved by up to 14%. Conclusion: An automated standardized trajectory with dynamically modulated couch-gantry arcs has been developed for intracranial radiotherapy. Through the incorporation of coronal arcs, it is demonstrated that significantly reduced OAR doses can be achieved relative to clinically treated patient plans via VMAT. Research Grant Funding Support by Varian Medical Systems.« less

Dynamic path planning for autonomous driving on various roads with avoidance of static and moving obstacles

NASA Astrophysics Data System (ADS)

Hu, Xuemin; Chen, Long; Tang, Bo; Cao, Dongpu; He, Haibo

2018-02-01

This paper presents a real-time dynamic path planning method for autonomous driving that avoids both static and moving obstacles. The proposed path planning method determines not only an optimal path, but also the appropriate acceleration and speed for a vehicle. In this method, we first construct a center line from a set of predefined waypoints, which are usually obtained from a lane-level map. A series of path candidates are generated by the arc length and offset to the center line in the s - ρ coordinate system. Then, all of these candidates are converted into Cartesian coordinates. The optimal path is selected considering the total cost of static safety, comfortability, and dynamic safety; meanwhile, the appropriate acceleration and speed for the optimal path are also identified. Various types of roads, including single-lane roads and multi-lane roads with static and moving obstacles, are designed to test the proposed method. The simulation results demonstrate the effectiveness of the proposed method, and indicate its wide practical application to autonomous driving.

FTS evolution

NASA Technical Reports Server (NTRS)

Provost, David E.

1990-01-01

Viewgraphs on flight telerobotic servicer evolution are presented. Topics covered include: paths for FTS evolution; frequently performed actions; primary task states; EPS radiator panel installation; generic task definitions; path planning; non-contact alignment; contact planning and control; and human operator interface.

Bim-Based Indoor Path Planning Considering Obstacles

NASA Astrophysics Data System (ADS)

Xu, M.; Wei, S.; Zlatanova, S.; Zhang, R.

2017-09-01

At present, 87 % of people's activities are in indoor environment; indoor navigation has become a research issue. As the building structures for people's daily life are more and more complex, many obstacles influence humans' moving. Therefore it is essential to provide an accurate and efficient indoor path planning. Nowadays there are many challenges and problems in indoor navigation. Most existing path planning approaches are based on 2D plans, pay more attention to the geometric configuration of indoor space, often ignore rich semantic information of building components, and mostly consider simple indoor layout without taking into account the furniture. Addressing the above shortcomings, this paper uses BIM (IFC) as the input data and concentrates on indoor navigation considering obstacles in the multi-floor buildings. After geometric and semantic information are extracted, 2D and 3D space subdivision methods are adopted to build the indoor navigation network and to realize a path planning that avoids obstacles. The 3D space subdivision is based on triangular prism. The two approaches are verified by the experiments.

Visually based path-planning by Japanese monkeys.

PubMed

Mushiake, H; Saito, N; Sakamoto, K; Sato, Y; Tanji, J

2001-03-01

To construct an animal model of strategy formation, we designed a maze path-finding task. First, we asked monkeys to capture a goal in the maze by moving a cursor on the screen. Cursor movement was linked to movements of each wrist. When the animals learned the association between cursor movement and wrist movement, we established a start and a goal in the maze, and asked them to find a path between them. We found that the animals took the shortest pathway, rather than approaching the goal randomly. We further found that the animals adopted a strategy of selecting a fixed intermediate point in the visually presented maze to select one of the shortest pathways, suggesting a visually based path planning. To examine their capacity to use that strategy flexibly, we transformed the task by blocking pathways in the maze, providing a problem to solve. The animals then developed a strategy of solving the problem by planning a novel shortest path from the start to the goal and rerouting the path to bypass the obstacle.

A Dynamic Bioinspired Neural Network Based Real-Time Path Planning Method for Autonomous Underwater Vehicles

PubMed Central

2017-01-01

Real-time path planning for autonomous underwater vehicle (AUV) is a very difficult and challenging task. Bioinspired neural network (BINN) has been used to deal with this problem for its many distinct advantages: that is, no learning process is needed and realization is also easy. However, there are some shortcomings when BINN is applied to AUV path planning in a three-dimensional (3D) unknown environment, including complex computing problem when the environment is very large and repeated path problem when the size of obstacles is bigger than the detection range of sensors. To deal with these problems, an improved dynamic BINN is proposed in this paper. In this proposed method, the AUV is regarded as the core of the BINN and the size of the BINN is based on the detection range of sensors. Then the BINN will move with the AUV and the computing could be reduced. A virtual target is proposed in the path planning method to ensure that the AUV can move to the real target effectively and avoid big-size obstacles automatically. Furthermore, a target attractor concept is introduced to improve the computing efficiency of neural activities. Finally, some experiments are conducted under various 3D underwater environments. The experimental results show that the proposed BINN based method can deal with the real-time path planning problem for AUV efficiently. PMID:28255297

A Dynamic Bioinspired Neural Network Based Real-Time Path Planning Method for Autonomous Underwater Vehicles.

PubMed

Ni, Jianjun; Wu, Liuying; Shi, Pengfei; Yang, Simon X

2017-01-01

Real-time path planning for autonomous underwater vehicle (AUV) is a very difficult and challenging task. Bioinspired neural network (BINN) has been used to deal with this problem for its many distinct advantages: that is, no learning process is needed and realization is also easy. However, there are some shortcomings when BINN is applied to AUV path planning in a three-dimensional (3D) unknown environment, including complex computing problem when the environment is very large and repeated path problem when the size of obstacles is bigger than the detection range of sensors. To deal with these problems, an improved dynamic BINN is proposed in this paper. In this proposed method, the AUV is regarded as the core of the BINN and the size of the BINN is based on the detection range of sensors. Then the BINN will move with the AUV and the computing could be reduced. A virtual target is proposed in the path planning method to ensure that the AUV can move to the real target effectively and avoid big-size obstacles automatically. Furthermore, a target attractor concept is introduced to improve the computing efficiency of neural activities. Finally, some experiments are conducted under various 3D underwater environments. The experimental results show that the proposed BINN based method can deal with the real-time path planning problem for AUV efficiently.

Using Planning, Scheduling and Execution for Autonomous Mars Rover Operations

NASA Technical Reports Server (NTRS)

Estlin, Tara A.; Gaines, Daniel M.; Chouinard, Caroline M.; Fisher, Forest W.; Castano, Rebecca; Judd, Michele J.; Nesnas, Issa A.

2006-01-01

With each new rover mission to Mars, rovers are traveling significantly longer distances. This distance increase raises not only the opportunities for science data collection, but also amplifies the amount of environment and rover state uncertainty that must be handled in rover operations. This paper describes how planning, scheduling and execution techniques can be used onboard a rover to autonomously generate and execute rover activities and in particular to handle new science opportunities that have been identified dynamically. We also discuss some of the particular challenges we face in supporting autonomous rover decision-making. These include interaction with rover navigation and path-planning software and handling large amounts of uncertainty in state and resource estimations. Finally, we describe our experiences in testing this work using several Mars rover prototypes in a realistic environment.

Thermal Stability of Al2O3/Silicone Composites as High-Temperature Encapsulants

NASA Astrophysics Data System (ADS)

Yao, Yiying

Underwater gliders are robust and long endurance ocean sampling platforms that are increasingly being deployed in coastal regions. This new environment is characterized by shallow waters and significant currents that can challenge the mobility of these efficient (but traditionally slow moving) vehicles. This dissertation aims to improve the performance of shallow water underwater gliders through path planning. The path planning problem is formulated for a dynamic particle (or "kinematic car") model. The objective is to identify the path which satisfies specified boundary conditions and minimizes a particular cost. Several cost functions are considered. The problem is addressed using optimal control theory. The length scales of interest for path planning are within a few turn radii. First, an approach is developed for planning minimum-time paths, for a fixed speed glider, that are sub-optimal but are guaranteed to be feasible in the presence of unknown time-varying currents. Next the minimum-time problem for a glider with speed controls, that may vary between the stall speed and the maximum speed, is solved. Last, optimal paths that minimize change in depth (equivalently, maximize range) are investigated. Recognizing that path planning alone cannot overcome all of the challenges associated with significant currents and shallow waters, the design of a novel underwater glider with improved capabilities is explored. A glider with a pneumatic buoyancy engine (allowing large, rapid buoyancy changes) and a cylindrical moving mass mechanism (generating large pitch and roll moments) is designed, manufactured, and tested to demonstrate potential improvements in speed and maneuverability.

Sequential quadratic programming-based fast path planning algorithm subject to no-fly zone constraints

NASA Astrophysics Data System (ADS)

Liu, Wei; Ma, Shunjian; Sun, Mingwei; Yi, Haidong; Wang, Zenghui; Chen, Zengqiang

2016-08-01

Path planning plays an important role in aircraft guided systems. Multiple no-fly zones in the flight area make path planning a constrained nonlinear optimization problem. It is necessary to obtain a feasible optimal solution in real time. In this article, the flight path is specified to be composed of alternate line segments and circular arcs, in order to reformulate the problem into a static optimization one in terms of the waypoints. For the commonly used circular and polygonal no-fly zones, geometric conditions are established to determine whether or not the path intersects with them, and these can be readily programmed. Then, the original problem is transformed into a form that can be solved by the sequential quadratic programming method. The solution can be obtained quickly using the Sparse Nonlinear OPTimizer (SNOPT) package. Mathematical simulations are used to verify the effectiveness and rapidity of the proposed algorithm.

A New Technique for Compensating Joint Limits in a Robot Manipulator

NASA Technical Reports Server (NTRS)

Litt, Jonathan; Hickman, Andre; Guo, Ten-Huei

1996-01-01

A new robust, optimal, adaptive technique for compensating rate and position limits in the joints of a six degree-of-freedom elbow manipulator is presented. In this new algorithm, the unmet demand as a result of actuator saturation is redistributed among the remaining unsaturated joints. The scheme is used to compensate for inadequate path planning, problems such as joint limiting, joint freezing, or even obstacle avoidance, where a desired position and orientation are not attainable due to an unrealizable joint command. Once a joint encounters a limit, supplemental commands are sent to other joints to best track, according to a selected criterion, the desired trajectory.

Path Planning Method in Multi-obstacle Marine Environment

NASA Astrophysics Data System (ADS)

Zhang, Jinpeng; Sun, Hanxv

2017-12-01

In this paper, an improved algorithm for particle swarm optimization is proposed for the application of underwater robot in the complex marine environment. Not only did consider to avoid obstacles when path planning, but also considered the current direction and the size effect on the performance of the robot dynamics. The algorithm uses the trunk binary tree structure to construct the path search space and A * heuristic search method is used in the search space to find a evaluation standard path. Then the particle swarm algorithm to optimize the path by adjusting evaluation function, which makes the underwater robot in the current navigation easier to control, and consume less energy.

Project Scheduling Based on Risk of Gas Transmission Pipe

NASA Astrophysics Data System (ADS)

Silvianita; Nurbaity, A.; Mulyadi, Y.; Suntoyo; Chamelia, D. M.

2018-03-01

The planning of a project has a time limit on which must be completed before or right at a predetermined time. Thus, in a project planning, it is necessary to have scheduling management that is useful for completing a project to achieve maximum results by considering the constraints that will exists. Scheduling management is undertaken to deal with uncertainties and negative impacts of time and cost in project completion. This paper explains about scheduling management in gas transmission pipeline project Gresik-Semarang to find out which scheduling plan is most effectively used in accordance with its risk value. Scheduling management in this paper is assissted by Microsoft Project software to find the critical path of existing project scheduling planning data. Critical path is the longest scheduling path with the fastest completion time. The result is found a critical path on project scheduling with completion time is 152 days. Furthermore, the calculation of risk is done by using House of Risk (HOR) method and it is found that the critical path has a share of 40.98 percent of all causes of the occurence of risk events that will be experienced.

Shape Sensing Techniques for Continuum Robots in Minimally Invasive Surgery: A Survey.

PubMed

Shi, Chaoyang; Luo, Xiongbiao; Qi, Peng; Li, Tianliang; Song, Shuang; Najdovski, Zoran; Fukuda, Toshio; Ren, Hongliang

2017-08-01

Continuum robots provide inherent structural compliance with high dexterity to access the surgical target sites along tortuous anatomical paths under constrained environments and enable to perform complex and delicate operations through small incisions in minimally invasive surgery. These advantages enable their broad applications with minimal trauma and make challenging clinical procedures possible with miniaturized instrumentation and high curvilinear access capabilities. However, their inherent deformable designs make it difficult to realize 3-D intraoperative real-time shape sensing to accurately model their shape. Solutions to this limitation can lead themselves to further develop closely associated techniques of closed-loop control, path planning, human-robot interaction, and surgical manipulation safety concerns in minimally invasive surgery. Although extensive model-based research that relies on kinematics and mechanics has been performed, accurate shape sensing of continuum robots remains challenging, particularly in cases of unknown and dynamic payloads. This survey investigates the recent advances in alternative emerging techniques for 3-D shape sensing in this field and focuses on the following categories: fiber-optic-sensor-based, electromagnetic-tracking-based, and intraoperative imaging modality-based shape-reconstruction methods. The limitations of existing technologies and prospects of new technologies are also discussed.

Path planning for persistent surveillance applications using fixed-wing unmanned aerial vehicles

NASA Astrophysics Data System (ADS)

Keller, James F.

This thesis addresses coordinated path planning for fixed-wing Unmanned Aerial Vehicles (UAVs) engaged in persistent surveillance missions. While uniquely suited to this mission, fixed wing vehicles have maneuver constraints that can limit their performance in this role. Current technology vehicles are capable of long duration flight with a minimal acoustic footprint while carrying an array of cameras and sensors. Both military tactical and civilian safety applications can benefit from this technology. We make three main contributions: C1 A sequential path planner that generates a C 2 flight plan to persistently acquire a covering set of data over a user designated area of interest. The planner features the following innovations: • A path length abstraction that embeds kino-dynamic motion constraints to estimate feasible path length. • A Traveling Salesman-type planner to generate a covering set route based on the path length abstraction. • A smooth path generator that provides C 2 routes that satisfy user specified curvature constraints. C2 A set of algorithms to coordinate multiple UAVs, including mission commencement from arbitrary locations to the start of a coordinated mission and de-confliction of paths to avoid collisions with other vehicles and fixed obstacles. C3 A numerically robust toolbox of spline-based algorithms tailored for vehicle routing validated through flight test experiments on multiple platforms. A variety of tests and platforms are discussed. The algorithms presented are based on a technical approach with approximately equal emphasis on analysis, computation, dynamic simulation, and flight test experimentation. Our planner (C1) directly takes into account vehicle maneuverability and agility constraints that could otherwise render simple solutions infeasible. This is especially important when surveillance objectives elevate the importance of optimized paths. Researchers have developed a diverse range of solutions for persistent surveillance applications but few directly address dynamic maneuver constraints. The key feature of C1 is a two stage sequential solution that discretizes the problem so that graph search techniques can be combined with parametric polynomial curve generation. A method to abstract the kino-dynamics of the aerial platforms is then presented so that a graph search solution can be adapted for this application. An A* Traveling Salesman Problem (TSP) algorithm is developed to search the discretized space using the abstract distance metric to acquire more data or avoid obstacles. Results of the graph search are then transcribed into smooth paths based on vehicle maneuver constraints. A complete solution for a single vehicle periodic tour of the area is developed using the results of the graph search algorithm. To execute the mission, we present a simultaneous arrival algorithm (C2) to coordinate execution by multiple vehicles to satisfy data refresh requirements and to ensure there are no collisions at any of the path intersections. We present a toolbox of spline-based algorithms (C3) to streamline the development of C2 continuous paths with numerical stability. These tools are applied to an aerial persistent surveillance application to illustrate their utility. Comparisons with other parametric polynomial approaches are highlighted to underscore the benefits of the B-spline framework. Performance limits with respect to feasibility constraints are documented.

UAVSAR Flight-Planning System

NASA Technical Reports Server (NTRS)

2008-01-01

A system of software partly automates planning of a flight of the Uninhabited Aerial Vehicle Synthetic Aperture Radar (UAVSAR) -- a polarimetric synthetic-aperture radar system aboard an unpiloted or minimally piloted airplane. The software constructs a flight plan that specifies not only the intended flight path but also the setup of the radar system at each point along the path.

Motion planning: A journey of robots, molecules, digital actors, and other artifacts

DOE Office of Scientific and Technical Information (OSTI.GOV)

Latombe, J.C.

1999-11-01

During the past three decades, motion planning has emerged as a crucial and productive research area in robotics. In the mid-1980s, the most advanced planners were barely able to compute collision-free paths for objects crawling in planar workspaces. Today, planners efficiently deal with robots with many degrees of freedom in complex environments. Techniques also exist to generate quasi-optimal trajectories, coordinate multiple robots, deal with dynamic and kinematic constraints, and handle dynamic environments. This paper describes some of these achievements, presents new problems that have recently emerged, discusses applications likely to motivate future research, and finally gives expectations for the comingmore » years. It stresses the fact that nonrobotics applications (e.g., graphic animation, surgical planning, computational biology) are growing in importance and are likely to shape future motion-planning research more than robotics itself.« less

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

NASA Technical Reports Server (NTRS)

Mckee, James W.

1989-01-01

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.

Grasp planning under uncertainty

NASA Technical Reports Server (NTRS)

Erkmen, A. M.; Stephanou, H. E.

1989-01-01

The planning of dexterous grasps for multifingered robot hands operating in uncertain environments is covered. A sensor-based approach to the planning of a reach path prior to grasping is first described. An on-line, joint space finger path planning algorithm for the enclose phase of grasping was then developed. The algorithm minimizes the impact momentum of the hand. It uses a Preshape Jacobian matrix to map task-level hand preshape requirements into kinematic constraints. A master slave scheme avoids inter-finger collisions and reduces the dimensionality of the planning problem.

Planning paths to multiple targets: memory involvement and planning heuristics in spatial problem solving.

PubMed

Wiener, J M; Ehbauer, N N; Mallot, H A

2009-09-01

For large numbers of targets, path planning is a complex and computationally expensive task. Humans, however, usually solve such tasks quickly and efficiently. We present experiments studying human path planning performance and the cognitive processes and heuristics involved. Twenty-five places were arranged on a regular grid in a large room. Participants were repeatedly asked to solve traveling salesman problems (TSP), i.e., to find the shortest closed loop connecting a start location with multiple target locations. In Experiment 1, we tested whether humans employed the nearest neighbor (NN) strategy when solving the TSP. Results showed that subjects outperform the NN-strategy, suggesting that it is not sufficient to explain human route planning behavior. As a second possible strategy we tested a hierarchical planning heuristic in Experiment 2, demonstrating that participants first plan a coarse route on the region level that is refined during navigation. To test for the relevance of spatial working memory (SWM) and spatial long-term memory (LTM) for planning performance and the planning heuristics applied, we varied the memory demands between conditions in Experiment 2. In one condition the target locations were directly marked, such that no memory was required; a second condition required participants to memorize the target locations during path planning (SWM); in a third condition, additionally, the locations of targets had to retrieved from LTM (SWM and LTM). Results showed that navigation performance decreased with increasing memory demands while the dependence on the hierarchical planning heuristic increased.

System and Method for Aiding Pilot Preview, Rehearsal, Review, and Real-Time Visual Acquisition of Flight Mission Progress

NASA Technical Reports Server (NTRS)

Prinzel, III, Lawrence J. (Inventor); Pope, Alan T. (Inventor); Williams, Steven P. (Inventor); Bailey, Randall E. (Inventor); Arthur, Jarvis J. (Inventor); Kramer, Lynda J. (Inventor); Schutte, Paul C. (Inventor)

2012-01-01

Embodiments of the invention permit flight paths (current and planned) to be viewed from various orientations to provide improved path and terrain awareness via graphical two-dimensional or three-dimensional perspective display formats. By coupling the flight path information with a terrain database, uncompromising terrain awareness relative to the path and ownship is provided. In addition, missed approaches, path deviations, and any navigational path can be reviewed and rehearsed before performing the actual task. By rehearsing a particular mission, check list items can be reviewed, terrain awareness can be highlighted, and missed approach procedures can be discussed by the flight crew. Further, the use of Controller Pilot Datalink Communications enables data-linked path, flight plan changes, and Air Traffic Control requests to be integrated into the flight display of the present invention.

Sampling-Based Coverage Path Planning for Complex 3D Structures

DTIC Science & Technology

2012-09-01

one such task, in which a single robot must sweep its end effector over the entirety of a known workspace. For two-dimensional environments, optimal...structures. First, we introduce a new algorithm for planning feasible coverage paths. It is more computationally efficient in problems of complex geometry...iteratively shortens and smooths a feasible coverage path; robot configurations are adjusted without violating any coverage con- straints. Third, we propose

Robot path planning algorithm based on symbolic tags in dynamic environment

NASA Astrophysics Data System (ADS)

Vokhmintsev, A.; Timchenko, M.; Melnikov, A.; Kozko, A.; Makovetskii, A.

2017-09-01

The present work will propose a new heuristic algorithms for path planning of a mobile robot in an unknown dynamic space that have theoretically approved estimates of computational complexity and are approbated for solving specific applied problems.

Research on Taxiway Path Optimization Based on Conflict Detection

PubMed Central

Zhou, Hang; Jiang, Xinxin

2015-01-01

Taxiway path planning is one of the effective measures to make full use of the airport resources, and the optimized paths can ensure the safety of the aircraft during the sliding process. In this paper, the taxiway path planning based on conflict detection is considered. Specific steps are shown as follows: firstly, make an improvement on A * algorithm, the conflict detection strategy is added to search for the shortest and safe path in the static taxiway network. Then, according to the sliding speed of aircraft, a time table for each node is determined and the safety interval is treated as the constraint to judge whether there is a conflict or not. The intelligent initial path planning model is established based on the results. Finally, make an example in an airport simulation environment, detect and relieve the conflict to ensure the safety. The results indicate that the model established in this paper is effective and feasible. Meanwhile, make comparison with the improved A*algorithm and other intelligent algorithms, conclude that the improved A*algorithm has great advantages. It could not only optimize taxiway path, but also ensure the safety of the sliding process and improve the operational efficiency. PMID:26226485

Expert system for neurosurgical treatment planning

NASA Astrophysics Data System (ADS)

Cheng, Andrew Y. S.; Chung, Sally S. Y.; Kwok, John C. K.

1996-04-01

A specially designed expert system is in development for neurosurgical treatment planning. The knowledge base contains knowledge and experiences on neurosurgical treatment planning from neurosurgeon consultants, who also determine the risks of different regions in human brains. When completed, the system can simulate the decision making process of neurosurgeons to determine the safest probing path for operation. The Computed Tomography (CT) or Magnetic Resonance Imaging (MRI) scan images for each patient are grabbed as the input. The system also allows neurosurgeons to include for any particular patient the additional information, such as how the tumor affects its neighboring functional regions, which is also important for calculating the safest probing path. It can then consider all the relevant information and find the most suitable probing path on the patient's brain. A 3D brain model is constructed for each set of the CT/MRI scan images and is displayed real-time together with the possible probing paths found. The precise risk value of each path is shown as a number between 0 and 1, together with its possible damages in text. Neurosurgeons can view more than one possible path simultaneously, and make the final decision on the selected path for operation.

Research on Taxiway Path Optimization Based on Conflict Detection.

PubMed

Zhou, Hang; Jiang, Xinxin

2015-01-01

Taxiway path planning is one of the effective measures to make full use of the airport resources, and the optimized paths can ensure the safety of the aircraft during the sliding process. In this paper, the taxiway path planning based on conflict detection is considered. Specific steps are shown as follows: firstly, make an improvement on A * algorithm, the conflict detection strategy is added to search for the shortest and safe path in the static taxiway network. Then, according to the sliding speed of aircraft, a time table for each node is determined and the safety interval is treated as the constraint to judge whether there is a conflict or not. The intelligent initial path planning model is established based on the results. Finally, make an example in an airport simulation environment, detect and relieve the conflict to ensure the safety. The results indicate that the model established in this paper is effective and feasible. Meanwhile, make comparison with the improved A*algorithm and other intelligent algorithms, conclude that the improved A*algorithm has great advantages. It could not only optimize taxiway path, but also ensure the safety of the sliding process and improve the operational efficiency.

Study of Double-Weighted Graph Model and Optimal Path Planning for Tourist Scenic Area Oriented Intelligent Tour Guide

NASA Astrophysics Data System (ADS)

Shi, Y.; Long, Y.; Wi, X. L.

2014-04-01

When tourists visiting multiple tourist scenic spots, the travel line is usually the most effective road network according to the actual tour process, and maybe the travel line is different from planned travel line. For in the field of navigation, a proposed travel line is normally generated automatically by path planning algorithm, considering the scenic spots' positions and road networks. But when a scenic spot have a certain area and have multiple entrances or exits, the traditional described mechanism of single point coordinates is difficult to reflect these own structural features. In order to solve this problem, this paper focuses on the influence on the process of path planning caused by scenic spots' own structural features such as multiple entrances or exits, and then proposes a doubleweighted Graph Model, for the weight of both vertexes and edges of proposed Model can be selected dynamically. And then discusses the model building method, and the optimal path planning algorithm based on Dijkstra algorithm and Prim algorithm. Experimental results show that the optimal planned travel line derived from the proposed model and algorithm is more reasonable, and the travelling order and distance would be further optimized.

Path planning for planetary rover using extended elevation map

NASA Technical Reports Server (NTRS)

Nakatani, Ichiro; Kubota, Takashi; Yoshimitsu, Tetsuo

1994-01-01

This paper describes a path planning method for planetary rovers to search for paths on planetary surfaces. The planetary rover is required to travel safely over a long distance for many days over unfamiliar terrain. Hence it is very important how planetary rovers process sensory information in order to understand the planetary environment and to make decisions based on that information. As a new data structure for informational mapping, an extended elevation map (EEM) has been introduced, which includes the effect of the size of the rover. The proposed path planning can be conducted in such a way as if the rover were a point while the size of the rover is automatically taken into account. The validity of the proposed methods is verified by computer simulations.

Autonomous Path Planning for On-Orbit Servicing Vehicles

NASA Astrophysics Data System (ADS)

McInnes, C. R.

On-orbit servicing has long been considered as a means of reducing mission costs. While automated on-orbit servicing of satellites in LEO and GEO has yet to be realised, the International Space Station (ISS) will require servicing in a number of forms for re-supply, external visual inspection and maintenance. This paper will discuss a unified approach to path planning for such servicing vehicles using artificial potential field methods. In particular, path constrained rendezvous and docking of the ESA Automated Transfer Vehicle (ATV) at the ISS will be investigated as will mission and path planning tools for the Daimler-Chrysler Aerospace ISS Inspector free-flying camera. Future applications for free-flying microcameras and co-operative control between multiple free-flyers for on-orbit assembly will also be considered.

Planning Paths Through Singularities in the Center of Mass Space

NASA Technical Reports Server (NTRS)

Doggett, William R.; Messner, William C.; Juang, Jer-Nan

1998-01-01

The center of mass space is a convenient space for planning motions that minimize reaction forces at the robot's base or optimize the stability of a mechanism. A unique problem associated with path planning in the center of mass space is the potential existence of multiple center of mass images for a single Cartesian obstacle, since a single center of mass location can correspond to multiple robot joint configurations. The existence of multiple images results in a need to either maintain multiple center of mass obstacle maps or to update obstacle locations when the robot passes through a singularity, such as when it moves from an elbow-up to an elbow-down configuration. To illustrate the concepts presented in this paper, a path is planned for an example task requiring motion through multiple center of mass space maps. The object of the path planning algorithm is to locate the bang- bang acceleration profile that minimizes the robot's base reactions in the presence of a single Cartesian obstacle. To simplify the presentation, only non-redundant robots are considered and joint non-linearities are neglected.

Safe Maritime Autonomous Path Planning in a High Sea State

NASA Technical Reports Server (NTRS)

Ono, Masahiro; Quadrelli, Marco; Huntsberger, Terrance L.

2014-01-01

This paper presents a path planning method for sea surface vehicles that prevents capsizing and bow-diving in a high sea-state. A key idea is to use response amplitude operators (RAOs) or, in control terminology, the transfer functions from a sea state to a vessel's motion, in order to find a set of speeds and headings that results in excessive pitch and roll oscillations. This information is translated to arithmetic constraints on the ship's velocity, which are passed to a model predictive control (MPC)-based path planner to find a safe and optimal path that achieves specified goals. An obstacle avoidance capability is also added to the path planner. The proposed method is demonstrated by simulations.

New Polyazine-Bridged RuII,RhIII and RuII,RhI Supramolecular Photocatalysts for Water Reduction to Hydrogen Applicable for Solar Energy Conversion and Mechanistic Investigation of the Photocatalytic Cycle

NASA Astrophysics Data System (ADS)

Zhou, Rongwei

Underwater gliders are robust and long endurance ocean sampling platforms that are increasingly being deployed in coastal regions. This new environment is characterized by shallow waters and significant currents that can challenge the mobility of these efficient (but traditionally slow moving) vehicles. This dissertation aims to improve the performance of shallow water underwater gliders through path planning. The path planning problem is formulated for a dynamic particle (or "kinematic car") model. The objective is to identify the path which satisfies specified boundary conditions and minimizes a particular cost. Several cost functions are considered. The problem is addressed using optimal control theory. The length scales of interest for path planning are within a few turn radii. First, an approach is developed for planning minimum-time paths, for a fixed speed glider, that are sub-optimal but are guaranteed to be feasible in the presence of unknown time-varying currents. Next the minimum-time problem for a glider with speed controls, that may vary between the stall speed and the maximum speed, is solved. Last, optimal paths that minimize change in depth (equivalently, maximize range) are investigated. Recognizing that path planning alone cannot overcome all of the challenges associated with significant currents and shallow waters, the design of a novel underwater glider with improved capabilities is explored. A glider with a pneumatic buoyancy engine (allowing large, rapid buoyancy changes) and a cylindrical moving mass mechanism (generating large pitch and roll moments) is designed, manufactured, and tested to demonstrate potential improvements in speed and maneuverability.

Path-following control of wheeled planetary exploration robots moving on deformable rough terrain.

PubMed

Ding, Liang; Gao, Hai-bo; Deng, Zong-quan; Li, Zhijun; Xia, Ke-rui; Duan, Guang-ren

2014-01-01

The control of planetary rovers, which are high performance mobile robots that move on deformable rough terrain, is a challenging problem. Taking lateral skid into account, this paper presents a rough terrain model and nonholonomic kinematics model for planetary rovers. An approach is proposed in which the reference path is generated according to the planned path by combining look-ahead distance and path updating distance on the basis of the carrot following method. A path-following strategy for wheeled planetary exploration robots incorporating slip compensation is designed. Simulation results of a four-wheeled robot on deformable rough terrain verify that it can be controlled to follow a planned path with good precision, despite the fact that the wheels will obviously skid and slip.

Path-Following Control of Wheeled Planetary Exploration Robots Moving on Deformable Rough Terrain

PubMed Central

Ding, Liang; Gao, Hai-bo; Deng, Zong-quan; Li, Zhijun; Xia, Ke-rui; Duan, Guang-ren

2014-01-01

The control of planetary rovers, which are high performance mobile robots that move on deformable rough terrain, is a challenging problem. Taking lateral skid into account, this paper presents a rough terrain model and nonholonomic kinematics model for planetary rovers. An approach is proposed in which the reference path is generated according to the planned path by combining look-ahead distance and path updating distance on the basis of the carrot following method. A path-following strategy for wheeled planetary exploration robots incorporating slip compensation is designed. Simulation results of a four-wheeled robot on deformable rough terrain verify that it can be controlled to follow a planned path with good precision, despite the fact that the wheels will obviously skid and slip. PMID:24790582

Aircraft path planning for optimal imaging using dynamic cost functions

NASA Astrophysics Data System (ADS)

Christie, Gordon; Chaudhry, Haseeb; Kochersberger, Kevin

2015-05-01

Unmanned aircraft development has accelerated with recent technological improvements in sensing and communications, which has resulted in an "applications lag" for how these aircraft can best be utilized. The aircraft are becoming smaller, more maneuverable and have longer endurance to perform sensing and sampling missions, but operating them aggressively to exploit these capabilities has not been a primary focus in unmanned systems development. This paper addresses a means of aerial vehicle path planning to provide a realistic optimal path in acquiring imagery for structure from motion (SfM) reconstructions and performing radiation surveys. This method will allow SfM reconstructions to occur accurately and with minimal flight time so that the reconstructions can be executed efficiently. An assumption is made that we have 3D point cloud data available prior to the flight. A discrete set of scan lines are proposed for the given area that are scored based on visibility of the scene. Our approach finds a time-efficient path and calculates trajectories between scan lines and over obstacles encountered along those scan lines. Aircraft dynamics are incorporated into the path planning algorithm as dynamic cost functions to create optimal imaging paths in minimum time. Simulations of the path planning algorithm are shown for an urban environment. We also present our approach for image-based terrain mapping, which is able to efficiently perform a 3D reconstruction of a large area without the use of GPS data.

Implications of path tolerance and path characteristics on critical vehicle manoeuvres

NASA Astrophysics Data System (ADS)

Lundahl, K.; Frisk, E.; Nielsen, L.

2017-12-01

Path planning and path following are core components in safe autonomous driving. Typically, a path planner provides a path with some tolerance on how tightly the path should be followed. Based on that, and other path characteristics, for example, sharpness of curves, a speed profile needs to be assigned so that the vehicle can stay within the given tolerance without going unnecessarily slow. Here, such trajectory planning is based on optimal control formulations where critical cases arise as on-the-limit solutions. The study focuses on heavy commercial vehicles, causing rollover to be of a major concern, due to the relatively high centre of gravity. Several results are obtained on required model complexity depending on path characteristics, for example, quantification of required path tolerance for a simple model to be sufficient, quantification of when yaw inertia needs to be considered in more detail, and how the curvature rate of change interplays with available friction. Overall, in situations where the vehicle is subject to a wide range of driving conditions, from good transport roads to more tricky avoidance manoeuvres, the requirements on the path following will vary. For this, the provided results form a basis for real-time path following.

Goal clarity and financial planning activities as determinants of retirement savings contributions.

PubMed

Stawski, Robert S; Hershey, Douglas A; Jacobs-Lawson, Joy M

2007-01-01

Retirement counselors, financial service professionals, and retirement intervention specialists routinely emphasize the importance of developing clear goals for the future; however, few empirical studies have focused on the benefits of retirement goal setting. In the present study, the extent to which goal clarity and financial planning activities predict retirement savings practices was examined among 100 working adults. Path analysis techniques were used to test two competing models, both of which were designed to predict savings contributions. Findings provide support for the model in which retirement goal clarity is a significant predictor of planning practices, and planning, in turn, predicts savings tendencies. Two demographic variables-income and age-were also revealed to be important elements of the model, with income accounting for roughly half of the explained variance in savings contributions. The results of this study have implications for the development of age-based models of planning, as well as implications for retirement counselors and financial planners who advise workers on long-term saving strategies.

Quadrilateral finite element mesh coarsening

DOEpatents

Staten, Matthew L; Dewey, Mark W; Benzley, Steven E

2012-10-16

Techniques for coarsening a quadrilateral mesh are described. These techniques include identifying a coarsening region within the quadrilateral mesh to be coarsened. Quadrilateral elements along a path through the coarsening region are removed. Node pairs along opposite sides of the path are identified. The node pairs along the path are then merged to collapse the path.

Application of particle swarm optimization in path planning of mobile robot

NASA Astrophysics Data System (ADS)

Wang, Yong; Cai, Feng; Wang, Ying

2017-08-01

In order to realize the optimal path planning of mobile robot in unknown environment, a particle swarm optimization algorithm based on path length as fitness function is proposed. The location of the global optimal particle is determined by the minimum fitness value, and the robot moves along the points of the optimal particles to the target position. The process of moving to the target point is done with MATLAB R2014a. Compared with the standard particle swarm optimization algorithm, the simulation results show that this method can effectively avoid all obstacles and get the optimal path.

Robot Path Planning in Uncertain Environments: A Language-Measure-Theoretic Approach

DTIC Science & Technology

2015-03-01

in the framework of probabilistic finite state automata (PFSA) and language measure from a control-theoretic perspective. The proposed concept has been...DOI: 10.1115/1.4027876] Keywords: path planning, language measure, probabilistic finite state automata 1 Motivation and Introduction In general

Enabling Autonomous Rover Science through Dynamic Planning and Scheduling

NASA Technical Reports Server (NTRS)

Estlin, Tara A.; Gaines, Daniel; Chouinard, Caroline; Fisher, Forest; Castano, Rebecca; Judd, Michele; Nesnas, Issa

2005-01-01

This paper describes how dynamic planning and scheduling techniques can be used onboard a rover to autonomously adjust rover activities in support of science goals. These goals could be identified by scientists on the ground or could be identified by onboard data-analysis software. Several different types of dynamic decisions are described, including the handling of opportunistic science goals identified during rover traverses, preserving high priority science targets when resources, such as power, are unexpectedly over-subscribed, and dynamically adding additional, ground-specified science targets when rover actions are executed more quickly than expected. After describing our specific system approach, we discuss some of the particular challenges we have examined to support autonomous rover decision-making. These include interaction with rover navigation and path-planning software and handling large amounts of uncertainty in state and resource estimations.

Task Assignment and Path Planning for Multiple Autonomous Underwater Vehicles Using 3D Dubins Curves †

PubMed Central

Zhang, Meiyan; Zheng, Yahong Rosa

2017-01-01

This paper investigates the task assignment and path planning problem for multiple AUVs in three dimensional (3D) underwater wireless sensor networks where nonholonomic motion constraints of underwater AUVs in 3D space are considered. The multi-target task assignment and path planning problem is modeled by the Multiple Traveling Sales Person (MTSP) problem and the Genetic Algorithm (GA) is used to solve the MTSP problem with Euclidean distance as the cost function and the Tour Hop Balance (THB) or Tour Length Balance (TLB) constraints as the stop criterion. The resulting tour sequences are mapped to 2D Dubins curves in the X−Y plane, and then interpolated linearly to obtain the Z coordinates. We demonstrate that the linear interpolation fails to achieve G1 continuity in the 3D Dubins path for multiple targets. Therefore, the interpolated 3D Dubins curves are checked against the AUV dynamics constraint and the ones satisfying the constraint are accepted to finalize the 3D Dubins curve selection. Simulation results demonstrate that the integration of the 3D Dubins curve with the MTSP model is successful and effective for solving the 3D target assignment and path planning problem. PMID:28696377

Task Assignment and Path Planning for Multiple Autonomous Underwater Vehicles Using 3D Dubins Curves †.

PubMed

Cai, Wenyu; Zhang, Meiyan; Zheng, Yahong Rosa

2017-07-11

This paper investigates the task assignment and path planning problem for multiple AUVs in three dimensional (3D) underwater wireless sensor networks where nonholonomic motion constraints of underwater AUVs in 3D space are considered. The multi-target task assignment and path planning problem is modeled by the Multiple Traveling Sales Person (MTSP) problem and the Genetic Algorithm (GA) is used to solve the MTSP problem with Euclidean distance as the cost function and the Tour Hop Balance (THB) or Tour Length Balance (TLB) constraints as the stop criterion. The resulting tour sequences are mapped to 2D Dubins curves in the X - Y plane, and then interpolated linearly to obtain the Z coordinates. We demonstrate that the linear interpolation fails to achieve G 1 continuity in the 3D Dubins path for multiple targets. Therefore, the interpolated 3D Dubins curves are checked against the AUV dynamics constraint and the ones satisfying the constraint are accepted to finalize the 3D Dubins curve selection. Simulation results demonstrate that the integration of the 3D Dubins curve with the MTSP model is successful and effective for solving the 3D target assignment and path planning problem.

Development of a new integrated local trajectory planning and tracking control framework for autonomous ground vehicles

NASA Astrophysics Data System (ADS)

Li, Xiaohui; Sun, Zhenping; Cao, Dongpu; Liu, Daxue; He, Hangen

2017-03-01

This study proposes a novel integrated local trajectory planning and tracking control (ILTPTC) framework for autonomous vehicles driving along a reference path with obstacles avoidance. For this ILTPTC framework, an efficient state-space sampling-based trajectory planning scheme is employed to smoothly follow the reference path. A model-based predictive path generation algorithm is applied to produce a set of smooth and kinematically-feasible paths connecting the initial state with the sampling terminal states. A velocity control law is then designed to assign a speed value at each of the points along the generated paths. An objective function considering both safety and comfort performance is carefully formulated for assessing the generated trajectories and selecting the optimal one. For accurately tracking the optimal trajectory while overcoming external disturbances and model uncertainties, a combined feedforward and feedback controller is developed. Both simulation analyses and vehicle testing are performed to verify the effectiveness of the proposed ILTPTC framework, and future research is also briefly discussed.

Distributed cooperating processes in a mobile robot control system

NASA Technical Reports Server (NTRS)

Skillman, Thomas L., Jr.

1988-01-01

A mobile inspection robot has been proposed for the NASA Space Station. It will be a free flying autonomous vehicle that will leave a berthing unit to accomplish a variety of inspection tasks around the Space Station, and then return to its berth to recharge, refuel, and transfer information. The Flying Eye robot will receive voice communication to change its attitude, move at a constant velocity, and move to a predefined location along a self generated path. This mobile robot control system requires integration of traditional command and control techniques with a number of AI technologies. Speech recognition, natural language understanding, task and path planning, sensory abstraction and pattern recognition are all required for successful implementation. The interface between the traditional numeric control techniques and the symbolic processing to the AI technologies must be developed, and a distributed computing approach will be needed to meet the real time computing requirements. To study the integration of the elements of this project, a novel mobile robot control architecture and simulation based on the blackboard architecture was developed. The control system operation and structure is discussed.

Automatic Operation For A Robot Lawn Mower

NASA Astrophysics Data System (ADS)

Huang, Y. Y.; Cao, Z. L.; Oh, S. J.; Kattan, E. U.; Hall, E. L.

1987-02-01

A domestic mobile robot, lawn mower, which performs the automatic operation mode, has been built up in the Center of Robotics Research, University of Cincinnati. The robot lawn mower automatically completes its work with the region filling operation, a new kind of path planning for mobile robots. Some strategies for region filling of path planning have been developed for a partly-known or a unknown environment. Also, an advanced omnidirectional navigation system and a multisensor-based control system are used in the automatic operation. Research on the robot lawn mower, especially on the region filling of path planning, is significant in industrial and agricultural applications.

Multi Robot Path Planning for Budgeted Active Perception with Self-Organising Maps

DTIC Science & Technology

2016-10-04

Multi- Robot Path Planning for Budgeted Active Perception with Self-Organising Maps Graeme Best1, Jan Faigl2 and Robert Fitch1 Abstract— We propose a...optimise paths for a multi- robot team that aims to maximally observe a set of nodes in the environment. The selected nodes are observed by visiting...regions, each node has an observation reward, and the robots are constrained by travel budgets. The SOM algorithm jointly selects and allocates nodes

A technique for breaking ice in the path of a ship

NASA Technical Reports Server (NTRS)

Saunders, A. R.; Hess, R. V.; Lucht, R. A. (Inventor)

1972-01-01

A technique is described for breaking ice in the path of a ship. A laser is placed on the bow of the ship with apparatus to scan the ice in the path of the ship with the laser beam. The beam cuts or shatters the ice, enabling the ship to break the ice in its path.

Robust Path Planning and Feedback Design Under Stochastic Uncertainty

NASA Technical Reports Server (NTRS)

Blackmore, Lars

2008-01-01

Autonomous vehicles require optimal path planning algorithms to achieve mission goals while avoiding obstacles and being robust to uncertainties. The uncertainties arise from exogenous disturbances, modeling errors, and sensor noise, which can be characterized via stochastic models. Previous work defined a notion of robustness in a stochastic setting by using the concept of chance constraints. This requires that mission constraint violation can occur with a probability less than a prescribed value.In this paper we describe a novel method for optimal chance constrained path planning with feedback design. The approach optimizes both the reference trajectory to be followed and the feedback controller used to reject uncertainty. Our method extends recent results in constrained control synthesis based on convex optimization to solve control problems with nonconvex constraints. This extension is essential for path planning problems, which inherently have nonconvex obstacle avoidance constraints. Unlike previous approaches to chance constrained path planning, the new approach optimizes the feedback gain as wellas the reference trajectory.The key idea is to couple a fast, nonconvex solver that does not take into account uncertainty, with existing robust approaches that apply only to convex feasible regions. By alternating between robust and nonrobust solutions, the new algorithm guarantees convergence to a global optimum. We apply the new method to an unmanned aircraft and show simulation results that demonstrate the efficacy of the approach.

2-Micron Triple-Pulse Integrated Path Differential Absorption Lidar Development for Simultaneous Airborne Column Measurements of Carbon Dioxide and Water Vapor in the Atmosphere

NASA Technical Reports Server (NTRS)

Singh, Upendra N.; Petros, Mulugeta; Refaat, Tamer F.; Yu, Jirong

2016-01-01

For more than 15 years, NASA Langley Research Center (LaRC) has contributed in developing several 2-micron carbon dioxide active remote sensors using the DIAL technique. Currently, an airborne 2-micron triple-pulse integrated path differential absorption (IPDA) lidar is under development at NASA LaRC. This paper focuses on the advancement of the 2-micron triple-pulse IPDA lidar development. Updates on the state-of-the-art triple-pulse laser transmitter will be presented including the status of wavelength control, packaging and lidar integration. In addition, receiver development updates will also be presented, including telescope integration, detection systems and data acquisition electronics. Future plan for IPDA lidar system for ground integration, testing and flight validation will be presented.

Path planning of decentralized multi-quadrotor based on fuzzy-cell decomposition algorithm

NASA Astrophysics Data System (ADS)

Iswanto, Wahyunggoro, Oyas; Cahyadi, Adha Imam

2017-04-01

The paper aims to present a design algorithm for multi quadrotor lanes in order to move towards the goal quickly and avoid obstacles in an area with obstacles. There are several problems in path planning including how to get to the goal position quickly and avoid static and dynamic obstacles. To overcome the problem, therefore, the paper presents fuzzy logic algorithm and fuzzy cell decomposition algorithm. Fuzzy logic algorithm is one of the artificial intelligence algorithms which can be applied to robot path planning that is able to detect static and dynamic obstacles. Cell decomposition algorithm is an algorithm of graph theory used to make a robot path map. By using the two algorithms the robot is able to get to the goal position and avoid obstacles but it takes a considerable time because they are able to find the shortest path. Therefore, this paper describes a modification of the algorithms by adding a potential field algorithm used to provide weight values on the map applied for each quadrotor by using decentralized controlled, so that the quadrotor is able to move to the goal position quickly by finding the shortest path. The simulations conducted have shown that multi-quadrotor can avoid various obstacles and find the shortest path by using the proposed algorithms.

Planning study for Merkel cell carcinoma based on the relapse pattern.

PubMed

Hoeller, Ulrike; Schubert, Tina; Mueller, Thomas; Budach, Volker; Ghadjar, Pirus; Brenner, Winfried; Kuschke, Wolf

2017-04-01

To develop a technique for radiation (RT) of in-transit path ways (IT) in Merkel cell carcinoma. In the planning study, IT were ink-marked on the skin during sentinel lymphscintigraphy and wire-marked in planning-CT. Pre- and post-operative planning-CTs were acquired. The clinical target volume (CTV) included tumor bed plus safety margin, IT and draining nodes, the planning volume (PTV) the CTV plus 0.5-1cm margin. VMAT plans with 2-3 arcs were analyzed. A planning study was performed for five pts. including two pts. with primary tumor (PT) in head and neck, 1 pt. each with PT of elbow, forearm and upper leg respectively. Plans showed satisfactory PTV coverage: D mean 100%±0%, D 98% 92.4%±2.24%, homogeneity index (HI) 0.095±0.01, conformation number (CN) 0.84±0.01 and conformality index (CI) 0.95±0.01. The planning study confirms feasibility of highly conformal irradiation of IT pathways based on individualized target delineation. Currently, patients referred for non-metastatic MCC are encouraged to enroll in a prospective clinical study that evaluates the feasibility of radiation of IT pathways. Copyright © 2017 Elsevier B.V. All rights reserved.

The intertwining paths of the density managment and riparian buffer study and the Northwest Forest Plan

Treesearch

Kenneth J. Ruzicka; Deanna H. Olson; Klaus J. Puettmann

2013-01-01

Initiated simultaneously, the Density Management and Riparian Buff er Study of western Oregon and the Northwest Forest Plan have had intertwining paths related to federal forest management and policy changes in the Pacifi c Northwest over the last 15 to 20 years. We briefl y discuss the development of the Northwest Forest Plan and how it changed the way forest policy...

The Integrated Curriculum of "Planned Approach to Healthier Schools"

ERIC Educational Resources Information Center

Lounsbery, Monica; Gast, Julie; Smith, Nicole

2005-01-01

Planned Approach to Healthier Schools (PATHS) is a multicomponent school program that aims to establish and sustain a social norm consistent with physical activity and healthy nutrition in the school community. The PATHS components include: (1) a professional development and wellness program for faculty and staff; (2) ongoing social-marketing…

32. ISOMETRIC VIEW OF PIPING PLAN, SHOWING PATH OF CONDUIT ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

32. ISOMETRIC VIEW OF PIPING PLAN, SHOWING PATH OF CONDUIT FROM CONTROL BUNKER TO SHIELDING TANK. F.C. TORKELSON DRAWING NUMBER 842-ARVFS-701-P-1. INEL INDEX CODE NUMBER: 075 0701 60 851 151977. - Idaho National Engineering Laboratory, Advanced Reentry Vehicle Fusing System, Scoville, Butte County, ID

Planning Flight Paths of Autonomous Aerobots

NASA Technical Reports Server (NTRS)

Kulczycki, Eric; Elfes, Alberto; Sharma, Shivanjli

2009-01-01

Algorithms for planning flight paths of autonomous aerobots (robotic blimps) to be deployed in scientific exploration of remote planets are undergoing development. These algorithms are also adaptable to terrestrial applications involving robotic submarines as well as aerobots and other autonomous aircraft used to acquire scientific data or to perform surveying or monitoring functions.

EPA Critical Path Science Plan Projects 19, 20 and 21: Human and Bovine Source Detection

EPA Science Inventory

The U.S. EPA Critical Path Science Plan Projects are: Project 19: develop novel bovine and human host-specific PCR assays and complete performance evaluation with other published methods. Project 20: Evaluate human-specific assays with water samples impacted with different lev...

Extended charge banking model of dual path shocks for implantable cardioverter defibrillators

PubMed Central

Dosdall, Derek J; Sweeney, James D

2008-01-01

Background Single path defibrillation shock methods have been improved through the use of the Charge Banking Model of defibrillation, which predicts the response of the heart to shocks as a simple resistor-capacitor (RC) circuit. While dual path defibrillation configurations have significantly reduced defibrillation thresholds, improvements to dual path defibrillation techniques have been limited to experimental observations without a practical model to aid in improving dual path defibrillation techniques. Methods The Charge Banking Model has been extended into a new Extended Charge Banking Model of defibrillation that represents small sections of the heart as separate RC circuits, uses a weighting factor based on published defibrillation shock field gradient measures, and implements a critical mass criteria to predict the relative efficacy of single and dual path defibrillation shocks. Results The new model reproduced the results from several published experimental protocols that demonstrated the relative efficacy of dual path defibrillation shocks. The model predicts that time between phases or pulses of dual path defibrillation shock configurations should be minimized to maximize shock efficacy. Discussion Through this approach the Extended Charge Banking Model predictions may be used to improve dual path and multi-pulse defibrillation techniques, which have been shown experimentally to lower defibrillation thresholds substantially. The new model may be a useful tool to help in further improving dual path and multiple pulse defibrillation techniques by predicting optimal pulse durations and shock timing parameters. PMID:18673561

Centralized Planning for Multiple Exploratory Robots

NASA Technical Reports Server (NTRS)

Estlin, Tara; Rabideau, Gregg; Chien, Steve; Barrett, Anthony

2005-01-01

A computer program automatically generates plans for a group of robotic vehicles (rovers) engaged in geological exploration of terrain. The program rapidly generates multiple command sequences that can be executed simultaneously by the rovers. Starting from a set of high-level goals, the program creates a sequence of commands for each rover while respecting hardware constraints and limitations on resources of each rover and of hardware (e.g., a radio communication terminal) shared by all the rovers. First, a separate model of each rover is loaded into a centralized planning subprogram. The centralized planning software uses the models of the rovers plus an iterative repair algorithm to resolve conflicts posed by demands for resources and by constraints associated with the all the rovers and the shared hardware. During repair, heuristics are used to make planning decisions that will result in solutions that will be better and will be found faster than would otherwise be possible. In particular, techniques from prior solutions of the multiple-traveling- salesmen problem are used as heuristics to generate plans in which the paths taken by the rovers to assigned scientific targets are shorter than they would otherwise be.

Current-Sensitive Path Planning for an Underactuated Free-Floating Ocean Sensorweb

NASA Technical Reports Server (NTRS)

Dahl, Kristen P.; Thompson, David R.; McLaren, David; Chao, Yi; Chien, Steve

2011-01-01

This work investigates multi-agent path planning in strong, dynamic currents using thousands of highly under-actuated vehicles. We address the specific task of path planning for a global network of ocean-observing floats. These submersibles are typified by the Argo global network consisting of over 3000 sensor platforms. They can control their buoyancy to float at depth for data collection or rise to the surface for satellite communications. Currently, floats drift at a constant depth regardless of the local currents. However, accurate current forecasts have become available which present the possibility of intentionally controlling floats' motion by dynamically commanding them to linger at different depths. This project explores the use of these current predictions to direct float networks to some desired final formation or position. It presents multiple algorithms for such path optimization and demonstrates their advantage over the standard approach of constant-depth drifting.

[Gender and career paths of female primary care physicians in Andalusia, Spain, at the beginning of 21st century].

PubMed

Saletti-Cuesta, Lorena; Delgado, Ana; Ortiz-Gómez, Teresa

2014-12-01

The purpose of this article was to study, from a feminist perspective, the diversity and homogeneity in the career paths of female primary care physicians from Andalusia, Spain in the early 21st century, by analyzing the meanings they give to their careers and the influence of personal, family and professional factors. We conducted a qualitative study with six discussion groups. Thirty-two female primary care physicians working in urban health centers of the public health system of Andalusia participated in the study. The discourse analysis revealed that most of the female physicians did not plan for professional goals and, when they did plan for them, the goals were intertwined with family needs. Consequently, their career paths were discontinuous. In contrast, career paths oriented towards professional development and the conscious planning of goals were more common among the female doctors acting as directors of health care centers.

Autonomous Robot Navigation in Human-Centered Environments Based on 3D Data Fusion

NASA Astrophysics Data System (ADS)

Steinhaus, Peter; Strand, Marcus; Dillmann, Rüdiger

2007-12-01

Efficient navigation of mobile platforms in dynamic human-centered environments is still an open research topic. We have already proposed an architecture (MEPHISTO) for a navigation system that is able to fulfill the main requirements of efficient navigation: fast and reliable sensor processing, extensive global world modeling, and distributed path planning. Our architecture uses a distributed system of sensor processing, world modeling, and path planning units. In this arcticle, we present implemented methods in the context of data fusion algorithms for 3D world modeling and real-time path planning. We also show results of the prototypic application of the system at the museum ZKM (center for art and media) in Karlsruhe.

Pseudo-random tool paths for CNC sub-aperture polishing and other applications.

PubMed

Dunn, Christina R; Walker, David D

2008-11-10

In this paper we first contrast classical and CNC polishing techniques in regard to the repetitiveness of the machine motions. We then present a pseudo-random tool path for use with CNC sub-aperture polishing techniques and report polishing results from equivalent random and raster tool-paths. The random tool-path used - the unicursal random tool-path - employs a random seed to generate a pattern which never crosses itself. Because of this property, this tool-path is directly compatible with dwell time maps for corrective polishing. The tool-path can be used to polish any continuous area of any boundary shape, including surfaces with interior perforations.

An Obstacle-Tolerant Path Planning Algorithm for Mobile-Anchor-Node-Assisted Localization

PubMed Central

Tsai, Rong-Guei

2018-01-01

The location information obtained using a sensor is a critical requirement in wireless sensor networks. Numerous localization schemes have been proposed, among which mobile-anchor-node-assisted localization (MANAL) can reduce costs and overcome environmental constraints. A mobile anchor node (MAN) provides its own location information to assist the localization of sensor nodes. Numerous path planning schemes have been proposed for MANAL, but most scenarios assume the absence of obstacles in the environment. However, in a realistic environment, sensor nodes cannot be located because the obstacles block the path traversed by the MAN, thereby rendering the sensor incapable of receiving sufficient three location information from the MAN. This study proposes the obstacle-tolerant path planning (OTPP) approach to solve the sensor location problem owing to obstacle blockage. OTPP can approximate the optimum beacon point number and path planning, thereby ensuring that all the unknown nodes can receive the three location information from the MAN and reduce the number of MAN broadcast packet times. Experimental results demonstrate that OTPP performs better than Z-curves because it reduces the total number of beacon points utilized and is thus more suitable in an obstacle-present environment. Compared to the Z-curve, OTPP can reduce localization error and improve localization coverage. PMID:29547582

The navigation system of the JPL robot

NASA Technical Reports Server (NTRS)

Thompson, A. M.

1977-01-01

The control structure of the JPL research robot and the operations of the navigation subsystem are discussed. The robot functions as a network of interacting concurrent processes distributed among several computers and coordinated by a central executive. The results of scene analysis are used to create a segmented terrain model in which surface regions are classified by traversibility. The model is used by a path planning algorithm, PATH, which uses tree search methods to find the optimal path to a goal. In PATH, the search space is defined dynamically as a consequence of node testing. Maze-solving and the use of an associative data base for context dependent node generation are also discussed. Execution of a planned path is accomplished by a feedback guidance process with automatic error recovery.

Interactive Learning Environment for Bio-Inspired Optimization Algorithms for UAV Path Planning

ERIC Educational Resources Information Center

Duan, Haibin; Li, Pei; Shi, Yuhui; Zhang, Xiangyin; Sun, Changhao

2015-01-01

This paper describes the development of BOLE, a MATLAB-based interactive learning environment, that facilitates the process of learning bio-inspired optimization algorithms, and that is dedicated exclusively to unmanned aerial vehicle path planning. As a complement to conventional teaching methods, BOLE is designed to help students consolidate the…

The force control and path planning of electromagnetic induction-based massage robot.

PubMed

Wang, Wendong; Zhang, Lei; Li, Jinzhe; Yuan, Xiaoqing; Shi, Yikai; Jiang, Qinqin; He, Lijing

2017-07-20

Massage robot is considered as an effective physiological treatment to relieve fatigue, improve blood circulation, relax muscle tone, etc. The simple massage equipment quickly spread into market due to low cost, but they are not widely accepted due to restricted massage function. Complicated structure and high cost caused difficulties for developing multi-function massage equipment. This paper presents a novel massage robot which can achieve tapping, rolling, kneading and other massage operations, and proposes an improved reciprocating path planning algorithm to improve massage effect. The number of coil turns, the coil current and the distance between massage head and yoke were chosen to investigate the influence on massage force by finite element method. The control system model of the wheeled massage robot was established, including control subsystem of the motor, path algorithm control subsystem, parameter module of the massage robot and virtual reality interface module. The improved reciprocating path planning algorithm was proposed to improve regional coverage rate and massage effect. The influence caused by coil current, the number of coil turns and the distance between massage head and yoke were simulated in Maxwell. It indicated that coil current has more important influence compared to the other two factors. The path planning simulation of the massage robot was completed in Matlab, and the results show that the improved reciprocating path planning algorithm achieved higher coverage rate than the traditional algorithm. With the analysis of simulation results, it can be concluded that the number of coil turns and the distance between the moving iron core and the yoke could be determined prior to coil current, and the force can be controllable by optimizing structure parameters of massage head and adjusting coil current. Meanwhile, it demonstrates that the proposed algorithm could effectively improve path coverage rate during massage operations, therefore the massage effect can be improved.

Benchmarking Gas Path Diagnostic Methods: A Public Approach

NASA Technical Reports Server (NTRS)

Simon, Donald L.; Bird, Jeff; Davison, Craig; Volponi, Al; Iverson, R. Eugene

2008-01-01

Recent technology reviews have identified the need for objective assessments of engine health management (EHM) technology. The need is two-fold: technology developers require relevant data and problems to design and validate new algorithms and techniques while engine system integrators and operators need practical tools to direct development and then evaluate the effectiveness of proposed solutions. This paper presents a publicly available gas path diagnostic benchmark problem that has been developed by the Propulsion and Power Systems Panel of The Technical Cooperation Program (TTCP) to help address these needs. The problem is coded in MATLAB (The MathWorks, Inc.) and coupled with a non-linear turbofan engine simulation to produce "snap-shot" measurements, with relevant noise levels, as if collected from a fleet of engines over their lifetime of use. Each engine within the fleet will experience unique operating and deterioration profiles, and may encounter randomly occurring relevant gas path faults including sensor, actuator and component faults. The challenge to the EHM community is to develop gas path diagnostic algorithms to reliably perform fault detection and isolation. An example solution to the benchmark problem is provided along with associated evaluation metrics. A plan is presented to disseminate this benchmark problem to the engine health management technical community and invite technology solutions.

Toward Shared Working Space of Human and Robotic Agents Through Dipole Flow Field for Dependable Path Planning.

PubMed

Trinh, Lan Anh; Ekström, Mikael; Cürüklü, Baran

2018-01-01

Recent industrial developments in autonomous systems, or agents, which assume that humans and the agents share the same space or even work in close proximity, open for new challenges in robotics, especially in motion planning and control. In these settings, the control system should be able to provide these agents a reliable path following control when they are working in a group or in collaboration with one or several humans in complex and dynamic environments. In such scenarios, these agents are not only moving to reach their goals, i.e., locations, they are also aware of the movements of other entities to find a collision-free path. Thus, this paper proposes a dependable, i.e., safe, reliable and effective, path planning algorithm for a group of agents that share their working space with humans. Firstly, the method employs the Theta * algorithm to initialize the paths from a starting point to a goal for a set of agents. As Theta * algorithm is computationally heavy, it only reruns when there is a significant change of the environment. To deal with the movements of the agents, a static flow field along the configured path is defined. This field is used by the agents to navigate and reach their goals even if the planned trajectories are changed. Secondly, a dipole field is calculated to avoid the collision of agents with other agents and human subjects. In this approach, each agent is assumed to be a source of a magnetic dipole field in which the magnetic moment is aligned with the moving direction of the agent. The magnetic dipole-dipole interactions between these agents generate repulsive forces to help them to avoid collision. The effectiveness of the proposed approach has been evaluated with extensive simulations. The results show that the static flow field is able to drive agents to the goals with a small number of requirements to update the path of agents. Meanwhile, the dipole flow field plays an important role to prevent collisions. The combination of these two fields results in a safe path planning algorithm, with a deterministic outcome, to navigate agents to their desired goals.

Scheduling of House Development Projects with CPM and PERT Method for Time Efficiency (Case Study: House Type 36)

NASA Astrophysics Data System (ADS)

Kholil, Muhammad; Nurul Alfa, Bonitasari; Hariadi, Madjumsyah

2018-04-01

Network planning is one of the management techniques used to plan and control the implementation of a project, which shows the relationship between activities. The objective of this research is to arrange network planning on house construction project on CV. XYZ and to know the role of network planning in increasing the efficiency of time so that can be obtained the optimal project completion period. This research uses descriptive method, where the data collected by direct observation to the company, interview, and literature study. The result of this research is optimal time planning in project work. Based on the results of the research, it can be concluded that the use of the both methods in scheduling of house construction project gives very significant effect on the completion time of the project. The company’s CPM (Critical Path Method) method can complete the project with 131 days, PERT (Program Evaluation Review and Technique) Method takes 136 days. Based on PERT calculation obtained Z = -0.66 or 0,2546 (from normal distribution table), and also obtained the value of probability or probability is 74,54%. This means that the possibility of house construction project activities can be completed on time is high enough. While without using both methods the project completion time takes 173 days. So using the CPM method, the company can save time up to 42 days and has time efficiency by using network planning.

Multi-Element Integrated Project Planning at Kennedy Space Center

NASA Technical Reports Server (NTRS)

Mullon, Robert

2008-01-01

This presentation demonstrates how the ASRC Scheduling team developed working practices to support multiple NASA and ASRC Project Managers using the enterprise capabilities of Primavera P6 and P6 Web Access. This work has proceeded as part of Kennedy Ground Systems' preparation for its transition from the Shuttle Program to the Constellation Program. The presenters will cover Primavera's enterprise-class capabilities for schedule development, integrated critical path analysis, and reporting, as well as advanced Primavera P6 Web Access tools and techniques for communicating project status.

A PLM-based automated inspection planning system for coordinate measuring machine

NASA Astrophysics Data System (ADS)

Zhao, Haibin; Wang, Junying; Wang, Boxiong; Wang, Jianmei; Chen, Huacheng

2006-11-01

With rapid progress of Product Lifecycle Management (PLM) in manufacturing industry, automatic generation of inspection planning of product and the integration with other activities in product lifecycle play important roles in quality control. But the techniques for these purposes are laggard comparing with techniques of CAD/CAM. Therefore, an automatic inspection planning system for Coordinate Measuring Machine (CMM) was developed to improve the automatization of measuring based on the integration of inspection system in PLM. Feature information representation is achieved based on a PLM canter database; measuring strategy is optimized through the integration of multi-sensors; reasonable number and distribution of inspection points are calculated and designed with the guidance of statistic theory and a synthesis distribution algorithm; a collision avoidance method is proposed to generate non-collision inspection path with high efficiency. Information mapping is performed between Neutral Interchange Files (NIFs), such as STEP, DML, DMIS, XML, etc., to realize information integration with other activities in the product lifecycle like design, manufacturing and inspection execution, etc. Simulation was carried out to demonstrate the feasibility of the proposed system. As a result, the inspection process is becoming simpler and good result can be got based on the integration in PLM.

Task path planning, scheduling and learning for free-ranging robot systems

NASA Technical Reports Server (NTRS)

Wakefield, G. Steve

1987-01-01

The development of robotics applications for space operations is often restricted by the limited movement available to guided robots. Free ranging robots can offer greater flexibility than physically guided robots in these applications. Presented here is an object oriented approach to path planning and task scheduling for free-ranging robots that allows the dynamic determination of paths based on the current environment. The system also provides task learning for repetitive jobs. This approach provides a basis for the design of free-ranging robot systems which are adaptable to various environments and tasks.

Path Planning Based on Ply Orientation Information for Automatic Fiber Placement on Mesh Surface

NASA Astrophysics Data System (ADS)

Pei, Jiazhi; Wang, Xiaoping; Pei, Jingyu; Yang, Yang

2018-03-01

This article introduces an investigation of path planning with ply orientation information for automatic fiber placement (AFP) on open-contoured mesh surface. The new method makes use of the ply orientation information generated by loading characteristics on surface, divides the surface into several zones according to the ply orientation information and then designs different fiber paths in different zones. This article also gives new idea of up-layer design in order to make up for defects between parts and improve product's strength.

Digital test assembly of truck parts with the IMMA-tool--an illustrative case.

PubMed

Hanson, L; Högberg, D; Söderholm, M

2012-01-01

Several digital human modelling (DHM) tools have been developed for simulation and visualisation of human postures and motions. In 2010 the DHM tool IMMA (Intelligently Moving Manikins) was introduced as a DHM tool that uses advanced path planning techniques to generate collision free and biomechanically acceptable motions for digital human models (as well as parts) in complex assembly situations. The aim of the paper is to illustrate how the IPS/IMMA tool is used at Scania CV AB in a digital test assembly process, and to compare the tool with other DHM tools on the market. The illustrated case of using the IMMA tool, here combined with the path planner tool IPS, indicates that the tool is promising. The major strengths of the tool are its user friendly interface, the motion generation algorithms, the batch simulation of manikins and the ergonomics assessment methods that consider time.

Robust mobility in human-populated environments

NASA Astrophysics Data System (ADS)

Gonzalez, Juan Pablo; Phillips, Mike; Neuman, Brad; Likhachev, Max

2012-06-01

Creating robots that can help humans in a variety of tasks requires robust mobility and the ability to safely navigate among moving obstacles. This paper presents an overview of recent research in the Robotics Collaborative Technology Alliance (RCTA) that addresses many of the core requirements for robust mobility in human-populated environments. Safe Interval Path Planning (SIPP) allows for very fast planning in dynamic environments when planning timeminimal trajectories. Generalized Safe Interval Path Planning extends this concept to trajectories that minimize arbitrary cost functions. Finally, generalized PPCP algorithm is used to generate plans that reason about the uncertainty in the predicted trajectories of moving obstacles and try to actively disambiguate the intentions of humans whenever necessary. We show how these approaches consider moving obstacles and temporal constraints and produce high-fidelity paths. Experiments in simulated environments show the performance of the algorithms under different controlled conditions, and experiments on physical mobile robots interacting with humans show how the algorithms perform under the uncertainties of the real world.

The flight planning - flight management connection

NASA Technical Reports Server (NTRS)

Sorensen, J. A.

1984-01-01

Airborne flight management systems are currently being implemented to minimize direct operating costs when flying over a fixed route between a given city pair. Inherent in the design of these systems is that the horizontal flight path and wind and temperature models be defined and input into the airborne computer before flight. The wind/temperature model and horizontal path are products of the flight planning process. Flight planning consists of generating 3-D reference trajectories through a forecast wind field subject to certain ATC and transport operator constraints. The interrelationships between flight management and flight planning are reviewed, and the steps taken during the flight planning process are summarized.

Path Planning Algorithms for the Adaptive Sensor Fleet

NASA Technical Reports Server (NTRS)

Stoneking, Eric; Hosler, Jeff

2005-01-01

The Adaptive Sensor Fleet (ASF) is a general purpose fleet management and planning system being developed by NASA in coordination with NOAA. The current mission of ASF is to provide the capability for autonomous cooperative survey and sampling of dynamic oceanographic phenomena such as current systems and algae blooms. Each ASF vessel is a software model that represents a real world platform that carries a variety of sensors. The OASIS platform will provide the first physical vessel, outfitted with the systems and payloads necessary to execute the oceanographic observations described in this paper. The ASF architecture is being designed for extensibility to accommodate heterogenous fleet elements, and is not limited to using the OASIS platform to acquire data. This paper describes the path planning algorithms developed for the acquisition phase of a typical ASF task. Given a polygonal target region to be surveyed, the region is subdivided according to the number of vessels in the fleet. The subdivision algorithm seeks a solution in which all subregions have equal area and minimum mean radius. Once the subregions are defined, a dynamic programming method is used to find a minimum-time path for each vessel from its initial position to its assigned region. This path plan includes the effects of water currents as well as avoidance of known obstacles. A fleet-level planning algorithm then shuffles the individual vessel assignments to find the overall solution which puts all vessels in their assigned regions in the minimum time. This shuffle algorithm may be described as a process of elimination on the sorted list of permutations of a cost matrix. All these path planning algorithms are facilitated by discretizing the region of interest onto a hexagonal tiling.

Avionic Architecture for Model Predictive Control Application in Mars Sample & Return Rendezvous Scenario

NASA Astrophysics Data System (ADS)

Saponara, M.; Tramutola, A.; Creten, P.; Hardy, J.; Philippe, C.

2013-08-01

Optimization-based control techniques such as Model Predictive Control (MPC) are considered extremely attractive for space rendezvous, proximity operations and capture applications that require high level of autonomy, optimal path planning and dynamic safety margins. Such control techniques require high-performance computational needs for solving large optimization problems. The development and implementation in a flight representative avionic architecture of a MPC based Guidance, Navigation and Control system has been investigated in the ESA R&T study “On-line Reconfiguration Control System and Avionics Architecture” (ORCSAT) of the Aurora programme. The paper presents the baseline HW and SW avionic architectures, and verification test results obtained with a customised RASTA spacecraft avionics development platform from Aeroflex Gaisler.

Redundant manipulator techniques for partially decentralized path planning and control of a platoon of autonomous vehicles.

PubMed

Stilwell, Daniel J; Bishop, Bradley E; Sylvester, Caleb A

2005-08-01

An approach to real-time trajectory generation for platoons of autonomous vehicles is developed from well-known control techniques for redundant robotic manipulators. The partially decentralized structure of this approach permits each vehicle to independently compute its trajectory in real-time using only locally generated information and low-bandwidth feedback generated by a system exogenous to the platoon. Our work is motivated by applications for which communications bandwidth is severely limited, such for platoons of autonomous underwater vehicles. The communication requirements for our trajectory generation approach are independent of the number of vehicles in the platoon, enabling platoons composed of a large number of vehicles to be coordinated despite limited communication bandwidth.

Bio-Inspired Genetic Algorithms with Formalized Crossover Operators for Robotic Applications.

PubMed

Zhang, Jie; Kang, Man; Li, Xiaojuan; Liu, Geng-Yang

2017-01-01

Genetic algorithms are widely adopted to solve optimization problems in robotic applications. In such safety-critical systems, it is vitally important to formally prove the correctness when genetic algorithms are applied. This paper focuses on formal modeling of crossover operations that are one of most important operations in genetic algorithms. Specially, we for the first time formalize crossover operations with higher-order logic based on HOL4 that is easy to be deployed with its user-friendly programing environment. With correctness-guaranteed formalized crossover operations, we can safely apply them in robotic applications. We implement our technique to solve a path planning problem using a genetic algorithm with our formalized crossover operations, and the results show the effectiveness of our technique.

The Effect of Tow Shearing on Reinforcement Positional Fidelity in the Manufacture of a Continuous Fiber Reinforced Thermoplastic Matrix Composite via Pultrusion-Like Processing of Commingled Feedstock

NASA Astrophysics Data System (ADS)

Warlick, Kent M.

While the addition of short fiber to 3D printed articles has increased structural performance, ultimate gains will only be realized through the introduction of continuous reinforcement placed along pre-planned load paths. Most additive manufacturing research focusing on the addition of continuous reinforcement has revolved around utilization of a prefrabricated composite filament or a fiber and matrix mixed within a hot end prior to deposition on a printing surface such that conventional extrusion based FDM can be applied. Although stronger 3D printed parts can be made in this manner, high quality homogenous composites are not possible due to fiber dominated regions, matrix dominated regions, and voids present between adjacent filaments. Conventional composite manufacturing processes are much better at creating homogeneous composites; however, the layer by layer approach in which they are made is inhibiting the alignment of reinforcement with loads. Automated Fiber Placement techniques utilize in plane bending deformation of the tow to facilitate tow steering. Due to buckling fibers on the inner radius of curves, manufacturers recommend a minimum curvature for path placement with this technique. A method called continuous tow shearing has shown promise to enable the placement of tows in complex patterns without tow buckling, spreading, and separation inherent in conventional forms of automated reinforcement positioning. The current work employs fused deposition modeling hardware and the continuous tow shearing technique to manufacture high quality fiber reinforced composites with high positional fidelity, varying continuous reinforcement orientations within a layer, and plastic elements incorporated enabling the ultimate gains in structural performance possible. A mechanical system combining concepts of additive manufacturing with fiber placement via filament winding was developed. Paths with and without tension inherent in filament winding were analyzed through microscopy in order to examine best and worst case scenarios. High quality fiber reinforced composite materials, in terms of low void content, high fiber volume fractions and homogeneity in microstructure, were manufactured in both of these scenarios. In order to improve fidelity and quality in fiber path transition regions, a forced air cooling manifold was designed, printed, and implemented into the current system. To better understand the composite performance that results from varying pertinent manufacturing parameters, the effect of feed rate, hot end temperature, forced air cooling, and deposition surface (polypropylene and previously deposited glass polypropylene commingled tow) on interply performance, microstructure, and positional fidelity were analyzed. Interply performance, in terms of average maximum load and average peel strength, was quantified through a t-peel test of the bonding quality between two surfaces. With use of forced air cooling, minor decreases in average peel strength were present due to a reduction in tow deposition temperature which was found to be the variable most indicative of performance. Average maximum load was comparable between the forced air cooled and non-air cooled samples. Microstructure was evaluated through characterization of composite area, void content, and flash percentage. Low void contents mostly between five to seven percent were attained. Further reduction of this void content to two percent is possible through higher processing temperatures; however, reduced composite area, low average peel strength performance, and the presence of smoke during manufacturing implied thermal degradation of the polypropylene matrix occurred in these samples with higher processing temperatures. Positional fidelity was measured through calculations of shear angle, shift width, and error of a predefined path. While positional fidelity variation was low with a polypropylene deposition surface, forced air cooling is necessary to achieve fidelity on top of an already deposited tow surface as evident by the fifty-six percent reduction in error tolerance profile achieved. Lastly, proof of concept articles with unique fiber paths and neat plastic elements incorporated were produced to demonstrate fiber placement along pre-planned load paths and the ability to achieve greater structural efficiency through the use of less material. The results show that high positional fidelity and high quality composites can be produced through the use of the tow shearing technique implemented in the developed mechanical system. The implementation of forced air cooling was critical in achieving fidelity and quality in transition regions. Alignment of continuous reinforcement with pre-planned load paths was demonstrated in the proof of concept article with varying fiber orientations within a layer. Combining fused deposition modeling of plastic with the placement of continuous reinforcement enabled a honeycomb composite to be produced with higher specific properties than traditional composites. Thus, the current system demonstrated a greater capability of achieving ultimate gains in structural performance than previously possible.

INNOVATIVE APPROACH FOR MEASURING AMMONIA AND METHANE FLUXES FROM A HOG FARM USING OPEN-PATH FOURIER TRANSFORM INFRARED SPECTROSCOPY

EPA Science Inventory

The paper describes a new approach to quantify emissions from area air pollution sources. The approach combines path-integrated concentration data acquired with any path-integrated optical remote sensing (PI-ORS) technique and computed tomography (CT) technique. In this study, an...

Column carbon dioxide and water vapor measurements by an airborne triple-pulse integrated path differential absorption lidar: novel lidar technologies and techniques with path to space

NASA Astrophysics Data System (ADS)

Singh, U. N.; Petros, M.; Refaat, T. F.; Yu, J.; Ismail, S.

2017-09-01

The 2-micron wavelength region is suitable for atmospheric carbon dioxide (CO2) measurements due to the existence of distinct absorption features for the gas at this wavelength region [1]. For more than 20 years, researchers at NASA Langley Research Center (LaRC) have developed several high-energy and high repetition rate 2-micron pulsed lasers [2]. Currently, LaRC team is engaged in designing, developing and demonstrating a triple-pulsed 2-micron direct detection Integrated Path Differential Absorption (IPDA) lidar to measure the weighted-average column dry-air mixing ratios of carbon dioxide (XCO2) and water vapor (XH2O) from an airborne platform [1, 3-5]. This novel technique allows measurement of the two most dominant greenhouse gases, simultaneously and independently, using a single instrument. This paper will provide status and details of the development of this airborne 2-micron triple-pulse IPDA lidar. The presented work will focus on the advancement of critical IPDA lidar components. Updates on the state-of-the-art triple-pulse laser transmitter will be presented including the status of seed laser locking, wavelength control, receiver and detector upgrades, laser packaging and lidar integration. Future plans for IPDA lidar ground integration, testing and flight validation will also be discussed. This work enables new Earth observation measurements, while reducing risk, cost, size, volume, mass and development time of required instruments.

Optimization of protocol design: a path to efficient, lower cost clinical trial execution

PubMed Central

Malikova, Marina A

2016-01-01

Managing clinical trials requires strategic planning and efficient execution. In order to achieve a timely delivery of important clinical trials’ outcomes, it is useful to establish standardized trial management guidelines and develop robust scoring methodology for evaluation of study protocol complexity. This review will explore the challenges clinical teams face in developing protocols to ensure that the right patients are enrolled and the right data are collected to demonstrate that a drug is safe and efficacious, while managing study costs and study complexity based on proposed comprehensive scoring model. Key factors to consider when developing protocols and techniques to minimize complexity will be discussed. A methodology to identify processes at planning phase, approaches to increase fiscal return and mitigate fiscal compliance risk for clinical trials will be addressed. PMID:28031939

Zero-Slack, Noncritical Paths

ERIC Educational Resources Information Center

Simons, Jacob V., Jr.

2017-01-01

The critical path method/program evaluation and review technique method of project scheduling is based on the importance of managing a project's critical path(s). Although a critical path is the longest path through a network, its location in large projects is facilitated by the computation of activity slack. However, logical fallacies in…

Sensors and Algorithms for an Unmanned Surf-Zone Robot

DTIC Science & Technology

2015-12-01

71 3. Data Fusion and Filtering................................................ 74 C. VIRTUAL POTENTIAL FIELD (VPF) PATH PLANNING ...iron effects are clearly seen: Soft iron de - calibration (sphere distortion) was caused by proximity of circuit boards. Offset of the center of the...information to perform global tasks such as path- planning , sensors and actuators commands, external communications, etc. Python3 is used as the primary

Real-time path planning and autonomous control for helicopter autorotation

NASA Astrophysics Data System (ADS)

Yomchinda, Thanan

Autorotation is a descending maneuver that can be used to recover helicopters in the event of total loss of engine power; however it is an extremely difficult and complex maneuver. The objective of this work is to develop a real-time system which provides full autonomous control for autorotation landing of helicopters. The work includes the development of an autorotation path planning method and integration of the path planner with a primary flight control system. The trajectory is divided into three parts: entry, descent and flare. Three different optimization algorithms are used to generate trajectories for each of these segments. The primary flight control is designed using a linear dynamic inversion control scheme, and a path following control law is developed to track the autorotation trajectories. Details of the path planning algorithm, trajectory following control law, and autonomous autorotation system implementation are presented. The integrated system is demonstrated in real-time high fidelity simulations. Results indicate feasibility of the capability of the algorithms to operate in real-time and of the integrated systems ability to provide safe autorotation landings. Preliminary simulations of autonomous autorotation on a small UAV are presented which will lead to a final hardware demonstration of the algorithms.

Integrated optimization of unmanned aerial vehicle task allocation and path planning under steady wind.

PubMed

Luo, He; Liang, Zhengzheng; Zhu, Moning; Hu, Xiaoxuan; Wang, Guoqiang

2018-01-01

Wind has a significant effect on the control of fixed-wing unmanned aerial vehicles (UAVs), resulting in changes in their ground speed and direction, which has an important influence on the results of integrated optimization of UAV task allocation and path planning. The objective of this integrated optimization problem changes from minimizing flight distance to minimizing flight time. In this study, the Euclidean distance between any two targets is expanded to the Dubins path length, considering the minimum turning radius of fixed-wing UAVs. According to the vector relationship between wind speed, UAV airspeed, and UAV ground speed, a method is proposed to calculate the flight time of UAV between targets. On this basis, a variable-speed Dubins path vehicle routing problem (VS-DP-VRP) model is established with the purpose of minimizing the time required for UAVs to visit all the targets and return to the starting point. By designing a crossover operator and mutation operator, the genetic algorithm is used to solve the model, the results of which show that an effective UAV task allocation and path planning solution under steady wind can be provided.

Integrated optimization of unmanned aerial vehicle task allocation and path planning under steady wind

PubMed Central

Liang, Zhengzheng; Zhu, Moning; Hu, Xiaoxuan; Wang, Guoqiang

2018-01-01

Wind has a significant effect on the control of fixed-wing unmanned aerial vehicles (UAVs), resulting in changes in their ground speed and direction, which has an important influence on the results of integrated optimization of UAV task allocation and path planning. The objective of this integrated optimization problem changes from minimizing flight distance to minimizing flight time. In this study, the Euclidean distance between any two targets is expanded to the Dubins path length, considering the minimum turning radius of fixed-wing UAVs. According to the vector relationship between wind speed, UAV airspeed, and UAV ground speed, a method is proposed to calculate the flight time of UAV between targets. On this basis, a variable-speed Dubins path vehicle routing problem (VS-DP-VRP) model is established with the purpose of minimizing the time required for UAVs to visit all the targets and return to the starting point. By designing a crossover operator and mutation operator, the genetic algorithm is used to solve the model, the results of which show that an effective UAV task allocation and path planning solution under steady wind can be provided. PMID:29561888

Image-based path planning for automated virtual colonoscopy navigation

NASA Astrophysics Data System (ADS)

Hong, Wei

2008-03-01

Virtual colonoscopy (VC) is a noninvasive method for colonic polyp screening, by reconstructing three-dimensional models of the colon using computerized tomography (CT). In virtual colonoscopy fly-through navigation, it is crucial to generate an optimal camera path for efficient clinical examination. In conventional methods, the centerline of the colon lumen is usually used as the camera path. In order to extract colon centerline, some time consuming pre-processing algorithms must be performed before the fly-through navigation, such as colon segmentation, distance transformation, or topological thinning. In this paper, we present an efficient image-based path planning algorithm for automated virtual colonoscopy fly-through navigation without the requirement of any pre-processing. Our algorithm only needs the physician to provide a seed point as the starting camera position using 2D axial CT images. A wide angle fisheye camera model is used to generate a depth image from the current camera position. Two types of navigational landmarks, safe regions and target regions are extracted from the depth images. Camera position and its corresponding view direction are then determined using these landmarks. The experimental results show that the generated paths are accurate and increase the user comfort during the fly-through navigation. Moreover, because of the efficiency of our path planning algorithm and rendering algorithm, our VC fly-through navigation system can still guarantee 30 FPS.

A Comparison of Two Path Planners for Planetary Rovers

NASA Technical Reports Server (NTRS)

Tarokh, M.; Shiller, Z.; Hayati, S.

1999-01-01

The paper presents two path planners suitable for planetary rovers. The first is based on fuzzy description of the terrain, and genetic algorithm to find a traversable path in a rugged terrain. The second planner uses a global optimization method with a cost function that is the path distance divided by the velocity limit obtained from the consideration of the rover static and dynamic stability. A description of both methods is provided, and the results of paths produced are given which show the effectiveness of the path planners in finding near optimal paths. The features of the methods and their suitability and application for rover path planning are compared

Defining Advancement Career Paths and Succession Plans: Critical Human Capital Retention Strategies for High-Performing Advancement Divisions

ERIC Educational Resources Information Center

Croteau, Jon Derek; Wolk, Holly Gordon

2010-01-01

There are many factors that can influence whether a highly talented staff member will build a career within an institution or use it as a stepping stone. This article defines and explores the notions of developing career paths and succession planning and why they are critical human capital investment strategies in retaining the highest performers…

Using borehole flow data to characterize the hydraulics of flow paths in operating wellfields

USGS Publications Warehouse

Paillet, F.; Lundy, J.

2004-01-01

Understanding the flow paths in the vicinity of water well intakes is critical in the design of effective wellhead protection strategies for heterogeneous carbonate aquifers. High-resolution flow logs can be combined with geophysical logs and borehole-wall-image logs (acoustic televiewer) to identify the porous beds, solution openings, and fractures serving as conduits connecting the well bore to the aquifer. Qualitative methods of flow log analysis estimate the relative transmissivity of each water-producing zone, but do not indicate how those zones are connected to the far-field aquifer. Borehole flow modeling techniques can be used to provide quantitative estimates of both transmissivity and far-field hydraulic head in each producing zone. These data can be used to infer how the individual zones are connected with each other, and to the surrounding large-scale aquifer. Such information is useful in land-use planning and the design of well intakes to prevent entrainment of contaminants into water-supply systems. Specific examples of flow log applications in the identification of flow paths in operating wellfields are given for sites in Austin and Faribault, Minnesota. Copyright ASCE 2004.

Path planning and energy management of solar-powered unmanned ground vehicles

NASA Astrophysics Data System (ADS)

Kaplan, Adam

Many of the applications pertinent to unmanned vehicles, such as environmental research and analysis, communications, and information-surveillance and reconnaissance, benefit from prolonged vehicle operation time. Conventional efforts to increase the operational time of electric-powered unmanned vehicles have traditionally focused on the design of energy-efficient components and the identification of energy efficient search patterns, while little attention has been paid to the vehicle's mission-level path plan and power management. This thesis explores the formulation and generation of integrated motion-plans and power-schedules for solar-panel equipped mobile robots operating under strict energy constraints, which cannot be effectively addressed through conventional motion planning algorithms. Transit problems are considered to design time-optimal paths using both Balkcom-Mason and Pseudo-Dubins curves. Additionally, a more complicated problem to generate mission plans for vehicles which must persistently travel between certain locations, similar to the traveling salesperson problem (TSP), is presented. A comparison between one of the common motion-planning algorithms and experimental results of the prescribed algorithms, made possible by use of a test environment and mobile robot designed and developed specifically for this research, are presented and discussed.

Using GIS and Google Earth for the creation of the Going-to-the-Sun Road Avalanche Atlas, Glacier National Park, Montana, USA

USGS Publications Warehouse

Peitzsch, Erich H.; Fagre, Daniel B.; Dundas, Mark

2010-01-01

Snow avalanche paths are key geomorphologic features in Glacier National Park, Montana, and an important component of mountain ecosystems: they are isolated within a larger ecosystem, they are continuously disturbed, and they contain unique physical characteristics (Malanson and Butler, 1984). Avalanches impact subalpine forest structure and function, as well as overall biodiversity (Bebi et al., 2009). Because avalanches are dynamic phenomena, avalanche path geometry and spatial extent depend upon climatic regimes. The USGS/GNP Avalanche Program formally began in 2003 as an avalanche forecasting program for the spring opening of the ever-popular Going-to-the-Sun Road (GTSR), which crosses through 37 identified avalanche paths. Avalanche safety and forecasting is a necessary part of the GTSR spring opening procedures. An avalanche atlas detailing topographic parameters and oblique photographs was completed for the GTSR corridor in response to a request from GNP personnel for planning and resource management. Using ArcMap 9.2 GIS software, polygons were created for every avalanche path affecting the GTSR using aerial imagery, field-based observations, and GPS measurements of sub-meter accuracy. Spatial attributes for each path were derived within the GIS. Resulting products include an avalanche atlas book for operational use, a geoPDF of the atlas, and a Google Earth flyover illustrating each path and associated photographs. The avalanche atlas aids park management in worker safety, infrastructure planning, and natural resource protection by identifying avalanche path patterns and location. The atlas was created for operational and planning purposes and is also used as a foundation for research such as avalanche ecology projects and avalanche path runout modeling.

Elucidating the ensemble of functionally-relevant transitions in protein systems with a robotics-inspired method.

PubMed

Molloy, Kevin; Shehu, Amarda

2013-01-01

Many proteins tune their biological function by transitioning between different functional states, effectively acting as dynamic molecular machines. Detailed structural characterization of transition trajectories is central to understanding the relationship between protein dynamics and function. Computational approaches that build on the Molecular Dynamics framework are in principle able to model transition trajectories at great detail but also at considerable computational cost. Methods that delay consideration of dynamics and focus instead on elucidating energetically-credible conformational paths connecting two functionally-relevant structures provide a complementary approach. Effective sampling-based path planning methods originating in robotics have been recently proposed to produce conformational paths. These methods largely model short peptides or address large proteins by simplifying conformational space. We propose a robotics-inspired method that connects two given structures of a protein by sampling conformational paths. The method focuses on small- to medium-size proteins, efficiently modeling structural deformations through the use of the molecular fragment replacement technique. In particular, the method grows a tree in conformational space rooted at the start structure, steering the tree to a goal region defined around the goal structure. We investigate various bias schemes over a progress coordinate for balance between coverage of conformational space and progress towards the goal. A geometric projection layer promotes path diversity. A reactive temperature scheme allows sampling of rare paths that cross energy barriers. Experiments are conducted on small- to medium-size proteins of length up to 214 amino acids and with multiple known functionally-relevant states, some of which are more than 13Å apart of each-other. Analysis reveals that the method effectively obtains conformational paths connecting structural states that are significantly different. A detailed analysis on the depth and breadth of the tree suggests that a soft global bias over the progress coordinate enhances sampling and results in higher path diversity. The explicit geometric projection layer that biases the exploration away from over-sampled regions further increases coverage, often improving proximity to the goal by forcing the exploration to find new paths. The reactive temperature scheme is shown effective in increasing path diversity, particularly in difficult structural transitions with known high-energy barriers.

Lunar Contour Crafting: A Novel Technique for ISRU-Based Habitat Development

NASA Technical Reports Server (NTRS)

Khoshnevis, Behrokh; Bodiford, Melanie P.; Burks, Kevin H.; Ethridge, Ed; Tucker, Dennis; Kim, Won; Toutanji, Houssam; Fiske, Michael R.

2005-01-01

1. Habitat Structures at MSFC is one element of the In-Situ Fabrication and Repair (ISFR) Program: ISFR develops technologies for fabrication, repair and recycling of tools, parts, and habitats/structures using in-situ resources. ISRU - based habitat structures are considered Class III. 2. Habitat Structure Purpose: Develop Lunar and/or Martian habitat structures for manned missions that maximize the use of in-situ resources to address the following agency topics: bioastronautics critical path roadmap; strategic technical challenges defined in H&RT formulation plan: margins and redundancy; modularity, robotic network, space resource utilization; autonomy, affordable logistics pre-positioning.

In-hospital cost comparison between the standard lateral and supercapsular percutaneously-assisted total hip surgical techniques for total hip replacement.

PubMed

Gofton, Wade; Fitch, David A

2016-03-01

The purpose of this study was to compare the in-hospital costs associated with the tissue-sparing supercapsular percutaneously-assisted total hip (SuperPath) and traditional Lateral surgical techniques for total hip replacement (THR). Between April 2013 and January 2014, in-hospital costs were reviewed for all THRs performed using the SuperPath technique by a single surgeon and all THRs performed using the Lateral technique by another surgeon at the same institution. Overall, costs were 28.4% higher in the Lateral group. This was largely attributable to increased costs associated with transfusion (+92.5%), patient rooms (+60.4%), patient food (+62.8%), narcotics (+42.5%), physical therapy (+52.5%), occupational therapy (+88.6%), and social work (+92.9%). The only costs noticeably increased for SuperPath were for imaging (+105.9%), and this was because the SuperPath surgeon performed intraoperative radiographs on all patients while the Lateral surgeon did not. The use of the SuperPath technique resulted in in-hospital cost reductions of over 28%, suggesting that this tissue-sparing surgical technique can be cost-effective primarily by facilitating early mobilisation and patient discharge even during a surgeon's initial experience with the approach.

Soft computing-based terrain visual sensing and data fusion for unmanned ground robotic systems

NASA Astrophysics Data System (ADS)

Shirkhodaie, Amir

2006-05-01

In this paper, we have primarily discussed technical challenges and navigational skill requirements of mobile robots for traversability path planning in natural terrain environments similar to Mars surface terrains. We have described different methods for detection of salient terrain features based on imaging texture analysis techniques. We have also presented three competing techniques for terrain traversability assessment of mobile robots navigating in unstructured natural terrain environments. These three techniques include: a rule-based terrain classifier, a neural network-based terrain classifier, and a fuzzy-logic terrain classifier. Each proposed terrain classifier divides a region of natural terrain into finite sub-terrain regions and classifies terrain condition exclusively within each sub-terrain region based on terrain visual clues. The Kalman Filtering technique is applied for aggregative fusion of sub-terrain assessment results. The last two terrain classifiers are shown to have remarkable capability for terrain traversability assessment of natural terrains. We have conducted a comparative performance evaluation of all three terrain classifiers and presented the results in this paper.

Intensity Modulated Radiation Therapy Dose Painting for Localized Prostate Cancer Using {sup 11}C-choline Positron Emission Tomography Scans

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chang, Joe H.; University of Melbourne, Victoria; Lim Joon, Daryl

Purpose: To demonstrate the technical feasibility of intensity modulated radiation therapy (IMRT) dose painting using {sup 11}C-choline positron emission tomography PET scans in patients with localized prostate cancer. Methods and Materials: This was an RT planning study of 8 patients with prostate cancer who had {sup 11}C-choline PET scans prior to radical prostatectomy. Two contours were semiautomatically generated on the basis of the PET scans for each patient: 60% and 70% of the maximum standardized uptake values (SUV{sub 60%} and SUV{sub 70%}). Three IMRT plans were generated for each patient: PLAN{sub 78}, which consisted of whole-prostate radiation therapy to 78more » Gy; PLAN{sub 78-90}, which consisted of whole-prostate RT to 78 Gy, a boost to the SUV{sub 60%} to 84 Gy, and a further boost to the SUV{sub 70%} to 90 Gy; and PLAN{sub 72-90}, which consisted of whole-prostate RT to 72 Gy, a boost to the SUV{sub 60%} to 84 Gy, and a further boost to the SUV{sub 70%} to 90 Gy. The feasibility of these plans was judged by their ability to reach prescription doses while adhering to published dose constraints. Tumor control probabilities based on PET scan-defined volumes (TCP{sub PET}) and on prostatectomy-defined volumes (TCP{sub path}), and rectal normal tissue complication probabilities (NTCP) were compared between the plans. Results: All plans for all patients reached prescription doses while adhering to dose constraints. TCP{sub PET} values for PLAN{sub 78}, PLAN{sub 78-90}, and PLAN{sub 72-90} were 65%, 97%, and 96%, respectively. TCP{sub path} values were 71%, 97%, and 89%, respectively. Both PLAN{sub 78-90} and PLAN{sub 72-90} had significantly higher TCP{sub PET} (P=.002 and .001) and TCP{sub path} (P<.001 and .014) values than PLAN{sub 78}. PLAN{sub 78-90} and PLAN{sub 72-90} were not significantly different in terms of TCP{sub PET} or TCP{sub path}. There were no significant differences in rectal NTCPs between the 3 plans. Conclusions: IMRT dose painting for localized prostate cancer using {sup 11}C-choline PET scans is technically feasible. Dose painting results in higher TCPs without higher NTCPs.« less

The application of Markov decision process with penalty function in restaurant delivery robot

NASA Astrophysics Data System (ADS)

Wang, Yong; Hu, Zhen; Wang, Ying

2017-05-01

As the restaurant delivery robot is often in a dynamic and complex environment, including the chairs inadvertently moved to the channel and customers coming and going. The traditional Markov decision process path planning algorithm is not save, the robot is very close to the table and chairs. To solve this problem, this paper proposes the Markov Decision Process with a penalty term called MDPPT path planning algorithm according to the traditional Markov decision process (MDP). For MDP, if the restaurant delivery robot bumps into an obstacle, the reward it receives is part of the current status reward. For the MDPPT, the reward it receives not only the part of the current status but also a negative constant term. Simulation results show that the MDPPT algorithm can plan a more secure path.

Fuzzy Logic Path Planning System for Collision Avoidance by an Autonomous Rover Vehicle

NASA Technical Reports Server (NTRS)

Murphy, Michael G.

1991-01-01

Systems already developed at JSC have shown the benefits of applying fuzzy logic control theory to space related operations. Four major issues are addressed that are associated with developing an autonomous collision avoidance subsystem within a path planning system designed for application in a remote, hostile environment that does not lend itself well to remote manipulation of the vehicle involved through Earth-based telecommunication. A good focus for this is unmanned exploration of the surface of Mars. The uncertainties involved indicate that robust approaches such as fuzzy logic control are particularly appropriate. The four major issues addressed are: (1) avoidance of a single fuzzy moving obstacle; (2) back off from a dead end in a static obstacle environment; (3) fusion of sensor data to detect obstacles; and (4) options for adaptive learning in a path planning system.

An improved artificial bee colony algorithm based on balance-evolution strategy for unmanned combat aerial vehicle path planning.

PubMed

Li, Bai; Gong, Li-gang; Yang, Wen-lun

2014-01-01

Unmanned combat aerial vehicles (UCAVs) have been of great interest to military organizations throughout the world due to their outstanding capabilities to operate in dangerous or hazardous environments. UCAV path planning aims to obtain an optimal flight route with the threats and constraints in the combat field well considered. In this work, a novel artificial bee colony (ABC) algorithm improved by a balance-evolution strategy (BES) is applied in this optimization scheme. In this new algorithm, convergence information during the iteration is fully utilized to manipulate the exploration/exploitation accuracy and to pursue a balance between local exploitation and global exploration capabilities. Simulation results confirm that BE-ABC algorithm is more competent for the UCAV path planning scheme than the conventional ABC algorithm and two other state-of-the-art modified ABC algorithms.

Multidimensional scaling for evolutionary algorithms--visualization of the path through search space and solution space using Sammon mapping.

PubMed

Pohlheim, Hartmut

2006-01-01

Multidimensional scaling as a technique for the presentation of high-dimensional data with standard visualization techniques is presented. The technique used is often known as Sammon mapping. We explain the mathematical foundations of multidimensional scaling and its robust calculation. We also demonstrate the use of this technique in the area of evolutionary algorithms. First, we present the visualization of the path through the search space of the best individuals during an optimization run. We then apply multidimensional scaling to the comparison of multiple runs regarding the variables of individuals and multi-criteria objective values (path through the solution space).

Kinematic state estimation and motion planning for stochastic nonholonomic systems using the exponential map.

PubMed

Park, Wooram; Liu, Yan; Zhou, Yu; Moses, Matthew; Chirikjian, Gregory S

2008-04-11

A nonholonomic system subjected to external noise from the environment, or internal noise in its own actuators, will evolve in a stochastic manner described by an ensemble of trajectories. This ensemble of trajectories is equivalent to the solution of a Fokker-Planck equation that typically evolves on a Lie group. If the most likely state of such a system is to be estimated, and plans for subsequent motions from the current state are to be made so as to move the system to a desired state with high probability, then modeling how the probability density of the system evolves is critical. Methods for solving Fokker-Planck equations that evolve on Lie groups then become important. Such equations can be solved using the operational properties of group Fourier transforms in which irreducible unitary representation (IUR) matrices play a critical role. Therefore, we develop a simple approach for the numerical approximation of all the IUR matrices for two of the groups of most interest in robotics: the rotation group in three-dimensional space, SO(3), and the Euclidean motion group of the plane, SE(2). This approach uses the exponential mapping from the Lie algebras of these groups, and takes advantage of the sparse nature of the Lie algebra representation matrices. Other techniques for density estimation on groups are also explored. The computed densities are applied in the context of probabilistic path planning for kinematic cart in the plane and flexible needle steering in three-dimensional space. In these examples the injection of artificial noise into the computational models (rather than noise in the actual physical systems) serves as a tool to search the configuration spaces and plan paths. Finally, we illustrate how density estimation problems arise in the characterization of physical noise in orientational sensors such as gyroscopes.

A portable back massage robot based on Traditional Chinese Medicine.

PubMed

Wang, Wendong; Liang, Chaohong; Zhang, Peng; Shi, Yikai

2018-05-30

A portable back massage robot which can complete the massage operations such as tapping, kneading and rolling was designed to improve the level of intelligence and massage effect. An efficient full covered path planning algorithm was put forward for a portable back massage robot to improve the coverage. Currently, massage robots has become one of important research focuses with the increasing requirements for healthcare. The massage robot is difficult to be widely accepted as there are problems of massage robot in control, structure, and coverage path planning. The 3D electromagnetic simulation model was established to optimize electromagnetic force. By analyzing the Traditional Chinese Medicine massage operation and the demands, the path planning algorithm models were established. The experimental platform of the massage robot was built. The simulation results show presented path planning algorithm is suitable for back massage, which ensures that the massage robot traverse the entire back area with improved massage coverage. The tested results show that the massage effect is best when the duty cycle is in the range of 1/8 to 1/2, and the massage force increases with the increase of the input voltage. The massage robot eventually achieved the desired massage effect, and the proposed efficient algorithm can effectively improve the coverage and promote the massage effect.

A global approach to kinematic path planning to robots with holonomic and nonholonomic constraints

NASA Technical Reports Server (NTRS)

Divelbiss, Adam; Seereeram, Sanjeev; Wen, John T.

1993-01-01

Robots in applications may be subject to holonomic or nonholonomic constraints. Examples of holonomic constraints include a manipulator constrained through the contact with the environment, e.g., inserting a part, turning a crank, etc., and multiple manipulators constrained through a common payload. Examples of nonholonomic constraints include no-slip constraints on mobile robot wheels, local normal rotation constraints for soft finger and rolling contacts in grasping, and conservation of angular momentum of in-orbit space robots. The above examples all involve equality constraints; in applications, there are usually additional inequality constraints such as robot joint limits, self collision and environment collision avoidance constraints, steering angle constraints in mobile robots, etc. The problem of finding a kinematically feasible path that satisfies a given set of holonomic and nonholonomic constraints, of both equality and inequality types is addressed. The path planning problem is first posed as a finite time nonlinear control problem. This problem is subsequently transformed to a static root finding problem in an augmented space which can then be iteratively solved. The algorithm has shown promising results in planning feasible paths for redundant arms satisfying Cartesian path following and goal endpoint specifications, and mobile vehicles with multiple trailers. In contrast to local approaches, this algorithm is less prone to problems such as singularities and local minima.

Processor Would Find Best Paths On Map

NASA Technical Reports Server (NTRS)

Eberhardt, Silvio P.

1990-01-01

Proposed very-large-scale integrated (VLSI) circuit image-data processor finds path of least cost from specified origin to any destination on map. Cost of traversal assigned to each picture element of map. Path of least cost from originating picture element to every other picture element computed as path that preserves as much as possible of signal transmitted by originating picture element. Dedicated microprocessor at each picture element stores cost of traversal and performs its share of computations of paths of least cost. Least-cost-path problem occurs in research, military maneuvers, and in planning routes of vehicles.

Symbiotic Navigation in Multi-Robot Systems with Remote Obstacle Knowledge Sharing

PubMed Central

Ravankar, Abhijeet; Ravankar, Ankit A.; Kobayashi, Yukinori; Emaru, Takanori

2017-01-01

Large scale operational areas often require multiple service robots for coverage and task parallelism. In such scenarios, each robot keeps its individual map of the environment and serves specific areas of the map at different times. We propose a knowledge sharing mechanism for multiple robots in which one robot can inform other robots about the changes in map, like path blockage, or new static obstacles, encountered at specific areas of the map. This symbiotic information sharing allows the robots to update remote areas of the map without having to explicitly navigate those areas, and plan efficient paths. A node representation of paths is presented for seamless sharing of blocked path information. The transience of obstacles is modeled to track obstacles which might have been removed. A lazy information update scheme is presented in which only relevant information affecting the current task is updated for efficiency. The advantages of the proposed method for path planning are discussed against traditional method with experimental results in both simulation and real environments. PMID:28678193

Using 40Ar/39Ar and Lu-Hf isotopic dates to further understand the deformational history of an ancient subduction zone in Alaska

NASA Astrophysics Data System (ADS)

Wildgoose, M.; Roeske, S.; Vervoort, J. D.

2011-12-01

Although muscovite is widely accepted as a reliable geochronometer, 40Ar/39Ar dates of K-white mica from blueschist facies rocks have proven difficult to interpret because of chemically mixed populations. We plan to use the in-situ 40Ar/39Ar UV laser ablation technique to address whether single crystals of chemically heterogeneous K-white mica can provide reliable ages of metamorphic events. This in-situ method allows for more detailed study of K-white mica than bulk separates, as individual crystals can be analyzed on a microstructural basis. Zoned K-white mica commonly occurs in blueschist rocks, but can be difficult to link to a P-T-t path as both isothermal decompression and isobaric heating could result in the formation of phengite cores and muscovite rims. Garnet-glaucophane-phengite-epidote blueschists from the Ruby Terrane, west-central Alaska, have zoned amphibole and K-white mica, with the latter containing phengite cores with more muscovitic rims. In-situ 40Ar/39Ar UV laser ablation of single K-white mica crystals from this area, in conjunction with Lu/Hf dating of co-occurring garnets, will allow a delineation of P-T paths by comparing garnet ages, which record the highest temperature on a P-T path, to the ages of the K-white mica cores and rims. Results will be presented at the meeting in December. Results from these dating techniques will be presented at the meeting in December.

A Survey on Ambient Intelligence in Health Care

PubMed Central

Acampora, Giovanni; Cook, Diane J.; Rashidi, Parisa; Vasilakos, Athanasios V.

2013-01-01

Ambient Intelligence (AmI) is a new paradigm in information technology aimed at empowering people’s capabilities by the means of digital environments that are sensitive, adaptive, and responsive to human needs, habits, gestures, and emotions. This futuristic vision of daily environment will enable innovative human-machine interactions characterized by pervasive, unobtrusive and anticipatory communications. Such innovative interaction paradigms make ambient intelligence technology a suitable candidate for developing various real life solutions, including in the health care domain. This survey will discuss the emergence of ambient intelligence (AmI) techniques in the health care domain, in order to provide the research community with the necessary background. We will examine the infrastructure and technology required for achieving the vision of ambient intelligence, such as smart environments and wearable medical devices. We will summarize of the state of the art artificial intelligence methodologies used for developing AmI system in the health care domain, including various learning techniques (for learning from user interaction), reasoning techniques (for reasoning about users’ goals and intensions) and planning techniques (for planning activities and interactions). We will also discuss how AmI technology might support people affected by various physical or mental disabilities or chronic disease. Finally, we will point to some of the successful case studies in the area and we will look at the current and future challenges to draw upon the possible future research paths. PMID:24431472

A Survey on Ambient Intelligence in Health Care.

PubMed

Acampora, Giovanni; Cook, Diane J; Rashidi, Parisa; Vasilakos, Athanasios V

2013-12-01

Ambient Intelligence (AmI) is a new paradigm in information technology aimed at empowering people's capabilities by the means of digital environments that are sensitive, adaptive, and responsive to human needs, habits, gestures, and emotions. This futuristic vision of daily environment will enable innovative human-machine interactions characterized by pervasive, unobtrusive and anticipatory communications. Such innovative interaction paradigms make ambient intelligence technology a suitable candidate for developing various real life solutions, including in the health care domain. This survey will discuss the emergence of ambient intelligence (AmI) techniques in the health care domain, in order to provide the research community with the necessary background. We will examine the infrastructure and technology required for achieving the vision of ambient intelligence, such as smart environments and wearable medical devices. We will summarize of the state of the art artificial intelligence methodologies used for developing AmI system in the health care domain, including various learning techniques (for learning from user interaction), reasoning techniques (for reasoning about users' goals and intensions) and planning techniques (for planning activities and interactions). We will also discuss how AmI technology might support people affected by various physical or mental disabilities or chronic disease. Finally, we will point to some of the successful case studies in the area and we will look at the current and future challenges to draw upon the possible future research paths.

FlyAR: augmented reality supported micro aerial vehicle navigation.

PubMed

Zollmann, Stefanie; Hoppe, Christof; Langlotz, Tobias; Reitmayr, Gerhard

2014-04-01

Micro aerial vehicles equipped with high-resolution cameras can be used to create aerial reconstructions of an area of interest. In that context automatic flight path planning and autonomous flying is often applied but so far cannot fully replace the human in the loop, supervising the flight on-site to assure that there are no collisions with obstacles. Unfortunately, this workflow yields several issues, such as the need to mentally transfer the aerial vehicle’s position between 2D map positions and the physical environment, and the complicated depth perception of objects flying in the distance. Augmented Reality can address these issues by bringing the flight planning process on-site and visualizing the spatial relationship between the planned or current positions of the vehicle and the physical environment. In this paper, we present Augmented Reality supported navigation and flight planning of micro aerial vehicles by augmenting the user’s view with relevant information for flight planning and live feedback for flight supervision. Furthermore, we introduce additional depth hints supporting the user in understanding the spatial relationship of virtual waypoints in the physical world and investigate the effect of these visualization techniques on the spatial understanding.

Report of the AAPM Task Group No. 105: Issues associated with clinical implementation of Monte Carlo-based photon and electron external beam treatment planning.

PubMed

Chetty, Indrin J; Curran, Bruce; Cygler, Joanna E; DeMarco, John J; Ezzell, Gary; Faddegon, Bruce A; Kawrakow, Iwan; Keall, Paul J; Liu, Helen; Ma, C M Charlie; Rogers, D W O; Seuntjens, Jan; Sheikh-Bagheri, Daryoush; Siebers, Jeffrey V

2007-12-01

The Monte Carlo (MC) method has been shown through many research studies to calculate accurate dose distributions for clinical radiotherapy, particularly in heterogeneous patient tissues where the effects of electron transport cannot be accurately handled with conventional, deterministic dose algorithms. Despite its proven accuracy and the potential for improved dose distributions to influence treatment outcomes, the long calculation times previously associated with MC simulation rendered this method impractical for routine clinical treatment planning. However, the development of faster codes optimized for radiotherapy calculations and improvements in computer processor technology have substantially reduced calculation times to, in some instances, within minutes on a single processor. These advances have motivated several major treatment planning system vendors to embark upon the path of MC techniques. Several commercial vendors have already released or are currently in the process of releasing MC algorithms for photon and/or electron beam treatment planning. Consequently, the accessibility and use of MC treatment planning algorithms may well become widespread in the radiotherapy community. With MC simulation, dose is computed stochastically using first principles; this method is therefore quite different from conventional dose algorithms. Issues such as statistical uncertainties, the use of variance reduction techniques, the ability to account for geometric details in the accelerator treatment head simulation, and other features, are all unique components of a MC treatment planning algorithm. Successful implementation by the clinical physicist of such a system will require an understanding of the basic principles of MC techniques. The purpose of this report, while providing education and review on the use of MC simulation in radiotherapy planning, is to set out, for both users and developers, the salient issues associated with clinical implementation and experimental verification of MC dose algorithms. As the MC method is an emerging technology, this report is not meant to be prescriptive. Rather, it is intended as a preliminary report to review the tenets of the MC method and to provide the framework upon which to build a comprehensive program for commissioning and routine quality assurance of MC-based treatment planning systems.

Autonomous navigation and control of a Mars rover

NASA Technical Reports Server (NTRS)

Miller, D. P.; Atkinson, D. J.; Wilcox, B. H.; Mishkin, A. H.

1990-01-01

A Mars rover will need to be able to navigate autonomously kilometers at a time. This paper outlines the sensing, perception, planning, and execution monitoring systems that are currently being designed for the rover. The sensing is based around stereo vision. The interpretation of the images use a registration of the depth map with a global height map provided by an orbiting spacecraft. Safe, low energy paths are then planned through the map, and expectations of what the rover's articulation sensors should sense are generated. These expectations are then used to ensure that the planned path is correctly being executed.

Path Analysis and Residual Plotting as Methods of Environmental Scanning in Higher Education: An Illustration with Applications and Enrollments.

ERIC Educational Resources Information Center

Morcol, Goktug; McLaughlin, Gerald W.

1990-01-01

The study proposes using path analysis and residual plotting as methods supporting environmental scanning in strategic planning for higher education institutions. Path models of three levels of independent variables are developed. Dependent variables measuring applications and enrollments at Virginia Polytechnic Institute and State University are…

A Flexible Toolkit Supporting Knowledge-based Tactical Planning for Ground Forces

DTIC Science & Technology

2011-06-01

assigned to each of the Special Areas to model its temporal behaviour . In Figure 5 an optimal path going over two defined intermediate points is...which area can be reached by an armoured infantry platoon within a given time interval, which path should be taken by a support unit to minimize...al. 2008]. Although trained commanders and staff personnel may achieve very accurate planning results, time consuming procedures are excluded when

A Path Planning and Obstacle Avoidance Hybrid System Using a Connectionist Network

DTIC Science & Technology

1990-06-01

Department lele7 Prfessor of Aerospace Sciences and Mathematical Sciences Houston, Texas June, 1990 Abstract A PATH PLANNING AND OBSTACLE AVOIDANCE HYBRID...See Weiland (1989), Wu (1989), Norwood (1989), Cheatham (1987 & 1989), Adnan (1990), and Regalbuto (1988 & 1990).] Possible applications of this...neuron model’s output can be described mathematically as: Yj(t+ At) =sgn ijXi(t)-O Other non-linearity functions, such as and the sigmoid/ logistics

Robot Path Planning in Uncertain Environments: A Language Measure-theoretic Approach

DTIC Science & Technology

2014-01-01

Paper DS-14-1028 to appear in the Special Issue on Stochastic Models, Control and Algorithms in Robotics, ASME Journal of Dynamic Systems...Measurement and Control Robot Path Planning in Uncertain Environments: A Language Measure-theoretic Approach⋆ Devesh K. Jha† Yue Li† Thomas A. Wettergren‡† Asok...algorithm, called ν⋆, that was formulated in the framework of probabilistic finite state automata (PFSA) and language measure from a control -theoretic

Evaluation of a New Backtrack Free Path Planning Algorithm for Manipulators

NASA Astrophysics Data System (ADS)

Islam, Md. Nazrul; Tamura, Shinsuke; Murata, Tomonari; Yanase, Tatsuro

This paper evaluates a newly proposed backtrack free path planning algorithm (BFA) for manipulators. BFA is an exact algorithm, i.e. it is resolution complete. Different from existing resolution complete algorithms, its computation time and memory space are proportional to the number of arms. Therefore paths can be calculated within practical and predetermined time even for manipulators with many arms, and it becomes possible to plan complicated motions of multi-arm manipulators in fully automated environments. The performance of BFA is evaluated for 2-dimensional environments while changing the number of arms and obstacle placements. Its performance under locus and attitude constraints is also evaluated. Evaluation results show that the computation volume of the algorithm is almost the same as the theoretical one, i.e. it increases linearly with the number of arms even in complicated environments. Moreover BFA achieves the constant performance independent of environments.

Optimal path planning for a mobile robot using cuckoo search algorithm

NASA Astrophysics Data System (ADS)

Mohanty, Prases K.; Parhi, Dayal R.

2016-03-01

The shortest/optimal path planning is essential for efficient operation of autonomous vehicles. In this article, a new nature-inspired meta-heuristic algorithm has been applied for mobile robot path planning in an unknown or partially known environment populated by a variety of static obstacles. This meta-heuristic algorithm is based on the levy flight behaviour and brood parasitic behaviour of cuckoos. A new objective function has been formulated between the robots and the target and obstacles, which satisfied the conditions of obstacle avoidance and target-seeking behaviour of robots present in the terrain. Depending upon the objective function value of each nest (cuckoo) in the swarm, the robot avoids obstacles and proceeds towards the target. The smooth optimal trajectory is framed with this algorithm when the robot reaches its goal. Some simulation and experimental results are presented at the end of the paper to show the effectiveness of the proposed navigational controller.

Adaptive Gait Control for a Quadruped Robot on 3D Path Planning

NASA Astrophysics Data System (ADS)

Igarashi, Hiroshi; Kakikura, Masayoshi

A legged walking robot is able to not only move on irregular terrain but also change its posture. For example, the robot can pass under overhead obstacles by crouching. The purpose of our research is to realize efficient path planning with a quadruped robot. Therefore, the path planning is expected to extended in three dimensions because of the mobility. However, some issues of the quadruped robot, which are instability, workspace limitation, deadlock and slippage, complicate realizing such application. In order to improve these issues and reinforce the mobility, a new static gait pattern for a quadruped robot, called TFG: Trajectory Following Gait, is proposed. The TFG intends to obtain high controllability like a wheel robot. Additionally, the TFG allows to change it posture during the walk. In this paper, some experimental results show that the TFG improves the issues and it is available for efficient locomotion in three dimensional environment.

Analytical transmissibility based transfer path analysis for multi-energy-domain systems using four-pole parameter theory

NASA Astrophysics Data System (ADS)

Mashayekhi, Mohammad Jalali; Behdinan, Kamran

2017-10-01

The increasing demand to minimize undesired vibration and noise levels in several high-tech industries has generated a renewed interest in vibration transfer path analysis. Analyzing vibration transfer paths within a system is of crucial importance in designing an effective vibration isolation strategy. Most of the existing vibration transfer path analysis techniques are empirical which are suitable for diagnosis and troubleshooting purpose. The lack of an analytical transfer path analysis to be used in the design stage is the main motivation behind this research. In this paper an analytical transfer path analysis based on the four-pole theory is proposed for multi-energy-domain systems. Bond graph modeling technique which is an effective approach to model multi-energy-domain systems is used to develop the system model. In this paper an electro-mechanical system is used as a benchmark example to elucidate the effectiveness of the proposed technique. An algorithm to obtain the equivalent four-pole representation of a dynamical systems based on the corresponding bond graph model is also presented in this paper.

Plans to Observe the 2017 Total Solar Eclipse from near the Path Edges

NASA Astrophysics Data System (ADS)

Waring Dunham, David; Nugent, Richard; Guhl, Konrad; Bode, Hans-Joachim

2015-08-01

The August 21st, 2017 solar eclipse provides a good opportunity, to time the totality contacts, other Baily’s bead phenomena, and observe other dynamic edge phenomena, from locations near the edges of the path of totality. A good network of roads and generally favorable weather prospects means that more observers will likely be able to deploy more equipment than during most previous eclipses. The value of contact and Baily’s bead timings of total solar eclipses, for determining solar diameter and intensity variations, was described in an earlier presentation in Focus Meeting 13. This presentation will concentrate on how observations of different types that have been used during past eclipses can be made by different observers, to obtain better information about the accuracy of the different types of observations for determining the mean solar diameter, and the systematic differences between them. A problem has been that the few observers who have attempted recording Baily’s beads from path edge locations have wanted to use the latest technology, to try to record the observations better, rather than try to make the observations in the same ways that were used for many past eclipses. Several observers trying different techniques at the same location, and doing that at several locations at different places along the path, is needed. Past techniques that we would like to compare include direct visual observation (but keeping eye safety in mind); visual observation of telescopically projected images; direct filtered video telescopic observations; and recording the flash spectrum. There are several towns that straddle the path edges. The International Occultation Timing Association would like to mobilize people in those towns to observe the eclipse from many places, to say whether or not the eclipse happened, and if it did, time it. A suitable cell phone app could be designed to report observations, including the observer’s location, as was attempted for an occultation of Regulus by the asteroid Erigone in the northeastern USA in 2014, but which unfortunately was clouded out everywhere.

Motion planning for autonomous vehicle based on radial basis function neural network in unstructured environment.

PubMed

Chen, Jiajia; Zhao, Pan; Liang, Huawei; Mei, Tao

2014-09-18

The autonomous vehicle is an automated system equipped with features like environment perception, decision-making, motion planning, and control and execution technology. Navigating in an unstructured and complex environment is a huge challenge for autonomous vehicles, due to the irregular shape of road, the requirement of real-time planning, and the nonholonomic constraints of vehicle. This paper presents a motion planning method, based on the Radial Basis Function (RBF) neural network, to guide the autonomous vehicle in unstructured environments. The proposed algorithm extracts the drivable region from the perception grid map based on the global path, which is available in the road network. The sample points are randomly selected in the drivable region, and a gradient descent method is used to train the RBF network. The parameters of the motion-planning algorithm are verified through the simulation and experiment. It is observed that the proposed approach produces a flexible, smooth, and safe path that can fit any road shape. The method is implemented on autonomous vehicle and verified against many outdoor scenes; furthermore, a comparison of proposed method with the existing well-known Rapidly-exploring Random Tree (RRT) method is presented. The experimental results show that the proposed method is highly effective in planning the vehicle path and offers better motion quality.

Motion Planning for Autonomous Vehicle Based on Radial Basis Function Neural Network in Unstructured Environment

PubMed Central

Chen, Jiajia; Zhao, Pan; Liang, Huawei; Mei, Tao

2014-01-01

The autonomous vehicle is an automated system equipped with features like environment perception, decision-making, motion planning, and control and execution technology. Navigating in an unstructured and complex environment is a huge challenge for autonomous vehicles, due to the irregular shape of road, the requirement of real-time planning, and the nonholonomic constraints of vehicle. This paper presents a motion planning method, based on the Radial Basis Function (RBF) neural network, to guide the autonomous vehicle in unstructured environments. The proposed algorithm extracts the drivable region from the perception grid map based on the global path, which is available in the road network. The sample points are randomly selected in the drivable region, and a gradient descent method is used to train the RBF network. The parameters of the motion-planning algorithm are verified through the simulation and experiment. It is observed that the proposed approach produces a flexible, smooth, and safe path that can fit any road shape. The method is implemented on autonomous vehicle and verified against many outdoor scenes; furthermore, a comparison of proposed method with the existing well-known Rapidly-exploring Random Tree (RRT) method is presented. The experimental results show that the proposed method is highly effective in planning the vehicle path and offers better motion quality. PMID:25237902

Computer simulation and evaluation of edge detection algorithms and their application to automatic path selection

NASA Technical Reports Server (NTRS)

Longendorfer, B. A.

1976-01-01

The construction of an autonomous roving vehicle requires the development of complex data-acquisition and processing systems, which determine the path along which the vehicle travels. Thus, a vehicle must possess algorithms which can (1) reliably detect obstacles by processing sensor data, (2) maintain a constantly updated model of its surroundings, and (3) direct its immediate actions to further a long range plan. The first function consisted of obstacle recognition. Obstacles may be identified by the use of edge detection techniques. Therefore, the Kalman Filter was implemented as part of a large scale computer simulation of the Mars Rover. The second function consisted of modeling the environment. The obstacle must be reconstructed from its edges, and the vast amount of data must be organized in a readily retrievable form. Therefore, a Terrain Modeller was developed which assembled and maintained a rectangular grid map of the planet. The third function consisted of directing the vehicle's actions.

Robust path planning for flexible needle insertion using Markov decision processes.

PubMed

Tan, Xiaoyu; Yu, Pengqian; Lim, Kah-Bin; Chui, Chee-Kong

2018-05-11

Flexible needle has the potential to accurately navigate to a treatment region in the least invasive manner. We propose a new planning method using Markov decision processes (MDPs) for flexible needle navigation that can perform robust path planning and steering under the circumstance of complex tissue-needle interactions. This method enhances the robustness of flexible needle steering from three different perspectives. First, the method considers the problem caused by soft tissue deformation. The method then resolves the common needle penetration failure caused by patterns of targets, while the last solution addresses the uncertainty issues in flexible needle motion due to complex and unpredictable tissue-needle interaction. Computer simulation and phantom experimental results show that the proposed method can perform robust planning and generate a secure control policy for flexible needle steering. Compared with a traditional method using MDPs, the proposed method achieves higher accuracy and probability of success in avoiding obstacles under complicated and uncertain tissue-needle interactions. Future work will involve experiment with biological tissue in vivo. The proposed robust path planning method can securely steer flexible needle within soft phantom tissues and achieve high adaptability in computer simulation.

IT Workforce: Key Practices Help Ensure Strong Integrated Program Teams; Selected Departments Need to Assess Skill Gaps

DTIC Science & Technology

2016-11-01

personnel, career paths for program managers, plans to strengthen program management, and use of special hiring authorities) Monitor and report...agencies with direct hiring authority for program managers and directed OPM to create a specialized career path. OMB also tasked agencies with...guidance for developing career paths for IT program managers.14 OPM’s career path guide was to build upon its IT Program Management Competency Model

A variational dynamic programming approach to robot-path planning with a distance-safety criterion

NASA Technical Reports Server (NTRS)

Suh, Suk-Hwan; Shin, Kang G.

1988-01-01

An approach to robot-path planning is developed by considering both the traveling distance and the safety of the robot. A computationally-efficient algorithm is developed to find a near-optimal path with a weighted distance-safety criterion by using a variational calculus and dynamic programming (VCDP) method. The algorithm is readily applicable to any factory environment by representing the free workspace as channels. A method for deriving these channels is also proposed. Although it is developed mainly for two-dimensional problems, this method can be easily extended to a class of three-dimensional problems. Numerical examples are presented to demonstrate the utility and power of this method.

Ancient village fire escape path planning based on improved ant colony algorithm

NASA Astrophysics Data System (ADS)

Xia, Wei; Cao, Kang; Hu, QianChuan

2017-06-01

The roadways are narrow and perplexing in ancient villages, it brings challenges and difficulties for people to choose route to escape when a fire occurs. In this paper, a fire escape path planning method based on ant colony algorithm is presented according to the problem. The factors in the fire environment which influence the escape speed is introduced to improve the heuristic function of the algorithm, optimal transfer strategy, and adjustment pheromone volatile factor to improve pheromone update strategy adaptively, improve its dynamic search ability and search speed. Through simulation, the dynamic adjustment of the optimal escape path is obtained, and the method is proved to be feasible.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dorum, O.H.; Hoover, A.; Jones, J.P.

This paper addresses some issues in the development of sensor-based systems for mobile robot navigation which use range imaging sensors as the primary source for geometric information about the environment. In particular, we describe a model of scanning laser range cameras which takes into account the properties of the mechanical system responsible for image formation and a calibration procedure which yields improved accuracy over previous models. In addition, we describe an algorithm which takes the limitations of these sensors into account in path planning and path execution. In particular, range imaging sensors are characterized by a limited field of viewmore » and a standoff distance -- a minimum distance nearer than which surfaces cannot be sensed. These limitations can be addressed by enriching the concept of configuration space to include information about what can be sensed from a given configuration, and using this information to guide path planning and path following.« less

A 2D chaotic path planning for mobile robots accomplishing boundary surveillance missions in adversarial conditions

NASA Astrophysics Data System (ADS)

Curiac, Daniel-Ioan; Volosencu, Constantin

2014-10-01

The path-planning algorithm represents a crucial issue for every autonomous mobile robot. In normal circumstances a patrol robot will compute an optimal path to ensure its task accomplishment, but in adversarial conditions the problem is getting more complicated. Here, the robot’s trajectory needs to be altered into a misleading and unpredictable path to cope with potential opponents. Chaotic systems provide the needed framework for obtaining unpredictable motion in all of the three basic robot surveillance missions: area, points of interests and boundary monitoring. Proficient approaches have been provided for the first two surveillance tasks, but for boundary patrol missions no method has been reported yet. This paper addresses the mentioned research gap by proposing an efficient method, based on chaotic dynamic of the Hénon system, to ensure unpredictable boundary patrol on any shape of chosen closed contour.

Neurosurgical robotic arm drilling navigation system.

PubMed

Lin, Chung-Chih; Lin, Hsin-Cheng; Lee, Wen-Yo; Lee, Shih-Tseng; Wu, Chieh-Tsai

2017-09-01

The aim of this work was to develop a neurosurgical robotic arm drilling navigation system that provides assistance throughout the complete bone drilling process. The system comprised neurosurgical robotic arm navigation combining robotic and surgical navigation, 3D medical imaging based surgical planning that could identify lesion location and plan the surgical path on 3D images, and automatic bone drilling control that would stop drilling when the bone was to be drilled-through. Three kinds of experiment were designed. The average positioning error deduced from 3D images of the robotic arm was 0.502 ± 0.069 mm. The correlation between automatically and manually planned paths was 0.975. The average distance error between automatically planned paths and risky zones was 0.279 ± 0.401 mm. The drilling auto-stopping algorithm had 0.00% unstopped cases (26.32% in control group 1) and 70.53% non-drilled-through cases (8.42% and 4.21% in control groups 1 and 2). The system may be useful for neurosurgical robotic arm drilling navigation. Copyright © 2016 John Wiley & Sons, Ltd.

Fuzzy logic path planning system for collision avoidance by an autonomous rover vehicle

NASA Technical Reports Server (NTRS)

Murphy, Michael G.

1993-01-01

The Space Exploration Initiative of the United States will make great demands upon NASA and its limited resources. One aspect of great importance will be providing for autonomous (unmanned) operation of vehicles and/or subsystems in space flight and surface exploration. An additional, complicating factor is that much of the need for autonomy of operation will take place under conditions of great uncertainty or ambiguity. Issues in developing an autonomous collision avoidance subsystem within a path planning system for application in a remote, hostile environment that does not lend itself well to remote manipulation by Earth-based telecommunications is addressed. A good focus is unmanned surface exploration of Mars. The uncertainties involved indicate that robust approaches such as fuzzy logic control are particularly appropriate. Four major issues addressed are (1) avoidance of a fuzzy moving obstacle; (2) backoff from a deadend in a static obstacle environment; (3) fusion of sensor data to detect obstacles; and (4) options for adaptive learning in a path planning system. Examples of the need for collision avoidance by an autonomous rover vehicle on the surface of Mars with a moving obstacle would be wind-blown debris, surface flow or anomalies due to subsurface disturbances, another vehicle, etc. The other issues of backoff, sensor fusion, and adaptive learning are important in the overall path planning system.

Apical Transportation, Centering Ability, and Cleaning Effectiveness of Reciprocating Single-file System Associated with Different Glide Path Techniques.

PubMed

de Carvalho, Guilherme Moreira; Sponchiado Junior, Emílio Carlos; Garrido, Angela Delfina Bittencourt; Lia, Raphael Carlos Comelli; Garcia, Lucas da Fonseca Roberti; Marques, André Augusto Franco

2015-12-01

The aim of this study was to evaluate the apical transportation, the centering ability, and the cleaning effectiveness of a reciprocating single-file system associated to different glide path techniques. The mesial root canals of 52 mandibular molars were randomly distributed into 4 groups (n = 13) according to the different glide path techniques used before biomechanical preparation with Reciproc System (RS): KF/RS (sizes 10 and 15 K-files), NGP/RS (no glide path, only reciprocating system), PF/RS (sizes 13, 16, and 19 PathFile instruments), and NP (no preparation). Cone-beam computed tomography analysis was performed before and after instrumentation for apical third images acquisition. Apical transportation and its direction were evaluated by using the formula D = (X1 - X2) - (Y1 - Y2), and the centering ability was analyzed by the formula CC = (X1 - X2/Y1 - Y2 or Y1 - Y2/X1 - X2). The samples were submitted to histologic processing and analyzed under a digital microscope for debris quantification. The values were statistically analyzed (Kruskal-Wallis, the Dunn multiple comparisons test, P < .05). All groups had similar apical transportation values, with no significant difference among them (P > .05). Groups had a tendency toward transportation in the mesial direction. No technique had perfect centering ability (=1.0), with no significant difference among them. KF/RS had larger amount of debris, with statistically significant difference in comparison with NGP/RS (P > .05). The different glide path techniques promoted minimal apical transportation, and the reciprocating single-file system tested remained relatively centralized within the root canal. Also, the different techniques interfered in the cleaning effectiveness of the reciprocating system. Copyright © 2015 American Association of Endodontists. Published by Elsevier Inc. All rights reserved.

Multiresolution motion planning for autonomous agents via wavelet-based cell decompositions.

PubMed

Cowlagi, Raghvendra V; Tsiotras, Panagiotis

2012-10-01

We present a path- and motion-planning scheme that is "multiresolution" both in the sense of representing the environment with high accuracy only locally and in the sense of addressing the vehicle kinematic and dynamic constraints only locally. The proposed scheme uses rectangular multiresolution cell decompositions, efficiently generated using the wavelet transform. The wavelet transform is widely used in signal and image processing, with emerging applications in autonomous sensing and perception systems. The proposed motion planner enables the simultaneous use of the wavelet transform in both the perception and in the motion-planning layers of vehicle autonomy, thus potentially reducing online computations. We rigorously prove the completeness of the proposed path-planning scheme, and we provide numerical simulation results to illustrate its efficacy.

Quad-rotor flight path energy optimization

NASA Astrophysics Data System (ADS)

Kemper, Edward

Quad-Rotor unmanned areal vehicles (UAVs) have been a popular area of research and development in the last decade, especially with the advent of affordable microcontrollers like the MSP 430 and the Raspberry Pi. Path-Energy Optimization is an area that is well developed for linear systems. In this thesis, this idea of path-energy optimization is extended to the nonlinear model of the Quad-rotor UAV. The classical optimization technique is adapted to the nonlinear model that is derived for the problem at hand, coming up with a set of partial differential equations and boundary value conditions to solve these equations. Then, different techniques to implement energy optimization algorithms are tested using simulations in Python. First, a purely nonlinear approach is used. This method is shown to be computationally intensive, with no practical solution available in a reasonable amount of time. Second, heuristic techniques to minimize the energy of the flight path are tested, using Ziegler-Nichols' proportional integral derivative (PID) controller tuning technique. Finally, a brute force look-up table based PID controller is used. Simulation results of the heuristic method show that both reliable control of the system and path-energy optimization are achieved in a reasonable amount of time.

Incorporating target registration error into robotic bone milling

NASA Astrophysics Data System (ADS)

Siebold, Michael A.; Dillon, Neal P.; Webster, Robert J.; Fitzpatrick, J. Michael

2015-03-01

Robots have been shown to be useful in assisting surgeons in a variety of bone drilling and milling procedures. Examples include commercial systems for joint repair or replacement surgeries, with in vitro feasibility recently shown for mastoidectomy. Typically, the robot is guided along a path planned on a CT image that has been registered to the physical anatomy in the operating room, which is in turn registered to the robot. The registrations often take advantage of the high accuracy of fiducial registration, but, because no real-world registration is perfect, the drill guided by the robot will inevitably deviate from its planned path. The extent of the deviation can vary from point to point along the path because of the spatial variation of target registration error. The allowable deviation can also vary spatially based on the necessary safety margin between the drill tip and various nearby anatomical structures along the path. Knowledge of the expected spatial distribution of registration error can be obtained from theoretical models or experimental measurements and used to modify the planned path. The objective of such modifications is to achieve desired probabilities for sparing specified structures. This approach has previously been studied for drilling straight holes but has not yet been generalized to milling procedures, such as mastoidectomy, in which cavities of more general shapes must be created. In this work, we present a general method for altering any path to achieve specified probabilities for any spatial arrangement of structures to be protected. We validate the method via numerical simulations in the context of mastoidectomy.

The eye of the storm: Balancing my storm of family, career and self

NASA Astrophysics Data System (ADS)

Horton, K. Renee

2008-03-01

In knowing that the path I travel is not the usual path traveled by most; this has turned out to be the best path for me and my family. It is very important to prioritize what is important to you and then define the best path for you versus choosing a path and the path chooses your prioritizes. Coming from a loving and supportive middle class upbringing created a deep sense of family and the importance of family. Early in my life I was determined to have children and a career. Over the last ten years there have been several obstacles to overcome in my storm, but with careful planning, due diligence, and a support system to help maintain calm at the center of my storm I have been able to achieve my goals of pursuing my Doctorate. A complete research plan was put into place into choosing the institution that I would further my academic endeavors in the same manner in which my dissertation research topic has been defined. Just as any successful business, all persons involved in my future success were consulted with equal input into the new endeavor with the full understanding of what this new plan entailed. We decided on the University of Alabama for several reasons: location, weather, flexibility, policies, research and my ability to make a change in the face of science. According to my advisor, I will do that in about two and half years at my graduation ceremony when I become the first African American to receive a PhD in Material Science from the University of Alabama.

Incorporating Target Registration Error Into Robotic Bone Milling

PubMed Central

Siebold, Michael A.; Dillon, Neal P.; Webster, Robert J.; Fitzpatrick, J. Michael

2015-01-01

Robots have been shown to be useful in assisting surgeons in a variety of bone drilling and milling procedures. Examples include commercial systems for joint repair or replacement surgeries, with in vitro feasibility recently shown for mastoidectomy. Typically, the robot is guided along a path planned on a CT image that has been registered to the physical anatomy in the operating room, which is in turn registered to the robot. The registrations often take advantage of the high accuracy of fiducial registration, but, because no real-world registration is perfect, the drill guided by the robot will inevitably deviate from its planned path. The extent of the deviation can vary from point to point along the path because of the spatial variation of target registration error. The allowable deviation can also vary spatially based on the necessary safety margin between the drill tip and various nearby anatomical structures along the path. Knowledge of the expected spatial distribution of registration error can be obtained from theoretical models or experimental measurements and used to modify the planned path. The objective of such modifications is to achieve desired probabilities for sparing specified structures. This approach has previously been studied for drilling straight holes but has not yet been generalized to milling procedures, such as mastoidectomy, in which cavities of more general shapes must be created. In this work, we present a general method for altering any path to achieve specified probabilities for any spatial arrangement of structures to be protected. We validate the method via numerical simulations in the context of mastoidectomy. PMID:26692630

Contributions of the SDR Task Network tool to Calibration and Validation of the NPOESS Preparatory Project instruments

NASA Astrophysics Data System (ADS)

Feeley, J.; Zajic, J.; Metcalf, A.; Baucom, T.

2009-12-01

The National Polar-orbiting Operational Environmental Satellite System (NPOESS) Preparatory Project (NPP) Calibration and Validation (Cal/Val) team is planning post-launch activities to calibrate the NPP sensors and validate Sensor Data Records (SDRs). The IPO has developed a web-based data collection and visualization tool in order to effectively collect, coordinate, and manage the calibration and validation tasks for the OMPS, ATMS, CrIS, and VIIRS instruments. This tool is accessible to the multi-institutional Cal/Val teams consisting of the Prime Contractor and Government Cal/Val leads along with the NASA NPP Mission team, and is used for mission planning and identification/resolution of conflicts between sensor activities. Visualization techniques aid in displaying task dependencies, including prerequisites and exit criteria, allowing for the identification of a critical path. This presentation will highlight how the information is collected, displayed, and used to coordinate the diverse instrument calibration/validation teams.

Marine Vehicle Sensor Network Architecture and Protocol Designs for Ocean Observation

PubMed Central

Zhang, Shaowei; Yu, Jiancheng; Zhang, Aiqun; Yang, Lei; Shu, Yeqiang

2012-01-01

The micro-scale and meso-scale ocean dynamic processes which are nonlinear and have large variability, have a significant impact on the fisheries, natural resources, and marine climatology. A rapid, refined and sophisticated observation system is therefore needed in marine scientific research. The maneuverability and controllability of mobile sensor platforms make them a preferred choice to establish ocean observing networks, compared to the static sensor observing platform. In this study, marine vehicles are utilized as the nodes of mobile sensor networks for coverage sampling of a regional ocean area and ocean feature tracking. A synoptic analysis about marine vehicle dynamic control, multi vehicles mission assignment and path planning methods, and ocean feature tracking and observing techniques is given. Combined with the observation plan in the South China Sea, we provide an overview of the mobile sensor networks established with marine vehicles, and the corresponding simulation results. PMID:22368475

Route planning in a four-dimensional environment

NASA Technical Reports Server (NTRS)

Slack, M. G.; Miller, D. P.

1987-01-01

Robots must be able to function in the real world. The real world involves processes and agents that move independently of the actions of the robot, sometimes in an unpredictable manner. A real-time integrated route planning and spatial representation system for planning routes through dynamic domains is presented. The system will find the safest most efficient route through space-time as described by a set of user defined evaluation functions. Because the route planning algorthims is highly parallel and can run on an SIMD machine in O(p) time (p is the length of a path), the system will find real-time paths through unpredictable domains when used in an incremental mode. Spatial representation, an SIMD algorithm for route planning in a dynamic domain, and results from an implementation on a traditional computer architecture are discussed.

Toward a new task assignment and path evolution (TAPE) for missile defense system (MDS) using intelligent adaptive SOM with recurrent neural networks (RNNs).

PubMed

Wang, Chi-Hsu; Chen, Chun-Yao; Hung, Kun-Neng

2015-06-01

In this paper, a new adaptive self-organizing map (SOM) with recurrent neural network (RNN) controller is proposed for task assignment and path evolution of missile defense system (MDS). We address the problem of N agents (defending missiles) and D targets (incoming missiles) in MDS. A new RNN controller is designed to force an agent (or defending missile) toward a target (or incoming missile), and a monitoring controller is also designed to reduce the error between RNN controller and ideal controller. A new SOM with RNN controller is then designed to dispatch agents to their corresponding targets by minimizing total damaging cost. This is actually an important application of the multiagent system. The SOM with RNN controller is the main controller. After task assignment, the weighting factors of our new SOM with RNN controller are activated to dispatch the agents toward their corresponding targets. Using the Lyapunov constraints, the weighting factors for the proposed SOM with RNN controller are updated to guarantee the stability of the path evolution (or planning) system. Excellent simulations are obtained using this new approach for MDS, which show that our RNN has the lowest average miss distance among the several techniques.

Introduction of a computer-based method for automated planning of reduction paths under consideration of simulated muscular forces.

PubMed

Buschbaum, Jan; Fremd, Rainer; Pohlemann, Tim; Kristen, Alexander

2017-08-01

Reduction is a crucial step in the surgical treatment of bone fractures. Finding an optimal path for restoring anatomical alignment is considered technically demanding because collisions as well as high forces caused by surrounding soft tissues can avoid desired reduction movements. The repetition of reduction movements leads to a trial-and-error process which causes a prolonged duration of surgery. By planning an appropriate reduction path-an optimal sequence of target-directed movements-these problems should be overcome. For this purpose, a computer-based method has been developed. Using the example of simple femoral shaft fractures, 3D models are generated out of CT images. A reposition algorithm aligns both fragments by reconstructing their broken edges. According to the criteria of a deduced planning strategy, a modified A*-algorithm searches collision-free route of minimal force from the dislocated into the computed target position. Muscular forces are considered using a musculoskeletal reduction model (OpenSim model), and bone collisions are detected by an appropriate method. Five femoral SYNBONE models were broken into different fracture classification types and were automatically reduced from ten randomly selected displaced positions. Highest mean translational and rotational error for achieving target alignment is [Formula: see text] and [Formula: see text]. Mean value and standard deviation of occurring forces are [Formula: see text] for M. tensor fasciae latae and [Formula: see text] for M. semitendinosus over all trials. These pathways are precise, collision-free, required forces are minimized, and thus regarded as optimal paths. A novel method for planning reduction paths under consideration of collisions and muscular forces is introduced. The results deliver additional knowledge for an appropriate tactical reduction procedure and can provide a basis for further navigated or robotic-assisted developments.

A study of interior noise levels, noise sources and transmission paths in light aircraft

NASA Technical Reports Server (NTRS)

Hayden, R. E.; Murray, B. S.; Theobald, M. A.

1983-01-01

The interior noise levels and spectral characteristics of 18 single-and twin-engine propeller-driven light aircraft, and source-path diagnosis of a single-engine aircraft which was considered representative of a large part of the fleet were studied. The purpose of the flight surveys was to measure internal noise levels and identify principal noise sources and paths under a carefully controlled and standardized set of flight procedures. The diagnostic tests consisted of flights and ground tests in which various parts of the aircraft, such as engine mounts, the engine compartment, exhaust pipe, individual panels, and the wing strut were instrumented to determine source levels and transmission path strengths using the transfer function technique. Predominant source and path combinations are identified. Experimental techniques are described. Data, transfer function calculations to derive source-path contributions to the cabin acoustic environment, and implications of the findings for noise control design are analyzed.

Measuring phonon mean free path distributions by probing quasiballistic phonon transport in grating nanostructures

DOE PAGES

Zeng, Lingping; Collins, Kimberlee C.; Hu, Yongjie; ...

2015-11-27

Heat conduction in semiconductors and dielectrics depends upon their phonon mean free paths that describe the average travelling distance between two consecutive phonon scattering events. Nondiffusive phonon transport is being exploited to extract phonon mean free path distributions. Here, we describe an implementation of a nanoscale thermal conductivity spectroscopy technique that allows for the study of mean free path distributions in optically absorbing materials with relatively simple fabrication and a straightforward analysis scheme. We pattern 1D metallic grating of various line widths but fixed gap size on sample surfaces. The metal lines serve as both heaters and thermometers in time-domainmore » thermoreflectance measurements and simultaneously act as wiregrid polarizers that protect the underlying substrate from direct optical excitation and heating. We demonstrate the viability of this technique by studying length-dependent thermal conductivities of silicon at various temperatures. The thermal conductivities measured with different metal line widths are analyzed using suppression functions calculated from the Boltzmann transport equation to extract the phonon mean free path distributions with no calibration required. Furthermore, this table-top ultrafast thermal transport spectroscopy technique enables the study of mean free path spectra in a wide range of technologically important materials.« less

Elucidating the ensemble of functionally-relevant transitions in protein systems with a robotics-inspired method

PubMed Central

2013-01-01

Background Many proteins tune their biological function by transitioning between different functional states, effectively acting as dynamic molecular machines. Detailed structural characterization of transition trajectories is central to understanding the relationship between protein dynamics and function. Computational approaches that build on the Molecular Dynamics framework are in principle able to model transition trajectories at great detail but also at considerable computational cost. Methods that delay consideration of dynamics and focus instead on elucidating energetically-credible conformational paths connecting two functionally-relevant structures provide a complementary approach. Effective sampling-based path planning methods originating in robotics have been recently proposed to produce conformational paths. These methods largely model short peptides or address large proteins by simplifying conformational space. Methods We propose a robotics-inspired method that connects two given structures of a protein by sampling conformational paths. The method focuses on small- to medium-size proteins, efficiently modeling structural deformations through the use of the molecular fragment replacement technique. In particular, the method grows a tree in conformational space rooted at the start structure, steering the tree to a goal region defined around the goal structure. We investigate various bias schemes over a progress coordinate for balance between coverage of conformational space and progress towards the goal. A geometric projection layer promotes path diversity. A reactive temperature scheme allows sampling of rare paths that cross energy barriers. Results and conclusions Experiments are conducted on small- to medium-size proteins of length up to 214 amino acids and with multiple known functionally-relevant states, some of which are more than 13Å apart of each-other. Analysis reveals that the method effectively obtains conformational paths connecting structural states that are significantly different. A detailed analysis on the depth and breadth of the tree suggests that a soft global bias over the progress coordinate enhances sampling and results in higher path diversity. The explicit geometric projection layer that biases the exploration away from over-sampled regions further increases coverage, often improving proximity to the goal by forcing the exploration to find new paths. The reactive temperature scheme is shown effective in increasing path diversity, particularly in difficult structural transitions with known high-energy barriers. PMID:24565158

An industrial robot singular trajectories planning based on graphs and neural networks

NASA Astrophysics Data System (ADS)

Łęgowski, Adrian; Niezabitowski, Michał

2016-06-01

Singular trajectories are rarely used because of issues during realization. A method of planning trajectories for given set of points in task space with use of graphs and neural networks is presented. In every desired point the inverse kinematics problem is solved in order to derive all possible solutions. A graph of solutions is made. The shortest path is determined to define required nodes in joint space. Neural networks are used to define the path between these nodes.

Planning Minimum-Energy Paths in an Off-Road Environment with Anisotropic Traversal Costs and Motion Constraints

DTIC Science & Technology

1989-06-01

problems, and (3) weighted-region problems. Since the minimum-energy path-planning problem addressed in this dissertation is a hybrid between the two...contains components that are strictly vehicle dependent, components that are strictly terrain dependent, and components representing a hybrid of...Single Segment Braking/Multiple Segment Hybrid Using Eq. (3.46), the traversal cost U 1,.-1 can be rewritten as Uop- 1 = mgD Itan01 , (4.12a) and the

Vervet monkey (Chlorocebus pygerythrus) behavior in a multi-destination route: Evidence for planning ahead when heuristics fail.

PubMed

Teichroeb, Julie Annette; Smeltzer, Eve Ann

2018-01-01

Animal paths are analogous to intractable mathematical problems like the Traveling Salesman Problem (TSP) and the shortest path problem (SPP). Both the TSP and SPP require an individual to find the shortest path through multiple targets but the TSP demands a return to the start, while the SPP does not. Vervet monkeys are very efficient in solving TSPs but this species is a multiple central place forager that does not always return to the same sleeping site and thus theoretically should be selected to find solutions to SPPs rather than TSPs. We examined path choice by wild vervets in an SPP experimental array where the shortest paths usually differed from those consistent with common heuristic strategies, the nearest-neighbor rule (NNR-go to the closest resource that has not been visited), and the convex hull (put a mental loop around sites, adding inner targets in order of distance from the edge)-an efficient strategy for TSPs but not SPPs. In addition, humans solving SPPs use an initial segment strategy (ISS-choose the straightest path at the beginning, only turning when necessary) and we looked at vervet paths consistent with this strategy. In 615 trials by single foragers, paths usually conformed to the NNR and rarely the slightly more efficient convex hull, supporting that vervets may be selected to solve SPPs. Further, like humans solving SPPs, vervets showed a tendency to use the ISS. Paths consistent with heuristics dropped off sharply, and use of the shortest path increased, when heuristics led to longer paths showing trade-offs in efficiency versus cognitive load. Two individuals out of 17, found the shortest path most often, showing inter-individual variation in path planning. Given support for the NNR and the ISS, we propose a new rule-of-thumb termed the "region heuristic" that vervets may apply in multi-destination routes.

Vervet monkey (Chlorocebus pygerythrus) behavior in a multi-destination route: Evidence for planning ahead when heuristics fail

PubMed Central

Smeltzer, Eve Ann

2018-01-01

Animal paths are analogous to intractable mathematical problems like the Traveling Salesman Problem (TSP) and the shortest path problem (SPP). Both the TSP and SPP require an individual to find the shortest path through multiple targets but the TSP demands a return to the start, while the SPP does not. Vervet monkeys are very efficient in solving TSPs but this species is a multiple central place forager that does not always return to the same sleeping site and thus theoretically should be selected to find solutions to SPPs rather than TSPs. We examined path choice by wild vervets in an SPP experimental array where the shortest paths usually differed from those consistent with common heuristic strategies, the nearest-neighbor rule (NNR–go to the closest resource that has not been visited), and the convex hull (put a mental loop around sites, adding inner targets in order of distance from the edge)–an efficient strategy for TSPs but not SPPs. In addition, humans solving SPPs use an initial segment strategy (ISS–choose the straightest path at the beginning, only turning when necessary) and we looked at vervet paths consistent with this strategy. In 615 trials by single foragers, paths usually conformed to the NNR and rarely the slightly more efficient convex hull, supporting that vervets may be selected to solve SPPs. Further, like humans solving SPPs, vervets showed a tendency to use the ISS. Paths consistent with heuristics dropped off sharply, and use of the shortest path increased, when heuristics led to longer paths showing trade-offs in efficiency versus cognitive load. Two individuals out of 17, found the shortest path most often, showing inter-individual variation in path planning. Given support for the NNR and the ISS, we propose a new rule-of-thumb termed the “region heuristic” that vervets may apply in multi-destination routes. PMID:29813105

Reducing water scarcity possible by 2050: Linking global assessments to policy dimensions

NASA Astrophysics Data System (ADS)

Wada, Y.; Gleeson, T.; Esnault, L.

2015-12-01

Water scarcity is not a problem just for the developing world. In California, legislators are currently proposing a $7.5 billion emergency water plan to their voters; and U.S. federal officials last year warned residents of Arizona and Nevada that they could face cuts in Colorado River water deliveries in 2016. Irrigation techniques, industrial and residential habits combined with climate change lie at the root of the problem. But despite what appears to be an insurmountable problem, it is possible to turn the situation around and significantly reduce water scarcity in over next 35 years. We identify outline strategies in six key areas that they believe can be combined in different ways in different parts of the world in order to effectively reduce water stress. (Water stress occurs in an area where more than 40% of the available water from rivers is unavailable because it is already being used - a situation that currently affects about a third of the global population, and may affect as many as half the people in the world by the end of the century if the current pattern of water use continues). We separate six key strategy areas for reducing water stress into "hard path" measures, involving building more reservoirs and increasing desalination efforts of sea water, and "soft path" measures that focus on reducing water demand rather than increasing water supply thanks to community-scale efforts and decision-making, combining efficient technology and environmental protection. While there are some economic, cultural and social factors that may make certain of the "soft path" measures such as population control difficult, the "soft path" measures offer the more realistic path forward in terms of reducing water stress by 2050.

Reducing water scarcity possible by 2050: Linking global assessments to policy dimensions

NASA Astrophysics Data System (ADS)

Watts, A.; Turetsky, M. R.; Benscoter, B.; Page, S. E.; Rein, G.; van der Werf, G.

2014-12-01

Water scarcity is not a problem just for the developing world. In California, legislators are currently proposing a $7.5 billion emergency water plan to their voters; and U.S. federal officials last year warned residents of Arizona and Nevada that they could face cuts in Colorado River water deliveries in 2016. Irrigation techniques, industrial and residential habits combined with climate change lie at the root of the problem. But despite what appears to be an insurmountable problem, it is possible to turn the situation around and significantly reduce water scarcity in over next 35 years. We identify outline strategies in six key areas that they believe can be combined in different ways in different parts of the world in order to effectively reduce water stress. (Water stress occurs in an area where more than 40% of the available water from rivers is unavailable because it is already being used - a situation that currently affects about a third of the global population, and may affect as many as half the people in the world by the end of the century if the current pattern of water use continues). We separate six key strategy areas for reducing water stress into "hard path" measures, involving building more reservoirs and increasing desalination efforts of sea water, and "soft path" measures that focus on reducing water demand rather than increasing water supply thanks to community-scale efforts and decision-making, combining efficient technology and environmental protection. While there are some economic, cultural and social factors that may make certain of the "soft path" measures such as population control difficult, the "soft path" measures offer the more realistic path forward in terms of reducing water stress by 2050.

Do Workplace Literacy Programs Promote High Skills or Low Wages? Suggestions for Future Evaluations of Workplace Literacy Programs.

ERIC Educational Resources Information Center

Sarmiento, Tony

Workplace literacy programs can support the path toward either low wages or high skills. Instead of the "high skill" path, most U.S. companies follow the "low wage" path. Depending on who is involved, which program goals are selected, and what planning process is followed, a workplace literacy program can maintain outdated workplaces or foster…

Air Vehicle Path Planning

DTIC Science & Technology

2001-12-13

6-18 6.13. Apollonius Circle for the Case of Two Unequal Power Radars . . . 6-20 6.14. Solution Triangle...Voronoi edge is an Apollonius circle [32, 19]. In this section, we are concerned with the optimality of the Voronoi path for the two radar exposure...Comparison of Cost vs. Path Length for Constrained Trajectories Around and Between Two Radars 6-18 from the two radars is an Apollonius circle

Efficient sampling of parsimonious inversion histories with application to genome rearrangement in Yersinia.

PubMed

Miklós, István; Darling, Aaron E

2009-06-22

Inversions are among the most common mutations acting on the order and orientation of genes in a genome, and polynomial-time algorithms exist to obtain a minimal length series of inversions that transform one genome arrangement to another. However, the minimum length series of inversions (the optimal sorting path) is often not unique as many such optimal sorting paths exist. If we assume that all optimal sorting paths are equally likely, then statistical inference on genome arrangement history must account for all such sorting paths and not just a single estimate. No deterministic polynomial algorithm is known to count the number of optimal sorting paths nor sample from the uniform distribution of optimal sorting paths. Here, we propose a stochastic method that uniformly samples the set of all optimal sorting paths. Our method uses a novel formulation of parallel Markov chain Monte Carlo. In practice, our method can quickly estimate the total number of optimal sorting paths. We introduce a variant of our approach in which short inversions are modeled to be more likely, and we show how the method can be used to estimate the distribution of inversion lengths and breakpoint usage in pathogenic Yersinia pestis. The proposed method has been implemented in a program called "MC4Inversion." We draw comparison of MC4Inversion to the sampler implemented in BADGER and a previously described importance sampling (IS) technique. We find that on high-divergence data sets, MC4Inversion finds more optimal sorting paths per second than BADGER and the IS technique and simultaneously avoids bias inherent in the IS technique.

Surface Navigation Using Optimized Waypoints and Particle Swarm Optimization

NASA Technical Reports Server (NTRS)

Birge, Brian

2013-01-01

The design priority for manned space exploration missions is almost always placed on human safety. Proposed manned surface exploration tasks (lunar, asteroid sample returns, Mars) have the possibility of astronauts traveling several kilometers away from a home base. Deviations from preplanned paths are expected while exploring. In a time-critical emergency situation, there is a need to develop an optimal home base return path. The return path may or may not be similar to the outbound path, and what defines optimal may change with, and even within, each mission. A novel path planning algorithm and prototype program was developed using biologically inspired particle swarm optimization (PSO) that generates an optimal path of traversal while avoiding obstacles. Applications include emergency path planning on lunar, Martian, and/or asteroid surfaces, generating multiple scenarios for outbound missions, Earth-based search and rescue, as well as human manual traversal and/or path integration into robotic control systems. The strategy allows for a changing environment, and can be re-tasked at will and run in real-time situations. Given a random extraterrestrial planetary or small body surface position, the goal was to find the fastest (or shortest) path to an arbitrary position such as a safe zone or geographic objective, subject to possibly varying constraints. The problem requires a workable solution 100% of the time, though it does not require the absolute theoretical optimum. Obstacles should be avoided, but if they cannot be, then the algorithm needs to be smart enough to recognize this and deal with it. With some modifications, it works with non-stationary error topologies as well.

Path planning on cellular nonlinear network using active wave computing technique

NASA Astrophysics Data System (ADS)

Yeniçeri, Ramazan; Yalçın, Müstak E.

2009-05-01

This paper introduces a simple algorithm to solve robot path finding problem using active wave computing techniques. A two-dimensional Cellular Neural/Nonlinear Network (CNN), consist of relaxation oscillators, has been used to generate active waves and to process the visual information. The network, which has been implemented on a Field Programmable Gate Array (FPGA) chip, has the feature of being programmed, controlled and observed by a host computer. The arena of the robot is modelled as the medium of the active waves on the network. Active waves are employed to cover the whole medium with their own dynamics, by starting from an initial point. The proposed algorithm is achieved by observing the motion of the wave-front of the active waves. Host program first loads the arena model onto the active wave generator network and command to start the generation. Then periodically pulls the network image from the generator hardware to analyze evolution of the active waves. When the algorithm is completed, vectorial data image is generated. The path from any of the pixel on this image to the active wave generating pixel is drawn by the vectors on this image. The robot arena may be a complicated labyrinth or may have a simple geometry. But, the arena surface always must be flat. Our Autowave Generator CNN implementation which is settled on the Xilinx University Program Virtex-II Pro Development System is operated by a MATLAB program running on the host computer. As the active wave generator hardware has 16, 384 neurons, an arena with 128 × 128 pixels can be modeled and solved by the algorithm. The system also has a monitor and network image is depicted on the monitor simultaneously.

Response prediction techniques and case studies of a path blocking system based on Global Transmissibility Direct Transmissibility method

NASA Astrophysics Data System (ADS)

Wang, Zengwei; Zhu, Ping; Zhao, Jianxuan

2017-02-01

In this paper, the prediction capabilities of the Global Transmissibility Direct Transmissibility (GTDT) method are further developed. Two path blocking techniques solely using the easily measured variables of the original system to predict the response of a path blocking system are generalized to finite element models of continuous systems. The proposed techniques are derived theoretically in a general form for the scenarios of setting the response of a subsystem to zero and of removing the link between two directly connected subsystems. The objective of this paper is to verify the reliability of the proposed techniques by finite element simulations. Two typical cases, the structural vibration transmission case and the structure-borne sound case, in two different configurations are employed to illustrate the validity of proposed techniques. The points of attention for each case have been discussed, and conclusions are given. It is shown that for the two cases of blocking a subsystem the proposed techniques are able to predict the new response using measured variables of the original system, even though operational forces are unknown. For the structural vibration transmission case of removing a connector between two components, the proposed techniques are available only when the rotational component responses of the connector are very small. The proposed techniques offer relative path measures and provide an alternative way to deal with NVH problems. The work in this paper provides guidance and reference for the engineering application of the GTDT prediction techniques.

Rapid, parallel path planning by propagating wavefronts of spiking neural activity

PubMed Central

Ponulak, Filip; Hopfield, John J.

2013-01-01

Efficient path planning and navigation is critical for animals, robotics, logistics and transportation. We study a model in which spatial navigation problems can rapidly be solved in the brain by parallel mental exploration of alternative routes using propagating waves of neural activity. A wave of spiking activity propagates through a hippocampus-like network, altering the synaptic connectivity. The resulting vector field of synaptic change then guides a simulated animal to the appropriate selected target locations. We demonstrate that the navigation problem can be solved using realistic, local synaptic plasticity rules during a single passage of a wavefront. Our model can find optimal solutions for competing possible targets or learn and navigate in multiple environments. The model provides a hypothesis on the possible computational mechanisms for optimal path planning in the brain, at the same time it is useful for neuromorphic implementations, where the parallelism of information processing proposed here can fully be harnessed in hardware. PMID:23882213

Mobile robots traversability awareness based on terrain visual sensory data fusion

NASA Astrophysics Data System (ADS)

Shirkhodaie, Amir

2007-04-01

In this paper, we have presented methods that significantly improve the robot awareness of its terrain traversability conditions. The terrain traversability awareness is achieved by association of terrain image appearances from different poses and fusion of extracted information from multimodality imaging and range sensor data for localization and clustering environment landmarks. Initially, we describe methods for extraction of salient features of the terrain for the purpose of landmarks registration from two or more images taken from different via points along the trajectory path of the robot. The method of image registration is applied as a means of overlaying (two or more) of the same terrain scene at different viewpoints. The registration geometrically aligns salient landmarks of two images (the reference and sensed images). A Similarity matching techniques is proposed for matching the terrain salient landmarks. Secondly, we present three terrain classifier models based on rule-based, supervised neural network, and fuzzy logic for classification of terrain condition under uncertainty and mapping the robot's terrain perception to apt traversability measures. This paper addresses the technical challenges and navigational skill requirements of mobile robots for traversability path planning in natural terrain environments similar to Mars surface terrains. We have described different methods for detection of salient terrain features based on imaging texture analysis techniques. We have also presented three competing techniques for terrain traversability assessment of mobile robots navigating in unstructured natural terrain environments. These three techniques include: a rule-based terrain classifier, a neural network-based terrain classifier, and a fuzzy-logic terrain classifier. Each proposed terrain classifier divides a region of natural terrain into finite sub-terrain regions and classifies terrain condition exclusively within each sub-terrain region based on terrain spatial and textural cues.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Coleman, Jody Rustyn; Poland, Richard W.

A system and method for the secure storage and transmission of data is provided. A data aggregate device can be configured to receive secure data from a data source, such as a sensor, and encrypt the secure data using a suitable encryption technique, such as a shared private key technique, a public key encryption technique, a Diffie-Hellman key exchange technique, or other suitable encryption technique. The encrypted secure data can be provided from the data aggregate device to different remote devices over a plurality of segregated or isolated data paths. Each of the isolated data paths can include an optoisolatormore » that is configured to provide one-way transmission of the encrypted secure data from the data aggregate device over the isolated data path. External data can be received through a secure data filter which, by validating the external data, allows for key exchange and other various adjustments from an external source.« less

Authenticated sensor interface device

DOE Office of Scientific and Technical Information (OSTI.GOV)

Coleman, Jody Rustyn; Poland, Richard W.

A system and method for the secure storage and transmission of data is provided. A data aggregate device can be configured to receive secure data from a data source, such as a sensor, and encrypt the secure data using a suitable encryption technique, such as a shared private key technique, a public key encryption technique, a Diffie-Hellman key exchange technique, or other suitable encryption technique. The encrypted secure data can be provided from the data aggregate device to different remote devices over a plurality of segregated or isolated data paths. Each of the isolated data paths can include an optoisolatormore » that is configured to provide one-way transmission of the encrypted secure data from the data aggregate device over the isolated data path. External data can be received through a secure data filter which, by validating the external data, allows for key exchange and other various adjustments from an external source.« less

Extraction of Airport Features from High Resolution Satellite Imagery for Design and Risk Assessment

NASA Technical Reports Server (NTRS)

Robinson, Chris; Qiu, You-Liang; Jensen, John R.; Schill, Steven R.; Floyd, Mike

2001-01-01

The LPA Group, consisting of 17 offices located throughout the eastern and central United States is an architectural, engineering and planning firm specializing in the development of Airports, Roads and Bridges. The primary focus of this ARC project is concerned with assisting their aviation specialists who work in the areas of Airport Planning, Airfield Design, Landside Design, Terminal Building Planning and design, and various other construction services. The LPA Group wanted to test the utility of high-resolution commercial satellite imagery for the purpose of extracting airport elevation features in the glide path areas surrounding the Columbia Metropolitan Airport. By incorporating remote sensing techniques into their airport planning process, LPA wanted to investigate whether or not it is possible to save time and money while achieving the equivalent accuracy as traditional planning methods. The Affiliate Research Center (ARC) at the University of South Carolina investigated the use of remotely sensed imagery for the extraction of feature elevations in the glide path zone. A stereo pair of IKONOS panchromatic satellite images, which has a spatial resolution of 1 x 1 m, was used to determine elevations of aviation obstructions such as buildings, trees, towers and fence-lines. A validation dataset was provided by the LPA Group to assess the accuracy of the measurements derived from the IKONOS imagery. The initial goal of this project was to test the utility of IKONOS imagery in feature extraction using ERDAS Stereo Analyst. This goal was never achieved due to problems with ERDAS software support of the IKONOS sensor model and the unavailability of imperative sensor model information from Space Imaging. The obstacles encountered in this project pertaining to ERDAS Stereo Analyst and IKONOS imagery will be reviewed in more detail later in this report. As a result of the technical difficulties with Stereo Analyst, ERDAS OrthoBASE was used to derive aviation obstruction measurements for this project. After collecting ancillary data such as GPS locations, South Carolina Geodetic Survey and Aero Dynamics ground survey points to set up the OrthoBASE Block File, measurements were taken of the various glide path obstructions and compared to the validation dataset. This process yielded the following conclusions: The IKONOS stereo model in conjunction with Imagine OrthoBASE can provide The LPA Group with a fast and cost efficient method for assessing aviation obstructions. Also, by creating our own stereo model we achieved any accuracy better currently available commercial products.

Pedestrian flow-path modeling to support tsunami-evacuation planning

NASA Astrophysics Data System (ADS)

Wood, N. J.; Jones, J. M.; Schmidtlein, M.

2015-12-01

Near-field tsunami hazards are credible threats to many coastal communities throughout the world. Along the U.S. Pacific Northwest coast, low-lying areas could be inundated by a series of catastrophic tsunamis potentially arriving in a matter of minutes following a Cascadia subduction zone (CSZ) earthquake. We developed a geospatial-modeling method for characterizing pedestrian-evacuation flow paths and evacuation basins to support evacuation and relief planning efforts for coastal communities in this region. We demonstrate this approach using the coastal communities of Aberdeen, Hoquiam, and Cosmopolis in southwestern Grays Harbor County, Washington (USA), where previous research suggests approximately 20,500 people (99% of the residents in tsunami-hazard zones) will likely have enough time to evacuate before tsunami-wave arrival. Geospatial, anisotropic, path distance models were developed to map the most efficient pedestrian paths to higher ground from locations within the tsunami-hazard zone. This information was then used to identify evacuation basins, outlining neighborhoods sharing a common evacuation pathway to safety. We then estimated the number of people traveling along designated evacuation pathways and arriving at pre-determined safe assembly areas, helping determine shelter demand and relief support (e.g., for elderly individuals or tourists). Finally, we assessed which paths may become inaccessible due to earthquake-induced ground failures, a factor which may impact an individual's success in reaching safe ground. The presentation will include a discussion of the implications of our analysis for developing more comprehensive coastal community tsunami-evacuation planning strategies worldwide.

Comparison of path visualizations and cognitive measures relative to travel technique in a virtual environment.

PubMed

Zanbaka, Catherine A; Lok, Benjamin C; Babu, Sabarish V; Ulinski, Amy C; Hodges, Larry F

2005-01-01

We describe a between-subjects experiment that compared four different methods of travel and their effect on cognition and paths taken in an immersive virtual environment (IVE). Participants answered a set of questions based on Crook's condensation of Bloom's taxonomy that assessed their cognition of the IVE with respect to knowledge, understanding and application, and higher mental processes. Participants also drew a sketch map of the IVE and the objects within it. The users' sense of presence was measured using the Steed-Usoh-Slater Presence Questionnaire. The participants' position and head orientation were automatically logged during their exposure to the virtual environment. These logs were later used to create visualizations of the paths taken. Path analysis, such as exploring the overlaid path visualizations and dwell data information, revealed further differences among the travel techniques. Our results suggest that, for applications where problem solving and evaluation of information is important or where opportunity to train is minimal, then having a large tracked space so that the participant can walk around the virtual environment provides benefits over common virtual travel techniques.

Statistical Symbolic Execution with Informed Sampling

NASA Technical Reports Server (NTRS)

Filieri, Antonio; Pasareanu, Corina S.; Visser, Willem; Geldenhuys, Jaco

2014-01-01

Symbolic execution techniques have been proposed recently for the probabilistic analysis of programs. These techniques seek to quantify the likelihood of reaching program events of interest, e.g., assert violations. They have many promising applications but have scalability issues due to high computational demand. To address this challenge, we propose a statistical symbolic execution technique that performs Monte Carlo sampling of the symbolic program paths and uses the obtained information for Bayesian estimation and hypothesis testing with respect to the probability of reaching the target events. To speed up the convergence of the statistical analysis, we propose Informed Sampling, an iterative symbolic execution that first explores the paths that have high statistical significance, prunes them from the state space and guides the execution towards less likely paths. The technique combines Bayesian estimation with a partial exact analysis for the pruned paths leading to provably improved convergence of the statistical analysis. We have implemented statistical symbolic execution with in- formed sampling in the Symbolic PathFinder tool. We show experimentally that the informed sampling obtains more precise results and converges faster than a purely statistical analysis and may also be more efficient than an exact symbolic analysis. When the latter does not terminate symbolic execution with informed sampling can give meaningful results under the same time and memory limits.

On-Line Path Generation and Tracking for High-Speed Wheeled Autonomous Vehicles

DTIC Science & Technology

2006-02-17

On-Line Path Generation and Tracking for High-Speed Wheeled Autonomous Vehicles Report Title ABSTRACT In this work we proposed two semi-analytic...298-102 Enclosure 1 On-Line Path Generation and Tracking for High-Speed Wheeled Autonomous Vehicles by...Specifically, the following problems will be addressed during this project: 2.1 Challenges The problem of trajectory planning for high-speed autonomous vehicles is

Navigating the Path to a Biomedical Science Career

NASA Astrophysics Data System (ADS)

Zimmerman, Andrea McNeely

The number of biomedical PhD scientists being trained and graduated far exceeds the number of academic faculty positions and academic research jobs. If this trend is compelling biomedical PhD scientists to increasingly seek career paths outside of academia, then more should be known about their intentions, desires, training experiences, and career path navigation. Therefore, the purpose of this study was to understand the process through which biomedical PhD scientists are trained and supported for navigating future career paths. In addition, the study sought to determine whether career development support efforts and opportunities should be redesigned to account for the proportion of PhD scientists following non-academic career pathways. Guided by the social cognitive career theory (SCCT) framework this study sought to answer the following central research question: How does a southeastern tier 1 research university train and support its biomedical PhD scientists for navigating their career paths? Key findings are: Many factors influence PhD scientists' career sector preference and job search process, but the most influential were relationships with faculty, particularly the mentor advisor; Planned activities are a significant aspect of the training process and provide skills for career success; and Planned activities provided skills necessary for a career, but influential factors directed the career path navigated. Implications for practice and future research are discussed.

Software for Project-Based Learning of Robot Motion Planning

ERIC Educational Resources Information Center

Moll, Mark; Bordeaux, Janice; Kavraki, Lydia E.

2013-01-01

Motion planning is a core problem in robotics concerned with finding feasible paths for a given robot. Motion planning algorithms perform a search in the high-dimensional continuous space of robot configurations and exemplify many of the core algorithmic concepts of search algorithms and associated data structures. Motion planning algorithms can…

Application of a distributed systems architecture for increased speed in image processing on an autonomous ground vehicle

NASA Astrophysics Data System (ADS)

Wright, Adam A.; Momin, Orko; Shin, Young Ho; Shakya, Rahul; Nepal, Kumud; Ahlgren, David J.

2010-01-01

This paper presents the application of a distributed systems architecture to an autonomous ground vehicle, Q, that participates in both the autonomous and navigation challenges of the Intelligent Ground Vehicle Competition. In the autonomous challenge the vehicle is required to follow a course, while avoiding obstacles and staying within the course boundaries, which are marked by white lines. For the navigation challenge, the vehicle is required to reach a set of target destinations, known as way points, with given GPS coordinates and avoid obstacles that it encounters in the process. Previously the vehicle utilized a single laptop to execute all processing activities including image processing, sensor interfacing and data processing, path planning and navigation algorithms and motor control. National Instruments' (NI) LabVIEW served as the programming language for software implementation. As an upgrade to last year's design, a NI compact Reconfigurable Input/Output system (cRIO) was incorporated to the system architecture. The cRIO is NI's solution for rapid prototyping that is equipped with a real time processor, an FPGA and modular input/output. Under the current system, the real time processor handles the path planning and navigation algorithms, the FPGA gathers and processes sensor data. This setup leaves the laptop to focus on running the image processing algorithm. Image processing as previously presented by Nepal et. al. is a multi-step line extraction algorithm and constitutes the largest processor load. This distributed approach results in a faster image processing algorithm which was previously Q's bottleneck. Additionally, the path planning and navigation algorithms are executed more reliably on the real time processor due to the deterministic nature of operation. The implementation of this architecture required exploration of various inter-system communication techniques. Data transfer between the laptop and the real time processor using UDP packets was established as the most reliable protocol after testing various options. Improvement can be made to the system by migrating more algorithms to the hardware based FPGA to further speed up the operations of the vehicle.

Planning nonlinear access paths for temporal bone surgery.

PubMed

Fauser, Johannes; Sakas, Georgios; Mukhopadhyay, Anirban

2018-05-01

Interventions at the otobasis operate in the narrow region of the temporal bone where several highly sensitive organs define obstacles with minimal clearance for surgical instruments. Nonlinear trajectories for potential minimally invasive interventions can provide larger distances to risk structures and optimized orientations of surgical instruments, thus improving clinical outcomes when compared to existing linear approaches. In this paper, we present fast and accurate planning methods for such nonlinear access paths. We define a specific motion planning problem in [Formula: see text] with notable constraints in computation time and goal pose that reflect the requirements of temporal bone surgery. We then present [Formula: see text]-RRT-Connect: two suitable motion planners based on bidirectional Rapidly exploring Random Tree (RRT) to solve this problem efficiently. The benefits of [Formula: see text]-RRT-Connect are demonstrated on real CT data of patients. Their general performance is shown on a large set of realistic synthetic anatomies. We also show that these new algorithms outperform state-of-the-art methods based on circular arcs or Bézier-Splines when applied to this specific problem. With this work, we demonstrate that preoperative and intra-operative planning of nonlinear access paths is possible for minimally invasive surgeries at the otobasis.

Integrating obstacle avoidance, global path planning, visual cue detection, and landmark triangulation in a mobile robot

NASA Astrophysics Data System (ADS)

Kortenkamp, David; Huber, Marcus J.; Congdon, Clare B.; Huffman, Scott B.; Bidlack, Clint R.; Cohen, Charles J.; Koss, Frank V.; Raschke, Ulrich; Weymouth, Terry E.

1993-05-01

This paper describes the design and implementation of an integrated system for combining obstacle avoidance, path planning, landmark detection and position triangulation. Such an integrated system allows the robot to move from place to place in an environment, avoiding obstacles and planning its way out of traps, while maintaining its position and orientation using distinctive landmarks. The task the robot performs is to search a 22 m X 22 m arena for 10 distinctive objects, visiting each object in turn. This same task was recently performed by a dozen different robots at a competition in which the robot described in this paper finished first.

Planification de trajectoires pour placement automatise de fibres sur surfaces de geometries complexes

NASA Astrophysics Data System (ADS)

Hely, Clement

During the past 50 years, the use of composite materials drastically increase, mainly thanks to the interest of aeronautical industries for these strong and lightweight materials. To improve the productivity of composite materials manufacturing some of the largest aeronautics companies began to develop automated processes such as Automated Fibre Placement (AFP). The AFP workcells currently used by the industry were mainly developed for production of large, nearly flat, plates with low curvatures such as aircraft fuselages. However, the fields of aeronautics and sport goods production begin nowadays to show an interest for manufacturing of smaller and more complex parts. The aim of the project in which this research takes place is to design a new AFP workcell and to develop new techniques allowing production of parts with small size and complex geometry. The work presented in this thesis focuses on the path planning on multi-axial revolution surfaces, e.g. Y-shaped tubes of constant circular cross section. Several path planning algorithms will be presented aiming at the exhaustive coverage of a mandrel with pre-impregnated (prepreg) composite tape. The methodology used in two of these algorithms is to individually cover each branch of the Y-shaped part with paths deriving from a helix. In the first one, the helix will be cut at the boundary between a branch and the junction region (algorithm HD) while in the second (algorithm HA) the pseudo-helix path can be adjusted to follow this boundary. These two methods were shown to have some drawbacks compromising their practical use and possibly leading to parts with diminished mechanical properties. To avoid these drawbacks, two others algorithms were developed with a new methodology. With them, the aim is to cover two branches of the Y-shape with a continuous course (i.e. without cut). The first one uses a well known strategy which defines plies with a constant fibre orientation. Parallel paths are then computed to generate a full and uniform ply covering two branches. Once again this method suffers from a main drawback, namely that it can produce highly curved paths leading to manufacturing defects. To overcome this limitation, a last algorithm is proposed ensuring that the maximal curvature of a trajectory stays below a fixed threshold. However, fulfilling this constraint prevents to predict the complete shape of the path and to ensure a perfectly uniform coverage. It is thus proposed to generate an exhaustive set of trajectories having different shapes and covering all the part. Then, a selection algorithm is used to choose the ones which are best suited according to selection criteria. To help the definition of these criteria, a finite element analysis is conducted to give some insight concerning the best suited shapes for specific loading cases. Finally, simulations were carried out with a workcell constituted by a robotic manipulator associated with a rotary table to verify the feasibility of the paths generated by the different algorithms.

Measuring The Neutron Lifetime to One Second Using in Beam Techniques

NASA Astrophysics Data System (ADS)

Mulholland, Jonathan; NIST In Beam Lifetime Collaboration

2013-10-01

The decay of the free neutron is the simplest nuclear beta decay and is the prototype for charged current semi-leptonic weak interactions. A precise value for the neutron lifetime is required for consistency tests of the Standard Model and is an essential parameter in the theory of Big Bang Nucleosynthesis. A new measurement of the neutron lifetime using the in-beam method is planned at the National Institute of Standards and Technology Center for Neutron Research. The systematic effects associated with the in-beam method are markedly different than those found in storage experiments utilizing ultracold neutrons. Experimental improvements, specifically recent advances in the determination of absolute neutron fluence, should permit an overall uncertainty of 1 second on the neutron lifetime. The technical improvements in the in-beam technique, and the path toward improving the precision of the new measurement will be discussed.

UAV Cooperation Architectures for Persistent Sensing

DOE Office of Scientific and Technical Information (OSTI.GOV)

Roberts, R S; Kent, C A; Jones, E D

2003-03-20

With the number of small, inexpensive Unmanned Air Vehicles (UAVs) increasing, it is feasible to build multi-UAV sensing networks. In particular, by using UAVs in conjunction with unattended ground sensors, a degree of persistent sensing can be achieved. With proper UAV cooperation algorithms, sensing is maintained even though exceptional events, e.g., the loss of a UAV, have occurred. In this paper a cooperation technique that allows multiple UAVs to perform coordinated, persistent sensing with unattended ground sensors over a wide area is described. The technique automatically adapts the UAV paths so that on the average, the amount of time thatmore » any sensor has to wait for a UAV revisit is minimized. We also describe the Simulation, Tactical Operations and Mission Planning (STOMP) software architecture. This architecture is designed to help simulate and operate distributed sensor networks where multiple UAVs are used to collect data.« less

Propagation effects handbook for satellite systems design. A summary of propagation impairments on 10 to 100 GHz satellite links with techniques for system design

NASA Technical Reports Server (NTRS)

Ippolito, Louis J.

1989-01-01

The NASA Propagation Effects Handbook for Satellite Systems Design provides a systematic compilation of the major propagation effects experienced on space-Earth paths in the 10 to 100 GHz frequency band region. It provides both a detailed description of the propagation phenomenon and a summary of the impact of the effect on the communications system design and performance. Chapter 2 through 5 describe the propagation effects, prediction models, and available experimental data bases. In Chapter 6, design techniques and prediction methods available for evaluating propagation effects on space-Earth communication systems are presented. Chapter 7 addresses the system design process and how the effects of propagation on system design and performance should be considered and how that can be mitigated. Examples of operational and planned Ku, Ka, and EHF satellite communications systems are given.

NASA High-Reynolds Number Circulation Control Research - Overview of CFD and Planned Experiments

NASA Technical Reports Server (NTRS)

Milholen, W. E., II; Jones, Greg S.; Cagle, Christopher M.

2010-01-01

A new capability to test active flow control concepts and propulsion simulations at high Reynolds numbers in the National Transonic Facility at the NASA Langley Research Center is being developed. This technique is focused on the use of semi-span models due to their increased model size and relative ease of routing high-pressure air to the model. A new dual flow-path high-pressure air delivery station has been designed, along with a new high performance transonic sem -si pan wing model. The modular wind tunnel model is designed for testing circulation control concepts at both transonic cruise and low-speed high-lift conditions. The ability of the model to test other active flow control techniques will be highlighted. In addition, a new higher capacity semi-span force and moment wind tunnel balance has been completed and calibrated to enable testing at transonic conditions.

Whitecap coverage from aerial photography

NASA Technical Reports Server (NTRS)

Austin, R. W.

1970-01-01

A program for determining the feasibility of deriving sea surface wind speeds by remotely sensing ocean surface radiances in the nonglitter regions is discussed. With a knowledge of the duration and geographical extent of the wind field, information about the conventional sea state may be derived. The use of optical techniques for determining sea state has obvious limitations. For example, such means can be used only in daylight and only when a clear path of sight is available between the sensor and the surface. However, sensors and vehicles capable of providing the data needed for such techniques are planned for the near future; therefore, a secondary or backup capability can be provided with little added effort. The information currently being sought regarding white water coverage is also of direct interest to those working with passive microwave systems, the study of energy transfer between winds and ocean currents, the aerial estimation of wind speeds, and many others.

Calibration of block 4 translator path delays at DSS 14 and CTA 21

NASA Technical Reports Server (NTRS)

Otoshi, T. Y.; Batelaan, P. D.; Wallace, K. B.; Ibanez, F.

1977-01-01

The techniques for calibrating the translator path by means of a portable zero delay device are described. In addition, some translator path data taken at DSS 14, Goldstone, over a period of about one year is presented.

Hayabusa Re-Entry: Trajectory Analysis and Observation Mission Design

NASA Technical Reports Server (NTRS)

Cassell, Alan M.; Winter, Michael W.; Allen, Gary A.; Grinstead, Jay H.; Antimisiaris, Manny E.; Albers, James; Jenniskens, Peter

2011-01-01

On June 13th, 2010, the Hayabusa sample return capsule successfully re-entered Earth s atmosphere over the Woomera Prohibited Area in southern Australia in its quest to return fragments from the asteroid 1998 SF36 Itokawa . The sample return capsule entered at a super-orbital velocity of 12.04 km/sec (inertial), making it the second fastest human-made object to traverse the atmosphere. The NASA DC-8 airborne observatory was utilized as an instrument platform to record the luminous portion of the sample return capsule re-entry (60 sec) with a variety of on-board spectroscopic imaging instruments. The predicted sample return capsule s entry state information at 200 km altitude was propagated through the atmosphere to generate aerothermodynamic and trajectory data used for initial observation flight path design and planning. The DC- 8 flight path was designed by considering safety, optimal sample return capsule viewing geometry and aircraft capabilities in concert with key aerothermodynamic events along the predicted trajectory. Subsequent entry state vector updates provided by the Deep Space Network team at NASA s Jet Propulsion Laboratory were analyzed after the planned trajectory correction maneuvers to further refine the DC-8 observation flight path. Primary and alternate observation flight paths were generated during the mission planning phase which required coordination with Australian authorities for pre-mission approval. The final observation flight path was chosen based upon trade-offs between optimal viewing requirements, ground based observer locations (to facilitate post-flight trajectory reconstruction), predicted weather in the Woomera Prohibited Area and constraints imposed by flight path filing deadlines. To facilitate sample return capsule tracking by the instrument operators, a series of two racetrack flight path patterns were performed prior to the observation leg so the instruments could be pointed towards the region in the star background where the sample return capsule was expected to become visible. An overview of the design methodologies and trade-offs used in the Hayabusa re-entry observation campaign are presented.

Financial Planning for Retirement: An Imperative for Baby Boomer Women.

ERIC Educational Resources Information Center

Glass, J. Conrad, Jr.; Kilpatrick, Beverly B.

1998-01-01

Many women fail to plan for retirement due to economic constraints, interrupted career paths, lower earnings, gender bias, gender-role socialization, self-esteem, role definition, locus of control, or risk tolerance. Retirement education must address women's specific issues regarding financial planning. (SK)

When the 'soft-path' gets hard: demand management and financial instability for water utilities

NASA Astrophysics Data System (ADS)

Zeff, H. B.; Characklis, G. W.

2014-12-01

In the past, cost benefit analysis (CBA) has been viewed as an effective means of evaluating water utility strategies, particularly those that were dependent on the construction of new supply infrastructure. As water utilities have begun to embrace 'soft-path' approaches as a way to reduce the need for supply-centric development, CBA fails to recognize some important financial incentives affected by reduced water consumption. Demand management, both as a short-term response to drought and in longer-term actions to accommodate demand growth, can introduce revenue risks that adversely affect a utility's ability to repay debt, re-invest in aging infrastructure, or maintain reserve funds for use in a short-term emergency. A utility that does not generate sufficient revenue to support these functions may be subject to credit rating downgrades, which in turn affect the interest rate it pays on its debt. Interest rates are a critical consideration for utility managers in the capital-intensive water sector, where debt payments for infrastructure often account for a large portion of a utility's overall costs. Even a small increase in interest rates can add millions of dollars to the cost of new infrastructure. Recent studies have demonstrated that demand management techniques can lead to significant revenue variability, and credit rating agencies have begun to take notice of drought response plans when evaluating water utility credit ratings, providing utilities with a disincentive to fully embrace soft-path approaches. This analysis examines the impact of demand management schemes on key credit rating metrics for a water utility in Raleigh, North Carolina. The utility's consumer base is currently experiencing rapid population growth, and demand management has the potential to reduce the dependence on costly new supply infrastructure but could lead to financial instability that will significantly increase the costs of financing future projects. This work analyzes how 'soft-path' approaches might be more efficiently integrated with investment in supply-side infrastructure and suggests how financial hedging tools could be used to improve long-term utility planning objectives.

Efficient Sampling of Parsimonious Inversion Histories with Application to Genome Rearrangement in Yersinia

PubMed Central

Darling, Aaron E.

2009-01-01

Inversions are among the most common mutations acting on the order and orientation of genes in a genome, and polynomial-time algorithms exist to obtain a minimal length series of inversions that transform one genome arrangement to another. However, the minimum length series of inversions (the optimal sorting path) is often not unique as many such optimal sorting paths exist. If we assume that all optimal sorting paths are equally likely, then statistical inference on genome arrangement history must account for all such sorting paths and not just a single estimate. No deterministic polynomial algorithm is known to count the number of optimal sorting paths nor sample from the uniform distribution of optimal sorting paths. Here, we propose a stochastic method that uniformly samples the set of all optimal sorting paths. Our method uses a novel formulation of parallel Markov chain Monte Carlo. In practice, our method can quickly estimate the total number of optimal sorting paths. We introduce a variant of our approach in which short inversions are modeled to be more likely, and we show how the method can be used to estimate the distribution of inversion lengths and breakpoint usage in pathogenic Yersinia pestis. The proposed method has been implemented in a program called “MC4Inversion.” We draw comparison of MC4Inversion to the sampler implemented in BADGER and a previously described importance sampling (IS) technique. We find that on high-divergence data sets, MC4Inversion finds more optimal sorting paths per second than BADGER and the IS technique and simultaneously avoids bias inherent in the IS technique. PMID:20333186

Airline meteorological requirements

NASA Technical Reports Server (NTRS)

Chandler, C. L.; Pappas, J.

1985-01-01

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.

AIDS education for a low literate audience in Zambia.

PubMed

Msimuko, A K

1988-04-01

A workshop funded by the USA Program for Appropriate Technology in Health (PATH) was an effort by Zambia toward prevention and control of AIDS. The lack of educational materials about AIDS for a low-literate audience was the major problem addressed by the workshop. Other problems include the lack of collaborative effort in the development of materials on AIDS, and the lack of skills needed in the development of such materials in Zambia. 1 of the objectives of the workshop was to launch the Planned Parenthood Association of Zambia's (PPAZ) materials development project. The scope of this project includes the production of educational materials on AIDS for low-literate audiences and a counseling handbook for family planning workers. Print materials should be simply written, using words, idioms, and graphics that are familiar to the target audience. Other workshop objectives included the establishment of collaborative relationships between organizations involved in existing AIDS educational activities in Zambia, and the development of practical skills needed to produce print materials. Education was identified as the most important strategy for the prevention and control of AIDS, and PPAZ should be the executing agency of the print materials project. Audience research, using focus group techniques, focus group discussions, behavioral messages, and pretesting of messages, should be the most effective means of reaching targeted audiences. PPAZ is contracted by PATH to begin development of educational materials, and 2 committees have formed to implement the project and to establish interagency collaboration. Audience research was begun between January and March of 1988, focusing on people's beliefs, practices, and ideas about AIDS. The final phase of the project will be the printing, distribution, and use of the AIDS materials and the training of family planning field workers in the proper use of these materials.

Mapping chemicals in air using an environmental CAT scanning system: evaluation of algorithms

NASA Astrophysics Data System (ADS)

Samanta, A.; Todd, L. A.

A new technique is being developed which creates near real-time maps of chemical concentrations in air for environmental and occupational environmental applications. This technique, we call Environmental CAT Scanning, combines the real-time measuring technique of open-path Fourier transform infrared spectroscopy with the mapping capabilitites of computed tomography to produce two-dimensional concentration maps. With this system, a network of open-path measurements is obtained over an area; measurements are then processed using a tomographic algorithm to reconstruct the concentrations. This research focussed on the process of evaluating and selecting appropriate reconstruction algorithms, for use in the field, by using test concentration data from both computer simultation and laboratory chamber studies. Four algorithms were tested using three types of data: (1) experimental open-path data from studies that used a prototype opne-path Fourier transform/computed tomography system in an exposure chamber; (2) synthetic open-path data generated from maps created by kriging point samples taken in the chamber studies (in 1), and; (3) synthetic open-path data generated using a chemical dispersion model to create time seires maps. The iterative algorithms used to reconstruct the concentration data were: Algebraic Reconstruction Technique without Weights (ART1), Algebraic Reconstruction Technique with Weights (ARTW), Maximum Likelihood with Expectation Maximization (MLEM) and Multiplicative Algebraic Reconstruction Technique (MART). Maps were evaluated quantitatively and qualitatively. In general, MART and MLEM performed best, followed by ARTW and ART1. However, algorithm performance varied under different contaminant scenarios. This study showed the importance of using a variety of maps, particulary those generated using dispersion models. The time series maps provided a more rigorous test of the algorithms and allowed distinctions to be made among the algorithms. A comprehensive evaluation of algorithms, for the environmental application of tomography, requires the use of a battery of test concentration data before field implementation, which models reality and tests the limits of the algorithms.

Task Decomposition Module For Telerobot Trajectory Generation

NASA Astrophysics Data System (ADS)

Wavering, Albert J.; Lumia, Ron

1988-10-01

A major consideration in the design of trajectory generation software for a Flight Telerobotic Servicer (FTS) is that the FTS will be called upon to perform tasks which require a diverse range of manipulator behaviors and capabilities. In a hierarchical control system where tasks are decomposed into simpler and simpler subtasks, the task decomposition module which performs trajectory planning and execution should therefore be able to accommodate a wide range of algorithms. In some cases, it will be desirable to plan a trajectory for an entire motion before manipulator motion commences, as when optimizing over the entire trajectory. Many FTS motions, however, will be highly sensory-interactive, such as moving to attain a desired position relative to a non-stationary object whose position is periodically updated by a vision system. In this case, the time-varying nature of the trajectory may be handled either by frequent replanning using updated sensor information, or by using an algorithm which creates a less specific state-dependent plan that determines the manipulator path as the trajectory is executed (rather than a priori). This paper discusses a number of trajectory generation techniques from these categories and how they may be implemented in a task decompo-sition module of a hierarchical control system. The structure, function, and interfaces of the proposed trajectory gener-ation module are briefly described, followed by several examples of how different algorithms may be performed by the module. The proposed task decomposition module provides a logical structure for trajectory planning and execution, and supports a large number of published trajectory generation techniques.

A computer-guided minimally-invasive technique for orthodontic forced eruption of impacted canines.

PubMed

BERTELè, Matteo; Minniti, Paola P; Dalessandri, Domenico; Bonetti, Stefano; Visconti, Luca; Paganelli, Corrado

2016-06-01

The aim of this study was to develop a computer-guided minimally-invasive protocol for the surgical application of an orthodontic traction during the forced eruption of an impacted canine. 3Diagnosys® software was used to evaluate impacted canines position and to plan the surgical access, taking into account soft and hard tissues thickness, orthodontic traction path and presence of possible obstacles. Geomagic® software was used for reverse engineering and RhinocerosTM software was employed as three-dimensional modeller in preparing individualized surgical guides. Surgical access was gained flapless through the use of a mucosal punch for soft tissues, followed by a trephine bur with a pre-adjusted stop for bone path creation. A diamond bur mounted on SONICflex® 2003/L handpiece was used to prepare a 2-mm-deep calibrated hole into the canine enamel where a titanium screw connected with a stainless steel ligature was screwed. In-vitro pull-out tests, radiological and SEM analysis were realized in order to investigate screw stability and position. In two out of ten samples the screw was removed after the application of a 1-kg pull-out force. Radiological and SEM analysis demonstrated that all the screws were inserted into the enamel without affecting dentine integrity. This computer-guided minimally-invasive technique allowed a precise and reliable positioning of screws utilized during the orthodontic traction of impacted canines.

Long Range Navigation for Mars Rovers Using Sensor-Based Path Planning and Visual Localisation

NASA Technical Reports Server (NTRS)

Laubach, Sharon L.; Olson, Clark F.; Burdick, Joel W.; Hayati, Samad

1999-01-01

The Mars Pathfinder mission illustrated the benefits of including a mobile robotic explorer on a planetary mission. However, for future Mars rover missions, significantly increased autonomy in navigation is required in order to meet demanding mission criteria. To address these requirements, we have developed new path planning and localisation capabilities that allow a rover to navigate robustly to a distant landmark. These algorithms have been implemented on the JPL Rocky 7 prototype microrover and have been tested extensively in the JPL MarsYard, as well as in natural terrain.

Dynamic Programming Algorithms for Planning and Robotics in Continuous Domains and the Hamilton-Jacobi Equation

DTIC Science & Technology

2008-09-22

provision of law, no person shall be subject to a penalty for failing to comply with a collection of information if it does not display a currently...CLASSIFICATION OF: 17. LIMITATION OF ABSTRACT Same as Report (SAR) 18. NUMBER OF PAGES 72 19a. NAME OF RESPONSIBLE PERSON a . REPORT unclassified b...2008 Ian Mitchell, University of British Columbia 3 Basic Path Planning • Find the optimal path p(s) to a target (or from a source) • Inputs – Cost c

Energy-optimal path planning by stochastic dynamically orthogonal level-set optimization

NASA Astrophysics Data System (ADS)

Subramani, Deepak N.; Lermusiaux, Pierre F. J.

2016-04-01

A stochastic optimization methodology is formulated for computing energy-optimal paths from among time-optimal paths of autonomous vehicles navigating in a dynamic flow field. Based on partial differential equations, the methodology rigorously leverages the level-set equation that governs time-optimal reachability fronts for a given relative vehicle-speed function. To set up the energy optimization, the relative vehicle-speed and headings are considered to be stochastic and new stochastic Dynamically Orthogonal (DO) level-set equations are derived. Their solution provides the distribution of time-optimal reachability fronts and corresponding distribution of time-optimal paths. An optimization is then performed on the vehicle's energy-time joint distribution to select the energy-optimal paths for each arrival time, among all stochastic time-optimal paths for that arrival time. Numerical schemes to solve the reduced stochastic DO level-set equations are obtained, and accuracy and efficiency considerations are discussed. These reduced equations are first shown to be efficient at solving the governing stochastic level-sets, in part by comparisons with direct Monte Carlo simulations. To validate the methodology and illustrate its accuracy, comparisons with semi-analytical energy-optimal path solutions are then completed. In particular, we consider the energy-optimal crossing of a canonical steady front and set up its semi-analytical solution using a energy-time nested nonlinear double-optimization scheme. We then showcase the inner workings and nuances of the energy-optimal path planning, considering different mission scenarios. Finally, we study and discuss results of energy-optimal missions in a wind-driven barotropic quasi-geostrophic double-gyre ocean circulation.

Usability of light-emitting diodes in precision approach path indicator systems by individuals with marginal color vision.

DOT National Transportation Integrated Search

2014-05-01

To save energy, the FAA is planning to convert from incandescent lights to light-emitting diodes (LEDs) in : precision approach path indicator (PAPI) systems. Preliminary work on the usability of LEDs by color vision-waivered pilots (Bullough, Skinne...

Optical information processing at NASA Ames Research Center

NASA Technical Reports Server (NTRS)

Reid, Max B.; Bualat, Maria G.; Cho, Young C.; Downie, John D.; Gary, Charles K.; Ma, Paul W.; Ozcan, Meric; Pryor, Anna H.; Spirkovska, Lilly

1993-01-01

The combination of analog optical processors with digital electronic systems offers the potential of tera-OPS computational performance, while often requiring less power and weight relative to all-digital systems. NASA is working to develop and demonstrate optical processing techniques for on-board, real time science and mission applications. Current research areas and applications under investigation include optical matrix processing for space structure vibration control and the analysis of Space Shuttle Main Engine plume spectra, optical correlation-based autonomous vision for robotic vehicles, analog computation for robotic path planning, free-space optical interconnections for information transfer within digital electronic computers, and multiplexed arrays of fiber optic interferometric sensors for acoustic and vibration measurements.

Natural environment support guidelines for space shuttle tests and operations

NASA Technical Reports Server (NTRS)

Carter, E. A.; Brown, S. C.

1974-01-01

All space shuttle events from launch through solid rocket booster recovery and orbiter landing are considered in terms of constraints placed on those operations by the natural environment. Thunderstorm activity is discussed as an example of a possible hazard. The activities most likely to require advanced detection and monitoring techniques are identified as those from deorbit decision to Orbiter landing. The inflexible flight plan will require the transmission of real time wind profile information below 24 km and warnings of thunderstorms or turbulence in the Orbiter flight path. Extensive aerial reconnaissance and communication facilities and procedures to permit immediate transmission of aircraft reports to the mission control authority and to the Orbiter will also be required.

Path probability of stochastic motion: A functional approach

NASA Astrophysics Data System (ADS)

Hattori, Masayuki; Abe, Sumiyoshi

2016-06-01

The path probability of a particle undergoing stochastic motion is studied by the use of functional technique, and the general formula is derived for the path probability distribution functional. The probability of finding paths inside a tube/band, the center of which is stipulated by a given path, is analytically evaluated in a way analogous to continuous measurements in quantum mechanics. Then, the formalism developed here is applied to the stochastic dynamics of stock price in finance.

Kinematic state estimation and motion planning for stochastic nonholonomic systems using the exponential map

PubMed Central

Park, Wooram; Liu, Yan; Zhou, Yu; Moses, Matthew; Chirikjian, Gregory S.

2010-01-01

SUMMARY A nonholonomic system subjected to external noise from the environment, or internal noise in its own actuators, will evolve in a stochastic manner described by an ensemble of trajectories. This ensemble of trajectories is equivalent to the solution of a Fokker–Planck equation that typically evolves on a Lie group. If the most likely state of such a system is to be estimated, and plans for subsequent motions from the current state are to be made so as to move the system to a desired state with high probability, then modeling how the probability density of the system evolves is critical. Methods for solving Fokker-Planck equations that evolve on Lie groups then become important. Such equations can be solved using the operational properties of group Fourier transforms in which irreducible unitary representation (IUR) matrices play a critical role. Therefore, we develop a simple approach for the numerical approximation of all the IUR matrices for two of the groups of most interest in robotics: the rotation group in three-dimensional space, SO(3), and the Euclidean motion group of the plane, SE(2). This approach uses the exponential mapping from the Lie algebras of these groups, and takes advantage of the sparse nature of the Lie algebra representation matrices. Other techniques for density estimation on groups are also explored. The computed densities are applied in the context of probabilistic path planning for kinematic cart in the plane and flexible needle steering in three-dimensional space. In these examples the injection of artificial noise into the computational models (rather than noise in the actual physical systems) serves as a tool to search the configuration spaces and plan paths. Finally, we illustrate how density estimation problems arise in the characterization of physical noise in orientational sensors such as gyroscopes. PMID:20454468

DOE Office of Scientific and Technical Information (OSTI.GOV)

Thangadurai, P.; Lumelsky, Yulia; Silverstein, Michael S.

Transmission electron microscopy (TEM) cross-section specimens of PMMA in contact with gold and Si were prepared by focused ion beam (FIB) and compared with plan-view PMMA specimens prepared by a dip-coating technique. The specimens were characterized by TEM and electron energy loss spectroscopy (EELS). In the cross-section specimens, the thin films of PMMA were located in a Si-PMMA-Au multilayer. Different thicknesses of PMMA films were spin-coated on the Si substrates. The thickness of the TEM specimens prepared by FIB was estimated using EELS to be 0.65 of the plasmon mean-free-path. Along the PMMA-Au interface, Au particle diffusion into the PMMAmore » was observed, and the size of the Au particles was in the range of 2-4 nm. Dip-coating of PMMA directly on Cu TEM grids resulted in thin specimens with a granular morphology, with a thickness of 0.58 of the plasmon mean-free-path. The dip-coated specimens were free from ion milling induced artifacts, and thus serve as control specimens for comparison with the cross-sectioned specimens prepared by FIB.« less

Design and analysis of advanced flight planning concepts

NASA Technical Reports Server (NTRS)

Sorensen, John A.

1987-01-01

The objectives of this continuing effort are to develop and evaluate new algorithms and advanced concepts for flight management and flight planning. This includes the minimization of fuel or direct operating costs, the integration of the airborne flight management and ground-based flight planning processes, and the enhancement of future traffic management systems design. Flight management (FMS) concepts are for on-board profile computation and steering of transport aircraft in the vertical plane between a city pair and along a given horizontal path. Flight planning (FPS) concepts are for the pre-flight ground based computation of the three-dimensional reference trajectory that connects the city pair and specifies the horizontal path, fuel load, and weather profiles for initializing the FMS. As part of these objectives, a new computer program called EFPLAN has been developed and utilized to study advanced flight planning concepts. EFPLAN represents an experimental version of an FPS. It has been developed to generate reference flight plans compatible as input to an FMS and to provide various options for flight planning research. This report describes EFPLAN and the associated research conducted in its development.

Modeling of tool path for the CNC sheet cutting machines

NASA Astrophysics Data System (ADS)

Petunin, Aleksandr A.

2015-11-01

In the paper the problem of tool path optimization for CNC (Computer Numerical Control) cutting machines is considered. The classification of the cutting techniques is offered. We also propose a new classification of toll path problems. The tasks of cost minimization and time minimization for standard cutting technique (Continuous Cutting Problem, CCP) and for one of non-standard cutting techniques (Segment Continuous Cutting Problem, SCCP) are formalized. We show that the optimization tasks can be interpreted as discrete optimization problem (generalized travel salesman problem with additional constraints, GTSP). Formalization of some constraints for these tasks is described. For the solution GTSP we offer to use mathematical model of Prof. Chentsov based on concept of a megalopolis and dynamic programming.

The Futurist Perspective: Implications for Community College Planning.

ERIC Educational Resources Information Center

Nicholson, R. Stephen; Keyser, John S.

Community college managers would probably acknowledge the importance of planning, but might not accept the need to adopt a futuristic perspective on educational planning. One of the characteristics of futurists is a belief that the future is a created reality, not a consequence of random events. Futurists conceive possible paths, examine…

76 FR 51463 - Petition for Waiver of Compliance

Federal Register 2010, 2011, 2012, 2013, 2014

2011-08-18

... territory. Specifically, this petition is made in connection with the implementation of PATH's Automatic Train Control (ATC) project and the plan to use unequipped PA-4 cars as maintenance-of-way (MOW) work... control (CBTC) technology throughout the PATH rail network, as described in the Positive Train Control...

NASA's Radioisotope Power Systems - Plans

NASA Technical Reports Server (NTRS)

Hamley, John A.; Mccallum, Peter W.; Sandifer, Carl E., II; Sutliff, Thomas J.; Zakrajsek, June F.

2015-01-01

NASA's Radioisotope Power Systems (RPS) Program continues to plan and implement content to enable planetary exploration where such systems could be needed, and to prepare more advanced RPS technology for possible infusion into future power systems. The 2014-2015 period saw significant changes, and strong progress. Achievements of near-term objectives have enabled definition of a clear path forward in which payoffs from research investments and other sustaining efforts can be applied. The future implementation path is expected to yield a higher-performing thermoelectric generator design, a more isotope-fuel efficient system concept design, and a robust RPS infrastructure maintained effectively within both NASA and the Department of Energy. This paper describes recent work with an eye towards the future plans that result from these achievements.

The path to active living: physical activity through community design in Somerville, Massachusetts.

PubMed

Burke, Noreen M; Chomitz, Virginia R; Rioles, Nicole A; Winslow, Stephen P; Brukilacchio, Lisa B; Baker, Jessie C

2009-12-01

Somerville, Massachusetts, an ethnically diverse, urban community northwest of Boston, presents opportunities and challenges for active living. With a dense street grid, well-maintained sidewalks, neighborhood parks, and existing Community Path, Somerville is very walkable. However, two major surface arteries traverse and bisect neighborhoods, creating pedestrian safety and environmental justice issues. Major goals included promoting increased collaboration and communication among existing active-living efforts; managing the Community Path extension project; encouraging Portuguese-speaking adults to incorporate daily physical activity; leveraging existing urban planning work to establish secure, attractive walking/biking corridors; and embedding active-living messages in everyday life. The Somerville Active Living by Design Partnership (ALbD) successfully created a robust task force that was integrated with citywide active-living efforts, secured resources to increase infrastructure and support for active living, including city-level coordinator positions, and changed decision-making practices that led to incorporation of pedestrian and bicycle transportation priorities into city planning and that influenced the extension of the Community Path. Partnerships must employ sustainability planning early on, utilize skilled facilitative leaders to manage leadership transitions, and engage new partners. Identifying, cultivating, and celebrating champions, especially those with political power, are critical. Working closely with research partners leads to rich data sources for planning and evaluation. Changing the built environment is difficult; working toward smaller wins is realistic and achievable. The synergy of ALbD and other community interventions created a foundation for short-term successes and accelerated political-cultural changes already underway with respect to active living.

Autonomous Lawnmower using FPGA implementation.

NASA Astrophysics Data System (ADS)

Ahmad, Nabihah; Lokman, Nabill bin; Helmy Abd Wahab, Mohd

2016-11-01

Nowadays, there are various types of robot have been invented for multiple purposes. The robots have the special characteristic that surpass the human ability and could operate in extreme environment which human cannot endure. In this paper, an autonomous robot is built to imitate the characteristic of a human cutting grass. A Field Programmable Gate Array (FPGA) is used to control the movements where all data and information would be processed. Very High Speed Integrated Circuit (VHSIC) Hardware Description Language (VHDL) is used to describe the hardware using Quartus II software. This robot has the ability of avoiding obstacle using ultrasonic sensor. This robot used two DC motors for its movement. It could include moving forward, backward, and turning left and right. The movement or the path of the automatic lawn mower is based on a path planning technique. Four Global Positioning System (GPS) plot are set to create a boundary. This to ensure that the lawn mower operates within the area given by user. Every action of the lawn mower is controlled by the FPGA DE' Board Cyclone II with the help of the sensor. Furthermore, Sketch Up software was used to design the structure of the lawn mower. The autonomous lawn mower was able to operate efficiently and smoothly return to coordinated paths after passing the obstacle. It uses 25% of total pins available on the board and 31% of total Digital Signal Processing (DSP) blocks.

Context Aware TCP for Intelligence, Surveillance and Reconnaissance Missions on Autonomous Platforms

DTIC Science & Technology

2014-10-08

under the Unmanned Vehicle Experimental Communications Testbed (UVECT) flight test plan and were done over the Stockbridge Research Facility in the...sure the payload did not interfere with the command and control systems of the aircraft several flight paths were selected to exert the link and the...throughput from data source to destination. Figure 1 shows the flight path of a small RPA in a PoL flight path scenario. The change of SNR

Robotic Online Path Planning on Point Cloud.

PubMed

Liu, Ming

2016-05-01

This paper deals with the path-planning problem for mobile wheeled- or tracked-robot which drive in 2.5-D environments, where the traversable surface is usually considered as a 2-D-manifold embedded in a 3-D ambient space. Specially, we aim at solving the 2.5-D navigation problem using raw point cloud as input. The proposed method is independent of traditional surface parametrization or reconstruction methods, such as a meshing process, which generally has high-computational complexity. Instead, we utilize the output of 3-D tensor voting framework on the raw point clouds. The computation of tensor voting is accelerated by optimized implementation on graphics computation unit. Based on the tensor voting results, a novel local Riemannian metric is defined using the saliency components, which helps the modeling of the latent traversable surface. Using the proposed metric, we prove that the geodesic in the 3-D tensor space leads to rational path-planning results by experiments. Compared to traditional methods, the results reveal the advantages of the proposed method in terms of smoothing the robot maneuver while considering the minimum travel distance.

Spreading paths in partially observed social networks

NASA Astrophysics Data System (ADS)

Onnela, Jukka-Pekka; Christakis, Nicholas A.

2012-03-01

Understanding how and how far information, behaviors, or pathogens spread in social networks is an important problem, having implications for both predicting the size of epidemics, as well as for planning effective interventions. There are, however, two main challenges for inferring spreading paths in real-world networks. One is the practical difficulty of observing a dynamic process on a network, and the other is the typical constraint of only partially observing a network. Using static, structurally realistic social networks as platforms for simulations, we juxtapose three distinct paths: (1) the stochastic path taken by a simulated spreading process from source to target; (2) the topologically shortest path in the fully observed network, and hence the single most likely stochastic path, between the two nodes; and (3) the topologically shortest path in a partially observed network. In a sampled network, how closely does the partially observed shortest path (3) emulate the unobserved spreading path (1)? Although partial observation inflates the length of the shortest path, the stochastic nature of the spreading process also frequently derails the dynamic path from the shortest path. We find that the partially observed shortest path does not necessarily give an inflated estimate of the length of the process path; in fact, partial observation may, counterintuitively, make the path seem shorter than it actually is.

Spreading paths in partially observed social networks.

PubMed

Onnela, Jukka-Pekka; Christakis, Nicholas A

2012-03-01

Understanding how and how far information, behaviors, or pathogens spread in social networks is an important problem, having implications for both predicting the size of epidemics, as well as for planning effective interventions. There are, however, two main challenges for inferring spreading paths in real-world networks. One is the practical difficulty of observing a dynamic process on a network, and the other is the typical constraint of only partially observing a network. Using static, structurally realistic social networks as platforms for simulations, we juxtapose three distinct paths: (1) the stochastic path taken by a simulated spreading process from source to target; (2) the topologically shortest path in the fully observed network, and hence the single most likely stochastic path, between the two nodes; and (3) the topologically shortest path in a partially observed network. In a sampled network, how closely does the partially observed shortest path (3) emulate the unobserved spreading path (1)? Although partial observation inflates the length of the shortest path, the stochastic nature of the spreading process also frequently derails the dynamic path from the shortest path. We find that the partially observed shortest path does not necessarily give an inflated estimate of the length of the process path; in fact, partial observation may, counterintuitively, make the path seem shorter than it actually is.

Optimization of magnet end-winding geometry

NASA Astrophysics Data System (ADS)

Reusch, Michael F.; Weissenburger, Donald W.; Nearing, James C.

1994-03-01

A simple, almost entirely analytic, method for the optimization of stress-reduced magnet-end winding paths for ribbon-like superconducting cable is presented. This technique is based on characterization of these paths as developable surfaces, i.e., surfaces whose intrinsic geometry is flat. The method is applicable to winding mandrels of arbitrary geometry. Computational searches for optimal winding paths are easily implemented via the technique. Its application to the end configuration of cylindrical Superconducting Super Collider (SSC)-type magnets is discussed. The method may be useful for other engineering problems involving the placement of thin sheets of material.

Optical remote measurement of toxic gases

NASA Technical Reports Server (NTRS)

Grant, W. B.; Kagann, R. H.; McClenny, W. A.

1992-01-01

Enactment of the Clean Air Act Amendments (CAAA) of 1990 has resulted in increased ambient air monitoring needs for industry, some of which may be met efficiently using open-path optical remote sensing techniques. These techniques include Fourier transform spectroscopy, differential optical absorption spectroscopy, laser long-path absorption, differential absorption lidar, and gas cell correlation spectroscopy. With this regulatory impetus, it is an opportune time to consider applying these technologies to the remote and/or path-averaged measurement and monitoring of toxic gases covered by the CAAA. This article reviews the optical remote sensing technology and literature for that application.

Sensitivity analysis of an optimization-based trajectory planner for autonomous vehicles in urban environments

NASA Astrophysics Data System (ADS)

Hardy, Jason; Campbell, Mark; Miller, Isaac; Schimpf, Brian

2008-10-01

The local path planner implemented on Cornell's 2007 DARPA Urban Challenge entry vehicle Skynet utilizes a novel mixture of discrete and continuous path planning steps to facilitate a safe, smooth, and human-like driving behavior. The planner first solves for a feasible path through the local obstacle map using a grid based search algorithm. The resulting path is then refined using a cost-based nonlinear optimization routine with both hard and soft constraints. The behavior of this optimization is influenced by tunable weighting parameters which govern the relative cost contributions assigned to different path characteristics. This paper studies the sensitivity of the vehicle's performance to these path planner weighting parameters using a data driven simulation based on logged data from the National Qualifying Event. The performance of the path planner in both the National Qualifying Event and in the Urban Challenge is also presented and analyzed.

Traverse Planning with Temporal-Spatial Constraints

NASA Technical Reports Server (NTRS)

Bresina, John L.; Morris, Paul H.; Deans, Mathew C.; Cohen, Tamar E.; Lees, David S.

2017-01-01

We present an approach to planning rover traverses in a domain that includes temporal-spatial constraints. We are using the NASA Resource Prospector mission as a reference mission in our research. The objective of this mission is to explore permanently shadowed regions at a Lunar pole. Most of the time the rover is required to avoid being in shadow. This requirement depends on where the rover is located and when it is at that location. Such a temporal-spatial constraint makes traverse planning more challenging for both humans and machines. We present a mixed-initiative traverse planner which addresses this challenge. This traverse planner is part of the Exploration Ground Data Systems (xGDS), which we have enhanced with new visualization features, new analysis tools, and new automation for path planning, in order to be applicable to the Re-source Prospector mission. The key concept that is the basis of the analysis tools and that supports the automated path planning is reachability in this dynamic environment due to the temporal-spatial constraints.

Planning for execution monitoring on a planetary rover

NASA Technical Reports Server (NTRS)

Gat, Erann; Firby, R. James; Miller, David P.

1990-01-01

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.

The Teratology Society 2007 strategic planning session: a desire to inspire.

PubMed

2008-05-01

On April 18-20, 2007, the Teratology Society held its third strategic planning session (SPS) in San Diego, CA. The purpose of this session was to build on the successful work generated by the previous strategic plans [Nashville, TN 2002 and Cincinnati, OH 1997] and importantly, to provide a path forward to inspire the Society, create deeper connections with members that speak to their individual passion for the science of teratology and to increase the Society's visibility within the larger scientific community. The following summary report provides an overview of the session's pre-work, objective, and discussions. A total of 24 attendees were present at the session. The group included representation from Council, various committees and different members constituencies. This plan and the activities subsequent to the session will provide a path forward for our Society for the next five years.

Method and apparatus for timing of laser beams in a multiple laser beam fusion system

DOEpatents

Eastman, Jay M.; Miller, Theodore L.

1981-01-01

The optical path lengths of a plurality of comparison laser beams directed to impinge upon a common target from different directions are compared to that of a master laser beam by using an optical heterodyne interferometric detection technique. The technique consists of frequency shifting the master laser beam and combining the master beam with a first one of the comparison laser beams to produce a time-varying heterodyne interference pattern which is detected by a photo-detector to produce an AC electrical signal indicative of the difference in the optical path lengths of the two beams which were combined. The optical path length of this first comparison laser beam is adjusted to compensate for the detected difference in the optical path lengths of the two beams. The optical path lengths of all of the comparison laser beams are made equal to the optical path length of the master laser beam by repeating the optical path length adjustment process for each of the comparison laser beams. In this manner, the comparison laser beams are synchronized or timed to arrive at the target within .+-.1.times.10.sup.-12 second of each other.

Analysis of switch and examine combining with post-examining selection in cognitive radio

NASA Astrophysics Data System (ADS)

Agarwal, Rupali; Srivastava, Neelam; Katiyar, Himanshu

2018-06-01

To perform spectrum sensing in fading environment is one of the most challenging tasks for a CR system. Diversity combining schemes are used to combat the effect of fading and hence detection probability of CR gets improved. Among many diversity combining techniques, switched diversity offers one of the lowest complexity solutions. The receiver embedded with switched diversity looks for an acceptable diversity path (having signal to noise ratio (SNR) above the required threshold) to receive the data. In conventional switch and examine combining (SEC) scheme, when no acceptable path is found after all the paths are examined, the receiver randomly chooses an unacceptable path. Switch and examine combining with post-examining selection (SECp) is a modified version of conventional SEC. In SECp, the conventional SEC scheme is altered in a way that it selects the best path when no acceptable path is found after all paths have been examined. In this paper, formula for probability of detection ( ?) is derived using SECp and SEC diversity combining technique over Rayleigh fading channel. Also the performance of SECp is compared with SEC and no diversity case. Performance comparison is done with the help of SNR vs. ? and complementary receiver operating characteristic curves.

Enroute flight-path planning - Cooperative performance of flight crews and knowledge-based systems

NASA Technical Reports Server (NTRS)

Smith, Philip J.; Mccoy, Elaine; Layton, Chuck; Galdes, Deb

1989-01-01

Interface design issues associated with the introduction of knowledge-based systems into the cockpit are discussed. Such issues include not only questions about display and control design, they also include deeper system design issues such as questions about the alternative roles and responsibilities of the flight crew and the computer system. In addition, the feasibility of using enroute flight path planning as a context for exploring such research questions is considered. In particular, the development of a prototyping shell that allows rapid design and study of alternative interfaces and system designs is discussed.

SU-F-J-197: A Novel Intra-Beam Range Detection and Adaptation Strategy for Particle Therapy

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chen, M; Jiang, S; Shao, Y

2016-06-15

Purpose: In-vivo range detection/verification is crucial in particle therapy for effective and safe delivery. The state-of-art techniques are not sufficient for in-vivo on-line range verification due to conflicts among patient dose, signal statistics and imaging time. We propose a novel intra-beam range detection and adaptation strategy for particle therapy. Methods: This strategy uses the planned mid-range spots as probing beams without adding extra radiation to patients. Such choice of probing beams ensures the Bragg peaks to remain inside the tumor even with significant range variation from the plan. It offers sufficient signal statistics for in-beam positron emission tomography (PET) duemore » to high positron activity of therapeutic dose. The probing beam signal can be acquired and reconstructed using in-beam PET that allows for delineation of the Bragg peaks and detection of range shift with ease of detection enabled by single-layered spots. If the detected range shift is within a pre-defined tolerance, the remaining spots will be delivered as the original plan. Otherwise, a fast re-optimization using range-shifted beamlets and accounting for the probing beam dose is applied to consider the tradeoffs posed by the online anatomy. Simulated planning and delivery studies were used to demonstrate the effectiveness of the proposed techniques. Results: Simulations with online range variations due to shifts of various foreign objects into the beam path showed successful delineation of the Bragg peaks as a result of delivering probing beams. Without on-line delivery adaptation, dose distribution was significantly distorted. In contrast, delivery adaptation incorporating detected range shift recovered well the planned dose. Conclusion: The proposed intra-beam range detection and adaptation utilizing the planned mid-range spots as probing beams, which illuminate the beam range with strong and accurate PET signals, is a safe, practical, yet effective approach to address range uncertainty issues in particle therapy.« less

Novel Diffusivity Measurement Technique

NASA Technical Reports Server (NTRS)

Rashidnia, Nasser

2001-01-01

A common-path interferometer (CPI) system was developed to measure the diffusivity of liquid pairs. The CPI is an optical technique that can be used to measure changes in the gradient of the refraction index of transparent materials. This system uses a shearing interferometer that shares the same optical path from a laser light source to the final imaging plane. Hence, the molecular diffusion coefficient of liquids can be determined using the physical relations between changes in the optical path length and the liquid phase properties. The data obtained with this interferometer were compared with similar results from other techniques and demonstrated that the instrument is superior in measuring the diffusivity of miscible liquids while keeping the system very compact and robust. CPI can also be used for studies in interface dynamics and other diffusion-dominated-process applications.

Scenario Planning at College of Marin.

ERIC Educational Resources Information Center

College of Marin, Kentfield, CA.

This article reviews the scenario planning process implemented at the College of Marin (California). Scenario planning is a creative process in which a group of people who share a common fate develop stories about different ways their future might unfold, and use these stories to make decisions about what path to take. The Global Business Network…

A Vision System For A Mars Rover

NASA Astrophysics Data System (ADS)

Wilcox, Brian H.; Gennery, Donald B.; Mishkin, Andrew H.; Cooper, Brian K.; Lawton, Teri B.; Lay, N. Keith; Katzmann, Steven P.

1987-01-01

A Mars rover must be able to sense its local environment with sufficient resolution and accuracy to avoid local obstacles and hazards while moving a significant distance each day. Power efficiency and reliability are extremely important considerations, making stereo correlation an attractive method of range sensing compared to laser scanning, if the computational load and correspondence errors can be handled. Techniques for treatment of these problems, including the use of more than two cameras to reduce correspondence errors and possibly to limit the computational burden of stereo processing, have been tested at JPL. Once a reliable range map is obtained, it must be transformed to a plan view and compared to a stored terrain database, in order to refine the estimated position of the rover and to improve the database. The slope and roughness of each terrain region are computed, which form the basis for a traversability map allowing local path planning. Ongoing research and field testing of such a system is described.

A vision system for a Mars rover

NASA Technical Reports Server (NTRS)

Wilcox, Brian H.; Gennery, Donald B.; Mishkin, Andrew H.; Cooper, Brian K.; Lawton, Teri B.; Lay, N. Keith; Katzmann, Steven P.

1988-01-01

A Mars rover must be able to sense its local environment with sufficient resolution and accuracy to avoid local obstacles and hazards while moving a significant distance each day. Power efficiency and reliability are extremely important considerations, making stereo correlation an attractive method of range sensing compared to laser scanning, if the computational load and correspondence errors can be handled. Techniques for treatment of these problems, including the use of more than two cameras to reduce correspondence errors and possibly to limit the computational burden of stereo processing, have been tested at JPL. Once a reliable range map is obtained, it must be transformed to a plan view and compared to a stored terrain database, in order to refine the estimated position of the rover and to improve the database. The slope and roughness of each terrain region are computed, which form the basis for a traversability map allowing local path planning. Ongoing research and field testing of such a system is described.

Improved Results for Route Planning in Stochastic Transportation Networks

NASA Technical Reports Server (NTRS)

Boyan, Justin; Mitzenmacher, Michael

2000-01-01

In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times are not determined by a fixed schedule but instead may be random. the problem requires more than standard shortest path techniques. In recent work, Datar and Ranade provide algorithms in the case where bus arrivals are assumed to be independent and exponentially distributed. We offer solutions to two important generalizations of the problem, answering open questions posed by Datar and Ranade. First, we provide a polynomial time algorithm for a much wider class of arrival distributions, namely those with increasing failure rate. This class includes not only exponential distributions but also uniform, normal, and gamma distributions. Second, in the case where bus arrival times are independent and geometric discrete random variable,. we provide an algorithm for transportation networks of buses and trains, where trains run according to a fixed schedule.

GOS hook type wells, directional planning, techniques applied and problems encountered

DOE Office of Scientific and Technical Information (OSTI.GOV)

A /Azim, M.; Fahmy, H.; Salem, A.

1995-10-01

This paper addresses the various aspects of hook type wells introduced and drilled within GUPCO operations during he last two years. The first well of this category was October-G10, drilled in October 1992 from October ``G`` platform to a target point in the Nubia formation. Several wells of the same type have been drilled through 1993 and 1994. This group includes October-H1, Ramadan 3-57, July 62-69 and SB 374-3. Drilling hook type well profiles has resulted in increased production and more reserve recovery. The driving force behind using this profile was the reservoir requirements where it was required to hitmore » a target within few meters at a certain angle and direction. Torque and drag models have been used to optimize well path planning, resulting in lower torque and drag values. Daily pot appraisal of the drilling operations to monitor hole cleaning effectiveness. Combination of advanced steerable systems and PDC bits enabled GUPCO to drill these wells cost effectively.« less

Reinventing Your Career: Following the 5 New Paths to Career Fulfillment.

ERIC Educational Resources Information Center

Logan, David C.; Kritzell, Bryan

This book is designed to help individuals reinvent their careers by analyzing the current state of their careers, identifying career objectives suited to their individual and family needs, and developing personal strategic action plans for achieving career fulfillment in five new career path options: corporate climber, new entrepreneur,…

For Teachers, a Better Kind of Pension Plan

ERIC Educational Resources Information Center

Winters, Marcus A.

2017-01-01

Public school teachers deserve a compensation system that puts them on a secure path toward retirement. The severely backloaded structure of today's public school teacher pension systems benefit only a small proportion of entering teachers while putting the rest on an insecure retirement path. But there is a cost-neutral solution to this problem…

Orientation Guidance and Control for Marine Vehicles in the Horizontal Plane

DTIC Science & Technology

1991-06-01

FIELD GROUP SUB-GROUP Autonomous vehicles , Guidance and control, Stability, Path keeping 19 ABSIRACT (Continue on reverse if necessary and identify by...following in 3-D space. 33 LIST OF REFERENCES 1. Kanayama, Y. and Hartman, B.I. (1989) " Smooth local path planning for autonomous vehicles , " Proceeding

Explore the Many Paths to Leadership

ERIC Educational Resources Information Center

Crow, Tracy

2015-01-01

The road to leadership is not necessarily one that educators plan carefully with a series of logical steps. Certainly some educators start as teachers and then systematically work through a traditional hierarchy on their way to the superintendency. No matter their role or their path, education leaders demand more from themselves and others and…

Alternative Paths to Entry: New Jersey and Elsewhere.

ERIC Educational Resources Information Center

Uhler, Sayre

In 1983, New Jersey's governor, Tom Keane, proposed the Alternative Path to Certification as a means to alleviate the state's growing teacher shortage. At least 12 other states are now using similar plans to recruit teachers possessing liberal arts bachelor's degrees who have passed a standardized test and completed successfully a one-year…

Many Paths to Skilled Employment: A Reverse Tracer Study of Seven Occupations in Colombia.

ERIC Educational Resources Information Center

Ziderman, Adrian; Horn, Robin

1995-01-01

Employs reverse tracer techniques to identify alternative training paths for selected skilled and semiskilled occupations in Colombia. Shows that workers pursue various alternative training paths to acquire essential occupational skills. Strong public intervention in training markets should be discouraged, as choices would be narrowed and the…

New paradigms in internal architecture design and freeform fabrication of tissue engineering porous scaffolds.

PubMed

Yoo, Dongjin

2012-07-01

Advanced additive manufacture (AM) techniques are now being developed to fabricate scaffolds with controlled internal pore architectures in the field of tissue engineering. In general, these techniques use a hybrid method which combines computer-aided design (CAD) with computer-aided manufacturing (CAM) tools to design and fabricate complicated three-dimensional (3D) scaffold models. The mathematical descriptions of micro-architectures along with the macro-structures of the 3D scaffold models are limited by current CAD technologies as well as by the difficulty of transferring the designed digital models to standard formats for fabrication. To overcome these difficulties, we have developed an efficient internal pore architecture design system based on triply periodic minimal surface (TPMS) unit cell libraries and associated computational methods to assemble TPMS unit cells into an entire scaffold model. In addition, we have developed a process planning technique based on TPMS internal architecture pattern of unit cells to generate tool paths for freeform fabrication of tissue engineering porous scaffolds. Copyright © 2012 IPEM. Published by Elsevier Ltd. All rights reserved.

Radial polar histogram: obstacle avoidance and path planning for robotic cognition and motion control

NASA Astrophysics Data System (ADS)

Wang, Po-Jen; Keyawa, Nicholas R.; Euler, Craig

2012-01-01

In order to achieve highly accurate motion control and path planning for a mobile robot, an obstacle avoidance algorithm that provided a desired instantaneous turning radius and velocity was generated. This type of obstacle avoidance algorithm, which has been implemented in California State University Northridge's Intelligent Ground Vehicle (IGV), is known as Radial Polar Histogram (RPH). The RPH algorithm utilizes raw data in the form of a polar histogram that is read from a Laser Range Finder (LRF) and a camera. A desired open block is determined from the raw data utilizing a navigational heading and an elliptical approximation. The left and right most radii are determined from the calculated edges of the open block and provide the range of possible radial paths the IGV can travel through. In addition, the calculated obstacle edge positions allow the IGV to recognize complex obstacle arrangements and to slow down accordingly. A radial path optimization function calculates the best radial path between the left and right most radii and is sent to motion control for speed determination. Overall, the RPH algorithm allows the IGV to autonomously travel at average speeds of 3mph while avoiding all obstacles, with a processing time of approximately 10ms.

Integrated Flight Path Planning System and Flight Control System for Unmanned Helicopters

PubMed Central

Jan, Shau Shiun; Lin, Yu Hsiang

2011-01-01

This paper focuses on the design of an integrated navigation and guidance system for unmanned helicopters. The integrated navigation system comprises two systems: the Flight Path Planning System (FPPS) and the Flight Control System (FCS). The FPPS finds the shortest flight path by the A-Star (A*) algorithm in an adaptive manner for different flight conditions, and the FPPS can add a forbidden zone to stop the unmanned helicopter from crossing over into dangerous areas. In this paper, the FPPS computation time is reduced by the multi-resolution scheme, and the flight path quality is improved by the path smoothing methods. Meanwhile, the FCS includes the fuzzy inference systems (FISs) based on the fuzzy logic. By using expert knowledge and experience to train the FIS, the controller can operate the unmanned helicopter without dynamic models. The integrated system of the FPPS and the FCS is aimed at providing navigation and guidance to the mission destination and it is implemented by coupling the flight simulation software, X-Plane, and the computing software, MATLAB. Simulations are performed and shown in real time three-dimensional animations. Finally, the integrated system is demonstrated to work successfully in controlling the unmanned helicopter to operate in various terrains of a digital elevation model (DEM). PMID:22164029

Integrated flight path planning system and flight control system for unmanned helicopters.

PubMed

Jan, Shau Shiun; Lin, Yu Hsiang

2011-01-01

This paper focuses on the design of an integrated navigation and guidance system for unmanned helicopters. The integrated navigation system comprises two systems: the Flight Path Planning System (FPPS) and the Flight Control System (FCS). The FPPS finds the shortest flight path by the A-Star (A*) algorithm in an adaptive manner for different flight conditions, and the FPPS can add a forbidden zone to stop the unmanned helicopter from crossing over into dangerous areas. In this paper, the FPPS computation time is reduced by the multi-resolution scheme, and the flight path quality is improved by the path smoothing methods. Meanwhile, the FCS includes the fuzzy inference systems (FISs) based on the fuzzy logic. By using expert knowledge and experience to train the FIS, the controller can operate the unmanned helicopter without dynamic models. The integrated system of the FPPS and the FCS is aimed at providing navigation and guidance to the mission destination and it is implemented by coupling the flight simulation software, X-Plane, and the computing software, MATLAB. Simulations are performed and shown in real time three-dimensional animations. Finally, the integrated system is demonstrated to work successfully in controlling the unmanned helicopter to operate in various terrains of a digital elevation model (DEM).

Directed Incremental Symbolic Execution

NASA Technical Reports Server (NTRS)

Person, Suzette; Yang, Guowei; Rungta, Neha; Khurshid, Sarfraz

2011-01-01

The last few years have seen a resurgence of interest in the use of symbolic execution -- a program analysis technique developed more than three decades ago to analyze program execution paths. Scaling symbolic execution and other path-sensitive analysis techniques to large systems remains challenging despite recent algorithmic and technological advances. An alternative to solving the problem of scalability is to reduce the scope of the analysis. One approach that is widely studied in the context of regression analysis is to analyze the differences between two related program versions. While such an approach is intuitive in theory, finding efficient and precise ways to identify program differences, and characterize their effects on how the program executes has proved challenging in practice. In this paper, we present Directed Incremental Symbolic Execution (DiSE), a novel technique for detecting and characterizing the effects of program changes. The novelty of DiSE is to combine the efficiencies of static analysis techniques to compute program difference information with the precision of symbolic execution to explore program execution paths and generate path conditions affected by the differences. DiSE is a complementary technique to other reduction or bounding techniques developed to improve symbolic execution. Furthermore, DiSE does not require analysis results to be carried forward as the software evolves -- only the source code for two related program versions is required. A case-study of our implementation of DiSE illustrates its effectiveness at detecting and characterizing the effects of program changes.

UCAV path planning in the presence of radar-guided surface-to-air missile threats

NASA Astrophysics Data System (ADS)

Zeitz, Frederick H., III

This dissertation addresses the problem of path planning for unmanned combat aerial vehicles (UCAVs) in the presence of radar-guided surface-to-air missiles (SAMs). The radars, collocated with SAM launch sites, operate within the structure of an Integrated Air Defense System (IADS) that permits communication and cooperation between individual radars. The problem is formulated in the framework of the interaction between three sub-systems: the aircraft, the IADS, and the missile. The main features of this integrated model are: The aircraft radar cross section (RCS) depends explicitly on both the aspect and bank angles; hence, the RCS and aircraft dynamics are coupled. The probabilistic nature of IADS tracking is accounted for; namely, the probability that the aircraft has been continuously tracked by the IADS depends on the aircraft RCS and range from the perspective of each radar within the IADS. Finally, the requirement to maintain tracking prior to missile launch and during missile flyout are also modeled. Based on this model, the problem of UCAV path planning is formulated as a minimax optimal control problem, with the aircraft bank angle serving as control. Necessary conditions of optimality for this minimax problem are derived. Based on these necessary conditions, properties of the optimal paths are derived. These properties are used to discretize the dynamic optimization problem into a finite-dimensional, nonlinear programming problem that can be solved numerically. Properties of the optimal paths are also used to initialize the numerical procedure. A homotopy method is proposed to solve the finite-dimensional, nonlinear programming problem, and a heuristic method is proposed to improve the discretization during the homotopy process. Based upon the properties of numerical solutions, a method is proposed for parameterizing and storing information for later recall in flight to permit rapid replanning in response to changing threats. Illustrative examples are presented that confirm the standard flying tactics of "denying range, aspect, and aim," by yielding flight paths that "weave" to avoid long exposures of aspects with large RCS.

Design of an advanced flight planning system

NASA Technical Reports Server (NTRS)

Sorensen, J. A.; Goka, T.

1985-01-01

The demand for both fuel conservation and four-dimensional traffic management require that the preflight planning process be designed to account for advances in airborne flight management and weather forecasting. The steps and issues in designing such an advanced flight planning system are presented. Focus is placed on the different optimization options for generating the three-dimensional reference path. For the cruise phase, one can use predefined jet routes, direct routes based on a network of evenly spaced grid points, or a network where the grid points are existing navaid locations. Each choice has its own problem in determining an optimum solution. Finding the reference path is further complicated by choice of cruise altitude levels, use of a time-varying weather field, and requiring a fixed time-of-arrival (four-dimensional problem).

Multiagent Flight Control in Dynamic Environments with Cooperative Coevolutionary Algorithms

NASA Technical Reports Server (NTRS)

Knudson, Matthew D.; Colby, Mitchell; Tumer, Kagan

2014-01-01

Dynamic flight environments in which objectives and environmental features change with respect to time pose a difficult problem with regards to planning optimal flight paths. Path planning methods are typically computationally expensive, and are often difficult to implement in real time if system objectives are changed. This computational problem is compounded when multiple agents are present in the system, as the state and action space grows exponentially. In this work, we use cooperative coevolutionary algorithms in order to develop policies which control agent motion in a dynamic multiagent unmanned aerial system environment such that goals and perceptions change, while ensuring safety constraints are not violated. Rather than replanning new paths when the environment changes, we develop a policy which can map the new environmental features to a trajectory for the agent while ensuring safe and reliable operation, while providing 92% of the theoretically optimal performance

Multiagent Flight Control in Dynamic Environments with Cooperative Coevolutionary Algorithms

NASA Technical Reports Server (NTRS)

Colby, Mitchell; Knudson, Matthew D.; Tumer, Kagan

2014-01-01

Dynamic environments in which objectives and environmental features change with respect to time pose a difficult problem with regards to planning optimal paths through these environments. Path planning methods are typically computationally expensive, and are often difficult to implement in real time if system objectives are changed. This computational problem is compounded when multiple agents are present in the system, as the state and action space grows exponentially with the number of agents in the system. In this work, we use cooperative coevolutionary algorithms in order to develop policies which control agent motion in a dynamic multiagent unmanned aerial system environment such that goals and perceptions change, while ensuring safety constraints are not violated. Rather than replanning new paths when the environment changes, we develop a policy which can map the new environmental features to a trajectory for the agent while ensuring safe and reliable operation, while providing 92% of the theoretically optimal performance.

SU-E-T-161: Characterization and Validation of CT Simulator Hounsfield Units to Relative Stopping Power Values for Proton Treatment Planning

DOE Office of Scientific and Technical Information (OSTI.GOV)

Schnell, E; Ahmad, S; De La Fuente Herman, T

2015-06-15

Purpose: To develop a calibration curve that includes and minimizes the variations of Hounsfield Unit (HU) from a CT scanner to Relative Stopping Power (RSP) of tissues along the proton beam path. The variations are due to scanner and proton energy, technique, phantom size and placement, and tissue arrangement. Methods: A CIRS 062 M phantom with 10 plugs of known relative electron density (RED) was scanned through a 16 slice GE Discovery CT Simulator scanner. Three setup combinations of plug distributions and techniques clinically implemented for five treatment regions were scanned with energies of 100, 120, and 140 kV. Volumetricmore » HU values were measured for each plug and scan. The RSP values derived through the Bethe-Bloch formula are currently being verified with parallel-plate ionization chamber measurements in water using 80, 150, and 225 MeV proton beam. Typical treatment plans for treatment regions of brain, head-&-neck, chest, abdomen, and pelvis are being planned and dose delivered will be compared with film and Optically Stimulated Luminescence (OSL) measurements. Results: Percentage variations were determined for each variable. For tissues close to water, variations were <1% from any given parameter. Tissues far from water equivalence (lung and bone) showed the greatest sensitivity to change (7.4% maximum) with scanner energy and up to 5.3% with positioning of the phantom. No major variations were observed for proton energies within the treatment range. Conclusion: When deriving a calibration curve, attention should be placed to low and high HU values. A thorough verification process of calculated vs. water-phantom measured RSP values at different proton energies, followed by dose validation of planned vs. measured doses in phantom with film and OSL detectors are currently being undertaken.« less

Solid Earth science in the 1990s. Volume 3: Measurement techniques and technology

NASA Technical Reports Server (NTRS)

1991-01-01

Reports are contained from the NASA Workshop on Solid Earth Science in the 1990s. The techniques and technologies needed to address the program objectives are discussed. The Measurement Technique and Technology Panel identified (1) candidate measurement systems for each of the measurements required for the Solid Earth Science Program that would fall under the NASA purview; (2) the capabilities and limitations of each technique; and (3) the developments necessary for each technique to meet the science panel requirements. In nearly all cases, current technology or a development path with existing technology was identified as capable of meeting the requirements of the science panels. These technologies and development paths are discussed.

THE INTERACTION MEAN FREE PATH OF PROTONS AT 3 Tev

DOE Office of Scientific and Technical Information (OSTI.GOV)

Day, G.; Gauld, C.F.; McCusker, C.B.A.

1963-02-16

The mean free path ( F ) of singly charged primary particles in the energy region of 3 Tev is determined using a maximum-likelihood technique. With all events taken into account a value of F = 22 cm is obtained. Considering only those events with a potential path greater than 20 cm, F becomes 27 cm. (auth)

Space Shuttle Communications Coverage Analysis for Thermal Tile Inspection

NASA Technical Reports Server (NTRS)

Kroll, Quin D.; Hwu, Shian U.; Upanavage, Matthew; Boster, John P.; Chavez, Mark A.

2009-01-01

The space shuttle ultra-high frequency Space-to-Space Communication System has to provide adequate communication coverage for astronauts who are performing thermal tile inspection and repair on the underside of the space shuttle orbiter (SSO). Careful planning and quantitative assessment are necessary to ensure successful system operations and mission safety in this work environment. This study assesses communication systems performance for astronauts who are working in the underside, non-line-of-sight shadow region on the space shuttle. All of the space shuttle and International Space Station (ISS) transmitting antennas are blocked by the SSO structure. To ensure communication coverage at planned inspection worksites, the signal strength and link margin between the SSO/ISS antennas and the extravehicular activity astronauts, whose line-of-sight is blocked by vehicle structure, was analyzed. Investigations were performed using rigorous computational electromagnetic modeling techniques. Signal strength was obtained by computing the reflected and diffracted fields along the signal propagation paths between transmitting and receiving antennas. Radio frequency (RF) coverage was determined for thermal tile inspection and repair missions using the results of this computation. Analysis results from this paper are important in formulating the limits on reliable communication range and RF coverage at planned underside inspection and repair worksites.

PLACES (Planning Land And Communities To Be Environmentally Sustainable) Program Helps Communities Onto The Path Of Sustainability

EPA Science Inventory

Land use changes from natural to more man-made environments that are done with no community level planning, shorten the life span and lessen the quality of life of a community. A community armed with a master plan with a number of alternative strategies that consider the natural...

Method and apparatus for planning motions of robot manipulators

DOEpatents

Chen, Pang C.; Hwang, Yong K.

1996-01-01

Method and apparatus for automatically planning motions of robot manipulators. The invention rapidly finds a collision-free path in a cluttered robot environment, if one exists, from any starting configuration of the robot manipulator to any ending configuration. The time to solution of a motion planning problem is not uniform, but proportional to the complexity of the problem.

Computer-implemented remote sensing techniques for measuring coastal productivity and nutrient transport systems

NASA Technical Reports Server (NTRS)

Butera, M. K.

1981-01-01

An automatic technique has been developed to measure marsh plant production by inference from a species classification derived from Landsat MSS data. A separate computer technique has been developed to calculate the transport path length of detritus and nutrients from their point of origin in the marsh to the shoreline from Landsat data. A nutrient availability indicator, the ratio of production to transport path length, was derived for each marsh-identified Landsat cell. The use of a data base compatible with the Landsat format facilitated data handling and computations.

Critical path method applied to research project planning: Fire Economics Evaluation System (FEES)

Treesearch

Earl B. Anderson; R. Stanton Hales

1986-01-01

The critical path method (CPM) of network analysis (a) depicts precedence among the many activities in a project by a network diagram; (b) identifies critical activities by calculating their starting, finishing, and float times; and (c) displays possible schedules by constructing time charts. CPM was applied to the development of the Forest Service's Fire...

77 FR 64374 - Notification of Petition for Approval; Port Authority Trans-Hudson Product Safety Plan

Federal Register 2010, 2011, 2012, 2013, 2014

2012-10-19

... assigned the petition Docket Number FRA-2012-0075. PATH is upgrading some of its track circuits with Digicode microprocessor-based track circuits. The Digicode track circuit is part of Alstom's Smartway Digital Track Circuit product line and will be used by PATH for train detection and broken rail detection...

Graphical methods and Cold War scientific practice: the Stommel Diagram's intriguing journey from the physical to the biological environmental sciences.

PubMed

Vance, Tiffany C; Doel, Ronald E

2010-01-01

In the last quarter of the twentieth century, an innovative three-dimensional graphical technique was introduced into biological oceanography and ecology, where it spread rapidly. Used to improve scientists' understanding of the importance of scale within oceanic ecosystems, this influential diagram addressed biological scales from phytoplankton to fish, physical scales from diurnal tides to ocean currents, and temporal scales from hours to ice ages. Yet the Stommel Diagram (named for physical oceanographer Henry Stommel, who created it in 1963) had not been devised to aid ecological investigations. Rather, Stommel intended it to help plan large-scale research programs in physical oceanography, particularly as Cold War research funding enabled a dramatic expansion of physical oceanography in the 1960s. Marine ecologists utilized the Stommel Diagram to enhance research on biological production in ocean environments, a key concern by the 1970s amid growing alarm about overfishing and ocean pollution. Before the end of the twentieth century, the diagram had become a significant tool within the discipline of ecology. Tracing the path that Stommel's graphical techniques traveled from the physical to the biological environmental sciences reveals a great deal about practices in these distinct research communities and their relative professional and institutional standings in the Cold War era. Crucial to appreciating the course of that path is an understanding of the divergent intellectual and social contexts of the physical versus the biological environmental sciences.

Phonon Scattering and Confinement in Crystalline Films

NASA Astrophysics Data System (ADS)

Parrish, Kevin D.

The operating temperature of energy conversion and electronic devices affects their efficiency and efficacy. In many devices, however, the reference values of the thermal properties of the materials used are no longer applicable due to processing techniques performed. This leads to challenges in thermal management and thermal engineering that demand accurate predictive tools and high fidelity measurements. The thermal conductivity of strained, nanostructured, and ultra-thin dielectrics are predicted computationally using solutions to the Boltzmann transport equation. Experimental measurements of thermal diffusivity are performed using transient grating spectroscopy. The thermal conductivities of argon, modeled using the Lennard-Jones potential, and silicon, modeled using density functional theory, are predicted under compressive and tensile strain from lattice dynamics calculations. The thermal conductivity of silicon is found to be invariant with compression, a result that is in disagreement with previous computational efforts. This difference is attributed to the more accurate force constants calculated from density functional theory. The invariance is found to be a result of competing effects of increased phonon group velocities and decreased phonon lifetimes, demonstrating how the anharmonic contribution of the atomic potential can scale differently than the harmonic contribution. Using three Monte Carlo techniques, the phonon-boundary scattering and the subsequent thermal conductivity reduction are predicted for nanoporous silicon thin films. The Monte Carlo techniques used are free path sampling, isotropic ray-tracing, and a new technique, modal ray-tracing. The thermal conductivity predictions from all three techniques are observed to be comparable to previous experimental measurements on nanoporous silicon films. The phonon mean free paths predicted from isotropic ray-tracing, however, are unphysical as compared to those predicted by free path sampling. Removing the isotropic assumption, leading to the formulation of modal ray-tracing, corrects the mean free path distribution. The effect of phonon line-of-sight is investigated in nanoporous silicon films using free path sampling. When the line-of-sight is cut off there is a distinct change in thermal conductivity versus porosity. By analyzing the free paths of an obstructed phonon mode, it is concluded that the trend change is due to a hard upper limit on the free paths that can exist due to the nanopore geometry in the material. The transient grating technique is an optical contact-less laser based experiment for measuring the in-plane thermal diffusivity of thin films and membranes. The theory of operation and physical setup of a transient grating experiment is detailed. The procedure for extracting the thermal diffusivity from the raw experimental signal is improved upon by removing arbitrary user choice in the fitting parameters used and constructing a parameterless error minimizing procedure. The thermal conductivity of ultra-thin argon films modeled with the Lennard-Jones potential is calculated from both the Monte Carlo free path sampling technique and from explicit reduced dimensionality lattice dynamics calculations. In these ultra-thin films, the phonon properties are altered in more than a perturbative manner, referred to as the confinement regime. The free path sampling technique, which is a perturbative method, is compared to a reduced dimensionality lattice dynamics calculation where the entire film thickness is taken as the unit cell. Divergence in thermal conductivity magnitude and trend is found at few unit cell thick argon films. Although the phonon group velocities and lifetimes are affected, it is found that alterations to the phonon density of states are the primary cause of the deviation in thermal conductivity in the confinement regime.

A testbed for the evaluation of computer aids for enroute flight path planning

NASA Technical Reports Server (NTRS)

Smith, Philip J.; Layton, Chuck; Galdes, Deb; Mccoy, C. E.

1990-01-01

A simulator study of the five airline flight crews engaged in various enroute planning activities has been conducted. Based on a cognitive task analysis of this data, a flight planning workstation has been developed on a Mac II controlling three color monitors. This workstation is being used to study design concepts to support the flight planning activities of dispatchers and flight crews in part-task simulators.

Path Flow Estimation Using Time Varying Coefficient State Space Model

NASA Astrophysics Data System (ADS)

Jou, Yow-Jen; Lan, Chien-Lun

2009-08-01

The dynamic path flow information is very crucial in the field of transportation operation and management, i.e., dynamic traffic assignment, scheduling plan, and signal timing. Time-dependent path information, which is important in many aspects, is nearly impossible to be obtained. Consequently, researchers have been seeking estimation methods for deriving valuable path flow information from less expensive traffic data, primarily link traffic counts of surveillance systems. This investigation considers a path flow estimation problem involving the time varying coefficient state space model, Gibbs sampler, and Kalman filter. Numerical examples with part of a real network of the Taipei Mass Rapid Transit with real O-D matrices is demonstrated to address the accuracy of proposed model. Results of this study show that this time-varying coefficient state space model is very effective in the estimation of path flow compared to time-invariant model.

Development of Phased-Array Ultrasonic Testing Acceptability Criteria : (Phase II)

DOT National Transportation Integrated Search

2014-10-01

The preliminary technical approach and scan plans developed during phase I of this research was implemented on testing four butt-weld specimens. The ray path analysis carried out to develop the scan plans and the preliminary data analysis indicated t...

The Path to a Cure for Hepatitis C in People With HIV

MedlinePlus

... of the Director Office of the Chief Science Management & Operations Administrative Services Office of Biodefense Research & Surety Communications ... Office of Clinical Research Policy and Regulatory Planning Operations Support Program Planning Analysis ... Office of Acquisitions Scientific Review Program Division ...

Segmentation of stereo terrain images

NASA Astrophysics Data System (ADS)

George, Debra A.; Privitera, Claudio M.; Blackmon, Theodore T.; Zbinden, Eric; Stark, Lawrence W.

2000-06-01

We have studied four approaches to segmentation of images: three automatic ones using image processing algorithms and a fourth approach, human manual segmentation. We were motivated toward helping with an important NASA Mars rover mission task -- replacing laborious manual path planning with automatic navigation of the rover on the Mars terrain. The goal of the automatic segmentations was to identify an obstacle map on the Mars terrain to enable automatic path planning for the rover. The automatic segmentation was first explored with two different segmentation methods: one based on pixel luminance, and the other based on pixel altitude generated through stereo image processing. The third automatic segmentation was achieved by combining these two types of image segmentation. Human manual segmentation of Martian terrain images was used for evaluating the effectiveness of the combined automatic segmentation as well as for determining how different humans segment the same images. Comparisons between two different segmentations, manual or automatic, were measured using a similarity metric, SAB. Based on this metric, the combined automatic segmentation did fairly well in agreeing with the manual segmentation. This was a demonstration of a positive step towards automatically creating the accurate obstacle maps necessary for automatic path planning and rover navigation.

Autonomous underwater vehicle adaptive path planning for target classification

NASA Astrophysics Data System (ADS)

Edwards, Joseph R.; Schmidt, Henrik

2002-11-01

Autonomous underwater vehicles (AUVs) are being rapidly developed to carry sensors into the sea in ways that have previously not been possible. The full use of the vehicles, however, is still not near realization due to lack of the true vehicle autonomy that is promised in the label (AUV). AUVs today primarily attempt to follow as closely as possible a preplanned trajectory. The key to increasing the autonomy of the AUV is to provide the vehicle with a means to make decisions based on its sensor receptions. The current work examines the use of active sonar returns from mine-like objects (MLOs) as a basis for sensor-based adaptive path planning, where the path planning objective is to discriminate between real mines and rocks. Once a target is detected in the mine hunting phase, the mine classification phase is initialized with a derivative cost function to emphasize signal differences and enhance classification capability. The AUV moves adaptively to minimize the cost function. The algorithm is verified using at-sea data derived from the joint MIT/SACLANTCEN GOATS experiments and advanced acoustic simulation using SEALAB. The mission oriented operating system (MOOS) real-time simulator is then used to test the onboard implementation of the algorithm.

An optimal model-based trajectory following architecture synthesising the lateral adaptive preview strategy and longitudinal velocity planning for highly automated vehicle

NASA Astrophysics Data System (ADS)

Cao, Haotian; Song, Xiaolin; Zhao, Song; Bao, Shan; Huang, Zhi

2017-08-01

Automated driving has received a broad of attentions from the academia and industry, since it is effective to greatly reduce the severity of potential traffic accidents and achieve the ultimate automobile safety and comfort. This paper presents an optimal model-based trajectory following architecture for highly automated vehicle in its driving tasks such as automated guidance or lane keeping, which includes a velocity-planning module, a steering controller and a velocity-tracking controller. The velocity-planning module considering the optimal time-consuming and passenger comforts simultaneously could generate a smooth velocity profile. The robust sliding mode control (SMC) steering controller with adaptive preview time strategy could not only track the target path well, but also avoid a big lateral acceleration occurred in its path-tracking progress due to a fuzzy-adaptive preview time mechanism introduced. In addition, an SMC controller with input-output linearisation method for velocity tracking is built and validated. Simulation results show this trajectory following architecture are effective and feasible for high automated driving vehicle, comparing with the Driver-in-the-Loop simulations performed by an experienced driver and novice driver, respectively. The simulation results demonstrate that the present trajectory following architecture could plan a satisfying longitudinal speed profile, track the target path well and safely when dealing with different road geometry structure, it ensures a good time efficiency and driving comfort simultaneously.

Path planning in uncertain flow fields using ensemble method

NASA Astrophysics Data System (ADS)

Wang, Tong; Le Maître, Olivier P.; Hoteit, Ibrahim; Knio, Omar M.

2016-10-01

An ensemble-based approach is developed to conduct optimal path planning in unsteady ocean currents under uncertainty. We focus our attention on two-dimensional steady and unsteady uncertain flows, and adopt a sampling methodology that is well suited to operational forecasts, where an ensemble of deterministic predictions is used to model and quantify uncertainty. In an operational setting, much about dynamics, topography, and forcing of the ocean environment is uncertain. To address this uncertainty, the flow field is parametrized using a finite number of independent canonical random variables with known densities, and the ensemble is generated by sampling these variables. For each of the resulting realizations of the uncertain current field, we predict the path that minimizes the travel time by solving a boundary value problem (BVP), based on the Pontryagin maximum principle. A family of backward-in-time trajectories starting at the end position is used to generate suitable initial values for the BVP solver. This allows us to examine and analyze the performance of the sampling strategy and to develop insight into extensions dealing with general circulation ocean models. In particular, the ensemble method enables us to perform a statistical analysis of travel times and consequently develop a path planning approach that accounts for these statistics. The proposed methodology is tested for a number of scenarios. We first validate our algorithms by reproducing simple canonical solutions, and then demonstrate our approach in more complex flow fields, including idealized, steady and unsteady double-gyre flows.

Cartographic modeling of snow avalanche path location within Glacier National Park, Montana

NASA Technical Reports Server (NTRS)

Walsh, Stephen J.; Brown, Daniel G.; Bian, Ling; Butler, David R.

1990-01-01

Geographic information system (GIS) techniques were applied to the study of snow-avalanche path location within Glacier National Park, Montana. Aerial photointerpretation and field surveys confirmed the location of 121 avalanche paths within the selected study area. Spatial and nonspatial information on each path were integrated using the ARC/INFO GIS. Lithologic, structural, hydrographic, topographic, and land-cover impacts on path location were analyzed. All path frequencies within variable classes were normalized by the area of class occurrence relative to the total area of the study area and were added to the morphometric information contained within INFO tables. The normalized values for each GIS coverage were used to cartographically model, by means of composite factor weightings, avalanche path locations.

Solar Diameter Measurements from Eclipses as a Solar Variability Proxy

NASA Astrophysics Data System (ADS)

Waring Dunham, David; Sofia, Sabatino; Guhl, Konrad; Herald, David Russell

2015-08-01

Since thermal relaxation times for the Sun are thousands of years, small variations of the Solar intensity are proportional to small variations of the Solar diameter on decadal time scales. In a combination between observations and theory, reliable values of the relation constant W are known, that allow transformation of historical variations of radius into variations of the solar luminosity. During the past 45 years, members of the International Occultation Timing Association (IOTA) have observed 20 annular and total solar eclipses from locations near the path edges. Baily’s beads, whose occurrence and duration are considerably prolonged as seen from path edge locations, were first timed visually, mostly using projection techniques, but since about 1980, they have been timed mainly from analysis of video recordings. The edge locations have the advantage that most of the beads are defined by the same features in the lunar polar regions that cause the phenomena at each eclipse. Some of the best-observed modern eclipses can be used to assess the accuracy of the results, which are limited mainly by the intensity drop at the Sun’s edge, and the consequent uncertainty in defining the edge. In addition, direct visual contact timings made near the path edges during earlier eclipses, back to 1715, have been found in the literature, and analyzed. Although the observations seem to show small variations, they are only a little larger than the assessed accuracies. The results can be improved with a consistent re-analysis of the observations using the much more accurate lunar profile data that is now available from the Japanese Kaguya and NASA’s LRO lunar orbiter observations. Also, IOTA has plans to observe future eclipses with a variety of techniques that were used in the past, to better assess the accuracies of the different observational methods that have been used, and determine any systematic differences between them.

Agent-Based Simulations for Project Management

NASA Technical Reports Server (NTRS)

White, J. Chris; Sholtes, Robert M.

2011-01-01

Currently, the most common approach used in project planning tools is the Critical Path Method (CPM). While this method was a great improvement over the basic Gantt chart technique being used at the time, it now suffers from three primary flaws: (1) task duration is an input, (2) productivity impacts are not considered , and (3) management corrective actions are not included. Today, computers have exceptional computational power to handle complex simulations of task e)(eculion and project management activities (e.g ., dynamically changing the number of resources assigned to a task when it is behind schedule). Through research under a Department of Defense contract, the author and the ViaSim team have developed a project simulation tool that enables more realistic cost and schedule estimates by using a resource-based model that literally turns the current duration-based CPM approach "on its head." The approach represents a fundamental paradigm shift in estimating projects, managing schedules, and reducing risk through innovative predictive techniques.

Vervet monkeys use paths consistent with context-specific spatial movement heuristics.

PubMed

Teichroeb, Julie A

2015-10-01

Animal foraging routes are analogous to the computationally demanding "traveling salesman problem" (TSP), where individuals must find the shortest path among several locations before returning to the start. Humans approximate solutions to TSPs using simple heuristics or "rules of thumb," but our knowledge of how other animals solve multidestination routing problems is incomplete. Most nonhuman primate species have shown limited ability to route plan. However, captive vervets were shown to solve a TSP for six sites. These results were consistent with either planning three steps ahead or a risk-avoidance strategy. I investigated how wild vervet monkeys (Chlorocebus pygerythrus) solved a path problem with six, equally rewarding food sites; where site arrangement allowed assessment of whether vervets found the shortest route and/or used paths consistent with one of three simple heuristics to navigate. Single vervets took the shortest possible path in fewer than half of the trials, usually in ways consistent with the most efficient heuristic (the convex hull). When in competition, vervets' paths were consistent with different, more efficient heuristics dependent on their dominance rank (a cluster strategy for dominants and the nearest neighbor rule for subordinates). These results suggest that, like humans, vervets may solve multidestination routing problems by applying simple, adaptive, context-specific "rules of thumb." The heuristics that were consistent with vervet paths in this study are the same as some of those asserted to be used by humans. These spatial movement strategies may have common evolutionary roots and be part of a universal mental navigational toolkit. Alternatively, they may have emerged through convergent evolution as the optimal way to solve multidestination routing problems.

Dynamics of a Two-Link Vehicle in an L-Shaped Corridor Revisited

NASA Astrophysics Data System (ADS)

Antonyuk, E. Ya.; Zabuga, A. T.

2014-03-01

The kinematics of a two-link mobile robot with three steerable wheels moving in an L-shaped corridor is analyzed. A smooth (with continuous first derivative) path is designed maintaining the optimal maneuverability of the vehicle. The motion of the vehicle along this path is planned. Analytical expressions for the reactions at the contact of the wheels with the ground are given in the general case of motion. The radius of curvature of the programmed path is shown to have a strong influence on the reactions.

Motion Planning and Synthesis of Human-Like Characters in Constrained Environments

NASA Astrophysics Data System (ADS)

Zhang, Liangjun; Pan, Jia; Manocha, Dinesh

We give an overview of our recent work on generating naturally-looking human motion in constrained environments with multiple obstacles. This includes a whole-body motion planning algorithm for high DOF human-like characters. The planning problem is decomposed into a sequence of low dimensional sub-problems. We use a constrained coordination scheme to solve the sub-problems in an incremental manner and a local path refinement algorithm to compute collision-free paths in tight spaces and satisfy the statically stable constraint on CoM. We also present a hybrid algorithm to generate plausible motion by combing the motion computed by our planner with mocap data. We demonstrate the performance of our algorithm on a 40 DOF human-like character and generate efficient motion strategies for object placement, bending, walking, and lifting in complex environments.

Path coloring on the Mesh

DOE Office of Scientific and Technical Information (OSTI.GOV)

Rabani, Y.

In the minimum path coloring problem, we are given a list of pairs of vertices of a graph. We are asked to connect each pair by a colored path. Paths of the same color must be edge disjoint. Our objective is to minimize the number of colors used. This problem was raised by Aggarwal et al and Raghavan and Upfal as a model for routing in all-optical networks. It is also related to questions in circuit routing. In this paper, we improve the O (ln N) approximation result of Kleinberg and Tardos for path coloring on the N x Nmore » mesh. We give an O(1) approximation algorithm to the number of colors needed, and a poly(ln ln N) approximation algorithm to the choice of paths and colors. To the best of our knowledge, these are the first sub-logarithmic bounds for any network other than trees, rings, or trees of rings. Our results are based on developing new techniques for randomized rounding. These techniques iteratively improve a fractional solution until it approaches integrality. They are motivated by the method used by Leighton, Maggs, and Rao for packet routing.« less

Application of Extended Kalman Filter in Persistant Scatterer Interferometry to Enhace the Accuracy of Unwrapping Process

NASA Astrophysics Data System (ADS)

Tavakkoli Estahbanat, A.; Dehghani, M.

2017-09-01

In interferometry technique, phases have been modulated between 0-2π. Finding the number of integer phases missed when they were wrapped is the main goal of unwrapping algorithms. Although the density of points in conventional interferometry is high, this is not effective in some cases such as large temporal baselines or noisy interferograms. Due to existing noisy pixels, not only it does not improve results, but also it leads to some unwrapping errors during interferogram unwrapping. In PS technique, because of the sparse PS pixels, scientists are confronted with a problem to unwrap phases. Due to the irregular data separation, conventional methods are sterile. Unwrapping techniques are divided in to path-independent and path-dependent in the case of unwrapping paths. A region-growing method which is a path-dependent technique has been used to unwrap PS data. In this paper an idea of EKF has been generalized on PS data. This algorithm is applied to consider the nonlinearity of PS unwrapping problem as well as conventional unwrapping problem. A pulse-pair method enhanced with singular value decomposition (SVD) has been used to estimate spectral shift from interferometric power spectral density in 7*7 local windows. Furthermore, a hybrid cost-map is used to manage the unwrapping path. This algorithm has been implemented on simulated PS data. To form a sparse dataset, A few points from regular grid are randomly selected and the RMSE of results and true unambiguous phases in presented to validate presented approach. The results of this algorithm and true unwrapped phases were completely identical.

Fast wavelength tuning techniques for external cavity lasers

DOEpatents

Wysocki, Gerard [Princeton, NJ; Tittel, Frank K [Houston, TX

2011-01-11

An apparatus comprising a laser source configured to emit a light beam along a first path, an optical beam steering component configured to steer the light beam from the first path to a second path at an angle to the first path, and a diffraction grating configured to reflect back at least a portion of the light beam along the second path, wherein the angle determines an external cavity length. Included is an apparatus comprising a laser source configured to emit a light beam along a first path, a beam steering component configured to redirect the light beam to a second path at an angle to the first path, wherein the optical beam steering component is configured to change the angle at a rate of at least about one Kilohertz, and a diffraction grating configured to reflect back at least a portion of the light beam along the second path.

National Program Plan for Research and Development in Solar Heating and Cooling. Interim Report.

ERIC Educational Resources Information Center

Energy Research and Development Administration, Washington, DC. Div. of Solar Energy.

This report presents the Energy Research and Development Administration (ERDA) program plan for solar heating and cooling of buildings and for agricultural and industrial process applications. An overview of the program plan is followed by a description of the ten paths to the solar heating and cooling of buildings and a brief discussion of the…

Do-It-Yourself Critical Path Method.

ERIC Educational Resources Information Center

Morris, Edward P., Jr.

This report describes the critical path method (CPM), a system for planning and scheduling work to get the best time-cost combination for any particular job. With the use of diagrams, the report describes how CPM works on a step-by-step basis. CPM uses a network to show which parts of a job must be done and how they would eventually fit together…

ABLEPathPlanner library for Umbra

DOE Office of Scientific and Technical Information (OSTI.GOV)

Oppel III, Fred J; Xavier, Patrick G.; Gottlieb, Eric Joseph

Umbra contains a flexible, modular path planner that is used to simulate complex entity behaviors moving within 3D terrain environments that include buildings, barriers, roads, bridges, fences, and a variety of other terrain features (water, vegetation, slope, etc…). The path planning algorithm is a critical component required to execute these tactical behaviors to provide realistic entity movement and provide efficient system computing performance.

Real-time Collision Avoidance and Path Optimizer for Semi-autonomous UAVs.

NASA Astrophysics Data System (ADS)

Hawary, A. F.; Razak, N. A.

2018-05-01

Whilst UAV offers a potentially cheaper and more localized observation platform than current satellite or land-based approaches, it requires an advance path planner to reveal its true potential, particularly in real-time missions. Manual control by human will have limited line-of-sights and prone to errors due to careless and fatigue. A good alternative solution is to equip the UAV with semi-autonomous capabilities that able to navigate via a pre-planned route in real-time fashion. In this paper, we propose an easy-and-practical path optimizer based on the classical Travelling Salesman Problem and adopts a brute force search method to re-optimize the route in the event of collisions using range finder sensor. The former utilizes a Simple Genetic Algorithm and the latter uses Nearest Neighbour algorithm. Both algorithms are combined to optimize the route and avoid collision at once. Although many researchers proposed various path planning algorithms, we find that it is difficult to integrate on a basic UAV model and often lacks of real-time collision detection optimizer. Therefore, we explore a practical benefit from this approach using on-board Arduino and Ardupilot controllers by manually emulating the motion of an actual UAV model prior to test on the flying site. The result showed that the range finder sensor provides a real-time data to the algorithm to find a collision-free path and eventually optimized the route successfully.

Navigation of military and space unmanned ground vehicles in unstructured terrains

NASA Technical Reports Server (NTRS)

Lescoe, Paul; Lavery, David; Bedard, Roger

1991-01-01

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.

Risk-Hedged Approach for Re-Routing Air Traffic Under Weather Uncertainty

NASA Technical Reports Server (NTRS)

Sadovsky, Alexander V.; Bilimoria, Karl D.

2016-01-01

This presentation corresponds to: our paper explores a new risk-hedged approach for re-routing air traffic around forecast convective weather. In this work, flying through a more likely weather instantiation is considered to pose a higher level of risk. Current operational practice strategically plans re-routes to avoid only the most likely (highest risk) weather instantiation, and then tactically makes any necessary adjustments as the weather evolves. The risk-hedged approach strategically plans re-routes by minimizing the risk-adjusted path length, incorporating multiple possible weather instantiations with associated likelihoods (risks). The resulting model is transparent and is readily analyzed for realism and treated with well-understood shortest-path algorithms. Risk-hedged re-routes are computed for some example weather instantiations. The main result is that in some scenarios, relative to an operational-practice proxy solution, the risk-hedged solution provides the benefits of lower risk as well as shorter path length. In other scenarios, the benefits of the risk-hedged solution are ambiguous, because the solution is characterized by a tradeoff between risk and path length. The risk-hedged solution can be executed in those scenarios where it provides a clear benefit over current operational practice.

Autonomous path-planning navigation system for site characterization

NASA Astrophysics Data System (ADS)

Rankin, Arturo L.; Crane, Carl D., III; Armstrong, David G., II; Nease, Allen D.; Brown, H. Edward

1996-05-01

The location and removal of buried munitions is an important yet hazardous task. Current development is aimed at performing both the ordnance location and removal tasks autonomously. An autonomous survey vehicle (ASV) named the Gator has been developed at the Center for Intelligent Machines and Robotics, under the direction of Wright Laboratory, Tyndall Air Force Base, Florida, and the Navy Explosive Ordnance Disposal Technology Division, Indian Head, Maryland. The primary task of the survey vehicle is to autonomously traverse an off-road site, towing behind it a trailer containing a sensor package capable of characterizing the sub-surface contents. Achieving 00 percent coverage of the site is critical to fully characterizing the site. This paper presents a strategy for planning efficient paths for the survey vehicle that guarantees near-complete coverage of a site. A small library of three in-house developed path planners are reviewed. A strategy is also presented to keep the trailer on-path and to calculate the percent of coverage of a site with a resolution of 0.01 m2. All of the algorithms discussed in this paper were initially developed in simulation on a Silicon Graphics computer and subsequently implemented on the survey vehicle.

Motion planning with complete knowledge using a colored SOM.

PubMed

Vleugels, J; Kok, J N; Overmars, M

1997-01-01

The motion planning problem requires that a collision-free path be determined for a robot moving amidst a fixed set of obstacles. Most neural network approaches to this problem are for the situation in which only local knowledge about the configuration space is available. The main goal of the paper is to show that neural networks are also suitable tools in situations with complete knowledge of the configuration space. In this paper we present an approach that combines a neural network and deterministic techniques. We define a colored version of Kohonen's self-organizing map that consists of two different classes of nodes. The network is presented with random configurations of the robot and, from this information, it constructs a road map of possible motions in the work space. The map is a growing network, and different nodes are used to approximate boundaries of obstacles and the Voronoi diagram of the obstacles, respectively. In a second phase, the positions of the two kinds of nodes are combined to obtain the road map. In this way a number of typical problems with small obstacles and passages are avoided, and the required number of nodes for a given accuracy is within reasonable limits. This road map is searched to find a motion connecting the given source and goal configurations of the robot. The algorithm is simple and general; the only specific computation that is required is a check for intersection of two polygons. We implemented the algorithm for planar robots allowing both translation and rotation and experiments show that compared to conventional techniques it performs well, even for difficult motion planning scenes.

A Self-Adaptive Capacitive Compensation Technique for Body Channel Communication.

PubMed

Mao, Jingna; Yang, Huazhong; Lian, Yong; Zhao, Bo

2017-10-01

In wireless body area network, capacitive-coupling body channel communication (CC-BCC) has the potential to attain better energy efficiency over conventional wireless communication schemes. The CC-BCC scheme utilizes the human body as the forward signal transmission medium, reducing the path loss in wireless body-centric communications. However, the backward path is formed by the coupling capacitance between the ground electrodes (GEs) of transmitter (Tx) and receiver (Rx), which increases the path loss and results in a body posture dependent backward impedance. Conventional methods use a fixed inductor to resonate with the backward capacitor to compensate the path loss, while it's not effective in compensating the variable backward impedance induced by the body movements. In this paper, we propose a self-adaptive capacitive compensation (SACC) technique to address such a problem. A backward distance detector is introduced to estimate the distance between two GEs of Tx and Rx, and a backward capacitance model is built to calculate the backward capacitance. The calculated backward capacitance at varying body posture is compensated by a digitally controlled tunable inductor (DCTI). The proposed SACC technique is validated by a prototype CC-BCC system, and measurements are taken on human subjects. The measurement results show that 9dB-16 dB channel enhancement can be achieved at a backward path distance of 1 cm-10 cm.

Tools and Methods for Visualization of Mesoscale Ocean Eddies

NASA Astrophysics Data System (ADS)

Bemis, K. G.; Liu, L.; Silver, D.; Kang, D.; Curchitser, E.

2017-12-01

Mesoscale ocean eddies form in the Gulf Stream and transport heat and nutrients across the ocean basin. The internal structure of these three-dimensional eddies and the kinematics with which they move are critical to a full understanding of their transport capacity. A series of visualization tools have been developed to extract, characterize, and track ocean eddies from 3D modeling results, to visually show the ocean eddy story by applying various illustrative visualization techniques, and to interactively view results stored on a server from a conventional browser. In this work, we apply a feature-based method to track instances of ocean eddies through the time steps of a high-resolution multidecadal regional ocean model and generate a series of eddy paths which reflect the life cycle of individual eddy instances. The basic method uses the Okubu-Weiss parameter to define eddy cores but could be adapted to alternative specifications of an eddy. Stored results include pixel-lists for each eddy instance, tracking metadata for eddy paths, and physical and geometric properties. In the simplest view, isosurfaces are used to display eddies along an eddy path. Individual eddies can then be selected and viewed independently or an eddy path can be viewed in the context of all eddy paths (longer than a specified duration) and the ocean basin. To tell the story of mesoscale ocean eddies, we combined illustrative visualization techniques, including visual effectiveness enhancement, focus+context, and smart visibility, with the extracted volume features to explore eddy characteristics at multiple scales from ocean basin to individual eddy. An evaluation by domain experts indicates that combining our feature-based techniques with illustrative visualization techniques provides an insight into the role eddies play in ocean circulation. A web-based GUI is under development to facilitate easy viewing of stored results. The GUI provides the user control to choose amongst available datasets, to specify the variables (such as temperature or salinity) to display on the isosurfaces, and to choose the scale and orientation of the view. These techniques allow an oceanographer to browse the data based on eddy paths and individual eddies rather than slices or volumes of data.

Chemistry, manufacturing and control (CMC) and clinical trial technical support for influenza vaccine manufacturers.

PubMed

Wahid, Rahnuma; Holt, Renee; Hjorth, Richard; Berlanda Scorza, Francesco

2016-10-26

With the support of the Biomedical Advanced Research and Development Authority (BARDA) of the US Department of Health and Human Services, PATH has contributed to the World Health Organization's (WHO's) Global Action Plan for Influenza Vaccines (GAP) by providing technical and clinical assistance to several developing country vaccine manufacturers (DCVMs). GAP builds regionally based independent and sustainable influenza vaccine production capacity to mitigate the overall global shortage of influenza vaccines. The program also ensures adequate influenza vaccine manufacturing capacity in the event of an influenza pandemic. Since 2009, PATH has worked closely with two DCVMs in Vietnam: the Institute of Vaccines and Medical Biologicals (IVAC) and VABIOTECH. Beginning in 2013, PATH also began working with Torlak Institute in Serbia; Instituto Butantan in Brazil; Serum Institute of India Private Ltd. in India; and Changchun BCHT Biotechnology Co. (BCHT) in China. The DCVMs supported under the GAP program all had existing influenza vaccine manufacturing capability and required technical support from PATH to improve vaccine yield, process efficiency, and product formulation. PATH has provided customized technical support for the manufacturing process to each DCVM based on their respective requirements. Additionally, PATH, working with BARDA and WHO, supported several DCVMs in the clinical development of influenza vaccine candidates progressing toward national licensure or WHO prequalification. As a result of the activities outlined in this review, several companies were able to make excellent progress in developing state-of-the-art manufacturing processes and completing early phase clinical trials. Licensure trials are currently ongoing or planned for several DCVMs. Copyright © 2016 Elsevier Ltd. All rights reserved.

Using multiple calibration sets to improve the quantitative accuracy of partial least squares (PLS) regression on open-path fourier transform infrared (OP/FT-IR) spectra of ammonia over wide concentration ranges

USDA-ARS?s Scientific Manuscript database

A technique of using multiple calibration sets in partial least squares regression (PLS) was proposed to improve the quantitative determination of ammonia from open-path Fourier transform infrared spectra. The spectra were measured near animal farms, and the path-integrated concentration of ammonia...

Interior Noise

NASA Technical Reports Server (NTRS)

Mixson, John S.; Wilby, John F.

1991-01-01

The generation and control of flight vehicle interior noise is discussed. Emphasis is placed on the mechanisms of transmission through airborne and structure-borne paths and the control of cabin noise by path modification. Techniques for identifying the relative contributions of the various source-path combinations are also discussed along with methods for the prediction of aircraft interior noise such as those based on the general modal theory and statistical energy analysis.

From classical to quantum and back: Hamiltonian adaptive resolution path integral, ring polymer, and centroid molecular dynamics

NASA Astrophysics Data System (ADS)

Kreis, Karsten; Kremer, Kurt; Potestio, Raffaello; Tuckerman, Mark E.

2017-12-01

Path integral-based methodologies play a crucial role for the investigation of nuclear quantum effects by means of computer simulations. However, these techniques are significantly more demanding than corresponding classical simulations. To reduce this numerical effort, we recently proposed a method, based on a rigorous Hamiltonian formulation, which restricts the quantum modeling to a small but relevant spatial region within a larger reservoir where particles are treated classically. In this work, we extend this idea and show how it can be implemented along with state-of-the-art path integral simulation techniques, including path-integral molecular dynamics, which allows for the calculation of quantum statistical properties, and ring-polymer and centroid molecular dynamics, which allow the calculation of approximate quantum dynamical properties. To this end, we derive a new integration algorithm that also makes use of multiple time-stepping. The scheme is validated via adaptive classical-path-integral simulations of liquid water. Potential applications of the proposed multiresolution method are diverse and include efficient quantum simulations of interfaces as well as complex biomolecular systems such as membranes and proteins.

Laser-Based Production of Metallic Conducting Paths

NASA Astrophysics Data System (ADS)

Vedder, Christian; Stollenwerk, Jochen; Wissenbach, Konrad; Pirch, Norbert

For numerous devices such as OLEDs, solar cells or heated windows conducting paths are needed for collecting or distributing electricity on poorly or non-conducting surfaces. With established techniques the metallic paths can only be produced with a great deal of effort, incurring high costs for plant, equipment and energy. A new laser based process to manufacture conducting paths allows for writing narrow paths (down to 35 μm width) of Al, Cu, Ag or similar materials onto flat surfaces of glass (plain or coated with ITO) and silicon wafers by melting and vaporizing a metal foil through optical energy at high speeds of up to 2.5 m/s.

Navigation system for autonomous mapper robots

NASA Astrophysics Data System (ADS)

Halbach, Marc; Baudoin, Yvan

1993-05-01

This paper describes the conception and realization of a fast, robust, and general navigation system for a mobile (wheeled or legged) robot. A database, representing a high level map of the environment is generated and continuously updated. The first part describes the legged target vehicle and the hexapod robot being developed. The second section deals with spatial and temporal sensor fusion for dynamic environment modeling within an obstacle/free space probabilistic classification grid. Ultrasonic sensors are used, others are suspected to be integrated, and a-priori knowledge is treated. US sensors are controlled by the path planning module. The third part concerns path planning and a simulation of a wheeled robot is also presented.

Geospatial analysis based on GIS integrated with LADAR.

PubMed

Fetterman, Matt R; Freking, Robert; Fernandez-Cull, Christy; Hinkle, Christopher W; Myne, Anu; Relyea, Steven; Winslow, Jim

2013-10-07

In this work, we describe multi-layered analyses of a high-resolution broad-area LADAR data set in support of expeditionary activities. High-level features are extracted from the LADAR data, such as the presence and location of buildings and cars, and then these features are used to populate a GIS (geographic information system) tool. We also apply line-of-sight (LOS) analysis to develop a path-planning module. Finally, visualization is addressed and enhanced with a gesture-based control system that allows the user to navigate through the enhanced data set in a virtual immersive experience. This work has operational applications including military, security, disaster relief, and task-based robotic path planning.

Transparent aligners: An invisible approach to correct mild skeletal class III malocclusion

PubMed Central

Yezdani, A. Arif

2015-01-01

This case report highlights the treatment of a mild skeletal class III malocclusion with an invisible thermoplastic retainer. A 15-year-old female patient presented with a mild skeletal class III malocclusion with a retrognathic maxilla, orthognathic mandible, a low mandibular plane angle with Angle's class III malocclusion with maxillary lateral incisors in anterior cross-bite with crowding of maxillary anteriors, imbricated and rotated mandibular incisors and deep bite. Accurate upper and lower impressions and a bite registration were taken with polyvinyl siloxane rubber base impression material. This was then sent to the lab for the processing of a series of ClearPath aligners. The ClearPath virtual set-up sent from the lab provided the treatment plan and interproximal reduction estimation complete with posttreatment results. This enabled the clinician to actively participate in the treatment plan and provide the necessary suggestions. The ClearPath three-dimensional aligner was found to have effectively corrected the anterior cross-bite and crowding of the maxillary anteriors. PMID:26015738

Children's exercise behavior: the moderating role of habit processes within the theory of planned behavior.

PubMed

Hashim, H A; Jawis, M N; Wahat, A; Grove, J R

2014-01-01

The moderating effect of exercise habit strength and specific habit processes within the theory of planned behavior (TPB) was tested in children. Participants were primary school students (N = 380, mean age = 10.46 ± .52). The data were collected using self-report measures followed by one-mile run test performance. Data were analyzed using structural equation modeling. The findings revealed that 34, 57, and 9% of students could be classified as low, moderate, and high in PA, respectively. Path analysis for the overall model revealed significant path loadings (p = < .05), except for the attitude-intention path. Moderating effects results revealed that strong habit strength extinguished the effects of intention on PA. Habit strength has the potential to minimize the deliberate processes associated with intention to exercise, thereby increasing the probability of intention-behavior translation. For specific habit processes, only negative affect appears to moderate the relationships between the TPB variables.

A novel method for trajectory planning of cooperative mobile manipulators.

PubMed

Bolandi, Hossein; Ehyaei, Amir Farhad

2011-01-01

We have designed a two-stage scheme to consider the trajectory planning problem of two mobile manipulators for cooperative transportation of a rigid body in the presence of static obstacles. In the first stage, with regard to the static obstacles, we develop a method that searches the workspace for the shortest possible path between the start and goal configurations, by constructing a graph on a portion of the configuration space that satisfies the collision and closure constraints. The final stage is to calculate a sequence of time-optimal trajectories to go between the consecutive points of the path, with regard to the nonholonomic constraints and the maximum allowed joint accelerations. This approach allows geometric constraints such as joint limits and closed-chain constraints, along with differential constraints such as nonholonomic velocity constraints and acceleration limits, to be incorporated into the planning scheme. The simulation results illustrate the effectiveness of the proposed method.

A Novel Method for Trajectory Planning of Cooperative Mobile Manipulators

PubMed Central

Bolandi, Hossein; Ehyaei, Amir Farhad

2011-01-01

We have designed a two-stage scheme to consider the trajectory planning problem of two mobile manipulators for cooperative transportation of a rigid body in the presence of static obstacles. In the first stage, with regard to the static obstacles, we develop a method that searches the workspace for the shortest possible path between the start and goal configurations, by constructing a graph on a portion of the configuration space that satisfies the collision and closure constraints. The final stage is to calculate a sequence of time-optimal trajectories to go between the consecutive points of the path, with regard to the nonholonomic constraints and the maximum allowed joint accelerations. This approach allows geometric constraints such as joint limits and closed-chain constraints, along with differential constraints such as nonholonomic velocity constraints and acceleration limits, to be incorporated into the planning scheme. The simulation results illustrate the effectiveness of the proposed method. PMID:22606656

pathChirp: Efficient Available Bandwidth Estimation for Network Paths

DOE Office of Scientific and Technical Information (OSTI.GOV)

Cottrell, Les

2003-04-30

This paper presents pathChirp, a new active probing tool for estimating the available bandwidth on a communication network path. Based on the concept of ''self-induced congestion,'' pathChirp features an exponential flight pattern of probes we call a chirp. Packet chips offer several significant advantages over current probing schemes based on packet pairs or packet trains. By rapidly increasing the probing rate within each chirp, pathChirp obtains a rich set of information from which to dynamically estimate the available bandwidth. Since it uses only packet interarrival times for estimation, pathChirp does not require synchronous nor highly stable clocks at the sendermore » and receiver. We test pathChirp with simulations and Internet experiments and find that it provides good estimates of the available bandwidth while using only a fraction of the number of probe bytes that current state-of-the-art techniques use.« less

A New Path Forward: Four Approaches to Quality Teaching and Better Schools

ERIC Educational Resources Information Center

Weingarten, Randi

2010-01-01

In a global knowledge economy, filling in the bubbles on a standardized test isn't going to prepare children to succeed in life. This is the time to shed the old conflicts and come together. In this article, the author suggests a new path forward--toward a 21st-century education system, a serious and comprehensive reform plan to transform U.S.…

IRBM in Unitary Plan Wind Tunnel

NASA Image and Video Library

1957-09-07

L57-700 In the reentry flight path of this nose cone model of a Jupiter Intermediate range ballistic missile (IRBM) was tested in the Unitary Plan Wind Tunnel. Photograph published in Engineer in Charge: A History of the Langley Aeronautical Laboratory, 1917-1958 by James R. Hansen. Page 475.

Consolidated View on Space Software Engineering Problems - An Empirical Study

NASA Astrophysics Data System (ADS)

Silva, N.; Vieira, M.; Ricci, D.; Cotroneo, D.

2015-09-01

Independent software verification and validation (ISVV) has been a key process for engineering quality assessment for decades, and is considered in several international standards. The “European Space Agency (ESA) ISVV Guide” is used for the European Space market to drive the ISVV tasks and plans, and to select applicable tasks and techniques. Software artefacts have room for improvement due to the amount if issues found during ISVV tasks. This article presents the analysis of the results of a large set of ISVV issues originated from three different ESA missions-amounting to more than 1000 issues. The study presents the main types, triggers and impacts related to the ISVV issues found and sets the path for a global software engineering improvement based on the most common deficiencies identified for space projects.

Towards an In-Beam Measurement of the Neutron Lifetime to 1 Second

NASA Astrophysics Data System (ADS)

Mulholland, Jonathan

2014-03-01

A precise value for the neutron lifetime is required for consistency tests of the Standard Model and is an essential parameter in the theory of Big Bang Nucleosynthesis. A new measurement of the neutron lifetime using the in-beam method is planned at the National Institute of Standards and Technology Center for Neutron Research. The systematic effects associated with the in-beam method are markedly different than those found in storage experiments utilizing ultracold neutrons. Experimental improvements, specifically recent advances in the determination of absolute neutron fluence, should permit an overall uncertainty of 1 second on the neutron lifetime. The dependence of the primordial mass fraction on the neutron lifetime, technical improvements of the in-beam technique, and the path toward improving the precision of the new measurement will be discussed.

Automated generation of weld path trajectories.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sizemore, John M.; Hinman-Sweeney, Elaine Marie; Ames, Arlo Leroy

2003-06-01

AUTOmated GENeration of Control Programs for Robotic Welding of Ship Structure (AUTOGEN) is software that automates the planning and compiling of control programs for robotic welding of ship structure. The software works by evaluating computer representations of the ship design and the manufacturing plan. Based on this evaluation, AUTOGEN internally identifies and appropriately characterizes each weld. Then it constructs the robot motions necessary to accomplish the welds and determines for each the correct assignment of process control values. AUTOGEN generates these robot control programs completely without manual intervention or edits except to correct wrong or missing input data. Most shipmore » structure assemblies are unique or at best manufactured only a few times. Accordingly, the high cost inherent in all previous methods of preparing complex control programs has made robot welding of ship structures economically unattractive to the U.S. shipbuilding industry. AUTOGEN eliminates the cost of creating robot control programs. With programming costs eliminated, capitalization of robots to weld ship structures becomes economically viable. Robot welding of ship structures will result in reduced ship costs, uniform product quality, and enhanced worker safety. Sandia National Laboratories and Northrop Grumman Ship Systems worked with the National Shipbuilding Research Program to develop a means of automated path and process generation for robotic welding. This effort resulted in the AUTOGEN program, which has successfully demonstrated automated path generation and robot control. Although the current implementation of AUTOGEN is optimized for welding applications, the path and process planning capability has applicability to a number of industrial applications, including painting, riveting, and adhesive delivery.« less

Solving a Class of Spatial Reasoning Problems: Minimal-Cost Path Planning in the Cartesian Plane.

DTIC Science & Technology

1987-06-01

as in Figure 72. By the Theorem of Pythagoras : Z1 <a z 2 < C Yl(bl+b 2)uI, the cost of going along (a,b,c) is greater that the...preceding lemmas to an indefinite number of boundary-crossing episodes is accomplished by the following theorems . Theorem 1 extends the result of Lemma 1... Theorem 1: Any two Snell’s-law paths within a K-explored wedge defined by Snell’s-law paths RL and R. do not intersect within the K-explored portion of

Path planning and execution monitoring for a planetary rover

NASA Technical Reports Server (NTRS)

Gat, Erann; Slack, Marc G.; Miller, David P.; Firby, R. James

1990-01-01

A path planner and an execution monitoring planner that will enable the rover to navigate to its various destinations safely and correctly while detecting and avoiding hazards are described. An overview of the complete architecture is given. Implementation and testbeds are described. The robot can detect unforseen obstacles and take appropriate action. This includes having the rover back away from the hazard and mark the area as untraversable in the in the rover's internal map. The experiments have consisted of paths roughly 20 m in length. The architecture works with a large variety of rover configurations with different kinematic constraints.

Ballistic Imaging and Scattering Measurements for Diesel Spray Combustion: Optical Development and Phenomenological Studies

DTIC Science & Technology

2016-04-01

polystyrene spheres in a water suspension. The impact of spatial filtering , temporal filtering , and scattering path length on image resolution are...The impact of spatial filtering , temporal filtering , and scattering path length on image resolution are reported. The technique is demonstrated...cell filled with polystyrene spheres in a water suspension. The impact of spatial filtering , temporal filtering , and scattering path length on image

Ground-Based Radiometric Measurements of Slant Path Attenuation in the V/W Bands

DTIC Science & Technology

2016-04-01

GROUND-BASED RADIOMETRIC MEASUREMENTS OF SLANT PATH ATTENUATION IN THE V/W BANDS APRIL 2016 FINAL TECHNICAL REPORT APPROVED FOR PUBLIC RELEASE...2. REPORT TYPE FINAL TECHNICAL REPORT 3. DATES COVERED (From - To) OCT 2012 – SEP 2015 4. TITLE AND SUBTITLE GROUND-BASED RADIOMETRIC MEASUREMENTS ...SUPPLEMENTARY NOTES 14. ABSTRACT Ground-based radiometric techniques were applied to measure the slant path attenuation cumulative distribution function to

Energy-Aware Multipath Routing Scheme Based on Particle Swarm Optimization in Mobile Ad Hoc Networks

PubMed Central

Robinson, Y. Harold; Rajaram, M.

2015-01-01

Mobile ad hoc network (MANET) is a collection of autonomous mobile nodes forming an ad hoc network without fixed infrastructure. Dynamic topology property of MANET may degrade the performance of the network. However, multipath selection is a great challenging task to improve the network lifetime. We proposed an energy-aware multipath routing scheme based on particle swarm optimization (EMPSO) that uses continuous time recurrent neural network (CTRNN) to solve optimization problems. CTRNN finds the optimal loop-free paths to solve link disjoint paths in a MANET. The CTRNN is used as an optimum path selection technique that produces a set of optimal paths between source and destination. In CTRNN, particle swarm optimization (PSO) method is primly used for training the RNN. The proposed scheme uses the reliability measures such as transmission cost, energy factor, and the optimal traffic ratio between source and destination to increase routing performance. In this scheme, optimal loop-free paths can be found using PSO to seek better link quality nodes in route discovery phase. PSO optimizes a problem by iteratively trying to get a better solution with regard to a measure of quality. The proposed scheme discovers multiple loop-free paths by using PSO technique. PMID:26819966

A systematic FPGA acceleration design for applications based on convolutional neural networks

NASA Astrophysics Data System (ADS)

Dong, Hao; Jiang, Li; Li, Tianjian; Liang, Xiaoyao

2018-04-01

Most FPGA accelerators for convolutional neural network are designed to optimize the inner acceleration and are ignored of the optimization for the data path between the inner accelerator and the outer system. This could lead to poor performance in applications like real time video object detection. We propose a brand new systematic FPFA acceleration design to solve this problem. This design takes the data path optimization between the inner accelerator and the outer system into consideration and optimizes the data path using techniques like hardware format transformation, frame compression. It also takes fixed-point, new pipeline technique to optimize the inner accelerator. All these make the final system's performance very good, reaching about 10 times the performance comparing with the original system.

Bidirectional quantum teleportation of unknown photons using path-polarization intra-particle hybrid entanglement and controlled-unitary gates via cross-Kerr nonlinearity

NASA Astrophysics Data System (ADS)

Heo, Jino; Hong, Chang-Ho; Lim, Jong-In; Yang, Hyung-Jin

2015-05-01

We propose an arbitrary controlled-unitary (CU) gate and a bidirectional quantum teleportation (BQTP) scheme. The proposed CU gate utilizes photonic qubits (photons) with cross-Kerr nonlinearities (XKNLs), X-homodyne detectors, and linear optical elements, and consists of the consecutive operation of a controlled-path (C-path) gate and a gathering-path (G-path) gate. It is almost deterministic and feasible with current technology when a strong coherent state and weak XKNLs are employed. Based on the CU gate, we present a BQTP scheme that simultaneously teleports two unknown photons between distant users by transmitting only one photon in a path-polarization intra-particle hybrid entangled state. Consequently, it is possible to experimentally implement BQTP with a certain success probability using the proposed CU gate. Project supported by the Ministry of Science, ICT&Future Planning, Korea, under the C-ITRC (Convergence Information Technology Research Center) Support program (NIPA-2013-H0301-13-3007) supervised by the National IT Industry Promotion Agency.

Generation de chemins de couverture pour des operations automatisees de controle non destructif appliquees dans l'industrie aerospatiale

NASA Astrophysics Data System (ADS)

Olivieri, Pierre

Non destructive testing (NDT) plays an important role in the aerospace industry during the fabrication and maintenance of the structures built and is used, among other useful applications, to detect flaws such as cracks at an early stage. However, NDT techniques are still mainly done manually, especially on complex aeronautical structures, which then results in several drawbacks. In addition to be difficult and time-consuming, reliability and repeatability of inspection results are likely to be affected, since they rely on each operator's experience and dexterity. The present thesis is part of a larger project (MANU-418) of the Consortium for Research and Innovation in Aerospace in Quebec (CRIAQ). In this project, it has been proposed to develop a system using a 6-DOF manipulator arm to automate three particular NDT techniques often needed in the aerospace industry: eddy current testing (ECT), fluorescent penetrant inspection (FPI), and infrared thermography (IRT). The main objective of the MANU-418 project is to demonstrate the efficiency of the developed system and provide inspection results of surface and near surface flaws (cracks usually) at least as reliably and repeatably as inspection results from a human operator. One specific objective stemming from the main objective of the project is to develop a methodology and a software tool to generate covering paths adapted for the three aforementioned NDT techniques to inspect the complex surfaces of aerospace structures. The present thesis aims at reaching this specific objective. At first, geometrical and topological properties of the surfaces considered in this project are defined (flat surfaces, round and straight edges, cylindrical or near cylindrical surfaces, holes). It is also assumed that the 3D model of the surface to inspect is known in advance. Moreover, it has been decided within the framework of the MANU-418 project to give priority to the automation of ECT compared with the other techniques (FPI and IRT). As a result, the methodology developed to generate inspection paths is more closely focused on path constraints relative to the manual operations of ECT using a differential eddy current probe (named here EC probe), but it is developed to be flexible enough to be used with the other techniques as well. Common inspection paths for ECT are usually defined by a sweeping motion using a zigzag pattern with the EC probe in mild contact with the inspected surface. Moreover, the main axis of the probe must keep a normal orientation with the surface, and the alignment of its two coils must always be oriented along the direction of its motion. A first methodology is then proposed to generate covering paths on the whole surface of interest while meeting all EC probe motion constraints. First, the surface is meshed with triangular facets, and then it is subdivided into several patches such that their geometry and topology are simpler than the whole surface. Paths are then generated on each patch by intersecting their facets with offset section planes defined along a sweeping direction. Furthermore, another methodology is developed to generate paths around an indication (namely a small area where the presence of a flaw is suspected) whose position and orientation are assumed to be known a priori.. Then, a software tool with a graphical user interface has been developed in the MATLAB environment to generate inspection paths based on these methodologies. A set of path parameters can be changed by the user to get desired paths (distance between passes, sweep direction, etc.). Once paths are computed, an ordered list of coordinates (positions and orientations) of the tool is exported in an EXCEL spreadsheet so that it could be used with a real robot. In this research, these data are then used to perform simulations of trajectories (path described as a function of the time) with a MotoMan robot (model SV3XL) using the MotoSim software. After validation of these trajectories in this software (absence of collisions, positions are all reachable, etc.), they are finally converted into instructions for the real MotoMan robot to proceed with experimental tests. These first simulations and experimentations on a MotoMan robot of the generated paths have given results close to the expected inspection trajectories used manually in the NDT techniques considered, especially for the ECT technique. Nevertheless, it is strongly recommended to validate this path generation method with more experimental tests. For instance, a "test" tool could be manufactured to measure errors of position and orientation of this tool with respect to expected trajectories on a typical complex aeronautical structure. (Abstract shortened by UMI.).

Dynamic Task Assignment and Path Planning of Multi-AUV System Based on an Improved Self-Organizing Map and Velocity Synthesis Method in Three-Dimensional Underwater Workspace.

PubMed

Zhu, Daqi; Huang, Huan; Yang, S X

2013-04-01

For a 3-D underwater workspace with a variable ocean current, an integrated multiple autonomous underwater vehicle (AUV) dynamic task assignment and path planning algorithm is proposed by combing the improved self-organizing map (SOM) neural network and a novel velocity synthesis approach. The goal is to control a team of AUVs to reach all appointed target locations for only one time on the premise of workload balance and energy sufficiency while guaranteeing the least total and individual consumption in the presence of the variable ocean current. First, the SOM neuron network is developed to assign a team of AUVs to achieve multiple target locations in 3-D ocean environment. The working process involves special definition of the initial neural weights of the SOM network, the rule to select the winner, the computation of the neighborhood function, and the method to update weights. Then, the velocity synthesis approach is applied to plan the shortest path for each AUV to visit the corresponding target in a dynamic environment subject to the ocean current being variable and targets being movable. Lastly, to demonstrate the effectiveness of the proposed approach, simulation results are given in this paper.

Lagrangian coherent structure assisted path planning for transoceanic autonomous underwater vehicle missions.

PubMed

Ramos, A G; García-Garrido, V J; Mancho, A M; Wiggins, S; Coca, J; Glenn, S; Schofield, O; Kohut, J; Aragon, D; Kerfoot, J; Haskins, T; Miles, T; Haldeman, C; Strandskov, N; Allsup, B; Jones, C; Shapiro, J

2018-03-15

Transoceanic Gliders are Autonomous Underwater Vehicles (AUVs) for which there is a developing and expanding range of applications in open-seas research, technology and underwater clean transport. Mature glider autonomy, operating depth (0-1000 meters) and low energy consumption without a CO 2 footprint enable evolutionary access across ocean basins. Pursuant to the first successful transatlantic glider crossing in December 2009, the Challenger Mission has opened the door to long-term, long-distance routine transoceanic AUV missions. These vehicles, which glide through the water column between 0 and 1000 meters depth, are highly sensitive to the ocean current field. Consequently, it is essential to exploit the complex space-time structure of the ocean current field in order to plan a path that optimizes scientific payoff and navigation efficiency. This letter demonstrates the capability of dynamical system theory for achieving this goal by realizing the real-time navigation strategy for the transoceanic AUV named Silbo, which is a Slocum deep-glider (0-1000 m), that crossed the North Atlantic from April 2016 to March 2017. Path planning in real time based on this approach has facilitated an impressive speed up of the AUV to unprecedented velocities resulting in major battery savings on the mission, offering the potential for routine transoceanic long duration missions.

Autonomous Collision-Free Navigation of Microvehicles in Complex and Dynamically Changing Environments.

PubMed

Li, Tianlong; Chang, Xiaocong; Wu, Zhiguang; Li, Jinxing; Shao, Guangbin; Deng, Xinghong; Qiu, Jianbin; Guo, Bin; Zhang, Guangyu; He, Qiang; Li, Longqiu; Wang, Joseph

2017-09-26

Self-propelled micro- and nanoscale robots represent a rapidly emerging and fascinating robotics research area. However, designing autonomous and adaptive control systems for operating micro/nanorobotics in complex and dynamically changing environments, which is a highly demanding feature, is still an unmet challenge. Here we describe a smart microvehicle for precise autonomous navigation in complicated environments and traffic scenarios. The fully autonomous navigation system of the smart microvehicle is composed of a microscope-coupled CCD camera, an artificial intelligence planner, and a magnetic field generator. The microscope-coupled CCD camera provides real-time localization of the chemically powered Janus microsphere vehicle and environmental detection for path planning to generate optimal collision-free routes, while the moving direction of the microrobot toward a reference position is determined by the external electromagnetic torque. Real-time object detection offers adaptive path planning in response to dynamically changing environments. We demonstrate that the autonomous navigation system can guide the vehicle movement in complex patterns, in the presence of dynamically changing obstacles, and in complex biological environments. Such a navigation system for micro/nanoscale vehicles, relying on vision-based close-loop control and path planning, is highly promising for their autonomous operation in complex dynamic settings and unpredictable scenarios expected in a variety of realistic nanoscale scenarios.

Predictive Sea State Estimation for Automated Ride Control and Handling - PSSEARCH

NASA Technical Reports Server (NTRS)

Huntsberger, Terrance L.; Howard, Andrew B.; Aghazarian, Hrand; Rankin, Arturo L.

2012-01-01

PSSEARCH provides predictive sea state estimation, coupled with closed-loop feedback control for automated ride control. It enables a manned or unmanned watercraft to determine the 3D map and sea state conditions in its vicinity in real time. Adaptive path-planning/ replanning software and a control surface management system will then use this information to choose the best settings and heading relative to the seas for the watercraft. PSSEARCH looks ahead and anticipates potential impact of waves on the boat and is used in a tight control loop to adjust trim tabs, course, and throttle settings. The software uses sensory inputs including IMU (Inertial Measurement Unit), stereo, radar, etc. to determine the sea state and wave conditions (wave height, frequency, wave direction) in the vicinity of a rapidly moving boat. This information can then be used to plot a safe path through the oncoming waves. The main issues in determining a safe path for sea surface navigation are: (1) deriving a 3D map of the surrounding environment, (2) extracting hazards and sea state surface state from the imaging sensors/map, and (3) planning a path and control surface settings that avoid the hazards, accomplish the mission navigation goals, and mitigate crew injuries from excessive heave, pitch, and roll accelerations while taking into account the dynamics of the sea surface state. The first part is solved using a wide baseline stereo system, where 3D structure is determined from two calibrated pairs of visual imagers. Once the 3D map is derived, anything above the sea surface is classified as a potential hazard and a surface analysis gives a static snapshot of the waves. Dynamics of the wave features are obtained from a frequency analysis of motion vectors derived from the orientation of the waves during a sequence of inputs. Fusion of the dynamic wave patterns with the 3D maps and the IMU outputs is used for efficient safe path planning.

Use of linkage mapping and centrality analysis across habitat gradients to conserve connectivity of gray wolf populations in western North America.

PubMed

Carroll, Carlos; McRae, Brad H; Brookes, Allen

2012-02-01

Centrality metrics evaluate paths between all possible pairwise combinations of sites on a landscape to rank the contribution of each site to facilitating ecological flows across the network of sites. Computational advances now allow application of centrality metrics to landscapes represented as continuous gradients of habitat quality. This avoids the binary classification of landscapes into patch and matrix required by patch-based graph analyses of connectivity. It also avoids the focus on delineating paths between individual pairs of core areas characteristic of most corridor- or linkage-mapping methods of connectivity analysis. Conservation of regional habitat connectivity has the potential to facilitate recovery of the gray wolf (Canis lupus), a species currently recolonizing portions of its historic range in the western United States. We applied 3 contrasting linkage-mapping methods (shortest path, current flow, and minimum-cost-maximum-flow) to spatial data representing wolf habitat to analyze connectivity between wolf populations in central Idaho and Yellowstone National Park (Wyoming). We then applied 3 analogous betweenness centrality metrics to analyze connectivity of wolf habitat throughout the northwestern United States and southwestern Canada to determine where it might be possible to facilitate range expansion and interpopulation dispersal. We developed software to facilitate application of centrality metrics. Shortest-path betweenness centrality identified a minimal network of linkages analogous to those identified by least-cost-path corridor mapping. Current flow and minimum-cost-maximum-flow betweenness centrality identified diffuse networks that included alternative linkages, which will allow greater flexibility in planning. Minimum-cost-maximum-flow betweenness centrality, by integrating both land cost and habitat capacity, allows connectivity to be considered within planning processes that seek to maximize species protection at minimum cost. Centrality analysis is relevant to conservation and landscape genetics at a range of spatial extents, but it may be most broadly applicable within single- and multispecies planning efforts to conserve regional habitat connectivity. ©2011 Society for Conservation Biology.

A Descent Rate Control Approach to Developing an Autonomous Descent Vehicle

NASA Astrophysics Data System (ADS)

Fields, Travis D.

Circular parachutes have been used for aerial payload/personnel deliveries for over 100 years. In the past two decades, significant work has been done to improve the landing accuracies of cargo deliveries for humanitarian and military applications. This dissertation discusses the approach developed in which a circular parachute is used in conjunction with an electro-mechanical reefing system to manipulate the landing location. Rather than attempt to steer the autonomous descent vehicle directly, control of the landing location is accomplished by modifying the amount of time spent in a particular wind layer. Descent rate control is performed by reversibly reefing the parachute canopy. The first stage of the research investigated the use of a single actuation during descent (with periodic updates), in conjunction with a curvilinear target. Simulation results using real-world wind data are presented, illustrating the utility of the methodology developed. Additionally, hardware development and flight-testing of the single actuation autonomous descent vehicle are presented. The next phase of the research focuses on expanding the single actuation descent rate control methodology to incorporate a multi-actuation path-planning system. By modifying the parachute size throughout the descent, the controllability of the system greatly increases. The trajectory planning methodology developed provides a robust approach to accurately manipulate the landing location of the vehicle. The primary benefits of this system are the inherent robustness to release location errors and the ability to overcome vehicle uncertainties (mass, parachute size, etc.). A separate application of the path-planning methodology is also presented. An in-flight path-prediction system was developed for use in high-altitude ballooning by utilizing the path-planning methodology developed for descent vehicles. The developed onboard system improves landing location predictions in-flight using collected flight information during the ascent and descent. Simulation and real-world flight tests (using the developed low-cost hardware) demonstrate the significance of the improvements achievable when flying the developed system.

Possible methods for distinguishing icebergs from ships by aerial remote sensing

NASA Technical Reports Server (NTRS)

Howes, W. L.

1979-01-01

The simplest methods for aerial remote sensing which are least affected by atmospheric opacities are summarized. Radar is preferred for targets off the flight path, and microwave radiometry for targets along the flight path. Radar methods are classified by ability to resolve targets. Techniques which do not require target resolution are preferred. Among these techniques, polarization methods appear most promising, specifically those which differentiate the expected relatively greater depolarization by icebergs from that by ships or which detect doubly-reversed circular polarization.

Long open-path measurements of greenhouse gases in air using near-infrared Fourier transform spectroscopy

NASA Astrophysics Data System (ADS)

Griffith, David W. T.; Pöhler, Denis; Schmitt, Stefan; Hammer, Samuel; Vardag, Sanam N.; Platt, Ulrich

2018-03-01

In complex and urban environments, atmospheric trace gas composition is highly variable in time and space. Point measurement techniques for trace gases with in situ instruments are well established and accurate, but do not provide spatial averaging to compare against developing high-resolution atmospheric models of composition and meteorology with resolutions of the order of a kilometre. Open-path measurement techniques provide path average concentrations and spatial averaging which, if sufficiently accurate, may be better suited to assessment and interpretation with such models. Open-path Fourier transform spectroscopy (FTS) in the mid-infrared region, and differential optical absorption spectroscopy (DOAS) in the UV and visible, have been used for many years for open-path spectroscopic measurements of selected species in both clean air and in polluted environments. Near infrared instrumentation allows measurements over longer paths than mid-infrared FTS for species such as greenhouse gases which are not easily accessible to DOAS.In this pilot study we present the first open-path near-infrared (4000-10 000 cm-1, 1.0-2.5 µm) FTS measurements of CO2, CH4, O2, H2O and HDO over a 1.5 km path in urban Heidelberg, Germany. We describe the construction of the open-path FTS system, the analysis of the collected spectra, several measures of precision and accuracy of the measurements, and the results a four-month trial measurement period in July-November 2014. The open-path measurements are compared to calibrated in situ measurements made at one end of the open path. We observe significant differences of the order of a few ppm for CO2 and a few tens of ppb for CH4 between the open-path and point measurements which are 2 to 4 times the measurement repeatability, but we cannot unequivocally assign the differences to specific local sources or sinks. We conclude that open-path FTS may provide a valuable new tool for investigations of atmospheric trace gas composition in complex, small-scale environments such as cities.

Accuracy of patient-specific guided glenoid baseplate positioning for reverse shoulder arthroplasty.

PubMed

Levy, Jonathan C; Everding, Nathan G; Frankle, Mark A; Keppler, Louis J

2014-10-01

The accuracy of reproducing a surgical plan during shoulder arthroplasty is improved by computer assistance. Intraoperative navigation, however, is challenged by increased surgical time and additional technically difficult steps. Patient-matched instrumentation has the potential to reproduce a similar degree of accuracy without the need for additional surgical steps. The purpose of this study was to examine the accuracy of patient-specific planning and a patient-specific drill guide for glenoid baseplate placement in reverse shoulder arthroplasty. A patient-specific glenoid baseplate drill guide for reverse shoulder arthroplasty was produced for 14 cadaveric shoulders based on a plan developed by a virtual preoperative 3-dimensional planning system using thin-cut computed tomography images. Using this patient-specific guide, high-volume shoulder surgeons exposed the glenoid through a deltopectoral approach and drilled the bicortical pathway defined by the guide. The trajectory of the drill path was compared with the virtual preoperative planned position using similar thin-cut computed tomography images to define accuracy. The drill pathway defined by the patient-matched guide was found to be highly accurate when compared with the preoperative surgical plan. The translational accuracy was 1.2 ± 0.7 mm. The accuracy of inferior tilt was 1.2° ± 1.2°. The accuracy of glenoid version was 2.6° ± 1.7°. The use of patient-specific glenoid baseplate guides is highly accurate in reproducing a virtual 3-dimensional preoperative plan. This technique delivers the accuracy observed using computerized navigation without any additional surgical steps or technical challenges. Copyright © 2014 Journal of Shoulder and Elbow Surgery Board of Trustees. Published by Elsevier Inc. All rights reserved.

A continuous arc delivery optimization algorithm for CyberKnife m6.

PubMed

Kearney, Vasant; Descovich, Martina; Sudhyadhom, Atchar; Cheung, Joey P; McGuinness, Christopher; Solberg, Timothy D

2018-06-01

This study aims to reduce the delivery time of CyberKnife m6 treatments by allowing for noncoplanar continuous arc delivery. To achieve this, a novel noncoplanar continuous arc delivery optimization algorithm was developed for the CyberKnife m6 treatment system (CyberArc-m6). CyberArc-m6 uses a five-step overarching strategy, in which an initial set of beam geometries is determined, the robotic delivery path is calculated, direct aperture optimization is conducted, intermediate MLC configurations are extracted, and the final beam weights are computed for the continuous arc radiation source model. This algorithm was implemented on five prostate and three brain patients, previously planned using a conventional step-and-shoot CyberKnife m6 delivery technique. The dosimetric quality of the CyberArc-m6 plans was assessed using locally confined mutual information (LCMI), conformity index (CI), heterogeneity index (HI), and a variety of common clinical dosimetric objectives. Using conservative optimization tuning parameters, CyberArc-m6 plans were able to achieve an average CI difference of 0.036 ± 0.025, an average HI difference of 0.046 ± 0.038, and an average LCMI of 0.920 ± 0.030 compared with the original CyberKnife m6 plans. Including a 5 s per minute image alignment time and a 5-min setup time, conservative CyberArc-m6 plans achieved an average treatment delivery speed up of 1.545x ± 0.305x compared with step-and-shoot plans. The CyberArc-m6 algorithm was able to achieve dosimetrically similar plans compared to their step-and-shoot CyberKnife m6 counterparts, while simultaneously reducing treatment delivery times. © 2018 American Association of Physicists in Medicine.

Multipass Target Search in Natural Environments

PubMed Central

Otte, Michael W.; Sofge, Donald; Gupta, Satyandra K.

2017-01-01

Consider a disaster scenario where search and rescue workers must search difficult to access buildings during an earthquake or flood. Often, finding survivors a few hours sooner results in a dramatic increase in saved lives, suggesting the use of drones for expedient rescue operations. Entropy can be used to quantify the generation and resolution of uncertainty. When searching for targets, maximizing mutual information of future sensor observations will minimize expected target location uncertainty by minimizing the entropy of the future estimate. Motion planning for multi-target autonomous search requires planning over an area with an imperfect sensor and may require multiple passes, which is hindered by the submodularity property of mutual information. Further, mission duration constraints must be handled accordingly, requiring consideration of the vehicle’s dynamics to generate feasible trajectories and must plan trajectories spanning the entire mission duration, something which most information gathering algorithms are incapable of doing. If unanticipated changes occur in an uncertain environment, new plans must be generated quickly. In addition, planning multipass trajectories requires evaluating path dependent rewards, requiring planning in the space of all previously selected actions, compounding the problem. We present an anytime algorithm for autonomous multipass target search in natural environments. The algorithm is capable of generating long duration dynamically feasible multipass coverage plans that maximize mutual information using a variety of techniques such as ϵ-admissible heuristics to speed up the search. To the authors’ knowledge this is the first attempt at efficiently solving multipass target search problems of such long duration. The proposed algorithm is based on best first branch and bound and is benchmarked against state of the art algorithms adapted to the problem in natural Simplex environments, gathering the most information in the given search time. PMID:29099087

Attitudes and exercise adherence: test of the Theories of Reasoned Action and Planned Behaviour.

PubMed

Smith, R A; Biddle, S J

1999-04-01

Three studies of exercise adherence and attitudes are reported that tested the Theory of Reasoned Action and the Theory of Planned Behaviour. In a prospective study of adherence to a private fitness club, structural equation modelling path analysis showed that attitudinal and social normative components of the Theory of Reasoned Action accounted for 13.1% of the variance in adherence 4 months later, although only social norm significantly predicted intention. In a second study, the Theory of Planned Behaviour was used to predict both physical activity and sedentary behaviour. Path analyses showed that attitude and perceived control, but not social norm, predicted total physical activity. Physical activity was predicted from intentions and control over sedentary behaviour. Finally, an intervention study with previously sedentary adults showed that intentions to be active measured at the start and end of a 10-week intervention were associated with the planned behaviour variables. A multivariate analysis of variance revealed no significant multivariate effects for time on the planned behaviour variables measured before and after intervention. Qualitative data provided evidence that participants had a positive experience on the intervention programme and supported the role of social normative factors in the adherence process.

Gender differences in visuospatial planning: an eye movements study.

PubMed

Cazzato, Valentina; Basso, Demis; Cutini, Simone; Bisiacchi, Patrizia

2010-01-20

Gender studies report a male advantage in several visuospatial abilities. Only few studies however, have evaluated differences in visuospatial planning behaviour with regard to gender. This study was aimed at exploring whether gender may affect the choice of cognitive strategies in a visuospatial planning task and, if oculomotor measures could assist in disentangling the cognitive processes involved. A computerised task based on the travelling salesperson problem paradigm, the Maps test, was used to investigate these issues. Participants were required to optimise time and space of a path travelling among a set of sub-goals in a spatially constrained environment. Behavioural results suggest that there are no gender differences in the initial visual processing of the stimuli, but rather during the execution of the plan, with males showing a shorter execution time and a higher path length optimisation than females. Males often showed changes of heuristics during the execution while females seemed to prefer a constant strategy. Moreover, a better performance in behavioural and oculomotor measures seemed to suggest that males are more able than females in either the optimisation of spatial features or the realisation of the planned scheme. Despite inconclusive findings, the results support previous research and provide insight into the level of cognitive processing involved in navigation and planning tasks, with regard to the influence of gender.

A Plan for the Development and Demonstration of Optical Communications for Deep Space

NASA Technical Reports Server (NTRS)

Lesh, J. R.; Deutsch, L. J.; Weber, W. J.

1990-01-01

In this article, an overall plan for the development and demonstration of optical communications for deep-space applications is presented. The current state of the technology for optical communications is presented. Then, the development and demonstration plan is presented in two parts: the overall major systems activities, followed by the generic technology developments that will enable them. The plan covers the path from laboratory subsystems demonstrations out to a full-scale flight experiment system for the proposed Mars Communications Relay Orbiter mission.

Simulation based optimization on automated fibre placement process

NASA Astrophysics Data System (ADS)

Lei, Shi

2018-02-01

In this paper, a software simulation (Autodesk TruPlan & TruFiber) based method is proposed to optimize the automate fibre placement (AFP) process. Different types of manufacturability analysis are introduced to predict potential defects. Advanced fibre path generation algorithms are compared with respect to geometrically different parts. Major manufacturing data have been taken into consideration prior to the tool paths generation to achieve high success rate of manufacturing.

OPEN-PATH FTIR MEASUREMENTS OF NOX AND OTHER DIESEL EMISSIONS

EPA Science Inventory

The paper gives results of a demonstration of the feasibility of using an open-path Fourier transform infrared (OP-FTIR) monitoring technique to address the across-road characterization of diesel vehicle emissions of criteria pollutants and hazardous air pollutants. Four sets of ...

Performance analysis of visible light communication using the STBC-OFDM technique for intelligent transportation systems

NASA Astrophysics Data System (ADS)

Li, Changping; Yi, Ying; Lee, Kyujin; Lee, Kyesan

2014-08-01

Visible light communication (VLC) applied in an intelligent transportation system (ITS) has attracted growing attentions, but it also faces challenges, for example deep path loss and optical multi-path dispersion. In this work, we modelled an actual outdoor optical channel as a Rician channel and further proposed space-time block coding (STBC) orthogonal frequency-division multiplexing (OFDM) technology to reduce the influence of severe optical multi-path dispersion associated with such a mock channel for achieving the effective BER of 10-6 even at a low signal-to-noise ratio (SNR). In this case, the optical signals transmission distance can be extended as long as possible. Through the simulation results of STBC-OFDM and single-input-single-output (SISO) counterparts in bit error rate (BER) performance comparison, we can distinctly observe that the VLC-ITS system using STBC-OFDM technique can obtain a strongly improved BER performance due to multi-path dispersion alleviation.

Neighboring extremals of dynamic optimization problems with path equality constraints

NASA Technical Reports Server (NTRS)

Lee, A. Y.

1988-01-01

Neighboring extremals of dynamic optimization problems with path equality constraints and with an unknown parameter vector are considered in this paper. With some simplifications, the problem is reduced to solving a linear, time-varying two-point boundary-value problem with integral path equality constraints. A modified backward sweep method is used to solve this problem. Two example problems are solved to illustrate the validity and usefulness of the solution technique.

Development of Anthropometric Analogous Headforms. Phase 1.

DTIC Science & Technology

1994-10-31

shown in figure 5. This surface mesh can then be transformed into polygon faces that are able to be rendered by the AutoCAD rendering tools . Rendering of...computer-generated surfaces. The material removal techniques require the programming of the tool path of the cutter and in some cases requires specialized... tooling . Tool path programs are available to transfer the computer-generated surface into actual paths of the cutting tool . In cases where the

Project Planning and Reporting

NASA Technical Reports Server (NTRS)

1982-01-01

Project Planning Analysis and Reporting System (PPARS) is automated aid in monitoring and scheduling of activities within project. PPARS system consists of PPARS Batch Program, five preprocessor programs, and two post-processor programs. PPARS Batch program is full CPM (Critical Path Method) scheduling program with resource capabilities. Can process networks with up to 10,000 activities.

Knowing the Community: Women Planning Careers in Educational Leadership

ERIC Educational Resources Information Center

Sperandio, Jill

2015-01-01

Women aspiring to be principals and superintendents in the U.S. public school system have little information concerning optimum career paths to leadership. This article considers recent research and theory regarding career planning in the context of K-12 schools, and the different approaches adopted by male and female aspirants. The choice of…

Automated vehicle guidance using discrete reference markers. [road surface steering techniques

NASA Technical Reports Server (NTRS)

Johnston, A. R.; Assefi, T.; Lai, J. Y.

1979-01-01

Techniques for providing steering control for an automated vehicle using discrete reference markers fixed to the road surface are investigated analytically. Either optical or magnetic approaches can be used for the sensor, which generates a measurement of the lateral offset of the vehicle path at each marker to form the basic data for steering control. Possible mechanizations of sensor and controller are outlined. Techniques for handling certain anomalous conditions, such as a missing marker, or loss of acquisition, and special maneuvers, such as u-turns and switching, are briefly discussed. A general analysis of the vehicle dynamics and the discrete control system is presented using the state variable formulation. Noise in both the sensor measurement and in the steering servo are accounted for. An optimal controller is simulated on a general purpose computer, and the resulting plots of vehicle path are presented. Parameters representing a small multipassenger tram were selected, and the simulation runs show response to an erroneous sensor measurement and acquisition following large initial path errors.

The terminal area automated path generation problem

NASA Technical Reports Server (NTRS)

Hsin, C.-C.

1977-01-01

The automated terminal area path generation problem in the advanced Air Traffic Control System (ATC), has been studied. Definitions, input, output and the interrelationships with other ATC functions have been discussed. Alternatives in modeling the problem have been identified. Problem formulations and solution techniques are presented. In particular, the solution of a minimum effort path stretching problem (path generation on a given schedule) has been carried out using the Newton-Raphson trajectory optimization method. Discussions are presented on the effect of different delivery time, aircraft entry position, initial guess on the boundary conditions, etc. Recommendations are made on real-world implementations.

Millimeter-wave studies

NASA Technical Reports Server (NTRS)

Allen, Kenneth C.

1988-01-01

Progress on millimeter-wave propagation experiments in Hawaii is reported. A short path for measuring attenuation in rain at 9.6, 28.8, 57.6, and 96.1 GHz is in operation. A slant path from Hilo to the top of Mauna Kea is scheduled. On this path, scattering from rain and clouds that may cause interference for satellites closely spaced in geosynchronous orbit will be measured at the same frequencies at 28.8 and 96.1 GHz. In addition the full transmission matrix will be measured at the same frequencies on the slant path. The technique and equipment used to measure the transmission matrix are described.

Detection of silver nanoparticles in seawater at ppb levels using UV-visible spectrophotometry with long path cells.

PubMed

Lodeiro, Pablo; Achterberg, Eric P; El-Shahawi, Mohammad S

2017-03-01

Silver nanoparticles (AgNPs) are emerging contaminants that are difficult to detect in natural waters. UV-visible spectrophotometry is a simple technique that allows detection of AgNPs through analysis of their characteristic surface plasmon resonance band. The detection limit for nanoparticles using up to 10cm path length cuvettes with UV-visible spectrophotometry is in the 0.1-10ppm range. This detection limit is insufficiently low to observe AgNPs in natural environments. Here we show how the use of capillary cells with an optical path length up to 200cm, forms an excellent technique for rapid detection and quantification of non-aggregated AgNPs at ppb concentrations in complex natural matrices such as seawater. Copyright © 2016 Elsevier B.V. All rights reserved.

Triple-Pulse Integrated Path Differential Absorption Lidar for Carbon Dioxide Measurement - Novel Lidar Technologies and Techniques with Path to Space

NASA Technical Reports Server (NTRS)

Singh, Upendra N.; Refaat, Tamer F.; Petros, Mulugeta

2017-01-01

The societal benefits of understanding climate change through identification of global carbon dioxide sources and sinks led to the desired NASA's active sensing of carbon dioxide emissions over nights, days, and seasons (ASCENDS) space-based missions of global carbon dioxide measurements. For more than 15 years, NASA Langley Research Center (LaRC) have developed several carbon dioxide active remote sensors using the differential absorption lidar (DIAL) technique operating at the two-micron wavelength. Currently, an airborne two-micron triple-pulse integrated path differential absorption (IPDA) lidar is under development. This IPDA lidar measures carbon dioxide as well as water vapor, the dominant interfering molecule on carbon dioxide remote sensing. Advancement of this triple-pulse IPDA lidar development is presented.

Vector Pursuit Path Tracking for Autonomous Ground Vehicles

DTIC Science & Technology

2000-08-01

vi INTRODUCTION ...........................................................................................................1...other geometric path-tracking techniques. 1 CHAPTER 1 INTRODUCTION An autonomous vehicle is one that is capable of automatic navigation. It is...Joint Architecture for Unmanned Ground Vehicles ( JAUGS ) working group meeting held at the University of Florida. 5 Figure 1.5: Autonomous

Adaptive designs in clinical trials.

PubMed

Bowalekar, Suresh

2011-01-01

In addition to the expensive and lengthy process of developing a new medicine, the attrition rate in clinical research was on the rise, resulting in stagnation in the development of new compounds. As a consequence to this, the US Food and Drug Administration released a critical path initiative document in 2004, highlighting the need for developing innovative trial designs. One of the innovations suggested the use of adaptive designs for clinical trials. Thus, post critical path initiative, there is a growing interest in using adaptive designs for the development of pharmaceutical products. Adaptive designs are expected to have great potential to reduce the number of patients and duration of trial and to have relatively less exposure to new drug. Adaptive designs are not new in the sense that the task of interim analysis (IA)/review of the accumulated data used in adaptive designs existed in the past too. However, such reviews/analyses of accumulated data were not necessarily planned at the stage of planning clinical trial and the methods used were not necessarily compliant with clinical trial process. The Bayesian approach commonly used in adaptive designs was developed by Thomas Bayes in the 18th century, about hundred years prior to the development of modern statistical methods by the father of modern statistics, Sir Ronald A. Fisher, but the complexity involved in Bayesian approach prevented its use in real life practice. The advances in the field of computer and information technology over the last three to four decades has changed the scenario and the Bayesian techniques are being used in adaptive designs in addition to other sequential methods used in IA. This paper attempts to describe the various adaptive designs in clinical trial and views of stakeholders about feasibility of using them, without going into mathematical complexities.

Rapid Onboard Trajectory Design for Autonomous Spacecraft in Multibody Systems

NASA Astrophysics Data System (ADS)

Trumbauer, Eric Michael

This research develops automated, on-board trajectory planning algorithms in order to support current and new mission concepts. These include orbiter missions to Phobos or Deimos, Outer Planet Moon orbiters, and robotic and crewed missions to small bodies. The challenges stem from the limited on-board computing resources which restrict full trajectory optimization with guaranteed convergence in complex dynamical environments. The approach taken consists of leveraging pre-mission computations to create a large database of pre-computed orbits and arcs. Such a database is used to generate a discrete representation of the dynamics in the form of a directed graph, which acts to index these arcs. This allows the use of graph search algorithms on-board in order to provide good approximate solutions to the path planning problem. Coupled with robust differential correction and optimization techniques, this enables the determination of an efficient path between any boundary conditions with very little time and computing effort. Furthermore, the optimization methods developed here based on sequential convex programming are shown to have provable convergence properties, as well as generating feasible major iterates in case of a system interrupt -- a key requirement for on-board application. The outcome of this project is thus the development of an algorithmic framework which allows the deployment of this approach in a variety of specific mission contexts. Test cases related to missions of interest to NASA and JPL such as a Phobos orbiter and a Near Earth Asteroid interceptor are demonstrated, including the results of an implementation on the RAD750 flight processor. This method fills a gap in the toolbox being developed to create fully autonomous space exploration systems.

Financial Preparation for Retirement in Brazil: a Cross-Cultural Test of the Interdisciplinary Financial Planning Model.

PubMed

França, Lucia H F; Hershey, Douglas A

2018-03-01

In this investigation, we attempt to replicate the Interdisciplinary Financial Planning Model advanced by Hershey et al. (International Journal of Aging and Human Development, 70, 1-38, 2010) using a sample of Brazilian adults. This model, which was originally tested on individuals from The Netherlands and the United States, posits that psychological, social, and economic forces are key determinants of retirement planning practices and perceptions of saving adequacy. Taken together, fifteen hypotheses were subject to evaluation. Participants were 167 Brazilian working adults, 21-69 years of age, who were married or cohabitating at the time of testing. A path analysis model showed substantial support for the theoretical framework, with all variables found to contribute directly or indirectly to the prediction of financial planning and saving adequacy. Furthermore, two new paths were found to emerge in the Brazilian model that were not observed in the original investigation. This cross-national replication of the Interdisciplinary Financial Planning Model extends research on the topic to a developing country in which relatively few empirical studies of retirement planning have been carried out. Other analyses in the article focus on direct comparisons between the Brazilian model and the models developed based on American and Dutch respondents, with an eye toward better understanding how cultural forces shape the retirement planning process. The discussion focuses on how models of financial planning, such as the Hershey et al. (2010) model, can inform the development of savings-oriented education and intervention programs.

Rectangular Array Of Digital Processors For Planning Paths

NASA Technical Reports Server (NTRS)

Kemeny, Sabrina E.; Fossum, Eric R.; Nixon, Robert H.

1993-01-01

Prototype 24 x 25 rectangular array of asynchronous parallel digital processors rapidly finds best path across two-dimensional field, which could be patch of terrain traversed by robotic or military vehicle. Implemented as single-chip very-large-scale integrated circuit. Excepting processors on edges, each processor communicates with four nearest neighbors along paths representing travel to north, south, east, and west. Each processor contains delay generator in form of 8-bit ripple counter, preset to 1 of 256 possible values. Operation begins with choice of processor representing starting point. Transmits signals to nearest neighbor processors, which retransmits to other neighboring processors, and process repeats until signals propagated across entire field.

NASA's Flexible Path for the Human Exploration

NASA Technical Reports Server (NTRS)

Soeder, James F.

2016-01-01

The idea of human exploration of Mars has been a topic in science fiction for close to a century. For the past 50 years it has been a major thrust in NASAs space mission planning. Currently, NASA is pursuing a flexible development path with the final goal to have humans on Mars. To reach Mars, new hardware will have to be developed and many technology hurdles will have to be overcome. This presentation discusses Mars and its Moons; the flexible path currently being followed; the hardware under development to support exploration; and the technical and organizational challenges that must be overcome to realize the age old dream of humans traveling to Mars.

A Comparative Evaluation of the Effect of Double Casting Technique Using Functionally Generated Path and Conventional Single Casting with Respect to Functional Articulation, Patient Satisfaction and Chair Side Time, in Single Unit Molar Teeth: An In Vivo Study.

PubMed

Memon, Sarfaraz

2014-12-01

A stable centric occlusal position that shows no evidence of occlusal disease should not be altered. Confirmative restorative dentistry deals with making restorations that are in harmony with existing jaw relations. Conventional techniques for construction have been unsuccessful in producing a prosthesis that can be inserted without minor intraoral occlusal adjustment. This study was conducted to evaluate the benefits of the double casting technique with FGP over the conventional casting technique. Ten patients with root canal treated maxillary molar were selected for the fabrication of metal crown. Two techniques, one involving the conventional fabrication and other using functionally generated path with double casting were used to fabricate the prosthesis. A comparison based on various parameters which was done between the two techniques. The change in the height of castings for the double casting group was less compared to the conventional group and was highly statistically significant (P < 0.001). The time taken for occlusal correction was significantly lower in double casting group than the conventional group (P < 0.001). The patient satisfaction (before occlusal correction) indicated better satisfaction for double casting group compared to conventional (P < 0.01). The functionally generated path with double casting technique resulted in castings which had better dimensional accuracy, less occlusal correction and better patient satisfaction compared to the conventional castings.

Operational Planning for Multiple Heterogeneous Unmanned Aerial Vehicles in Three Dimensions

DTIC Science & Technology

2009-06-01

human input in the planning process. Two solution methods are presented: (1) a mixed-integer program, and (2) an algorithm that utilizes a metaheuristic ...and (2) an algorithm that utilizes a metaheuristic to generate composite variables for a linear program, called the Composite Operations Planning...that represent a path and an associated type of UAV. The reformulation is incorporated into an algorithm that uses a metaheuristic to generate the

NATO Needs a Comprehensive Strategy for Russia

DTIC Science & Technology

2015-01-01

stated their intent to continue on this path in the 2014 Wales Summit Declaration, when they announced a Readiness Action Plan that will create a...expansion of other military activities, such as joint planning , information exchanges, discus- sions among senior leaders, and ship visits. Second...end of the Cold War. For example, the Army stationed about 213,000 soldiers on 41 garrisons in Europe in 1989 but plans to have only about 30,000

SU-E-T-49: A Multi-Institutional Study of Independent Dose Verification for IMRT

DOE Office of Scientific and Technical Information (OSTI.GOV)

Baba, H; Tachibana, H; Kamima, T

2015-06-15

Purpose: AAPM TG114 does not cover the independent verification for IMRT. We conducted a study of independent dose verification for IMRT in seven institutes to show the feasibility. Methods: 384 IMRT plans in the sites of prostate and head and neck (HN) were collected from the institutes, where the planning was performed using Eclipse and Pinnacle3 with the two techniques of step and shoot (S&S) and sliding window (SW). All of the institutes used a same independent dose verification software program (Simple MU Analysis: SMU, Triangle Product, Ishikawa, JP), which is Clarkson-based and CT images were used to compute radiologicalmore » path length. An ion-chamber measurement in a water-equivalent slab phantom was performed to compare the doses computed using the TPS and an independent dose verification program. Additionally, the agreement in dose computed in patient CT images between using the TPS and using the SMU was assessed. The dose of the composite beams in the plan was evaluated. Results: The agreement between the measurement and the SMU were −2.3±1.9 % and −5.6±3.6 % for prostate and HN sites, respectively. The agreement between the TPSs and the SMU were −2.1±1.9 % and −3.0±3.7 for prostate and HN sites, respectively. There was a negative systematic difference with similar standard deviation and the difference was larger in the HN site. The S&S technique showed a statistically significant difference between the SW. Because the Clarkson-based method in the independent program underestimated (cannot consider) the dose under the MLC. Conclusion: The accuracy would be improved when the Clarkson-based algorithm should be modified for IMRT and the tolerance level would be within 5%.« less

Effect of digital template in the assistant of a giant condylar osteochondroma resection.

PubMed

Bai, Guo; He, Dongmei; Yang, Chi; Lu, Chuan; Huang, Dong; Chen, Minjie; Yuan, Jianbing

2014-05-01

Exostosis osteochondroma is usually resected with the whole condyle even part of it is not involved. This study was to report the effect of using digital template in the assistant of resection while protecting the uninvolved condyle. We used computer-aided design technique in the assistant of making preoperative plan of a patient with giant condylar osteochondroma of exogenous type, including determining the boundary between the tumor and the articular surface of condyle, and designing the virtual tumor resection plane, surgical approach, and remove-out path of the tumor. The digital osteotomy template was made by rapid prototyping technique based on the preoperative plan. Postoperative CT scan was performed and merged with the preoperative CT by the Proplan 1.3 system to evaluate the accuracy of surgical resection with the guide of digital template. The osteotomy template was attached to the lateral surface of condyle accurately, and the tumor was removed totally by the guide of the template without injuries to adjacent nerves and vessels. Postoperative CT showed that the osteochondroma was removed completely and the unaffected articular surface of condyle was preserved well. The merging of postoperative and preoperative CT by Proplan 1.3 system showed the outcome of the operation matched with the preoperative planning quite well with an error of 0.92 mm. There was no sign of recurrence after 6 months of follow-up. The application of digital template could improve the accuracy of the giant condylar tumor resection and help to preserve the uninvolved condyle. The use of digital template could reduce injuries to the nerves and vessels as well as save time for the operation.

SU-E-T-457: Impact of Interfractional Variations On Anterior Vs. Lateral-Field Proton Therapy of Prostate Cancer

DOE Office of Scientific and Technical Information (OSTI.GOV)

Moteabbed, M; Trofimov, A; Sharp, G C

2015-06-15

Purpose: To investigate the effects of interfractional anatomy and setup variations on plans with anterior-oblique vs. lateral beams for prostate cancer pencil beam scanning (PBS) and passive scattered (PS) proton therapy. Methods: Six patients with low/intermediate risk prostate cancer treated with PS proton therapy at our institution were selected. All patients underwent weekly verification CT scans. Implanted fiducials were used for localization, and endorectal balloons for prostate immobilization. New PBS plans with lateral beams, as well as PBS and PS plans with anterior-oblique beams (±35 deg) were created. PBS plans used two different spot sizes: ∼10mm (large) and ∼5mm (medium)more » sigma at 25cm range and optimized as single-field-uniform-dose with ∼8% non-uniformity. No range uncertainty margins were applied in PBS plans to maximize rectal sparing. Field-specific apertures were used when planning with large spots to sharpen the penumbrae. The planned dose was recomputed on each weekly CT with fiducials aligned to the simulation CT, scaled and accumulated via deformable image registration. Results: The dose volume analysis showed that although difference between planned and accumulated dose remains negligible for plans with conventional lateral beams using both PS and PBS, this is not the case for plans with anterior beams. The target coverage in anterior plans was largely degraded due to the variations in the beam path length and the absence of range margins. The average prostate D95 was reduced by 7.5/15.9% (using PS/PBS) after accumulation for anterior plans, compared with 0/0.4% for lateral plans. The average mean dose in organs-at-risk decreased by 1% for lateral and 2% for anterior plans, similarly for PS and PBS. Spot size did not affect the dose changes. Conclusion: Prostate plans using anterior beams may undergo clinically relevant interfractional dose degradation. Corrective strategies guided by in-vivo range measurements should be studied before clinical application of this technique.« less

User's guide to Monte Carlo methods for evaluating path integrals

NASA Astrophysics Data System (ADS)

Westbroek, Marise J. E.; King, Peter R.; Vvedensky, Dimitri D.; Dürr, Stephan

2018-04-01

We give an introduction to the calculation of path integrals on a lattice, with the quantum harmonic oscillator as an example. In addition to providing an explicit computational setup and corresponding pseudocode, we pay particular attention to the existence of autocorrelations and the calculation of reliable errors. The over-relaxation technique is presented as a way to counter strong autocorrelations. The simulation methods can be extended to compute observables for path integrals in other settings.

Heating and thermal control of brazing technique to break contamination path for potential Mars sample return

NASA Astrophysics Data System (ADS)

Bao, Xiaoqi; Badescu, Mircea; Sherrit, Stewart; Bar-Cohen, Yoseph; Campos, Sergio

2017-04-01

The potential return of Mars sample material is of great interest to the planetary science community, as it would enable extensive analysis of samples with highly sensitive laboratory instruments. It is important to make sure such a mission concept would not bring any living microbes, which may possibly exist on Mars, back to Earth's environment. In order to ensure the isolation of Mars microbes from Earth's Atmosphere, a brazing sealing and sterilizing technique was proposed to break the Mars-to-Earth contamination path. Effectively, heating the brazing zone in high vacuum space and controlling the sample temperature for integrity are key challenges to the implementation of this technique. The break-thechain procedures for container configurations, which are being considered, were simulated by multi-physics finite element models. Different heating methods including induction and resistive/radiation were evaluated. The temperature profiles of Martian samples in a proposed container structure were predicted. The results show that the sealing and sterilizing process can be controlled such that the samples temperature is maintained below the level that may cause damage, and that the brazing technique is a feasible approach to breaking the contamination path.

Construction of Optimal-Path Maps for Homogeneous-Cost-Region Path-Planning Problems

DTIC Science & Technology

1989-09-01

of Artificial Inteligence , 9%,4. 24. Kirkpatrick, S., Gelatt Jr., C. D., and Vecchi, M. P., "Optinization by Sinmulated Ani- nealing", Science, Vol...studied in depth by researchers in such fields as artificial intelligence, robot;cs, and computa- tional geometry. Most methods require homogeneous...the results of the research. 10 U. L SLEVANT RESEARCH A. APPLICABLE CONCEPTS FROM ARTIFICIAL INTELLIGENCE 1. Search Methods One of the central

THE CRITICAL-PATH METHOD OF CONSTRUCTION CONTROL.

ERIC Educational Resources Information Center

DOMBROW, RODGER T.; MAUCHLY, JOHN

THIS DISCUSSION PRESENTS A DEFINITION AND BRIEF DESCRIPTION OF THE CRITICAL-PATH METHOD AS APPLIED TO BUILDING CONSTRUCTION. INTRODUCING REMARKS CONSIDER THE MOST PERTINENT QUESTIONS PERTAINING TO CPM AND THE NEEDS ASSOCIATED WITH MINIMIZING TIME AND COST ON CONSTRUCTION PROJECTS. SPECIFIC DISCUSSION INCLUDES--(1) ADVANTAGES OF NETWORK TECHNIQUES,…

Multispectral scanner system parameter study and analysis software system description, volume 2

NASA Technical Reports Server (NTRS)

Landgrebe, D. A. (Principal Investigator); Mobasseri, B. G.; Wiersma, D. J.; Wiswell, E. R.; Mcgillem, C. D.; Anuta, P. E.

1978-01-01

The author has identified the following significant results. The integration of the available methods provided the analyst with the unified scanner analysis package (USAP), the flexibility and versatility of which was superior to many previous integrated techniques. The USAP consisted of three main subsystems; (1) a spatial path, (2) a spectral path, and (3) a set of analytic classification accuracy estimators which evaluated the system performance. The spatial path consisted of satellite and/or aircraft data, data correlation analyzer, scanner IFOV, and random noise model. The output of the spatial path was fed into the analytic classification and accuracy predictor. The spectral path consisted of laboratory and/or field spectral data, EXOSYS data retrieval, optimum spectral function calculation, data transformation, and statistics calculation. The output of the spectral path was fended into the stratified posterior performance estimator.

Estimation of High-Frequency Earth-Space Radio Wave Signals via Ground-Based Polarimetric Radar Observations

NASA Technical Reports Server (NTRS)

Bolen, Steve; Chandrasekar, V.

2002-01-01

Expanding human presence in space, and enabling the commercialization of this frontier, is part of the strategic goals for NASA's Human Exploration and Development of Space (HEDS) enterprise. Future near-Earth and planetary missions will support the use of high-frequency Earth-space communication systems. Additionally, increased commercial demand on low-frequency Earth-space links in the S- and C-band spectra have led to increased interest in the use of higher frequencies in regions like Ku and Ka-band. Attenuation of high-frequency signals, due to a precipitating medium, can be quite severe and can cause considerable disruptions in a communications link that traverses such a medium. Previously, ground radar measurements were made along the Earth-space path and compared to satellite beacon data that was transmitted to a ground station. In this paper, quantitative estimation of the attenuation along the propagation path is made via inter-comparisons of radar data taken from the Tropical Rainfall Measuring Mission (TRMM) Precipitation Radar (PR) and ground-based polarimetric radar observations. Theoretical relationships between the expected specific attenuation (k) of spaceborne measurements with ground-based measurements of reflectivity (Zh) and differential propagation phase shift (Kdp) are developed for various hydrometeors that could be present along the propagation path, which are used to estimate the two-way path-integrated attenuation (PIA) on the PR return echo. Resolution volume matching and alignment of the radar systems is performed, and a direct comparison of PR return echo with ground radar attenuation estimates is made directly on a beam-by-beam basis. The technique is validated using data collected from the TExas and Florida UNderflights (TEFLUN-B) experiment and the TRMM large Biosphere-Atmosphere experiment in Amazonia (LBA) campaign. Attenuation estimation derived from this method can be used for strategiC planning of communication systems for future HEDS missions.

Presurgical cleft lip and palate orthopedics: an overview

PubMed Central

Alzain, Ibtesam; Batwa, Waeil; Cash, Alex; Murshid, Zuhair A

2017-01-01

Patients with cleft lip and/or palate go through a lifelong journey of multidisciplinary care, starting from before birth and extending until adulthood. Presurgical orthopedic (PSO) treatment is one of the earliest stages of this care plan. In this paper we provide a review of the PSO treatment. This review should help general and specialist dentists to better understand the cleft patient care path and to be able to answer patient queries more efficiently. The objectives of this paper were to review the basic principles of PSO treatment, the various types of techniques used in this therapy, and the protocol followed, and to critically evaluate the advantages and disadvantages of some of these techniques. In conclusion, we believe that PSO treatment, specifically nasoalveolar molding, does help to approximate the segments of the cleft maxilla and does reduce the intersegment space in readiness for the surgical closure of cleft sites. However, what we remain unable to prove equivocally at this point is whether the reduction in the dimensions of the cleft presurgically and the manipulation of the nasal complex benefit our patients in the long term. PMID:28615974

Measurements of 12C ions beam fragmentation at large angle with an Emulsion Cloud Chamber

NASA Astrophysics Data System (ADS)

Alexandrov, A.; De Lellis, G.; Di Crescenzo, A.; Lauria, A.; Montesi, M. C.; Pastore, A.; Patera, V.; Sarti, A.; Tioukov, V.

2017-08-01

Hadron radiotherapy is a powerful technique for the treatment of deep-seated tumours. The physical dose distribution of hadron beams is characterized by a small dose delivered in the entrance channel and a large dose in the Bragg peak area. Fragmentation of the incident particles and struck nuclei occurs along the hadron path. Knowledge of the fragment energies and angular distributions is crucial for the validation of the models used in treatment planning systems. We report on large angle fragmentation measurements of a 400 MeV/n 12C beam impinging on a composite target at the GSI laboratory in Germany. The detector was made of 300 micron thick nuclear emulsion films, with sub-micrometric spatial resolution and large angle track detection capability, interleaved with passive material. Thanks to newly developed techniques in the automated scanning of emulsions it was possible to extend the angular range of detected particles. This resulted in the first measurement of the angular and momentum spectrum for fragments emitted in the range from 34o to 81o.

VHF/UHF technique for the determination of the columnar electron contents of the plasmasphere and of the protonosphere using geostationary satellite transmission: Observations during magnetic storms

NASA Technical Reports Server (NTRS)

Almeida, O. G.

1972-01-01

Measurements of the total electron content of the plasmasphere up to geostationary heights were made using the beacon transmitters aboard the satellite ATS-3. The technique employed is a combination of the phase-path length difference and the Faraday rotation angle methods. Such a combination permits very accurate determination of the integration constant necessary to convert phase-path length difference data into information about the absolute value of the columnar content.

Kinematics, controls, and path planning results for a redundant manipulator

NASA Technical Reports Server (NTRS)

Gretz, Bruce; Tilley, Scott W.

1989-01-01

The inverse kinematics solution, a modal position control algorithm, and path planning results for a 7 degree of freedom manipulator are presented. The redundant arm consists of two links with shoulder and elbow joints and a spherical wrist. The inverse kinematics problem for tip position is solved and the redundant joint is identified. It is also shown that a locus of tip positions exists in which there are kinematic limitations on self-motion. A computationally simple modal position control algorithm has been developed which guarantees a nearly constant closed-loop dynamic response throughout the workspace. If all closed-loop poles are assigned to the same location, the algorithm can be implemented with very little computation. To further reduce the required computation, the modal gains are updated only at discrete time intervals. Criteria are developed for the frequency of these updates. For commanding manipulator movements, a 5th-order spline which minimizes jerk provides a smooth tip-space path. Schemes for deriving a corresponding joint-space trajectory are discussed. Modifying the trajectory to avoid joint torque saturation when a tip payload is added is also considered. Simulation results are presented.

The High Field Path to Practical Fusion Energy

NASA Astrophysics Data System (ADS)

Mumgaard, Robert; Whyte, D.; Greenwald, M.; Hartwig, Z.; Brunner, D.; Sorbom, B.; Marmar, E.; Minervini, J.; Bonoli, P.; Irby, J.; Labombard, B.; Terry, J.; Vieira, R.; Wukitch, S.

2017-10-01

We propose a faster, lower cost development path for fusion energy enabled by high temperature superconductors, devices at high magnetic field, innovative technologies and modern approaches to technology development. Timeliness, scale, and economic-viability are the drivers for fusion energy to combat climate change and aid economic development. The opportunities provided by high-temperature superconductors, innovative engineering and physics, and new organizational structures identified over the last few years open new possibilities for realizing practical fusion energy that could meet mid-century de-carbonization needs. We discuss re-factoring the fusion energy development path with an emphasis on concrete risk retirement strategies utilizing a modular approach based on the high-field tokamak that leverages the broader tokamak physics understanding of confinement, stability, and operational limits. Elements of this plan include development of high-temperature superconductor magnets, simplified immersion blankets, advanced long-leg divertors, a compact divertor test tokamak, efficient current drive, modular construction, and demountable magnet joints. An R&D plan culminating in the construction of an integrated pilot plant and test facility modeled on the ARC concept is presented.

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

NASA Technical Reports Server (NTRS)

Farah, Jeffrey J.; Kelley, Robert B.

1992-01-01

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.

Programs for road network planning.

Treesearch

Ward W. Carson; Dennis P. Dykstra

1978-01-01

This paper describes four computer programs developed to assist logging engineers to plan transportation in a forest. The objective of these programs, to be used together, is to find the shortest path through a transportation network from a point of departure to a destination. Three of the programs use the digitizing and plotting capabilities of a programable desk-top...

Partnerships: The Path to Improving Crisis Communication

DTIC Science & Technology

2007-03-01

News Media Perceives Relationships with Public Safety.................32 Table 4. Public Safety SWOT Analysis ...opportunities and threats ( SWOT ) of the Seattle fire and police departments. The SWOT analysis is an assessment tool common to strategic planning for...requirements for training • Lack of strategic planning experience Table 4. Public Safety SWOT Analysis 46 Table 4 compares the strengths and

Rover Slip Validation and Prediction Algorithm

NASA Technical Reports Server (NTRS)

Yen, Jeng

2009-01-01

A physical-based simulation has been developed for the Mars Exploration Rover (MER) mission that applies a slope-induced wheel-slippage to the rover location estimator. Using the digital elevation map from the stereo images, the computational method resolves the quasi-dynamic equations of motion that incorporate the actual wheel-terrain speed to estimate the gross velocity of the vehicle. Based on the empirical slippage measured by the Visual Odometry software of the rover, this algorithm computes two factors for the slip model by minimizing the distance of the predicted and actual vehicle location, and then uses the model to predict the next drives. This technique, which has been deployed to operate the MER rovers in the extended mission periods, can accurately predict the rover position and attitude, mitigating the risk and uncertainties in the path planning on high-slope areas.

OMEGA (Offshore Membrane for Enclosing Algae). NASA-NAVY: A Strategic Planning Discussion

NASA Technical Reports Server (NTRS)

Trent, Jonathan

2010-01-01

This briefing packet provides a short introduction to OMEGA and a truncated version of our project approach, with an example of the kind of work break down structure (WBS) used to guide our Phase I activities. It is meant to give you an impression of how we are approaching the challenge of creating the world's first marine photobioreactor (PBR) that will scale to address the strategic energy problems confronting the United States and the world. Some of our conceptual PBR designs and plans for logistics are included to communicate the path we have taken. We have also included an aerial photograph of the experimental tanks we are using at the Cal Fish and Game, followed by concluding remarks. The overarching purpose of the strategic planning discussion in Norfolk is to establish the relationship between the NASA OMEGA Team and the Navy, to unite the strengths of both agencies, and to map a mutual way forward along the project's established critical path.

A human-machine cooperation route planning method based on improved A* algorithm

NASA Astrophysics Data System (ADS)

Zhang, Zhengsheng; Cai, Chao

2011-12-01

To avoid the limitation of common route planning method to blindly pursue higher Machine Intelligence and autoimmunization, this paper presents a human-machine cooperation route planning method. The proposed method includes a new A* path searing strategy based on dynamic heuristic searching and a human cooperated decision strategy to prune searching area. It can overcome the shortage of A* algorithm to fall into a local long term searching. Experiments showed that this method can quickly plan a feasible route to meet the macro-policy thinking.

Osm-Oriented Method of Multimodal Route Planning

NASA Astrophysics Data System (ADS)

Li, X.; Wu, Q.; Chen, L.; Xiong, W.; Jing, N.

2015-07-01

With the increasing pervasiveness of basic facilitate of transportation and information, the need of multimodal route planning is becoming more essential in the fields of communication and transportation, urban planning, logistics management, etc. This article mainly described an OSM-oriented method of multimodal route planning. Firstly, it introduced how to extract the information we need from OSM data and build proper network model and storage model; then it analysed the accustomed cost standard adopted by most travellers; finally, we used shortest path algorithm to calculate the best route with multiple traffic means.

Planning for the future.

PubMed

Stiewing, Janis

2002-01-01

Revising the strategic plan was the beginning of a multiyear initiative that will determine the path of the JRCERT. The key word in the preceding statement is beginning. The strategic plan is an ever-changing document. Although some components, such as the values statements, will stand over time, other components will change as accreditation and educational arenas change. That is the paradox of strategic planning: Remaining true to the vision, values and mission statements requires knowing when to change to keep the JRCERT aligned with the responsive to its communities of interest.

Optimization and planning of operating theatre activities: an original definition of pathways and process modeling.

PubMed

Barbagallo, Simone; Corradi, Luca; de Ville de Goyet, Jean; Iannucci, Marina; Porro, Ivan; Rosso, Nicola; Tanfani, Elena; Testi, Angela

2015-05-17

The Operating Room (OR) is a key resource of all major hospitals, but it also accounts for up 40% of resource costs. Improving cost effectiveness, while maintaining a quality of care, is a universal objective. These goals imply an optimization of planning and a scheduling of the activities involved. This is highly challenging due to the inherent variable and unpredictable nature of surgery. A Business Process Modeling Notation (BPMN 2.0) was used for the representation of the "OR Process" (being defined as the sequence of all of the elementary steps between "patient ready for surgery" to "patient operated upon") as a general pathway ("path"). The path was then both further standardized as much as possible and, at the same time, keeping all of the key-elements that would allow one to address or define the other steps of planning, and the inherent and wide variability in terms of patient specificity. The path was used to schedule OR activity, room-by-room, and day-by-day, feeding the process from a "waiting list database" and using a mathematical optimization model with the objective of ending up in an optimized planning. The OR process was defined with special attention paid to flows, timing and resource involvement. Standardization involved a dynamics operation and defined an expected operating time for each operation. The optimization model has been implemented and tested on real clinical data. The comparison of the results reported with the real data, shows that by using the optimization model, allows for the scheduling of about 30% more patients than in actual practice, as well as to better exploit the OR efficiency, increasing the average operating room utilization rate up to 20%. The optimization of OR activity planning is essential in order to manage the hospital's waiting list. Optimal planning is facilitated by defining the operation as a standard pathway where all variables are taken into account. By allowing a precise scheduling, it feeds the process of planning and, further up-stream, the management of a waiting list in an interactive and bi-directional dynamic process.

Generalized Ensemble Sampling of Enzyme Reaction Free Energy Pathways

PubMed Central

Wu, Dongsheng; Fajer, Mikolai I.; Cao, Liaoran; Cheng, Xiaolin; Yang, Wei

2016-01-01

Free energy path sampling plays an essential role in computational understanding of chemical reactions, particularly those occurring in enzymatic environments. Among a variety of molecular dynamics simulation approaches, the generalized ensemble sampling strategy is uniquely attractive for the fact that it not only can enhance the sampling of rare chemical events but also can naturally ensure consistent exploration of environmental degrees of freedom. In this review, we plan to provide a tutorial-like tour on an emerging topic: generalized ensemble sampling of enzyme reaction free energy path. The discussion is largely focused on our own studies, particularly ones based on the metadynamics free energy sampling method and the on-the-path random walk path sampling method. We hope that this mini presentation will provide interested practitioners some meaningful guidance for future algorithm formulation and application study. PMID:27498634

Design of Quiet Rotorcraft Approach Trajectories

NASA Technical Reports Server (NTRS)

Padula, Sharon L.; Burley, Casey L.; Boyd, D. Douglas, Jr.; Marcolini, Michael A.

2009-01-01

A optimization procedure for identifying quiet rotorcraft approach trajectories is proposed and demonstrated. The procedure employs a multi-objective genetic algorithm in order to reduce noise and create approach paths that will be acceptable to pilots and passengers. The concept is demonstrated by application to two different helicopters. The optimized paths are compared with one another and to a standard 6-deg approach path. The two demonstration cases validate the optimization procedure but highlight the need for improved noise prediction techniques and for additional rotorcraft acoustic data sets.

HYBRID SILICON-ON-SAPPHIRE/SCALED CMOS INTERFERENCE MITIGATION FRONT END BASED ON SIMULTANEOUS NOISE CANCELLATION, ACTIVE-INTERFERENCE CANCELLATION AND N-PATH-MIXER FILTERING

DTIC Science & Technology

2017-04-01

INTERFERENCE-CANCELLATION AND N-PATH-MIXER FILTERING Harish Krishnaswamy, Negar Reiskarimian, and Linxiao Zhang Columbia University APRIL 2017 Final...INTERFERENCE-CANCELLATION AND N- PATH-MIXER FILTERING 5a. CONTRACT NUMBER FA8650-14-1-7414 5b. GRANT NUMBER 5c. PROGRAM ELEMENT NUMBER 61101E/62716E 6...techniques for developing interference mitigation technology (IMT) enabling frequency-agile, reconfigurable filter -less receivers. Wideband noise

Laser production of articles from powders

DOEpatents

Lewis, Gary K.; Milewski, John O.; Cremers, David A.; Nemec, Ronald B.; Barbe, Michael R.

1998-01-01

Method and apparatus for forming articles from materials in particulate form in which the materials are melted by a laser beam and deposited at points along a tool path to form an article of the desired shape and dimensions. Preferably the tool path and other parameters of the deposition process are established using computer-aided design and manufacturing techniques. A controller comprised of a digital computer directs movement of a deposition zone along the tool path and provides control signals to adjust apparatus functions, such as the speed at which a deposition head which delivers the laser beam and powder to the deposition zone moves along the tool path.

Laser production of articles from powders

DOEpatents

Lewis, G.K.; Milewski, J.O.; Cremers, D.A.; Nemec, R.B.; Barbe, M.R.

1998-11-17

Method and apparatus for forming articles from materials in particulate form in which the materials are melted by a laser beam and deposited at points along a tool path to form an article of the desired shape and dimensions. Preferably the tool path and other parameters of the deposition process are established using computer-aided design and manufacturing techniques. A controller comprised of a digital computer directs movement of a deposition zone along the tool path and provides control signals to adjust apparatus functions, such as the speed at which a deposition head which delivers the laser beam and powder to the deposition zone moves along the tool path. 20 figs.

Entanglement by Path Identity.

PubMed

Krenn, Mario; Hochrainer, Armin; Lahiri, Mayukh; Zeilinger, Anton

2017-02-24

Quantum entanglement is one of the most prominent features of quantum mechanics and forms the basis of quantum information technologies. Here we present a novel method for the creation of quantum entanglement in multipartite and high-dimensional systems. The two ingredients are (i) superposition of photon pairs with different origins and (ii) aligning photons such that their paths are identical. We explain the experimentally feasible creation of various classes of multiphoton entanglement encoded in polarization as well as in high-dimensional Hilbert spaces-starting only from nonentangled photon pairs. For two photons, arbitrary high-dimensional entanglement can be created. The idea of generating entanglement by path identity could also apply to quantum entities other than photons. We discovered the technique by analyzing the output of a computer algorithm. This shows that computer designed quantum experiments can be inspirations for new techniques.

Entanglement by Path Identity

NASA Astrophysics Data System (ADS)

Krenn, Mario; Hochrainer, Armin; Lahiri, Mayukh; Zeilinger, Anton

2017-02-01

Quantum entanglement is one of the most prominent features of quantum mechanics and forms the basis of quantum information technologies. Here we present a novel method for the creation of quantum entanglement in multipartite and high-dimensional systems. The two ingredients are (i) superposition of photon pairs with different origins and (ii) aligning photons such that their paths are identical. We explain the experimentally feasible creation of various classes of multiphoton entanglement encoded in polarization as well as in high-dimensional Hilbert spaces—starting only from nonentangled photon pairs. For two photons, arbitrary high-dimensional entanglement can be created. The idea of generating entanglement by path identity could also apply to quantum entities other than photons. We discovered the technique by analyzing the output of a computer algorithm. This shows that computer designed quantum experiments can be inspirations for new techniques.

Role of Pharmacy Residency Training in Career Planning: A Student's Perspective.

PubMed

McElhaney, Ashley; Weber, Robert J

2014-12-01

Pharmacy students typically become more focused on career planning and assessment in the final year of their PharmD training. Weighing career options in the advanced pharmacy practice experience year can be both exciting and stressful. The goal of this article is to provide a primer on how pharmacy students can assess how a residency can fit into career planning. This article will describe the various career paths available to graduating students, highlight ways in which a residency can complement career choices, review the current state of the job market for pharmacists, discuss the current and future plans for residency programs, and present thoughts from some current and former residents on why they chose to complete a residency. Most career paths require some additional training, and a residency provides appropriate experience very quickly compared to on-the-job training. Alternative plans to residency training must also be considered, as there are not enough residency positions for candidates. Directors of pharmacy must consider several factors when giving career advice on pharmacy residency training to pharmacy students; they should provide the students with an honest assessment of their work skills and their abilities to successfully complete a residency. This assessment will help the students to set a plan for improvement and give them a better chance at being matched to a pharmacy residency.

Role of Pharmacy Residency Training in Career Planning: A Student’s Perspective

PubMed Central

McElhaney, Ashley; Weber, Robert J.

2014-01-01

Pharmacy students typically become more focused on career planning and assessment in the final year of their PharmD training. Weighing career options in the advanced pharmacy practice experience year can be both exciting and stressful. The goal of this article is to provide a primer on how pharmacy students can assess how a residency can fit into career planning. This article will describe the various career paths available to graduating students, highlight ways in which a residency can complement career choices, review the current state of the job market for pharmacists, discuss the current and future plans for residency programs, and present thoughts from some current and former residents on why they chose to complete a residency. Most career paths require some additional training, and a residency provides appropriate experience very quickly compared to on-the-job training. Alternative plans to residency training must also be considered, as there are not enough residency positions for candidates. Directors of pharmacy must consider several factors when giving career advice on pharmacy residency training to pharmacy students; they should provide the students with an honest assessment of their work skills and their abilities to successfully complete a residency. This assessment will help the students to set a plan for improvement and give them a better chance at being matched to a pharmacy residency. PMID:25673897

Avoiding space robot collisions utilizing the NASA/GSFC tri-mode skin sensor

NASA Technical Reports Server (NTRS)

Prinz, F. B.

1991-01-01

Sensor based robot motion planning research has primarily focused on mobile robots. Consider, however, the case of a robot manipulator expected to operate autonomously in a dynamic environment where unexpected collisions can occur with many parts of the robot. Only a sensor based system capable of generating collision free paths would be acceptable in such situations. Recently, work in this area has been reported in which a deterministic solution for 2DOF systems has been generated. The arm was sensitized with 'skin' of infra-red sensors. We have proposed a heuristic (potential field based) methodology for redundant robots with large DOF's. The key concepts are solving the path planning problem by cooperating global and local planning modules, the use of complete information from the sensors and partial (but appropriate) information from a world model, representation of objects with hyper-ellipsoids in the world model, and the use of variational planning. We intend to sensitize the robot arm with a 'skin' of capacitive proximity sensors. These sensors were developed at NASA, and are exceptionally suited for the space application. In the first part of the report, we discuss the development and modeling of the capacitive proximity sensor. In the second part we discuss the motion planning algorithm.

Analysis of Multi-Flight Common Routes for Traffic Flow Management

NASA Technical Reports Server (NTRS)

Sheth, Kapil; Clymer, Alexis; Morando, Alex; Shih, Fu-Tai

2016-01-01

When severe convective weather requires rerouting aircraft, FAA traffic managers employ severe weather avoidance plans (e.g., Playbook routes, Coded Departure Routes, etc.) These routes provide pilots with safe paths around weather-affected regions, and provide controllers with predictable, and often well-established flight plans. However, they often introduce large deviations to the nominal flight plans, which may not be necessary as weather conditions change. If and when the imposed traffic management initiatives (TMIs) become stale, updated shorter path flight trajectories may be found en route, providing significant time-savings to the affected flights. Multiple Flight Common Routes (MFCR) is a concept that allows multiple flights that are within a specified proximity or region, to receive updated shorter flight plans in an operationally efficient manner. MFCR is believed to provide benefits to the National Airspace System (NAS) by allowing traffic managers to update several flight plans of en route aircraft simultaneously, reducing operational workload within the TMUs of all affected ARTCCs. This paper will explore some aspects of the MFCR concept by analyzing multiple flights that have been selected for rerouting by the NAS Constraint Evaluation and Notification Tool (NASCENT). Various methods of grouping aircraft with common or similar routes will be presented, along with a comparison of the efficacy of these methods.