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.

MO-F-CAMPUS-T-03: Continuous Dose Delivery with Gamma Knife Perfexion

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

Ghobadi,; Li, W; Chung, C

2015-06-15

Purpose: We propose continuous dose delivery techniques for stereotactic treatments delivered by Gamma Knife Perfexion using inverse treatment planning system that can be applied to various tumour sites in the brain. We test the accuracy of the plans on Perfexion’s planning system (GammaPlan) to ensure the obtained plans are viable. This approach introduces continuous dose delivery for Perefxion, as opposed to the currently employed step-and-shoot approaches, for different tumour sites. Additionally, this is the first realization of automated inverse planning on GammaPlan. Methods: The inverse planning approach is divided into two steps of identifying a quality path inside the target,more » and finding the best collimator composition for the path. To find a path, we select strategic regions inside the target volume and find a path that visits each region exactly once. This path is then passed to a mathematical model which finds the best combination of collimators and their durations. The mathematical model minimizes the dose spillage to the surrounding tissues while ensuring the prescribed dose is delivered to the target(s). Organs-at-risk and their corresponding allowable doses can also be added to the model to protect adjacent organs. Results: We test this approach on various tumour sizes and sites. The quality of the obtained treatment plans are comparable or better than forward plans and inverse plans that use step- and-shoot technique. The conformity indices in the obtained continuous dose delivery plans are similar to those of forward plans while the beam-on time is improved on average (see Table 1 in supporting document). Conclusion: We employ inverse planning for continuous dose delivery in Perfexion for brain tumours. The quality of the obtained plans is similar to forward and inverse plans that use conventional step-and-shoot technique. We tested the inverse plans on GammaPlan to verify clinical relevance. This research was partially supported by Elekta, Sweden (vendor of Gamma Knife Perfexion)« less

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.

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.

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

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.

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.

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.

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).

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.

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.

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.

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.

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.

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.

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.

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.

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...

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.

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.

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.

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.

[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.

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…

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.

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.

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.

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

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.

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

Hybrid Motion Planning with Multiple Destinations

NASA Technical Reports Server (NTRS)

Clouse, Jeffery

1998-01-01

In our initial proposal, we laid plans for developing a hybrid motion planning system that combines the concepts of visibility-based motion planning, artificial potential field based motion planning, evolutionary constrained optimization, and reinforcement learning. Our goal was, and still is, to produce a hybrid motion planning system that outperforms the best traditional motion planning systems on problems with dynamic environments. The proposed hybrid system will be in two parts the first is a global motion planning system and the second is a local motion planning system. The global system will take global information about the environment, such as the placement of the obstacles and goals, and produce feasible paths through those obstacles. We envision a system that combines the evolutionary-based optimization and visibility-based motion planning to achieve this end.

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.

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.

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.

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.

INL Autonomous Navigation System

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

2005-03-30

The INL Autonomous Navigation System provides instructions for autonomously navigating a robot. The system permits high-speed autonomous navigation including obstacle avoidance, waypoing navigation and path planning in both indoor and outdoor environments.

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.

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.

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).

Robotic path-finding in inverse treatment planning for stereotactic radiosurgery with continuous dose delivery

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

Vandewouw, Marlee M., E-mail: marleev@mie.utoronto

Purpose: Continuous dose delivery in radiation therapy treatments has been shown to decrease total treatment time while improving the dose conformity and distribution homogeneity over the conventional step-and-shoot approach. The authors develop an inverse treatment planning method for Gamma Knife® Perfexion™ that continuously delivers dose along a path in the target. Methods: The authors’ method is comprised of two steps: find a path within the target, then solve a mixed integer optimization model to find the optimal collimator configurations and durations along the selected path. Robotic path-finding techniques, specifically, simultaneous localization and mapping (SLAM) using an extended Kalman filter, aremore » used to obtain a path that travels sufficiently close to selected isocentre locations. SLAM is novelly extended to explore a 3D, discrete environment, which is the target discretized into voxels. Further novel extensions are incorporated into the steering mechanism to account for target geometry. Results: The SLAM method was tested on seven clinical cases and compared to clinical, Hamiltonian path continuous delivery, and inverse step-and-shoot treatment plans. The SLAM approach improved dose metrics compared to the clinical plans and Hamiltonian path continuous delivery plans. Beam-on times improved over clinical plans, and had mixed performance compared to Hamiltonian path continuous plans. The SLAM method is also shown to be robust to path selection inaccuracies, isocentre selection, and dose distribution. Conclusions: The SLAM method for continuous delivery provides decreased total treatment time and increased treatment quality compared to both clinical and inverse step-and-shoot plans, and outperforms existing path methods in treatment quality. It also accounts for uncertainty in treatment planning by accommodating inaccuracies.« less

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.

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.

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.

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.

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.

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.

Mobile robots IV; Proceedings of the Meeting, Philadelphia, PA, Nov. 6, 7, 1989

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

Wolfe, W.J.; Chun, W.H.

1990-01-01

The present conference on mobile robot systems discusses high-speed machine perception based on passive sensing, wide-angle optical ranging, three-dimensional path planning for flying/crawling robots, navigation of autonomous mobile intelligence in an unstructured natural environment, mechanical models for the locomotion of a four-articulated-track robot, a rule-based command language for a semiautonomous Mars rover, and a computer model of the structured light vision system for a Mars rover. Also discussed are optical flow and three-dimensional information for navigation, feature-based reasoning trail detection, a symbolic neural-net production system for obstacle avoidance and navigation, intelligent path planning for robot navigation in an unknown environment,more » behaviors from a hierarchical control system, stereoscopic TV systems, the REACT language for autonomous robots, and a man-amplifying exoskeleton.« less

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

A flexible 3D laser scanning system using a robotic arm

NASA Astrophysics Data System (ADS)

Fei, Zixuan; Zhou, Xiang; Gao, Xiaofei; Zhang, Guanliang

2017-06-01

In this paper, we present a flexible 3D scanning system based on a MEMS scanner mounted on an industrial arm with a turntable. This system has 7-degrees of freedom and is able to conduct a full field scan from any angle, suitable for scanning object with the complex shape. The existing non-contact 3D scanning system usually uses laser scanner that projects fixed stripe mounted on the Coordinate Measuring Machine (CMM) or industrial robot. These existing systems can't perform path planning without CAD models. The 3D scanning system presented in this paper can scan the object without CAD models, and we introduced this path planning method in the paper. We also propose a practical approach to calibrating the hand-in-eye system based on binocular stereo vision and analyzes the errors of the hand-eye calibration.

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.

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.

Trajectory Generation and Path Planning for Autonomous Aerobots

NASA Technical Reports Server (NTRS)

Sharma, Shivanjli; Kulczycki, Eric A.; Elfes, Alberto

2007-01-01

This paper presents global path planning algorithms for the Titan aerobot based on user defined waypoints in 2D and 3D space. The algorithms were implemented using information obtained through a planner user interface. The trajectory planning algorithms were designed to accurately represent the aerobot's characteristics, such as minimum turning radius. Additionally, trajectory planning techniques were implemented to allow for surveying of a planar area based solely on camera fields of view, airship altitude, and the location of the planar area's perimeter. The developed paths allow for planar navigation and three-dimensional path planning. These calculated trajectories are optimized to produce the shortest possible path while still remaining within realistic bounds of airship dynamics.

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.

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.

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

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 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

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...

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.

Adaptable mission planning for kino-dynamic systems

NASA Astrophysics Data System (ADS)

Bush, Lawrence A. M.; Jimenez, Tony R.; Williams, Brian C.

Autonomous systems can perform tasks that are dangerous, monotonous, or even impossible for humans. To approach the problem of planning for Unmanned Aerial Vehicles (UAVs) we present a hierarchical method that combines a high-level planner with a low-level planner. We pose the problem of high-level planning as a Selective Traveling Salesman Problem (STSP) and select the order in which to visit our science sites. We then use a kino-dynamic path planner to create a large number of intermediate waypoints. This is a complete system that combines high and low level planning to achieve a goal. This paper demonstrates the benefits gained by adaptable high-level plans versus static and greedy plans.

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.

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

Mobile robot dynamic path planning based on improved genetic algorithm

NASA Astrophysics Data System (ADS)

Wang, Yong; Zhou, Heng; Wang, Ying

2017-08-01

In dynamic unknown environment, the dynamic path planning of mobile robots is a difficult problem. In this paper, a dynamic path planning method based on genetic algorithm is proposed, and a reward value model is designed to estimate the probability of dynamic obstacles on the path, and the reward value function is applied to the genetic algorithm. Unique coding techniques reduce the computational complexity of the algorithm. The fitness function of the genetic algorithm fully considers three factors: the security of the path, the shortest distance of the path and the reward value of the path. The simulation results show that the proposed genetic algorithm is efficient in all kinds of complex dynamic environments.

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.

Energy aware path planning in complex four dimensional environments

NASA Astrophysics Data System (ADS)

Chakrabarty, Anjan

This dissertation addresses the problem of energy-aware path planning for small autonomous vehicles. While small autonomous vehicles can perform missions that are too risky (or infeasible) for larger vehicles, the missions are limited by the amount of energy that can be carried on board the vehicle. Path planning techniques that either minimize energy consumption or exploit energy available in the environment can thus increase range and endurance. Path planning is complicated by significant spatial (and potentially temporal) variations in the environment. While the main focus is on autonomous aircraft, this research also addresses autonomous ground vehicles. Range and endurance of small unmanned aerial vehicles (UAVs) can be greatly improved by utilizing energy from the atmosphere. Wind can be exploited to minimize energy consumption of a small UAV. But wind, like any other atmospheric component , is a space and time varying phenomenon. To effectively use wind for long range missions, both exploration and exploitation of wind is critical. This research presents a kinematics based tree algorithm which efficiently handles the four dimensional (three spatial and time) path planning problem. The Kinematic Tree algorithm provides a sequence of waypoints, airspeeds, heading and bank angle commands for each segment of the path. The planner is shown to be resolution complete and computationally efficient. Global optimality of the cost function cannot be claimed, as energy is gained from the atmosphere, making the cost function inadmissible. However the Kinematic Tree is shown to be optimal up to resolution if the cost function is admissible. Simulation results show the efficacy of this planning method for a glider in complex real wind data. Simulation results verify that the planner is able to extract energy from the atmosphere enabling long range missions. The Kinematic Tree planning framework, developed to minimize energy consumption of UAVs, is applied for path planning in ground robots. In traditional path planning problem the focus is on obstacle avoidance and navigation. The optimal Kinematic Tree algorithm named Kinematic Tree* is shown to find optimal paths to reach the destination while avoiding obstacles. A more challenging path planning scenario arises for planning in complex terrain. This research shows how the Kinematic Tree* algorithm can be extended to find minimum energy paths for a ground vehicle in difficult mountainous terrain.

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

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.

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.

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.

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

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.

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

Three-dimensional path planning software-assisted transjugular intrahepatic portosystemic shunt: a technical modification.

PubMed

Tsauo, Jiaywei; Luo, Xuefeng; Ye, Linchao; Li, Xiao

2015-06-01

This study was designed to report our results with a modified technique of three-dimensional (3D) path planning software assisted transjugular intrahepatic portosystemic shunt (TIPS). 3D path planning software was recently developed to facilitate TIPS creation by using two carbon dioxide portograms acquired at least 20° apart to generate a 3D path for overlay needle guidance. However, one shortcoming is that puncturing along the overlay would be technically impossible if the angle of the liver access set and the angle of the 3D path are not the same. To solve this problem, a prototype 3D path planning software was fitted with a utility to calculate the angle of the 3D path. Using this, we modified the angle of the liver access set accordingly during the procedure in ten patients. Failure for technical reasons occurred in three patients (unsuccessful wedged hepatic venography in two cases, software technical failure in one case). The procedure was successful in the remaining seven patients, and only one needle pass was required to obtain portal vein access in each case. The course of puncture was comparable to the 3D path in all patients. No procedure-related complication occurred following the procedures. Adjusting the angle of the liver access set to match the angle of the 3D path determined by the software appears to be a favorable modification to the technique of 3D path planning software assisted TIPS.

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.…

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.

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).

Lunar Surface Propagation Modeling and Effects on Communications

NASA Technical Reports Server (NTRS)

Hwu, Shian U.; Upanavage, Matthew; Sham, Catherine C.

2008-01-01

This paper analyzes the lunar terrain effects on the signal propagation of the planned NASA lunar wireless communication and sensor systems. It is observed that the propagation characteristics are significantly affected by the presence of the lunar terrain. The obtained results indicate that the terrain geometry, antenna location, and lunar surface material are important factors determining the propagation characteristics of the lunar wireless communication systems. The path loss can be much more severe than the free space propagation and is greatly affected by the antenna height, operating frequency, and surface material. The analysis results from this paper are important for the lunar communication link margin analysis in determining the limits on the reliable communication range and radio frequency coverage performance at planned lunar base worksites. Key Words lunar, multipath, path loss, propagation, wireless.

Environment exploration and SLAM experiment research based on ROS

NASA Astrophysics Data System (ADS)

Li, Zhize; Zheng, Wei

2017-11-01

Robots need to get the information of surrounding environment by means of map learning. SLAM or navigation based on mobile robots is developing rapidly. ROS (Robot Operating System) is widely used in the field of robots because of the convenient code reuse and open source. Numerous excellent algorithms of SLAM or navigation are ported to ROS package. hector_slam is one of them that can set up occupancy grid maps on-line fast with low computation resources requiring. Its characters above make the embedded handheld mapping system possible. Similarly, hector_navigation also does well in the navigation field. It can finish path planning and environment exploration by itself using only an environmental sensor. Combining hector_navigation with hector_slam can realize low cost environment exploration, path planning and slam at the same time

Minimally invasive positioning robot system of femoral neck hollow screw implants based on x-ray error correction

NASA Astrophysics Data System (ADS)

Zou, Yunpeng; Xu, Ying; Hu, Lei; Guo, Na; Wang, Lifeng

2017-01-01

Aiming the high failure rate, the high radiation quantity and the poor positioning accuracy of femoral neck traditional surgery, this article develops a set of new positioning robot system of femoral neck hollow screw implants based on X-rays error correction, which bases on the study of x-rays perspective principle and the Motion Principle of 6 DOF(degree of freedom) series robot UR(Universal Robots). Compared with Computer Assisted Navigation System, this system owns better positioning accuracy and more simple operation. In addition, without extra Equipment of Visual Tracking, this system can reduce a lot of cost. During the surgery, Doctor can plan the operation path and the pose of mark needle according to the positive and lateral X-rays images of patients. Then they can calculate the pixel ratio according to the ratio of the actual length of mark line and the length on image. After that, they can calculate the amount of exercise of UR Robot according to the relative position between operation path and guide pin and the fixed relationship between guide pin and UR robot. Then, they can control UR to drive the positioning guide pin to the operation path. At this point, check the positioning guide pin and the planning path is coincident, if not, repeat the previous steps, until the positioning guide pin and the planning path coincide which will eventually complete the positioning operation. Moreover, to verify the positioning accuracy, this paper make an errors analysis aiming to thirty cases of the experimental model of bone. The result shows that the motion accuracy of the UR Robot is 0.15mm and the Integral error precision is within 0.8mm. To verify the clinical feasibility of this system, this article analysis on three cases of the clinical experiment. In the whole process of positioning, the X-rays irradiation time is 2-3s, the number of perspective is 3-5 and the whole positioning time is 7-10min. The result shows that this system can complete accurately femoral neck positioning surgery. Meanwhile, it can greatly reduce the X-rays radiation of medical staff and patients. To summarize, it has a significant value in clinical application.

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…

The Path to Successful ERP Implementation.

ERIC Educational Resources Information Center

Swartz, David G.

2001-01-01

Examines how universities and colleges can economically and efficiently implement an enterprise resource planning project when designing their administrative information system. Administrative steps discussed include conducting a needs assessment, deciding on the right system that matches the assessment, developing the correct contracting…

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.

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.

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

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.

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

Three-Dimensional Path Planning Software-Assisted Transjugular Intrahepatic Portosystemic Shunt: A Technical Modification

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

Tsauo, Jiaywei, E-mail: 80732059@qq.com; Luo, Xuefeng, E-mail: luobo-913@126.com; Ye, Linchao, E-mail: linchao.ye@siemens.com

2015-06-15

PurposeThis study was designed to report our results with a modified technique of three-dimensional (3D) path planning software assisted transjugular intrahepatic portosystemic shunt (TIPS).Methods3D path planning software was recently developed to facilitate TIPS creation by using two carbon dioxide portograms acquired at least 20° apart to generate a 3D path for overlay needle guidance. However, one shortcoming is that puncturing along the overlay would be technically impossible if the angle of the liver access set and the angle of the 3D path are not the same. To solve this problem, a prototype 3D path planning software was fitted with a utility to calculate themore » angle of the 3D path. Using this, we modified the angle of the liver access set accordingly during the procedure in ten patients.ResultsFailure for technical reasons occurred in three patients (unsuccessful wedged hepatic venography in two cases, software technical failure in one case). The procedure was successful in the remaining seven patients, and only one needle pass was required to obtain portal vein access in each case. The course of puncture was comparable to the 3D path in all patients. No procedure-related complication occurred following the procedures.ConclusionsAdjusting the angle of the liver access set to match the angle of the 3D path determined by the software appears to be a favorable modification to the technique of 3D path planning software assisted TIPS.« less

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.

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

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.

Constructing an Indoor Floor Plan Using Crowdsourcing Based on Magnetic Fingerprinting

PubMed Central

Zhao, Fang; Jiang, Mengling; Ma, Hao; Zhang, Yuexia

2017-01-01

A large number of indoor positioning systems have recently been developed to cater for various location-based services. Indoor maps are a prerequisite of such indoor positioning systems; however, indoor maps are currently non-existent for most indoor environments. Construction of an indoor map by external experts excludes quick deployment and prevents widespread utilization of indoor localization systems. Here, we propose an algorithm for the automatic construction of an indoor floor plan, together with a magnetic fingerprint map of unmapped buildings using crowdsourced smartphone data. For floor plan construction, our system combines the use of dead reckoning technology, an observation model with geomagnetic signals, and trajectory fusion based on an affinity propagation algorithm. To obtain the indoor paths, the magnetic trajectory data obtained through crowdsourcing were first clustered using dynamic time warping similarity criteria. The trajectories were inferred from odometry tracing, and those belonging to the same cluster in the magnetic trajectory domain were then fused. Fusing these data effectively eliminates the inherent tracking errors originating from noisy sensors; as a result, we obtained highly accurate indoor paths. One advantage of our system is that no additional hardware such as a laser rangefinder or wheel encoder is required. Experimental results demonstrate that our proposed algorithm successfully constructs indoor floor plans with 0.48 m accuracy, which could benefit location-based services which lack indoor maps. PMID:29156639

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.

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.

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.

Horizontal atmospheric turbulence, beam propagation, and modeling

NASA Astrophysics Data System (ADS)

Wilcox, Christopher C.; Santiago, Freddie; Martinez, Ty; Judd, K. Peter; Restaino, Sergio R.

2017-05-01

The turbulent effect from the Earth's atmosphere degrades the performance of an optical imaging system. Many studies have been conducted in the study of beam propagation in a turbulent medium. Horizontal beam propagation and correction presents many challenges when compared to vertical due to the far harsher turbulent conditions and increased complexity it induces. We investigate the collection of beam propagation data, analysis, and use for building a mathematical model of the horizontal turbulent path and the plans for an adaptive optical system to use this information to correct for horizontal path atmospheric turbulence.

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.

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

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

75 FR 51161 - Notice of Passenger Facility Charge (PFC) Approvals and Disapprovals

Federal Register 2010, 2011, 2012, 2013, 2014

2010-08-18

... approach path indicator systems. By-pass taxiway and hold apron. Master plan update. Airfield signage... mandates. Concourse A and B. Overlay taxiway C and connectors. Engineer/design airfield signage...

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.

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.

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.

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.

Robot environment expert system

NASA Technical Reports Server (NTRS)

Potter, J. L.

1985-01-01

The Robot Environment Expert System uses a hexidecimal tree data structure to model a complex robot environment where not only the robot arm moves, but also the robot itself and other objects may move. The hextree model allows dynamic updating, collision avoidance and path planning over time, to avoid moving objects.

World University Ranking Systems: An Alternative Approach Using Partial Least Squares Path Modelling

ERIC Educational Resources Information Center

Jajo, Nethal K.; Harrison, Jen

2014-01-01

University rankings are key drivers in national and institutional strategic planning. The increase in the number of university ranking systems and the diversity of methods and indicators used by these systems necessitate the development of an index that can measure a university's performance in all these systems at once. This article presents…

Dynamic Testing of the NASA Hypersonic Project Combined Cycle Engine Testbed for Mode Transition Experiments

NASA Technical Reports Server (NTRS)

2011-01-01

NASA is interested in developing technology that leads to more routine, safe, and affordable access to space. Access to space using airbreathing propulsion systems has potential to meet these objectives based on Airbreathing Access to Space (AAS) system studies. To this end, the NASA Fundamental Aeronautics Program (FAP) Hypersonic Project is conducting fundamental research on a Turbine Based Combined Cycle (TBCC) propulsion system. The TBCC being studied considers a dual flow-path inlet system. One flow-path includes variable geometry to regulate airflow to a turbine engine cycle. The turbine cycle provides propulsion from take-off to supersonic flight. The second flow-path supports a dual-mode scramjet (DMSJ) cycle which would be initiated at supersonic speed to further accelerate the vehicle to hypersonic speed. For a TBCC propulsion system to accelerate a vehicle from supersonic to hypersonic speed, a critical enabling technology is the ability to safely and effectively transition from the turbine to the DMSJ-referred to as mode transition. To experimentally test methods of mode transition, a Combined Cycle Engine (CCE) Large-scale Inlet testbed was designed with two flow paths-a low speed flow-path sized for a turbine cycle and a high speed flow-path designed for a DMSJ. This testbed system is identified as the CCE Large-Scale Inlet for Mode Transition studies (CCE-LIMX). The test plan for the CCE-LIMX in the NASA Glenn Research Center (GRC) 10- by 10-ft Supersonic Wind Tunnel (10x10 SWT) is segmented into multiple phases. The first phase is a matrix of inlet characterization (IC) tests to evaluate the inlet performance and establish the mode transition schedule. The second phase is a matrix of dynamic system identification (SysID) experiments designed to support closed-loop control development at mode transition schedule operating points for the CCE-LIMX. The third phase includes a direct demonstration of controlled mode transition using a closed loop control system developed with the data obtained from the first two phases. Plans for a fourth phase include mode transition experiments with a turbine engine. This paper, focusing on the first two phases of experiments, presents developed operational and analysis tools for streamlined testing and data reduction procedures.

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.

Crawler Acquisition and Testing Demonstration Project Management Plan

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

DEFIGH-PRICE, C.

2000-10-23

If the crawler based retrieval system is selected, this project management plan identifies the path forward for acquiring a crawler/track pump waste retrieval system, and completing sufficient testing to support deploying the crawler for as part of a retrieval technology demonstration for Tank 241-C-104. In the balance of the document, these activities will be referred to as the Crawler Acquisition and Testing Demonstration. During recent Tri-Party Agreement negotiations, TPA milestones were proposed for a sludge/hard heel waste retrieval demonstration in tank C-104. Specifically one of the proposed milestones requires completion of a cold demonstration of sufficient scale to support finalmore » design and testing of the equipment (M-45-03G) by 6/30/2004. A crawler-based retrieval system was one of the two options evaluated during the pre-conceptual engineering for C-104 retrieval (RPP-6843 Rev. 0). The alternative technology procurement initiated by the Hanford Tanks Initiative (HTI) project, combined with the pre-conceptual engineering for C-104 retrieval provide an opportunity to achieve compliance with the proposed TPA milestone M-45-03H. This Crawler Acquisition and Testing Demonstration project management plan identifies the plans, organizational interfaces and responsibilities, management control systems, reporting systems, timeline and requirements for the acquisition and testing of the crawler based retrieval system. This project management plan is complimentary to and supportive of the Project Management Plan for Retrieval of C-104 (RPP-6557). This project management plan focuses on utilizing and completing the efforts initiated under the Hanford Tanks Initiative (HTI) to acquire and cold test a commercial crawler based retrieval system. The crawler-based retrieval system will be purchased on a schedule to support design of the waste retrieval from tank C-104 (project W-523) and to meet the requirement of proposed TPA milestone M-45-03H. This Crawler Acquisition and Testing Demonstration project management plan includes the following: (1) Identification of acquisition strategy and plan to obtain a crawler based retrieval system; (2) Plan for sufficient cold testing to make a decision for W-523 and to comply with TPA Milestone M-45-03H; (3) Cost and schedule for path forward; (4) Responsibilities of the participants; and (5) The plan is supported by updated Level 1 logics, a Relative Order of Magnitude cost estimate and preliminary project schedule.« less

Power Distribution System Planning with GIS Consideration

NASA Astrophysics Data System (ADS)

Wattanasophon, Sirichai; Eua-Arporn, Bundhit

This paper proposes a method for solving radial distribution system planning problems taking into account geographical information. The proposed method can automatically determine appropriate location and size of a substation, routing of feeders, and sizes of conductors while satisfying all constraints, i.e. technical constraints (voltage drop and thermal limit) and geographical constraints (obstacle, existing infrastructure, and high-cost passages). Sequential quadratic programming (SQP) and minimum path algorithm (MPA) are applied to solve the planning problem based on net price value (NPV) consideration. In addition this method integrates planner's experience and optimization process to achieve an appropriate practical solution. The proposed method has been tested with an actual distribution system, from which the results indicate that it can provide satisfactory plans.

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.

Charting a path to efficiencies following a merger.

PubMed

Klar, Brandon; Shufelt, Gregory P

2015-06-01

Health systems can access the full range of opportunities for enhanced efficiencies following a merger or an acquisition by pursuing the following five-step process, which constitutes the development of a business plan of operational efficiencies: Secure executive sponsorship and involvement. Establish an integration steering committee. Develop guiding principles. Identify and validate potential efficiencies. Develop an action plan for each department and function.

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.

Stochastic Evolutionary Algorithms for Planning Robot Paths

NASA Technical Reports Server (NTRS)

Fink, Wolfgang; Aghazarian, Hrand; Huntsberger, Terrance; Terrile, Richard

2006-01-01

A computer program implements stochastic evolutionary algorithms for planning and optimizing collision-free paths for robots and their jointed limbs. Stochastic evolutionary algorithms can be made to produce acceptably close approximations to exact, optimal solutions for path-planning problems while often demanding much less computation than do exhaustive-search and deterministic inverse-kinematics algorithms that have been used previously for this purpose. Hence, the present software is better suited for application aboard robots having limited computing capabilities (see figure). The stochastic aspect lies in the use of simulated annealing to (1) prevent trapping of an optimization algorithm in local minima of an energy-like error measure by which the fitness of a trial solution is evaluated while (2) ensuring that the entire multidimensional configuration and parameter space of the path-planning problem is sampled efficiently with respect to both robot joint angles and computation time. Simulated annealing is an established technique for avoiding local minima in multidimensional optimization problems, but has not, until now, been applied to planning collision-free robot paths by use of low-power computers.

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.

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.

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.

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.

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.

Development and human factors analysis of an augmented reality interface for multi-robot tele-operation and control

NASA Astrophysics Data System (ADS)

Lee, Sam; Lucas, Nathan P.; Ellis, R. Darin; Pandya, Abhilash

2012-06-01

This paper presents a seamlessly controlled human multi-robot system comprised of ground and aerial robots of semiautonomous nature for source localization tasks. The system combines augmented reality interfaces capabilities with human supervisor's ability to control multiple robots. The role of this human multi-robot interface is to allow an operator to control groups of heterogeneous robots in real time in a collaborative manner. It used advanced path planning algorithms to ensure obstacles are avoided and that the operators are free for higher-level tasks. Each robot knows the environment and obstacles and can automatically generate a collision-free path to any user-selected target. It displayed sensor information from each individual robot directly on the robot in the video view. In addition, a sensor data fused AR view is displayed which helped the users pin point source information or help the operator with the goals of the mission. The paper studies a preliminary Human Factors evaluation of this system in which several interface conditions are tested for source detection tasks. Results show that the novel Augmented Reality multi-robot control (Point-and-Go and Path Planning) reduced mission completion times compared to the traditional joystick control for target detection missions. Usability tests and operator workload analysis are also investigated.

Control of wheeled mobile robot in restricted environment

NASA Astrophysics Data System (ADS)

Ali, Mohammed A. H.; En, Chang Yong

2018-03-01

This paper presents a simulation and practical control system for wheeled mobile robot in restricted environment. A wheeled mobile robot with 3 wheels is fabricated and controlled by proportional derivative active force control (PD-AFC) to move in a pre-planned restricted environment to maintain the tracking errors at zero level. A control system with two loops, outer by PD controller and inner loop by Active Force Control, are designed to control the wheeled mobile robot. Fuzzy logic controller is implemented in the Active force Control to estimate the inertia matrix that will be used to calculate the actual torque applied on the wheeled mobile robot. The mobile robot is tested in two different trajectories, namely are circular and straight path. The actual path and desired path are compared.

The Challenge of Grounding Planning in Simulation with an Interactive Model Development Environment

NASA Technical Reports Server (NTRS)

Clement, Bradley J.; Frank, Jeremy D.; Chachere, John M.; Smith, Tristan B.; Swanson, Keith J.

2011-01-01

A principal obstacle to fielding automated planning systems is the difficulty of modeling. Physical systems are modeled conventionally based on specification documents and the modeler's understanding of the system. Thus, the model is developed in a way that is disconnected from the system's actual behavior and is vulnerable to manual error. Another obstacle to fielding planners is testing and validation. For a space mission, generated plans must be validated often by translating them into command sequences that are run in a simulation testbed. Testing in this way is complex and onerous because of the large number of possible plans and states of the spacecraft. Though, if used as a source of domain knowledge, the simulator can ease validation. This paper poses a challenge: to ground planning models in the system physics represented by simulation. A proposed, interactive model development environment illustrates the integration of planning and simulation to meet the challenge. This integration reveals research paths for automated model construction and validation.

Simulation Of Research And Development Projects

NASA Technical Reports Server (NTRS)

Miles, Ralph F.

1987-01-01

Measures of preference for alternative project plans calculated. Simulation of Research and Development Projects (SIMRAND) program aids in optimal allocation of research and development resources needed to achieve project goals. Models system subsets or project tasks as various network paths to final goal. Each path described in terms of such task variables as cost per hour, cost per unit, and availability of resources. Uncertainty incorporated by treating task variables as probabilistic random variables. Written in Microsoft FORTRAN 77.

Analysis and design of a capsule landing system and surface vehicle control system for Mars exploration

NASA Technical Reports Server (NTRS)

Frederick, D. K.; Lashmet, P. K.; Sandor, G. N.; Shen, C. N.; Smith, E. V.; Yerazunis, S. W.

1973-01-01

Problems related to the design and control of a mobile planetary vehicle to implement a systematic plan for the exploration of Mars are reported. Problem areas include: vehicle configuration, control, dynamics, systems and propulsion; systems analysis, terrain modeling and path selection; and chemical analysis of specimens. These tasks are summarized: vehicle model design, mathematical model of vehicle dynamics, experimental vehicle dynamics, obstacle negotiation, electrochemical controls, remote control, collapsibility and deployment, construction of a wheel tester, wheel analysis, payload design, system design optimization, effect of design assumptions, accessory optimal design, on-board computer subsystem, laser range measurement, discrete obstacle detection, obstacle detection systems, terrain modeling, path selection system simulation and evaluation, gas chromatograph/mass spectrometer system concepts, and chromatograph model evaluation and improvement.

Rough-Cut Capacity Planning in Multimodal Freight Transportation Networks

DTIC Science & Technology

2012-09-30

transportation system to losses in es - tablished routes or assets? That is, what is the nature and length of system capability degradation due to these...Multimodal Rough-Cut Capacity Planning is mod- eled using the Resource Constrained Shortest Path Problem. We demonstrate how this approach supports...of non-zero ele - ments and the 0 entries depict appropriately dimensioned blocks of 0 entries.∣∣∣∣∑ k Ck ∣∣∣∣ Σ 0 0 0 0 Σ 0 0

The research of autonomous obstacle avoidance of mobile robot based on multi-sensor integration

NASA Astrophysics Data System (ADS)

Zhao, Ming; Han, Baoling

2016-11-01

The object of this study is the bionic quadruped mobile robot. The study has proposed a system design plan for mobile robot obstacle avoidance with the binocular stereo visual sensor and the self-control 3D Lidar integrated with modified ant colony optimization path planning to realize the reconstruction of the environmental map. Because the working condition of a mobile robot is complex, the result of the 3D reconstruction with a single binocular sensor is undesirable when feature points are few and the light condition is poor. Therefore, this system integrates the stereo vision sensor blumblebee2 and the Lidar sensor together to detect the cloud information of 3D points of environmental obstacles. This paper proposes the sensor information fusion technology to rebuild the environment map. Firstly, according to the Lidar data and visual data on obstacle detection respectively, and then consider two methods respectively to detect the distribution of obstacles. Finally fusing the data to get the more complete, more accurate distribution of obstacles in the scene. Then the thesis introduces ant colony algorithm. It has analyzed advantages and disadvantages of the ant colony optimization and its formation cause deeply, and then improved the system with the help of the ant colony optimization to increase the rate of convergence and precision of the algorithm in robot path planning. Such improvements and integrations overcome the shortcomings of the ant colony optimization like involving into the local optimal solution easily, slow search speed and poor search results. This experiment deals with images and programs the motor drive under the compiling environment of Matlab and Visual Studio and establishes the visual 2.5D grid map. Finally it plans a global path for the mobile robot according to the ant colony algorithm. The feasibility and effectiveness of the system are confirmed by ROS and simulation platform of Linux.

Intelligent control and adaptive systems; Proceedings of the Meeting, Philadelphia, PA, Nov. 7, 8, 1989

NASA Technical Reports Server (NTRS)

Rodriguez, Guillermo (Editor)

1990-01-01

Various papers on intelligent control and adaptive systems are presented. Individual topics addressed include: control architecture for a Mars walking vehicle, representation for error detection and recovery in robot task plans, real-time operating system for robots, execution monitoring of a mobile robot system, statistical mechanics models for motion and force planning, global kinematics for manipulator planning and control, exploration of unknown mechanical assemblies through manipulation, low-level representations for robot vision, harmonic functions for robot path construction, simulation of dual behavior of an autonomous system. Also discussed are: control framework for hand-arm coordination, neural network approach to multivehicle navigation, electronic neural networks for global optimization, neural network for L1 norm linear regression, planning for assembly with robot hands, neural networks in dynamical systems, control design with iterative learning, improved fuzzy process control of spacecraft autonomous rendezvous using a genetic algorithm.

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.

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

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.

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.

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.

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.

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.

A Comparison of Risk Sensitive Path Planning Methods for Aircraft Emergency Landing

NASA Technical Reports Server (NTRS)

Meuleau, Nicolas; Plaunt, Christian; Smith, David E.; Smith, Tristan

2009-01-01

Determining the best site to land a damaged aircraft presents some interesting challenges for standard path planning techniques. There are multiple possible locations to consider, the space is 3-dimensional with dynamics, the criteria for a good path is determined by overall risk rather than distance or time, and optimization really matters, since an improved path corresponds to greater expected survival rate. We have investigated a number of different path planning methods for solving this problem, including cell decomposition, visibility graphs, probabilistic road maps (PRMs), and local search techniques. In their pure form, none of these techniques have proven to be entirely satisfactory - some are too slow or unpredictable, some produce highly non-optimal paths or do not find certain types of paths, and some do not cope well with the dynamic constraints when controllability is limited. In the end, we are converging towards a hybrid technique that involves seeding a roadmap with a layered visibility graph, using PRM to extend that roadmap, and using local search to further optimize the resulting paths. We describe the techniques we have investigated, report on our experiments with these techniques, and discuss when and why various techniques were unsatisfactory.

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.

Development of preoperative planning software for transforaminal endoscopic surgery and the guidance for clinical applications.

PubMed

Chen, Xiaojun; Cheng, Jun; Gu, Xin; Sun, Yi; Politis, Constantinus

2016-04-01

Preoperative planning is of great importance for transforaminal endoscopic techniques applied in percutaneous endoscopic lumbar discectomy. In this study, a modular preoperative planning software for transforaminal endoscopic surgery was developed and demonstrated. The path searching method is based on collision detection, and the oriented bounding box was constructed for the anatomical models. Then, image reformatting algorithms were developed for multiplanar reconstruction which provides detailed anatomical information surrounding the virtual planned path. Finally, multithread technique was implemented to realize the steady-state condition of the software. A preoperative planning software for transforaminal endoscopic surgery (TE-Guider) was developed; seven cases of patients with symptomatic lumbar disc herniations were planned preoperatively using TE-Guider. The distances to the midlines and the direction of the optimal paths were exported, and each result was in line with the empirical value. TE-Guider provides an efficient and cost-effective way to search the ideal path and entry point for the puncture. However, more clinical cases will be conducted to demonstrate its feasibility and reliability.

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.

Reasoning on the Self-Organizing Incremental Associative Memory for Online Robot Path Planning

NASA Astrophysics Data System (ADS)

Kawewong, Aram; Honda, Yutaro; Tsuboyama, Manabu; Hasegawa, Osamu

Robot path-planning is one of the important issues in robotic navigation. This paper presents a novel robot path-planning approach based on the associative memory using Self-Organizing Incremental Neural Networks (SOINN). By the proposed method, an environment is first autonomously divided into a set of path-fragments by junctions. Each fragment is represented by a sequence of preliminarily generated common patterns (CPs). In an online manner, a robot regards the current path as the associative path-fragments, each connected by junctions. The reasoning technique is additionally proposed for decision making at each junction to speed up the exploration time. Distinct from other methods, our method does not ignore the important information about the regions between junctions (path-fragments). The resultant number of path-fragments is also less than other method. Evaluation is done via Webots physical 3D-simulated and real robot experiments, where only distance sensors are available. Results show that our method can represent the environment effectively; it enables the robot to solve the goal-oriented navigation problem in only one episode, which is actually less than that necessary for most of the Reinforcement Learning (RL) based methods. The running time is proved finite and scales well with the environment. The resultant number of path-fragments matches well to the environment.

Succession Planning in the Iranian Health System: A Case Study of the Ministry of Health and Medical Education

PubMed Central

Mehrtak, Mohamad; Vatankhah, Soodabeh; Delgoshaei, Bahram; Gholipour, Arian

2014-01-01

Background: Succession planning promotes the culture of private ownership, staff loyalty to the organization and develops organizational commitment, and increases organizational stability. The study was conducted to examine the status of succession planning in the Iranian health system in order to highlight the key concepts, provide new insight, and attract the attention of senior managers of the Ministry of Health and Medical Education to the importance of succession planning in achieving organizational goals. Methods: In a qualitative study with a framework analysis approach, semi-structured interviews were conducted with a sample selected using purposive and snowball sampling procedure. The MAXQDA-10 was used to apply the codes and manage the data. The codes were extracted using inductive and deductive methods. Results: Fourteen themes and six main subthemes were identified, including planning, organizational culture, system approach, competency model, career path, and senior managers. Our findings indicate a lack of succession planning in the Iranian health system. Conclusion: lack of succession planning could lead to inefficiency and ineffectiveness in health services provision. Implementation of succession planning could maximize human resources utilization. PMID:25168998

Succession planning in the Iranian health system: a case study of the Ministry of Health and Medical Education.

PubMed

Mehrtak, Mohamad; Vatankhah, Soodabeh; Delgoshaei, Bahram; Gholipour, Arian

2014-05-30

Succession planning promotes the culture of private ownership, staff loyalty to the organization and develops organizational commitment, and increases organizational stability. The study was conducted to examine the status of succession planning in the Iranian health system in order to highlight the key concepts, provide new insight, and attract the attention of senior managers of the Ministry of Health and Medical Education to the importance of succession planning in achieving organizational goals. In a qualitative study with a framework analysis approach, semi-structured interviews were conducted with a sample selected using purposive and snowball sampling procedure. The MAXQDA-10 was used to apply the codes and manage the data. The codes were extracted using inductive and deductive methods. Fourteen themes and six main subthemes were identified, including planning, organizational culture, system approach, competency model, career path, and senior managers. Our findings indicate a lack of succession planning in the Iranian health system. lack of succession planning could lead to inefficiency and ineffectiveness in health services provision. Implementation of succession planning could maximize human resources utilization.

Autonomous terrain characterization and modelling for dynamic control of unmanned vehicles

NASA Technical Reports Server (NTRS)

Talukder, A.; Manduchi, R.; Castano, R.; Owens, K.; Matthies, L.; Castano, A.; Hogg, R.

2002-01-01

This end-to-end obstacle negotiation system is envisioned to be useful in optimized path planning and vehicle navigation in terrain conditions cluttered with vegetation, bushes, rocks, etc. Results on natural terrain with various natural materials are presented.

Analysis and design of a capsule landing system and surface vehicle control system for Mars exporation

NASA Technical Reports Server (NTRS)

Frederick, D. K.; Lashmet, P. K.; Sandor, G. N.; Shen, C. N.; Smith, E. J.; Yerazunis, S. W.

1972-01-01

The problems related to the design and control of a mobile planetary vehicle to implement a systematic plan for the exploration of Mars were investigated. Problem areas receiving attention include: vehicle configuration, control, dynamics, systems and propulsion; systems analysis; navigation, terrain modeling and path selection; and chemical analysis of specimens. The following specific tasks were studied: vehicle model design, mathematical modeling of dynamic vehicle, experimental vehicle dynamics, obstacle negotiation, electromechanical controls, collapsibility and deployment, construction of a wheel tester, wheel analysis, payload design, system design optimization, effect of design assumptions, accessory optimal design, on-board computer subsystem, laser range measurement, discrete obstacle detection, obstacle detection systems, terrain modeling, path selection system simulation and evaluation, gas chromatograph/mass spectrometer system concepts, chromatograph model evaluation and improvement and transport parameter evaluation.

Analysis and design of a capsule landing system and surface vehicle control system for Mars exploration

NASA Technical Reports Server (NTRS)

Frederick, D. K.; Lashmet, P. K.; Sandor, G. N.; Shen, C. N.; Smith, E. J.; Yerazunis, S. W.

1972-01-01

Investigation of problems related to the design and control of a mobile planetary vehicle to implement a systematic plan for the exploration of Mars has been undertaken. Problem areas receiving attention include: vehicle configuration, control, dynamics, systems and propulsion; systems analysis; terrain modeling and path selection; and chemical analysis of specimens. The following specific tasks have been under study: vehicle model design, mathematical modeling of a dynamic vehicle, experimental vehicle dynamics, obstacle negotiation, electromechanical controls, collapsibility and deployment, construction of a wheel tester, wheel analysis, payload design, system design optimization, effect of design assumptions, accessory optimal design, on-board computer sybsystem, laser range measurement, discrete obstacle detection, obstacle detection systems, terrain modeling, path selection system simulation and evaluation, gas chromatograph/mass spectrometer system concepts, chromatograph model evaluation and improvement.

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.

From Welfare to Work: Dynamic Lesson Plans for ESL Learners. Final Report. Fiscal Year 1998-99 [and] From Welfare to Work: Lessons for ESL Learners.

ERIC Educational Resources Information Center

Center for Literacy, Inc., Philadelphia, PA.

This document combines a final project report and the resulting guidebook of 20 lesson plans for English as a second language (ESL) instructors to help learners work within the Temporary Assistance to Needy Families (TANF) system and acquire effective job readiness strategies, choose a career path, and pursue employment. The report describes the…

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.

Path to Market for Compact Modular Fusion Power Cores

NASA Astrophysics Data System (ADS)

Woodruff, Simon; Baerny, Jennifer K.; Mattor, Nathan; Stoulil, Don; Miller, Ronald; Marston, Theodore

2012-08-01

The benefits of an energy source whose reactants are plentiful and whose products are benign is hard to measure, but at no time in history has this energy source been more needed. Nuclear fusion continues to promise to be this energy source. However, the path to market for fusion systems is still regularly a matter for long-term (20 + year) plans. This white paper is intended to stimulate discussion of faster commercialization paths, distilling guidance from investors, utilities, and the wider energy research community (including from ARPA-E). There is great interest in a small modular fusion system that can be developed quickly and inexpensively. A simple model shows how compact modular fusion can produce a low cost development path by optimizing traditional systems that burn deuterium and tritium, operating not only at high magnetic field strength, but also by omitting some components that allow for the core to become more compact and easier to maintain. The dominant hurdles to the development of low cost, practical fusion systems are discussed, primarily in terms of the constraints placed on the cost of development stages in the private sector. The main finding presented here is that the bridge from DOE Office of Science to the energy market can come at the Proof of Principle development stage, providing the concept is sufficiently compact and inexpensive that its development allows for a normal technology commercialization path.

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.

Optimal path planning for video-guided smart munitions via multitarget tracking

NASA Astrophysics Data System (ADS)

Borkowski, Jeffrey M.; Vasquez, Juan R.

2006-05-01

An advent in the development of smart munitions entails autonomously modifying target selection during flight in order to maximize the value of the target being destroyed. A unique guidance law can be constructed that exploits both attribute and kinematic data obtained from an onboard video sensor. An optimal path planning algorithm has been developed with the goals of obstacle avoidance and maximizing the value of the target impacted by the munition. Target identification and classification provides a basis for target value which is used in conjunction with multi-target tracks to determine an optimal waypoint for the munition. A dynamically feasible trajectory is computed to provide constraints on the waypoint selection. Results demonstrate the ability of the autonomous system to avoid moving obstacles and revise target selection in flight.

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

USV Path Planning Using Potential Field Model

DTIC Science & Technology

2017-09-01

control system and hardware used. Figure 24. Control System Block Diagram The course commands are passed via Wi - Fi to the USV where the low...plane about the center. The estimated moment of inertia is 2 2 2 2 2( ) 36(1.35 0.98 ) 8.35 12 12 m b wI kg m+ += = = • . (41) b. Added

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.

Contrast enhanced computed tomography and reconstruction of hepatic vascular system for transjugular intrahepatic portal systemic shunt puncture path planning.

PubMed

Qin, Jian-Ping; Tang, Shan-Hong; Jiang, Ming-De; He, Qian-Wen; Chen, Hong-Bin; Yao, Xin; Zeng, Wei-Zheng; Gu, Ming

2015-08-28

To describe a method for the transjugular intrahepatic portal systemic shunt (TIPS) placement performed with the aid of contrast-enhanced computed tomography (CECT) and three-dimensional reconstructed vascular images (3D RVIs), and to assess its safety and effectiveness. Four hundred and ninety patients were treated with TIPS between January 2005 and December 2012. All patients underwent liver CECT and reconstruction of 3D RVIs of the right hepatic vein to portal vein (PV) prior to the operation. The 3D RVIs were carefully reviewed to plan the puncture path from the start to target points for needle pass through the PV in the TIPS procedure. The improved TIPS procedure was successful in 483 (98.6%) of the 490 patients. The number of punctures attempted was one in 294 (60%) patients, 2 to 3 in 147 (30%) patients, 4 to 6 in 25 (5.1%) patients and more than 6 in 17 (3.5%) patients. Seven patients failed. Of the 490 patients, 12 had punctures into the artery, 15 into the bile duct, eight into the gallbladder, and 18 through the liver capsule. Analysis of the portograms from the 483 successful cases indicated that the puncture points were all located distally to the PV bifurcation on anteroposterior images, while the points were located proximally to the bifurcation in the three cases with intraabdominal bleeding. The complications included three cases of bleeding, of whom one died and two needed surgery. Use of CECT and 3D RVIs to plan the puncture path for TIPS procedure is safe, simple and effective for clinical use.

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

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.

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.

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.

Online Aerial Terrain Mapping for Ground Robot Navigation

PubMed Central

Peterson, John; Chaudhry, Haseeb; Abdelatty, Karim; Bird, John; Kochersberger, Kevin

2018-01-01

This work presents a collaborative unmanned aerial and ground vehicle system which utilizes the aerial vehicle’s overhead view to inform the ground vehicle’s path planning in real time. The aerial vehicle acquires imagery which is assembled into a orthomosaic and then classified. These terrain classes are used to estimate relative navigation costs for the ground vehicle so energy-efficient paths may be generated and then executed. The two vehicles are registered in a common coordinate frame using a real-time kinematic global positioning system (RTK GPS) and all image processing is performed onboard the unmanned aerial vehicle, which minimizes the data exchanged between the vehicles. This paper describes the architecture of the system and quantifies the registration errors between the vehicles. PMID:29461496

Online Aerial Terrain Mapping for Ground Robot Navigation.

PubMed

Peterson, John; Chaudhry, Haseeb; Abdelatty, Karim; Bird, John; Kochersberger, Kevin

2018-02-20

This work presents a collaborative unmanned aerial and ground vehicle system which utilizes the aerial vehicle's overhead view to inform the ground vehicle's path planning in real time. The aerial vehicle acquires imagery which is assembled into a orthomosaic and then classified. These terrain classes are used to estimate relative navigation costs for the ground vehicle so energy-efficient paths may be generated and then executed. The two vehicles are registered in a common coordinate frame using a real-time kinematic global positioning system (RTK GPS) and all image processing is performed onboard the unmanned aerial vehicle, which minimizes the data exchanged between the vehicles. This paper describes the architecture of the system and quantifies the registration errors between the vehicles.

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.

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.

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.

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.

Visual environment recognition for robot path planning using template matched filters

NASA Astrophysics Data System (ADS)

Orozco-Rosas, Ulises; Picos, Kenia; Díaz-Ramírez, Víctor H.; Montiel, Oscar; Sepúlveda, Roberto

2017-08-01

A visual approach in environment recognition for robot navigation is proposed. This work includes a template matching filtering technique to detect obstacles and feasible paths using a single camera to sense a cluttered environment. In this problem statement, a robot can move from the start to the goal by choosing a single path between multiple possible ways. In order to generate an efficient and safe path for mobile robot navigation, the proposal employs a pseudo-bacterial potential field algorithm to derive optimal potential field functions using evolutionary computation. Simulation results are evaluated in synthetic and real scenes in terms of accuracy of environment recognition and efficiency of path planning computation.

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

Earth Observing System (EOS) Advanced Microwave Sounding Unit-A (AMSU-A) schedule plan

NASA Technical Reports Server (NTRS)

1994-01-01

This report describes Aerojet's methods and procedures used to control and administer contractual schedules for the EOS/AMSU-A program. Included are the following: the master, intermediate, and detail schedules; critical path analysis; and the total program logic network diagrams.

Automated path planning of the Payload Inspection and Processing System

NASA Technical Reports Server (NTRS)

Byers, Robert M.

1994-01-01

The Payload Changeout Room Inspection and Processing System (PIPS) is a highly redundant manipulator intended for performing tasks in the crowded and sensitive environment of the Space Shuttle Orbiter payload bay. Its dexterity will be exploited to maneuver the end effector in a workspace populated with obstacles. A method is described by which the end effector of a highly redundant manipulator is directed toward a target via a Lyapunov stability function. A cost function is constructed which represents the distance from the manipulator links to obstacles. Obstacles are avoided by causing the vector of joint parameters to move orthogonally to the gradient of the workspace cost function. A C language program implements the algorithm to generate a joint history. The resulting motion is graphically displayed using the Interactive Graphical Robot Instruction Program (IGRIP) produced by Deneb Robotics. The graphical simulation has the potential to be a useful tool in path planning for the PIPS in the Shuttle Payload Bay environment.

A multi-criteria approach to camera motion design for volume data animation.

PubMed

Hsu, Wei-Hsien; Zhang, Yubo; Ma, Kwan-Liu

2013-12-01

We present an integrated camera motion design and path generation system for building volume data animations. Creating animations is an essential task in presenting complex scientific visualizations. Existing visualization systems use an established animation function based on keyframes selected by the user. This approach is limited in providing the optimal in-between views of the data. Alternatively, computer graphics and virtual reality camera motion planning is frequently focused on collision free movement in a virtual walkthrough. For semi-transparent, fuzzy, or blobby volume data the collision free objective becomes insufficient. Here, we provide a set of essential criteria focused on computing camera paths to establish effective animations of volume data. Our dynamic multi-criteria solver coupled with a force-directed routing algorithm enables rapid generation of camera paths. Once users review the resulting animation and evaluate the camera motion, they are able to determine how each criterion impacts path generation. In this paper, we demonstrate how incorporating this animation approach with an interactive volume visualization system reduces the effort in creating context-aware and coherent animations. This frees the user to focus on visualization tasks with the objective of gaining additional insight from the volume 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.

Off-line robot programming and graphical verification of path planning

NASA Technical Reports Server (NTRS)

Tonkay, Gregory L.

1989-01-01

The objective of this project was to develop or specify an integrated environment for off-line programming, graphical path verification, and debugging for robotic systems. Two alternatives were compared. The first was the integration of the ASEA Off-line Programming package with ROBSIM, a robotic simulation program. The second alternative was the purchase of the commercial product IGRIP. The needs of the RADL (Robotics Applications Development Laboratory) were explored and the alternatives were evaluated based on these needs. As a result, IGRIP was proposed as the best solution to the problem.

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.

Tracking Control of Mobile Robots Localized via Chained Fusion of Discrete and Continuous Epipolar Geometry, IMU and Odometry.

PubMed

Tick, David; Satici, Aykut C; Shen, Jinglin; Gans, Nicholas

2013-08-01

This paper presents a novel navigation and control system for autonomous mobile robots that includes path planning, localization, and control. A unique vision-based pose and velocity estimation scheme utilizing both the continuous and discrete forms of the Euclidean homography matrix is fused with inertial and optical encoder measurements to estimate the pose, orientation, and velocity of the robot and ensure accurate localization and control signals. A depth estimation system is integrated in order to overcome the loss of scale inherent in vision-based estimation. A path following control system is introduced that is capable of guiding the robot along a designated curve. Stability analysis is provided for the control system and experimental results are presented that prove the combined localization and control system performs with high accuracy.

A fault-tolerant control architecture for unmanned aerial vehicles

NASA Astrophysics Data System (ADS)

Drozeski, Graham R.

Research has presented several approaches to achieve varying degrees of fault-tolerance in unmanned aircraft. Approaches in reconfigurable flight control are generally divided into two categories: those which incorporate multiple non-adaptive controllers and switch between them based on the output of a fault detection and identification element, and those that employ a single adaptive controller capable of compensating for a variety of fault modes. Regardless of the approach for reconfigurable flight control, certain fault modes dictate system restructuring in order to prevent a catastrophic failure. System restructuring enables active control of actuation not employed by the nominal system to recover controllability of the aircraft. After system restructuring, continued operation requires the generation of flight paths that adhere to an altered flight envelope. The control architecture developed in this research employs a multi-tiered hierarchy to allow unmanned aircraft to generate and track safe flight paths despite the occurrence of potentially catastrophic faults. The hierarchical architecture increases the level of autonomy of the system by integrating five functionalities with the baseline system: fault detection and identification, active system restructuring, reconfigurable flight control; reconfigurable path planning, and mission adaptation. Fault detection and identification algorithms continually monitor aircraft performance and issue fault declarations. When the severity of a fault exceeds the capability of the baseline flight controller, active system restructuring expands the controllability of the aircraft using unconventional control strategies not exploited by the baseline controller. Each of the reconfigurable flight controllers and the baseline controller employ a proven adaptive neural network control strategy. A reconfigurable path planner employs an adaptive model of the vehicle to re-shape the desired flight path. Generation of the revised flight path is posed as a linear program constrained by the response of the degraded system. Finally, a mission adaptation component estimates limitations on the closed-loop performance of the aircraft and adjusts the aircraft mission accordingly. A combination of simulation and flight test results using two unmanned helicopters validates the utility of the hierarchical architecture.

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

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.

The Human Space Life Sciences Critical Path Roadmap Project: A Strategy for Human Space Flight through Exploration-Class Missions

NASA Technical Reports Server (NTRS)

Sawin, Charles F.

1999-01-01

The product of the critical path roadmap project is an integrated strategy for mitigating the risks associated with human exploration class missions. It is an evolving process that will assure the ability to communicate the integrated critical path roadmap. Unlike previous reports, this one will not sit on a shelf - it has the full support of the JSC Space and Life Sciences Directorate (SA) and is already being used as a decision making tool (e.g., budget and investigation planning for Shuttle and Space Station mission). Utility of this product depends on many efforts, namely: providing the required information (completed risk data sheets, critical question information, technology data). It is essential to communicate the results of the critical path roadmap to the scientific community - this meeting is a good opportunity to do so. The web site envisioned for the critical path roadmap will provide the capability to communicate to a broader community and to track and update the system routinely.

Automated flight path planning for virtual endoscopy.

PubMed

Paik, D S; Beaulieu, C F; Jeffrey, R B; Rubin, G D; Napel, S

1998-05-01

In this paper, a novel technique for rapid and automatic computation of flight paths for guiding virtual endoscopic exploration of three-dimensional medical images is described. While manually planning flight paths is a tedious and time consuming task, our algorithm is automated and fast. Our method for positioning the virtual camera is based on the medial axis transform but is much more computationally efficient. By iteratively correcting a path toward the medial axis, the necessity of evaluating simple point criteria during morphological thinning is eliminated. The virtual camera is also oriented in a stable viewing direction, avoiding sudden twists and turns. We tested our algorithm on volumetric data sets of eight colons, one aorta and one bronchial tree. The algorithm computed the flight paths in several minutes per volume on an inexpensive workstation with minimal computation time added for multiple paths through branching structures (10%-13% per extra path). The results of our algorithm are smooth, centralized paths that aid in the task of navigation in virtual endoscopic exploration of three-dimensional medical images.

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.

Mobile transporter path planning

NASA Technical Reports Server (NTRS)

Baffes, Paul; Wang, Lui

1990-01-01

The use of a genetic algorithm (GA) for solving the mobile transporter path planning problem is investigated. The mobile transporter is a traveling robotic vehicle proposed for the space station which must be able to reach any point of the structure autonomously. Elements of the genetic algorithm are explored in both a theoretical and experimental sense. Specifically, double crossover, greedy crossover, and tournament selection techniques are examined. Additionally, the use of local optimization techniques working in concert with the GA are also explored. Recent developments in genetic algorithm theory are shown to be particularly effective in a path planning problem domain, though problem areas can be cited which require more research.

Serial robot for the trajectory optimization and error compensation of TMT mask exchange system

NASA Astrophysics Data System (ADS)

Wang, Jianping; Zhang, Feifan; Zhou, Zengxiang; Zhai, Chao

2015-10-01

Mask exchange system is the main part of Multi-Object Broadband Imaging Echellette (MOBIE) on the Thirty Meter Telescope (TMT). According to the conception of the TMT mask exchange system, the pre-design was introduced in the paper which was based on IRB 140 robot. The stiffness model of IRB 140 in SolidWorks was analyzed under different gravity vectors for further error compensation. In order to find the right location and path planning, the robot and the mask cassette model was imported into MOBIE model to perform different schemes simulation. And obtained the initial installation position and routing. Based on these initial parameters, IRB 140 robot was operated to simulate the path and estimate the mask exchange time. Meanwhile, MATLAB and ADAMS software were used to perform simulation analysis and optimize the route to acquire the kinematics parameters and compare with the experiment results. After simulation and experimental research mentioned in the paper, the theoretical reference was acquired which could high efficient improve the structure of the mask exchange system parameters optimization of the path and precision of the robot position.

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

Differential effects of labyrinthine dysfunction on distance and direction during blindfolded walking of a triangular path.

PubMed

Glasauer, S; Amorim, M-A; Viaud-Delmon, I; Berthoz, A

2002-08-01

While we walk through the environment, we constantly receive inputs from different sensory systems. For us to accomplish a given task, for example to reach a target location, the sensory information has to be integrated to update our knowledge of self-position and self-orientation with respect to the target so that we can correctly plan and perform the remaining trajectory. As has been shown previously, vestibular information plays a minor role in the performance of linear goal-directed locomotion when walking blindfolded toward a previously seen target within a few meters. The present study extends the question of whether vestibular information is a requirement for goal-directed locomotion by studying a more complex task that also involves rotation: walking a triangular path. Furthermore, studying this task provides information about how we walk a given trajectory, how we move around corners, and whether we are able to return to the starting point. Seven young male, five labyrinthine-defective (LD) and five age- and gender-matched control subjects were asked to walk a previously seen triangular path, which was marked on the ground, first without vision (EC) and then with vision (EO). Each subject performed three clockwise (CW) and three counterclockwise (CCW) walks under the EC condition and one CW and CCW walk under the EO condition. The movement of the subjects was recorded by means of a 3D motion analysis system. Analysis of the data showed that LD subjects had, in the EC condition, a significantly larger final arrival error, which was due to increased directional errors during the turns. However, there was no difference between the groups as regards the overall path length walked. This shows that LD subjects were able to plan and execute the given trajectory without vision, but failed to turn correctly around the corners. Hence, the results demonstrate that vestibular information enhances the ability to perform a planned trajectory incorporating whole body rotations when no visual feedback is available.

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.

Evolution and advanced technology. [of Flight Telerobotic Servicer

NASA Technical Reports Server (NTRS)

Ollendorf, Stanford; Pennington, Jack E.; Hansen, Bert, III

1990-01-01

The NASREM architecture with its standard interfaces permits development and evolution of the Flight Telerobotic Servicer to greater autonomy. Technologies in control strategies for an arm with seven DOF, including a safety system containing skin sensors for obstacle avoidance, are being developed. Planning and robotic execution software includes symbolic task planning, world model data bases, and path planning algorithms. Research over the last five years has led to the development of laser scanning and ranging systems, which use coherent semiconductor laser diodes for short range sensing. The possibility of using a robot to autonomously assemble space structures is being investigated. A control framework compatible with NASREM is being developed that allows direct global control of the manipulator. Researchers are developing systems that permit an operator to quickly reconfigure the telerobot to do new tasks safely.

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

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

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.

Enroute flight planning: Evaluating design concepts for the development of cooperative problem-solving systems

NASA Technical Reports Server (NTRS)

Smith, Philip J.

1995-01-01

There are many problem-solving tasks that are too complex to fully automate given the current state of technology. Nevertheless, significant improvements in overall system performance could result from the introduction of well-designed computer aids. We have been studying the development of cognitive tools for one such problem-solving task, enroute flight path planning for commercial airlines. Our goal has been two-fold. First, we have been developing specific system designs to help with this important practical problem. Second, we have been using this context to explore general design concepts to guide in the development of cooperative problem-solving systems. These design concepts are described below, along with illustrations of their application.

The study of optimization on process parameters of high-accuracy computerized numerical control polishing

NASA Astrophysics Data System (ADS)

Huang, Wei-Ren; Huang, Shih-Pu; Tsai, Tsung-Yueh; Lin, Yi-Jyun; Yu, Zong-Ru; Kuo, Ching-Hsiang; Hsu, Wei-Yao; Young, Hong-Tsu

2017-09-01

Spherical lenses lead to forming spherical aberration and reduced optical performance. Consequently, in practice optical system shall apply a combination of spherical lenses for aberration correction. Thus, the volume of the optical system increased. In modern optical systems, aspherical lenses have been widely used because of their high optical performance with less optical components. However, aspherical surfaces cannot be fabricated by traditional full aperture polishing process due to their varying curvature. Sub-aperture computer numerical control (CNC) polishing is adopted for aspherical surface fabrication in recent years. By using CNC polishing process, mid-spatial frequency (MSF) error is normally accompanied during this process. And the MSF surface texture of optics decreases the optical performance for high precision optical system, especially for short-wavelength applications. Based on a bonnet polishing CNC machine, this study focuses on the relationship between MSF surface texture and CNC polishing parameters, which include feed rate, head speed, track spacing and path direction. The power spectral density (PSD) analysis is used to judge the MSF level caused by those polishing parameters. The test results show that controlling the removal depth of single polishing path, through the feed rate, and without same direction polishing path for higher total removal depth can efficiently reduce the MSF error. To verify the optical polishing parameters, we divided a correction polishing process to several polishing runs with different direction polishing paths. Compare to one shot polishing run, multi-direction path polishing plan could produce better surface quality on the optics.

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.

Interactive computation of coverage regions for indoor wireless communication

NASA Astrophysics Data System (ADS)

Abbott, A. Lynn; Bhat, Nitin; Rappaport, Theodore S.

1995-12-01

This paper describes a system which assists in the strategic placement of rf base stations within buildings. Known as the site modeling tool (SMT), this system allows the user to display graphical floor plans and to select base station transceiver parameters, including location and orientation, interactively. The system then computes and highlights estimated coverage regions for each transceiver, enabling the user to assess the total coverage within the building. For single-floor operation, the user can choose between distance-dependent and partition- dependent path-loss models. Similar path-loss models are also available for the case of multiple floors. This paper describes the method used by the system to estimate coverage for both directional and omnidirectional antennas. The site modeling tool is intended to be simple to use by individuals who are not experts at wireless communication system design, and is expected to be very useful in the specification of indoor wireless systems.

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.

MOBLAB: a mobile laboratory for testing real-time vision-based systems in path monitoring

NASA Astrophysics Data System (ADS)

Cumani, Aldo; Denasi, Sandra; Grattoni, Paolo; Guiducci, Antonio; Pettiti, Giuseppe; Quaglia, Giorgio

1995-01-01

In the framework of the EUREKA PROMETHEUS European Project, a Mobile Laboratory (MOBLAB) has been equipped for studying, implementing and testing real-time algorithms which monitor the path of a vehicle moving on roads. Its goal is the evaluation of systems suitable to map the position of the vehicle within the environment where it moves, to detect obstacles, to estimate motion, to plan the path and to warn the driver about unsafe conditions. MOBLAB has been built with the financial support of the National Research Council and will be shared with teams working in the PROMETHEUS Project. It consists of a van equipped with an autonomous power supply, a real-time image processing system, workstations and PCs, B/W and color TV cameras, and TV equipment. This paper describes the laboratory outline and presents the computer vision system and the strategies that have been studied and are being developed at I.E.N. `Galileo Ferraris'. The system is based on several tasks that cooperate to integrate information gathered from different processes and sources of knowledge. Some preliminary results are presented showing the performances of the system.

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…

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...

Ontology-Based Concept Map for Planning a Personalised Learning Path

ERIC Educational Resources Information Center

Chen, Chih-Ming

2009-01-01

Developing personalised web-based learning systems has been an important research issue in e-learning because no fixed learning pathway will be appropriate for all learners. However, most current web-based learning platforms with personalised curriculum sequencing tend to emphasise the learner preferences and interests in relation to personalised…

[Health workforce planning: brief historic route of Chilean policies].

PubMed

Villarroel González, Sebastián Raúl

2016-11-18

Healthcare workers have been widely recognized as the mainstay of healthcare systems. Mostly incorporated as human resources into healthcare planning, their expression in the public policies of Chile and Latin America has undergone changes in compliance with the socio-economic and economic development of the countries in the region as well as changes in their healthcare systems. This article offers a historical review of healthcare human resources planning in Chile from a government-level standpoint; thus, enabling the characterization of a path that has added tools from the economic sciences to the healthcare workers’ own diagnosis, promoting policy actions to improve planning and management at national level, although the results have been inconsistent. Today, the great interest by national and international entities in healthcare human resources constitutes a growing concern about current problems, asymmetries, and expected results-- all of which increase the complexity of healthcare staffing and human resources planning.

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.

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

Schiefer, H., E-mail: johann.schiefer@kssg.ch; Peters, S.; Plasswilm, L.

Purpose: For stereotactic radiosurgery, the AAPM Report No. 54 [AAPM Task Group 42 (AAPM, 1995)] requires the overall stability of the isocenter (couch, gantry, and collimator) to be within a 1 mm radius. In reality, a rotating system has no rigid axis and thus no isocenter point which is fixed in space. As a consequence, the isocenter concept is reviewed here. It is the aim to develop a measurement method following the revised definitions. Methods: The mechanical isocenter is defined here by the point which rotates on the shortest path in the room coordinate system. The path is labeled asmore » “isocenter path.” Its center of gravity is assumed to be the mechanical isocenter. Following this definition, an image-based and radiation-free measurement method was developed. Multiple marker pairs in a plane perpendicular to the assumed gantry rotation axis of a linear accelerator are imaged with a smartphone application from several rotation angles. Each marker pair represents an independent measuring system. The room coordinates of the isocenter path and the mechanical isocenter are calculated based on the marker coordinates. The presented measurement method is by this means strictly focused on the mechanical isocenter. Results: The measurement result is available virtually immediately following completion of measurement. When 12 independent measurement systems are evaluated, the standard deviations of the isocenter path points and mechanical isocenter coordinates are 0.02 and 0.002 mm, respectively. Conclusions: The measurement is highly accurate, time efficient, and simple to adapt. It is therefore suitable for regular checks of the mechanical isocenter characteristics of the gantry and collimator rotation axis. When the isocenter path is reproducible and its extent is in the range of the needed geometrical accuracy, it should be taken into account in the planning process. This is especially true for stereotactic treatments and radiosurgery.« less

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

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.

Levels of Autonomy and Autonomous System Performance Assessment for Intelligent Unmanned Systems

DTIC Science & Technology

2014-04-01

LIDAR and camera sensors that is driven entirely by teleoperation would be AL 0. If that same robot used its LIDAR and camera data to generate a...obstacle detection, mapping, path planning 3 CMMAD semi- autonomous counter- mine system (Few 2010) Talon UGV, camera, LIDAR , metal detector...NCAP framework are performed on individual UMS components and do not require mission level evaluations. For example, bench testing of camera, LIDAR

Optimal slew path planning for the Sino-French Space-based multiband astronomical Variable Objects Monitor mission

NASA Astrophysics Data System (ADS)

She, Yuchen; Li, Shuang

2018-01-01

The planning algorithm to calculate a satellite's optimal slew trajectory with a given keep-out constraint is proposed. An energy-optimal formulation is proposed for the Space-based multiband astronomical Variable Objects Monitor Mission Analysis and Planning (MAP) system. The innovative point of the proposed planning algorithm lies in that the satellite structure and control limitation are not considered as optimization constraints but are formulated into the cost function. This modification is able to relieve the burden of the optimizer and increases the optimization efficiency, which is the major challenge for designing the MAP system. Mathematical analysis is given to prove that there is a proportional mapping between the formulation and the satellite controller output. Simulations with different scenarios are given to demonstrate the efficiency of the developed algorithm.

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…

Interference Path Loss Prediction in A319/320 Airplanes Using Modulated Fuzzy Logic and Neural Networks

NASA Technical Reports Server (NTRS)

Jafri, Madiha J.; Ely, Jay J.; Vahala, Linda L.

2007-01-01

In this paper, neural network (NN) modeling is combined with fuzzy logic to estimate Interference Path Loss measurements on Airbus 319 and 320 airplanes. Interference patterns inside the aircraft are classified and predicted based on the locations of the doors, windows, aircraft structures and the communication/navigation system-of-concern. Modeled results are compared with measured data. Combining fuzzy logic and NN modeling is shown to improve estimates of measured data over estimates obtained with NN alone. A plan is proposed to enhance the modeling for better prediction of electromagnetic coupling problems inside aircraft.

Multigeneration data migration from legacy systems

NASA Astrophysics Data System (ADS)

Ratib, Osman M.; Liu, Brent J.; Kho, Hwa T.; Tao, Wenchao; Wang, Cun; McCoy, J. Michael

2003-05-01

The migration of image data from different generations of legacy archive systems represents a technical challenge and in incremental cost in transitions to newer generations of PACS. UCLA medical center has elected to completely replace the existing PACS infrastructure encompassing several generations of legacy systems by a new commercial system providing enterprise-wide image management and communication. One of the most challenging parts of the project was the migration of large volumes of legacy images into the new system. Planning of the migration required the development of specialized software and hardware, and included different phases of data mediation from existing databases to the new PACS database prior to the migration of the image data. The project plan included a detailed analysis of resources and cost of data migration to optimize the process and minimize the delay of a hybrid operation where the legacy systems need to remain operational. Our analysis and project planning showed that the data migration represents the most critical path in the process of PACS renewal. Careful planning and optimization of the project timeline and resources allocated is critical to minimize the financial impact and the time delays that such migrations can impose on the implementation plan.

Optimisation des trajectoires d'un systeme de gestion de vol d'avions pour la reduction des couts de vol

NASA Astrophysics Data System (ADS)

Sidibe, Souleymane

The implementation and monitoring of operational flight plans is a major occupation for a crew of commercial flights. The purpose of this operation is to set the vertical and lateral trajectories followed by airplane during phases of flight: climb, cruise, descent, etc. These trajectories are subjected to conflicting economical constraints: minimization of flight time and minimization of fuel consumed and environmental constraints. In its task of mission planning, the crew is assisted by the Flight Management System (FMS) which is used to construct the path to follow and to predict the behaviour of the aircraft along the flight plan. The FMS considered in our research, particularly includes an optimization model of flight only by calculating the optimal speed profile that minimizes the overall cost of flight synthesized by a criterion of cost index following a steady cruising altitude. However, the model based solely on optimization of the speed profile is not sufficient. It is necessary to expand the current optimization for simultaneous optimization of the speed and altitude in order to determine an optimum cruise altitude that minimizes the overall cost when the path is flown with the optimal speed profile. Then, a new program was developed. The latter is based on the method of dynamic programming invented by Bellman to solve problems of optimal paths. In addition, the improvement passes through research new patterns of trajectories integrating ascendant cruises and using the lateral plane with the effect of the weather: wind and temperature. Finally, for better optimization, the program takes into account constraint of flight domain of aircrafts which utilize the FMS.

The Pacific Asynchronous TeleHealth (PATH) system: review of 1,000 pediatric teleconsultations.

PubMed

Mahnke, Christopher Becket; Jordan, Christopher P; Bergvall, Ethan; Person, Donald A; Pinsker, Jordan E

2011-01-01

The aim of this study was to evaluate the impact on pediatric care of the Pacific Asynchronous TeleHealth (PATH) system, a provider-to-provider teleconsultation platform utilized by military medical facilities throughout the Pacific Region. This review focuses on access to care, quality of care, and cost savings for the Department of Defense as a result of ongoing development of the PATH system from 2006 to 2009. This is a retrospective review of 1,000 consecutive teleconsultations occurring from January 2006 to March 2009. Three pediatric subspecialists reviewed the characteristics of each teleconsultation and the ultimate outcome. The PATH system processed > 300 pediatric teleconsultations in 2009 from 20 hospitals and clinics throughout the Pacific Region. The number of teleconsultations has grown significantly since 2006. Median teleconsultation response time was 14.5 h with 97% of teleconsultations answered within 1 week. The majority (75%) of teleconsultations came from areas without host nation pediatric subspecialty resources. Most teleconsultations (72%) involved diagnostic questions, whereas 21% were primarily for treatment issues. Teleconsultations originated predominantly from outpatient clinics (90%), with question resolution in 60% of cases without a face-to-face subspecialty evaluation. Fifteen percent of teleconsultations resulted in patient transfer to our center for definitive diagnosis and treatment. The diagnostic and/or treatment plan was modified in 74% of teleconsultations. PATH precluded patient transfer in 12%-43% of teleconsultations (annual savings: $208,283-$746,348 per year) and generated an average of 1.7 relative value units per teleconsultation. PATH provided patient access to pediatric subspecialty expertise via provider-to-provider asynchronous teleconsultation. Internet-based pediatric subspecialty teleconsultation provides fast, convenient, cost-effective, quality pediatric care to populations of patients who might otherwise require transfer to a distant medical facility for more advanced care. PATH serves as a model for future asynchronous teleconsultation platforms in both the military and civilian healthcare arenas.

Game theory and risk-based leveed river system planning with noncooperation

NASA Astrophysics Data System (ADS)

Hui, Rui; Lund, Jay R.; Madani, Kaveh

2016-01-01

Optimal risk-based levee designs are usually developed for economic efficiency. However, in river systems with multiple levees, the planning and maintenance of different levees are controlled by different agencies or groups. For example, along many rivers, levees on opposite riverbanks constitute a simple leveed river system with each levee designed and controlled separately. Collaborative planning of the two levees can be economically optimal for the whole system. Independent and self-interested landholders on opposite riversides often are willing to separately determine their individual optimal levee plans, resulting in a less efficient leveed river system from an overall society-wide perspective (the tragedy of commons). We apply game theory to simple leveed river system planning where landholders on each riverside independently determine their optimal risk-based levee plans. Outcomes from noncooperative games are analyzed and compared with the overall economically optimal outcome, which minimizes net flood cost system-wide. The system-wide economically optimal solution generally transfers residual flood risk to the lower-valued side of the river, but is often impractical without compensating for flood risk transfer to improve outcomes for all individuals involved. Such compensation can be determined and implemented with landholders' agreements on collaboration to develop an economically optimal plan. By examining iterative multiple-shot noncooperative games with reversible and irreversible decisions, the costs of myopia for the future in making levee planning decisions show the significance of considering the externalities and evolution path of dynamic water resource problems to improve decision-making.

Semi-autonomous wheelchair system using stereoscopic cameras.

PubMed

Nguyen, Jordan S; Nguyen, Thanh H; Nguyen, Hung T

2009-01-01

This paper is concerned with the design and development of a semi-autonomous wheelchair system using stereoscopic cameras to assist hands-free control technologies for severely disabled people. The stereoscopic cameras capture an image from both the left and right cameras, which are then processed with a Sum of Absolute Differences (SAD) correlation algorithm to establish correspondence between image features in the different views of the scene. This is used to produce a stereo disparity image containing information about the depth of objects away from the camera in the image. A geometric projection algorithm is then used to generate a 3-Dimensional (3D) point map, placing pixels of the disparity image in 3D space. This is then converted to a 2-Dimensional (2D) depth map allowing objects in the scene to be viewed and a safe travel path for the wheelchair to be planned and followed based on the user's commands. This assistive technology utilising stereoscopic cameras has the purpose of automated obstacle detection, path planning and following, and collision avoidance during navigation. Experimental results obtained in an indoor environment displayed the effectiveness of this assistive technology.

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.

Open Path Trace Gas Laser Sensors for UAV Deployment

NASA Astrophysics Data System (ADS)

Shadman, S.; Mchale, L.; Rose, C.; Yalin, A.

2015-12-01

Novel trace gas sensors based on open-path Cavity Ring-down Spectroscopy (CRDS) are being developed to enable remote and mobile deployments including on small unmanned aerial systems (UAS). Relative to established closed-path CRDS instruments, the use of open-path configurations allows removal of the bulky and power hungry vacuum and flow system, potentially enabling lightweight and low power instruments with high sensitivity. However, open path operation introduces new challenges including the need to maintain mirror cleanliness, mitigation of particle optical effects, and the need to measure spectral features that are relatively broad. The present submission details open-path CRDS instruments for ammonia and methane and their planned use in UAS studies. The ammonia sensor uses a quantum cascade laser at 10.3 mm in a configuration in which the laser frequency is continuously swept and a trigger circuit and acousto-optic modulator (AOM) extinguish the light when the laser is resonant with the cavity. Ring-down signals are measured with a two-stage thermoelectrically cooled MCT photodetector. The cavity mirrors have reflectivity of 0.9995 and a noise equivalent absorption of 1.5 ppb Hz-1/2 was demonstrated. A first version of the methane sensor operated at 1.7um with a telecom diode laser while the current version operates at 3.6 um with an interband cascade laser (stronger absorption). We have performed validation measurements against known standards for both sensors. Compact optical assemblies are being developed for UAS deployment. For example, the methane sensor head will have target mass of <4 kg and power draw <40 W. A compact single board computer and DAQ system is being designed for sensor control and signal processing with target mass <1 kg and power draw <10 W. The sensor size and power parameters are suitable for UAS deployment on both fixed wing and rotor style UAS. We plan to deploy the methane sensor to measure leakage and emission of methane from natural gas infrastructure, and to deploy both sensors together to study emissions from dairies and feedlots. The latter measurement campaign will also examine ammonia deposition to the ground, and bi-directional ammonia fluxes, using methane as a conservative tracer and examining the change in the ratio of ammonia to methane as a function of downwind position.

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.

Integration of task level planning and diagnosis for an intelligent robot

NASA Technical Reports Server (NTRS)

Chan, Amy W.

1992-01-01

A satellite floating space is diagnosed with a telerobot attached performing maintenance or replacement tasks. This research included three objectives. The first objective was to generate intelligent path planning for a robot to move around a satellite. The second objective was to diagnose possible faulty scenarios in the satellite. The third objective included two tasks. The first task was to combine intelligent path planning with diagnosis. The second task was to build an interface between the combined intelligent system with Robosim. The ability of a robot to deal with unexpected scenarios is particularly important in space since the situation could be different from time to time so that the telerobot must be capable of detecting that the situation has changed and the necessity may exist to alter its behavior based on the new situation. The feature of allowing human-in-the-loop is also very important in space. In some extreme cases, the situation is beyond the capability of a robot so our research project allows the human to override the decision of a robot.

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.

Man-machine cooperation in advanced teleoperation

NASA Technical Reports Server (NTRS)

Fiorini, Paolo; Das, Hari; Lee, Sukhan

1993-01-01

Teleoperation experiments at JPL have shown that advanced features in a telerobotic system are a necessary condition for good results, but that they are not sufficient to assure consistently good performance by the operators. Two or three operators are normally used during training and experiments to maintain the desired performance. An alternative to this multi-operator control station is a man-machine interface embedding computer programs that can perform some of the operator's functions. In this paper we present our first experiments with these concepts, in which we focused on the areas of real-time task monitoring and interactive path planning. In the first case, when performing a known task, the operator has an automatic aid for setting control parameters and camera views. In the second case, an interactive path planner will rank different path alternatives so that the operator will make the correct control decision. The monitoring function has been implemented with a neural network doing the real-time task segmentation. The interactive path planner was implemented for redundant manipulators to specify arm configurations across the desired path and satisfy geometric, task, and performance constraints.

Finding the way with a noisy brain.

PubMed

Cheung, Allen; Vickerstaff, Robert

2010-11-11

Successful navigation is fundamental to the survival of nearly every animal on earth, and achieved by nervous systems of vastly different sizes and characteristics. Yet surprisingly little is known of the detailed neural circuitry from any species which can accurately represent space for navigation. Path integration is one of the oldest and most ubiquitous navigation strategies in the animal kingdom. Despite a plethora of computational models, from equational to neural network form, there is currently no consensus, even in principle, of how this important phenomenon occurs neurally. Recently, all path integration models were examined according to a novel, unifying classification system. Here we combine this theoretical framework with recent insights from directed walk theory, and develop an intuitive yet mathematically rigorous proof that only one class of neural representation of space can tolerate noise during path integration. This result suggests many existing models of path integration are not biologically plausible due to their intolerance to noise. This surprising result imposes significant computational limitations on the neurobiological spatial representation of all successfully navigating animals, irrespective of species. Indeed, noise-tolerance may be an important functional constraint on the evolution of neuroarchitectural plans in the animal kingdom.

Solving the detour problem in navigation: a model of prefrontal and hippocampal interactions.

PubMed

Spiers, Hugo J; Gilbert, Sam J

2015-01-01

Adapting behavior to accommodate changes in the environment is an important function of the nervous system. A universal problem for motile animals is the discovery that a learned route is blocked and a detour is required. Given the substantial neuroscience research on spatial navigation and decision-making it is surprising that so little is known about how the brain solves the detour problem. Here we review the limited number of relevant functional neuroimaging, single unit recording and lesion studies. We find that while the prefrontal cortex (PFC) consistently responds to detours, the hippocampus does not. Recent evidence suggests the hippocampus tracks information about the future path distance to the goal. Based on this evidence we postulate a conceptual model in which: Lateral PFC provides a prediction error signal about the change in the path, frontopolar and superior PFC support the re-formulation of the route plan as a novel subgoal and the hippocampus simulates the new path. More data will be required to validate this model and understand (1) how the system processes the different options; and (2) deals with situations where a new path becomes available (i.e., shortcuts).

Real-time path planning in dynamic virtual environments using multiagent navigation graphs.

PubMed

Sud, Avneesh; Andersen, Erik; Curtis, Sean; Lin, Ming C; Manocha, Dinesh

2008-01-01

We present a novel approach for efficient path planning and navigation of multiple virtual agents in complex dynamic scenes. We introduce a new data structure, Multi-agent Navigation Graph (MaNG), which is constructed using first- and second-order Voronoi diagrams. The MaNG is used to perform route planning and proximity computations for each agent in real time. Moreover, we use the path information and proximity relationships for local dynamics computation of each agent by extending a social force model [Helbing05]. We compute the MaNG using graphics hardware and present culling techniques to accelerate the computation. We also address undersampling issues and present techniques to improve the accuracy of our algorithm. Our algorithm is used for real-time multi-agent planning in pursuit-evasion, terrain exploration and crowd simulation scenarios consisting of hundreds of moving agents, each with a distinct goal.

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.

Automation for "Direct-to" Clearances in Air-Traffic Control

NASA Technical Reports Server (NTRS)

Erzberger, Heinz; McNally, David

2006-01-01

A method of automation, and a system of computer hardware and software to implement the method, have been invented to assist en-route air-traffic controllers in the issuance of clearances to fly directly to specified waypoints or navigation fixes along straight paths that deviate from previously filed flight plans. Such clearances, called "direct-to" clearances, have been in use since before the invention of this method and system.

Dynamic Modeling and Soil Mechanics for Path Planning of the Mars Exploration Rovers

NASA Technical Reports Server (NTRS)

Trease, Brian

2011-01-01

To help minimize risk of high sinkage and slippage during drives and to better understand soil properties and rover terramechanics from drive data, a multidisciplinary team was formed under the Mars Exploration Rover project to develop and utilize dynamic computer-based models for rover drives over realistic terrains. The resulting system, named ARTEMIS (Adams-based Rover Terramechanics and Mobility Interaction System), consists of the dynamic model, a library of terramechanics subroutines, and the high-resolution digital elevation maps of the Mars surface. A 200-element model of the rovers was developed and validated for drop tests before launch, using Adams dynamic modeling software. The external library was built in Fortran and called by Adams to model the wheel-soil interactions include the rut-formation effect of deformable soils, lateral and longitudinal forces, bull-dozing effects, and applied wheel torque. The paper presents the details and implementation of the system. To validate the developed system, one study case is presented from a realistic drive on Mars of the Opportunity rover. The simulation results match well from the measurement of on-board telemetry data. In its final form, ARTEMIS will be used in a predictive manner to assess terrain navigability and will become part of the overall effort in path planning and navigation for both Martian and lunar rovers.

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

DTS: The NOAO Data Transport System

NASA Astrophysics Data System (ADS)

Fitzpatrick, M.; Semple, T.

2014-05-01

The NOAO Data Transport System (DTS) provides high-throughput, reliable, data transfer between telescopes, pipelines and archive centers located in the Northern and Southern hemispheres. It is a distributed application using XML-RPC for command and control, and either parallel-TCP or UDT protocols for bulk data transport. The system is data-agnostic, allowing arbitrary files or directories to be moved using the same infrastructure. Data paths are configurable in the system by connecting nodes as the source or destination of data in a queue. Each leg of a data path may be configured independently based on the network environment between the sites. A queueing model is currently implemented to manage the automatic movement of data, a streaming model is planned to support arbitrarily large transfers (e.g. as in a disk recovery scenario) or to provide a 'pass-thru' interface to minize overheads. A web-based monitor allows anyone to get a graphical overview of the DTS system as it runs, operators will be able to control individual nodes in the system. Through careful tuning of the network paths DTS is able to achieve in excess of 80-percent of the nominal wire speed using only commodity networks, making it ideal for long-haul transport of large volumes of data.

Fast and automatic depth control of iterative bone ablation based on optical coherence tomography data

NASA Astrophysics Data System (ADS)

Fuchs, Alexander; Pengel, Steffen; Bergmeier, Jan; Kahrs, Lüder A.; Ortmaier, Tobias

2015-07-01

Laser surgery is an established clinical procedure in dental applications, soft tissue ablation, and ophthalmology. The presented experimental set-up for closed-loop control of laser bone ablation addresses a feedback system and enables safe ablation towards anatomical structures that usually would have high risk of damage. This study is based on combined working volumes of optical coherence tomography (OCT) and Er:YAG cutting laser. High level of automation in fast image data processing and tissue treatment enables reproducible results and shortens the time in the operating room. For registration of the two coordinate systems a cross-like incision is ablated with the Er:YAG laser and segmented with OCT in three distances. The resulting Er:YAG coordinate system is reconstructed. A parameter list defines multiple sets of laser parameters including discrete and specific ablation rates as ablation model. The control algorithm uses this model to plan corrective laser paths for each set of laser parameters and dynamically adapts the distance of the laser focus. With this iterative control cycle consisting of image processing, path planning, ablation, and moistening of tissue the target geometry and desired depth are approximated until no further corrective laser paths can be set. The achieved depth stays within the tolerances of the parameter set with the smallest ablation rate. Specimen trials with fresh porcine bone have been conducted to prove the functionality of the developed concept. Flat bottom surfaces and sharp edges of the outline without visual signs of thermal damage verify the feasibility of automated, OCT controlled laser bone ablation with minimal process time.

A linguistic geometry for 3D strategic planning

NASA Technical Reports Server (NTRS)

Stilman, Boris

1995-01-01

This paper is a new step in the development and application of the Linguistic Geometry. This formal theory is intended to discover the inner properties of human expert heuristics, which have been successful in a certain class of complex control systems, and apply them to different systems. In this paper we investigate heuristics extracted in the form of hierarchical networks of planning paths of autonomous agents. Employing Linguistic Geometry tools the dynamic hierarchy of networks is represented as a hierarchy of formal attribute languages. The main ideas of this methodology are shown in this paper on the new pilot example of the solution of the extremely complex 3D optimization problem of strategic planning for the space combat of autonomous vehicles. This example demonstrates deep and highly selective search in comparison with conventional search algorithms.

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

Designing urban rules from emergent patterns: co-evolving paths of informal and formal urban systems - the case of Portugal

NASA Astrophysics Data System (ADS)

Silva, Paulo

2018-05-01

In many societies, informality has been a relevant part of the construction of the urban fabric. This is valid along a city’s history and in recent urbanization processes. In the past, informality was in the origin of many of urban planning. Very soon urban planning adopted, as one of their main missions malfunctions in cities. Therefore, the need of formalization became one of the main reasons on the emergence, the control of informal processes. As an answer to informal individual solutions, urban planning responded with standardized rules and the urge of creating spaces fitting into pre-established rules instead of rules fitting into spaces. Urban planning as a discipline has gradually changed its path. The contrast between urbanization promoted under formal urban planning and informal urbanization is only one sign of the mismatch between urban planning actions and informal urbanization dynamics. Considering this tension between formal and informal dynamics, in some cases, planning rules and planning processes continue ignoring informal dynamics; in other cases, planning rules are designed to integrate informality “without losing its face” through “planning games” [1]; and a third and less explored way in which planning systems interact with informality and from that interaction learn how to improve (we consider it a process of enrichment) planning rules while they promote an upgrade of informal interventions [2]. This latter win-win situation in which both informal and formal systems benefit from their interaction is still rare: most of the time either only one side benefits or none benefit from the interaction. Nevertheless, there are signs that from this interaction co-dependent adaptation might occur with positive outcomes for the urban system – in which co-evolutionary dynamics can be traced. We propose to look at the way building rules have been designed in Europe in a context considered successful in the sense of dealing of informality – the one of Portugal. The country experienced a wave of informality associated with illegal urbanization since the 1960’s in the main urban areas. The process of interaction between informal and formal urban systems proved to be a success in statistic terms. Slum clearance reduced the existence of informal occupations to almost zero. Informal settlements involving land tenure have been dealt with in the last two decades with considerable positive impact in the urban fabric. Based on this, with this paper we will evaluate how informal and formal systems are impacting each other and changing along the time the shape of building and of planning rules. For this we will look at the planning tools created to formalize informal settlements in the Lisbon Metropolitan Area from the last forty years to see how urban and building rules were adapted to respond to the specific needs of informal settlements; how this adaptation moved from temporary and exceptional to permanent rules; finally, how were these new rules able to “contaminate” the general planning and building codes. We aim that these findings would help us to contribute to a “healthier” relation between formal and informal urban systems, not ignoring each other, not controlling each other but instead learning with each other. By achieving this, planning systems become more responsive; on the other hand, informal occupations can be upgraded without being destroyed with the contribution of the planning systems.

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

Systems Engineering Management Plan NASA Traffic Aware Planner Integration Into P-180 Airborne Test-Bed

NASA Technical Reports Server (NTRS)

Maris, John

2015-01-01

NASA's Traffic Aware Planner (TAP) is a cockpit decision support tool that provides aircrew with vertical and lateral flight-path optimizations with the intent of achieving significant fuel and time savings, while automatically avoiding traffic, weather, and restricted airspace conflicts. A key step towards the maturation and deployment of TAP concerned its operational evaluation in a representative flight environment. This Systems Engineering Management Plan (SEMP) addresses the test-vehicle design, systems integration, and flight-test planning for the first TAP operational flight evaluations, which were successfully completed in November 2013. The trial outcomes are documented in the Traffic Aware Planner (TAP) flight evaluation paper presented at the 14th AIAA Aviation Technology, Integration, and Operations Conference, Atlanta, GA. (AIAA-2014-2166, Maris, J. M., Haynes, M. A., Wing, D. J., Burke, K. A., Henderson, J., & Woods, S. E., 2014).

NAVAIR Avionics Master Plan.

DTIC Science & Technology

1981-02-26

data rates, sufficient to handle radio frequency infor- mation. It also diminishes the vulnerability of the data paths to extraneous interferences from...The 1990 system will be unusable if Electromagnetic Interference (EMI)/Electromagnetic Pulse (EMP)/temperature/shock environments are not successfully...direct result of technological advancements driven by over utilization of the lower frequency spectrum (resulting in signal interference ) as well as

On the Path to Better Living.

ERIC Educational Resources Information Center

Irvin, Jesse L.

The purpose of this course of study is to improve economic citizenship through the study of the business and economic environment. Topics cover a wide range and are divided into twelve major units with lesson plans for each: Unit I--Our Economic World, Unit II--Our Economic System, Unit III--Economic Risks and Insurance, Unit IV--Money Management,…

A Heuristic Algorithm for Planning Personalized Learning Paths for Context-Aware Ubiquitous Learning

ERIC Educational Resources Information Center

Hwang, Gwo-Jen; Kuo, Fan-Ray; Yin, Peng-Yeng; Chuang, Kuo-Hsien

2010-01-01

In a context-aware ubiquitous learning environment, learning systems can detect students' learning behaviors in the real-world with the help of context-aware (sensor) technology; that is, students can be guided to observe or operate real-world objects with personalized support from the digital world. In this study, an optimization problem that…

Ecological criteria, participant preferences and location models: A GIS approach toward ATV trail planning

Treesearch

Stephanie A. Snyder; Jay H. Whitmore; Ingrid E. Schneider; Dennis R. Becker

2008-01-01

This paper presents a geographic information system (GIS)-based method for recreational trail location for all-terrain vehicles (ATVs) which considers environmental factors, as well as rider preferences for trail attributes. The method utilizes the Least-Cost Path algorithm within a GIS framework to optimize trail location. The trail location algorithm considered trail...

Examining Middle School Students' Awareness of Their Career Paths

ERIC Educational Resources Information Center

Alsuwaidi, Sultan A.

2012-01-01

The United Arab Emirates (UAE) education system is missing an educational plan that can provide students the necessary information to learn about themselves and the world of work and help them make a smooth transition from primary school to secondary schools and the workplace. To address this gap, this study examined 9th graders' career awareness…

The US Wilderness Managers Survey: Charting a path for the future

Treesearch

Chad P. Dawson; Ken Cordell; Alan E. Watson; Ramesh Ghimire; Gary T. Green

2016-01-01

The Wilderness Manager Survey (WMS) was developed in 2014 to support interagency strategic planning for the National Wilderness Preservation System (NWPS) and asked managers about their perceived threats to the NWPS, the need for science information to support decisionmaking, the need for education and training, and the most important problems for managers in the...

Compilation of Abstracts of Theses Submitted by Candidates for Degrees.

DTIC Science & Technology

1988-08-30

Systems Richbourg, R.F. Solving a Class of Spatial 7MAJ, USA Reasoning: Minimal-Cost 0 Path Planning in the Cart- isian Plane Staniec, C.J. Solving...Survey of the OH-50 Dash 14 LCDR, USN System Struth, R.G., Jr. A Theoretical Examiniation 15LCDR, USN of a Re-Entry Capsule In- corporating an...Toti, W.J. The Effect of Multipath on 23 LT, USN Digital Conmunications Systems : With Application to Space Station Webb, F.L. Target Motion Analysis

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.

Experiments in autonomous robotics

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

Hamel, W.R.

1987-01-01

The Center for Engineering Systems Advanced Research (CESAR) is performing basic research in autonomous robotics for energy-related applications in hazardous environments. The CESAR research agenda includes a strong experimental component to assure practical evaluation of new concepts and theories. An evolutionary sequence of mobile research robots has been planned to support research in robot navigation, world sensing, and object manipulation. A number of experiments have been performed in studying robot navigation and path planning with planar sonar sensing. Future experiments will address more complex tasks involving three-dimensional sensing, dexterous manipulation, and human-scale operations.

Challenges for Planning and Maintaining of Urban Rain Harvesting Systems- the case of Hammarby Sjöstad and Årstafältet in Stockholm

NASA Astrophysics Data System (ADS)

Suleiman, Lina

2017-04-01

Planners and policymakers' concern escalates over conventional systems dealing with rains in cities based on domination and control of nature rather than harmony and design with nature. A new spatial planning paradigm is needed to put in place systems which mimic natural water systems and promise multiple values instead of systems consider rain as a source of problem. However, such approach embodies significant planning challenges. Urban rain harvesting systems (URHs) are inherently viewed as 'sociotechnical' systems. As such, planning processes should consider the interdependence of 'social' and 'technical' aspects as essential elements if a transition towards sustainable urban water systems is to be realised. Drawing on a common understanding for what urban rain harvesting systems should deliver in terms of 'functions' and 'added values', a generic planning framework is developed to inform practitioners on how the 'socio' and 'technical' elements should be assimilated in a long-term and integrated planning processes of URHs. Using the developed framework, the paper examines the planning and maintenance processes of urban rain harvesting systems in Årstafältet and Hammarby Sjöstad respectively. Results show that planners lack a common operational understanding on how these systems should be designed holistically in a long term and integrated planning processes creating working gabs or positional conflicts. In practice, urban planners and water engineers look at these systems as either urban design component or water drainage system to deal with technical functions hindering a smooth transition path towards urban rain harvesting systems. The paper concludes on the urgency for reordering roles and relations within a new set-up organisation to incubate these systems in long-term planning and maintenance processes. Key words: 'Sociotechnical' system, Water, Planning, Urban Rain Harvesting systems (URHs), Hammarby Sjostad and Årstafältet

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…

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.

A strategy for advancing tilt-rotor technology

NASA Technical Reports Server (NTRS)

Morlok, Edward K.; Schoendorfer, David L.

1985-01-01

Tilt-rotor technology has many features which make it a very promising development in aviation which might have application to a wide variety of transportation and logistics situations. However, aside from military applications and rather specialized industrial applications, little is known regarding the potential of tilt-rotor for commercial transportation and hence it is difficult to plan a development program which would gain support and be likely to produce a stream of significant benefits. The purpose is to attempt to provide some of this information in a manner that would be useful for preparing a strategy for development of tilt-rotor aircraft technology. Specifically, the objectives were: to identify promising paths of development and deployment of tilt-rotor aircraft technology in the air transportation system considering both benefits and disbenefits, and to identify any particular groups that are likely to benefit significantly and propose plans for gaining their support of research and development of this technology. Potential advantages of the tilt-rotor technology in the context of air transportation as a door-to-door system were identified, and then promising paths of development of such tilt-rotor systems were analyzed. These then lead to recommendations for specific studies, information dissemination and development of awareness of the tilt-rotor among specific transport-related groups.

Unmanned Aircraft Systems (UAS) Integration in the National Airspace System (NAS) Project: KDP-A for Phase 2 Minimum Operational Performance Standards

NASA Technical Reports Server (NTRS)

Grindle, Laurie; Hackenberg, Davis L.

2016-01-01

UAS Integration in the NAS Project has: a) Developed Technical Challenges that are crucial to UAS integration, aligned with NASA's Strategic Plan and Thrusts, and support FAA standards development. b) Demonstrated rigorous project management processes through the execution of previous phases. c) Defined Partnership Plans. d) Established path to KDP-C. Request approval of Technical Challenges, execution of partnerships and plans, and execution of near-term FY17 activities. There is an increasing need to fly UAS in the NAS to perform missions of vital importance to National Security and Defense, Emergency Management, and Science. There is also an emerging need to enable commercial applications such as cargo transport (e.g. FedEx). Unencumbered NAS Access for Civil/Commercial UAS. Provide research findings, utilizing simulation and flight tests, to support the development and validation of DAA and C2 technologies necessary for integrating Unmanned Aircraft Systems into the National Airspace System.

Trajectory planning of mobile robots using indirect solution of optimal control method in generalized point-to-point task

NASA Astrophysics Data System (ADS)

Nazemizadeh, M.; Rahimi, H. N.; Amini Khoiy, K.

2012-03-01

This paper presents an optimal control strategy for optimal trajectory planning of mobile robots by considering nonlinear dynamic model and nonholonomic constraints of the system. The nonholonomic constraints of the system are introduced by a nonintegrable set of differential equations which represent kinematic restriction on the motion. The Lagrange's principle is employed to derive the nonlinear equations of the system. Then, the optimal path planning of the mobile robot is formulated as an optimal control problem. To set up the problem, the nonlinear equations of the system are assumed as constraints, and a minimum energy objective function is defined. To solve the problem, an indirect solution of the optimal control method is employed, and conditions of the optimality derived as a set of coupled nonlinear differential equations. The optimality equations are solved numerically, and various simulations are performed for a nonholonomic mobile robot to illustrate effectiveness of the proposed method.

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.

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.

An Evaluation on Medical Education, Research and Development of AYUSH Systems of Medicine through Five Year Plans of India.

PubMed

Samal, Janmejaya; Dehury, Ranjit Kumar

2016-05-01

Indian system of medicine has its origin in India. The system is currently renamed as AYUSH, an acronym for Ayurveda, Yoga & Naturopathy, Unani, Sidha and Homeopathy. These are the six Indian systems of medicine prevalent and practiced in India and in few neighboring Asian countries. The primary objective of this review was to gain insight in to the prior and existing initiatives which would enable reflection and assist in the identification of future change. A review was carried out based on the five year plan documents, obtained from the planning commission web portal of Govt. of India, on medical education, research and development of AYUSH systems of medicine. Post independence, the process of five year planning took its birth with the initiation of long term planning in India. The planning process embraced all the social and technology sectors in it. Since the beginning of five year planning, health and family welfare planning became imperative as a social sector planning. Planning regarding Indian Systems of Medicine became a part of health and family welfare planning since then. During the entire planning process a progressive path of development could be observed as per this evaluation. A relatively sluggish process of development was observed up to seventh plan however post eighth plan the growth took its pace. Eighth plan onwards several innovative development processes could be noticed. Despite the relative developments and growth of Indian systems of medicine these systems have to face lot of criticism and appraisal owing to their various characteristic features. In the beginning the system thrived with great degree of uncertainty, as described in 1(st) five year plan, however progressed ahead with a vision to be a globally accepted system, as envisaged in 11(th) five year plan. A very strong optimistic approach in spreading India's own medical heritage is the need of the hour. The efforts are neither completely insufficient nor sufficient enough; hence a continuous endeavor for the revival and dissemination of India's own medical inheritance for the welfare of the society at large is highly desirable.

An Evaluation on Medical Education, Research and Development of AYUSH Systems of Medicine through Five Year Plans of India

PubMed Central

Dehury, Ranjit Kumar

2016-01-01

Introduction Indian system of medicine has its origin in India. The system is currently renamed as AYUSH, an acronym for Ayurveda, Yoga & Naturopathy, Unani, Sidha and Homeopathy. These are the six Indian systems of medicine prevalent and practiced in India and in few neighboring Asian countries. Objective The primary objective of this review was to gain insight in to the prior and existing initiatives which would enable reflection and assist in the identification of future change. Materials and Methods A review was carried out based on the five year plan documents, obtained from the planning commission web portal of Govt. of India, on medical education, research and development of AYUSH systems of medicine. Results Post independence, the process of five year planning took its birth with the initiation of long term planning in India. The planning process embraced all the social and technology sectors in it. Since the beginning of five year planning, health and family welfare planning became imperative as a social sector planning. Planning regarding Indian Systems of Medicine became a part of health and family welfare planning since then. During the entire planning process a progressive path of development could be observed as per this evaluation. A relatively sluggish process of development was observed up to seventh plan however post eighth plan the growth took its pace. Eighth plan onwards several innovative development processes could be noticed. Despite the relative developments and growth of Indian systems of medicine these systems have to face lot of criticism and appraisal owing to their various characteristic features. In the beginning the system thrived with great degree of uncertainty, as described in 1st five year plan, however progressed ahead with a vision to be a globally accepted system, as envisaged in 11th five year plan. Conclusion A very strong optimistic approach in spreading India’s own medical heritage is the need of the hour. The efforts are neither completely insufficient nor sufficient enough; hence a continuous endeavor for the revival and dissemination of India’s own medical inheritance for the welfare of the society at large is highly desirable. PMID:27437245

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

Common-Path Wavefront Sensing for Advanced Coronagraphs

NASA Technical Reports Server (NTRS)

Wallace, J. Kent; Serabyn, Eugene; Mawet, Dimitri

2012-01-01

Imaging of faint companions around nearby stars is not limited by either intrinsic resolution of a coronagraph/telescope system, nor is it strictly photon limited. Typically, it is both the magnitude and temporal variation of small phase and amplitude errors imparted to the electric field by elements in the optical system which will limit ultimate performance. Adaptive optics systems, particularly those with multiple deformable mirrors, can remove these errors, but they need to be sensed in the final image plane. If the sensing system is before the final image plane, which is typical for most systems, then the non-common path optics between the wavefront sensor and science image plane will lead to un-sensed errors. However, a new generation of high-performance coronagraphs naturally lend themselves to wavefront sensing in the final image plane. These coronagraphs and the wavefront sensing will be discussed, as well as plans for demonstrating this with a high-contrast system on the ground. Such a system will be a key system-level proof for a future space-based coronagraph mission, which will also be discussed.

Chain-Based Communication in Cylindrical Underwater Wireless Sensor Networks

PubMed Central

Javaid, Nadeem; Jafri, Mohsin Raza; Khan, Zahoor Ali; Alrajeh, Nabil; Imran, Muhammad; Vasilakos, Athanasios

2015-01-01

Appropriate network design is very significant for Underwater Wireless Sensor Networks (UWSNs). Application-oriented UWSNs are planned to achieve certain objectives. Therefore, there is always a demand for efficient data routing schemes, which can fulfill certain requirements of application-oriented UWSNs. These networks can be of any shape, i.e., rectangular, cylindrical or square. In this paper, we propose chain-based routing schemes for application-oriented cylindrical networks and also formulate mathematical models to find a global optimum path for data transmission. In the first scheme, we devise four interconnected chains of sensor nodes to perform data communication. In the second scheme, we propose routing scheme in which two chains of sensor nodes are interconnected, whereas in third scheme single-chain based routing is done in cylindrical networks. After finding local optimum paths in separate chains, we find global optimum paths through their interconnection. Moreover, we develop a computational model for the analysis of end-to-end delay. We compare the performance of the above three proposed schemes with that of Power Efficient Gathering System in Sensor Information Systems (PEGASIS) and Congestion adjusted PEGASIS (C-PEGASIS). Simulation results show that our proposed 4-chain based scheme performs better than the other selected schemes in terms of network lifetime, end-to-end delay, path loss, transmission loss, and packet sending rate. PMID:25658394

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.

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.

Wireless Distribution Systems To Support Medical Response to Disasters

PubMed Central

Arisoylu, Mustafa; Mishra, Rajesh; Rao, Ramesh; Lenert, Leslie A.

2005-01-01

We discuss the design of multi-hop access networks with multiple gateways that supports medical response to disasters. We examine and implement protocols to ensure high bandwidth, robust, self-healing and secure wireless multi-hop access networks for extreme conditions. Address management, path setup, gateway discovery and selection protocols are described. Future directions and plans are also considered. PMID:16779171

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.

Sensorimotor adaptation of point-to-point arm movements after spaceflight: the role of internal representation of gravity force in trajectory planning.

PubMed

Gaveau, Jérémie; Paizis, Christos; Berret, Bastien; Pozzo, Thierry; Papaxanthis, Charalambos

2011-08-01

After an exposure to weightlessness, the central nervous system operates under new dynamic and sensory contexts. To find optimal solutions for rapid adaptation, cosmonauts have to decide whether parameters from the world or their body have changed and to estimate their properties. Here, we investigated sensorimotor adaptation after a spaceflight of 10 days. Five cosmonauts performed forward point-to-point arm movements in the sagittal plane 40 days before and 24 and 72 h after the spaceflight. We found that, whereas the shape of hand velocity profiles remained unaffected after the spaceflight, hand path curvature significantly increased 1 day after landing and returned to the preflight level on the third day. Control experiments, carried out by 10 subjects under normal gravity conditions, showed that loading the arm with varying loads (from 0.3 to 1.350 kg) did not affect path curvature. Therefore, changes in path curvature after spaceflight cannot be the outcome of a control process based on the subjective feeling that arm inertia was increased. By performing optimal control simulations, we found that arm kinematics after exposure to microgravity corresponded to a planning process that overestimated the gravity level and optimized movements in a hypergravity environment (∼1.4 g). With time and practice, the sensorimotor system was recalibrated to Earth's gravity conditions, and cosmonauts progressively generated accurate estimations of the body state, gravity level, and sensory consequences of the motor commands (72 h). These observations provide novel insights into how the central nervous system evaluates body (inertia) and environmental (gravity) states during sensorimotor adaptation of point-to-point arm movements after an exposure to weightlessness.

Fiber-reinforced ceramic composites for Earth-to-orbit rocket engine turbines

NASA Technical Reports Server (NTRS)

Brockmeyer, Jerry W.; Schnittgrund, Gary D.

1990-01-01

Fiber reinforced ceramic matrix composites (FRCMC) are emerging materials systems that offer potential for use in liquid rocket engines. Advantages of these materials in rocket engine turbomachinery include performance gain due to higher turbine inlet temperature, reduced launch costs, reduced maintenance with associated cost benefits, and reduced weight. This program was initiated to assess the state of FRCMC development and to propose a plan for their implementation into liquid rocket engine turbomachinery. A complete range of FRCMC materials was investigated relative to their development status and feasibility for use in the hot gas path of earth-to-orbit rocket engine turbomachinery. Of the candidate systems, carbon fiber-reinforced silicon carbide (C/SiC) offers the greatest near-term potential. Critical hot gas path components were identified, and the first stage inlet nozzle and turbine rotor of the fuel turbopump for the liquid oxygen/hydrogen Space Transportation Main Engine (STME) were selected for conceptual design and analysis. The critical issues associated with the use of FRCMC were identified. Turbine blades were designed, analyzed and fabricated. The Technology Development Plan, completed as Task 5 of this program, provides a course of action for resolution of these issues.

Description of the computations and pilot procedures for planning fuel-conservative descents with a small programmable calculator

NASA Technical Reports Server (NTRS)

Vicroy, D. D.; Knox, C. E.

1983-01-01

A simplified flight management descent algorithm was developed and programmed on a small programmable calculator. It was designed to aid the pilot in planning and executing a fuel conservative descent to arrive at a metering fix at a time designated by the air traffic control system. The algorithm may also be used for planning fuel conservative descents when time is not a consideration. The descent path was calculated for a constant Mach/airspeed schedule from linear approximations of airplane performance with considerations given for gross weight, wind, and nonstandard temperature effects. The flight management descent algorithm and the vertical performance modeling required for the DC-10 airplane is described.

Semiautomated Management Of Arriving Air Traffic

NASA Technical Reports Server (NTRS)

Erzberger, Heinz; Nedell, William

1992-01-01

System of computers, graphical workstations, and computer programs developed for semiautomated management of approach and arrival of numerous aircraft at airport. System comprises three subsystems: traffic-management advisor, used for controlling traffic into terminal area; descent advisor generates information integrated into plan-view display of traffic on monitor; and final-approach-spacing tool used to merge traffic converging on final approach path while making sure aircraft are properly spaced. Not intended to restrict decisions of air-traffic controllers.

Implementation of a Multi-Robot Coverage Algorithm on a Two-Dimensional, Grid-Based Environment

DTIC Science & Technology

2017-06-01

two planar laser range finders with a 180-degree field of view , color camera, vision beacons, and wireless communicator. In their system, the robots...Master’s thesis 4. TITLE AND SUBTITLE IMPLEMENTATION OF A MULTI -ROBOT COVERAGE ALGORITHM ON A TWO -DIMENSIONAL, GRID-BASED ENVIRONMENT 5. FUNDING NUMBERS...path planning coverage algorithm for a multi -robot system in a two -dimensional, grid-based environment. We assess the applicability of a topology

Path planning and parameter optimization of uniform removal in active feed polishing

NASA Astrophysics Data System (ADS)

Liu, Jian; Wang, Shaozhi; Zhang, Chunlei; Zhang, Linghua; Chen, Huanan

2015-06-01

A high-quality ultrasmooth surface is demanded in short-wave optical systems. However, the existing polishing methods have difficulties meeting the requirement on spherical or aspheric surfaces. As a new kind of small tool polishing method, active feed polishing (AFP) could attain a surface roughness of less than 0.3 nm (RMS) on spherical elements, although AFP may magnify the residual figure error or mid-frequency error. The purpose of this work is to propose an effective algorithm to realize uniform removal of the surface in the processing. At first, the principle of the AFP and the mechanism of the polishing machine are introduced. In order to maintain the processed figure error, a variable pitch spiral path planning algorithm and the dwell time-solving model are proposed. For suppressing the possible mid-frequency error, the uniformity of the synthesis tool path, which is generated by an arbitrary point at the polishing tool bottom, is analyzed and evaluated, and the angular velocity ratio of the tool spinning motion to the revolution motion is optimized. Finally, an experiment is conducted on a convex spherical surface and an ultrasmooth surface is finally acquired. In conclusion, a high-quality ultrasmooth surface can be successfully obtained with little degradation of the figure and mid-frequency errors by the algorithm.

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.

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.

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.

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.

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…

Multicore Hardware Experiments in Software Producibility

DTIC Science & Technology

2009-06-01

processors. 15. SUBJECT TERMS Multi-core, Real - time Systems , Testing, Software Modernization 16. SECURITY CLASSIFICATION OF: 17. LIMITATION OF... real ‐ time   systems .   The  inputs to the dgclocalnav component are the path plan (received from highlevelplanner, discussed  next), the drivable grid... time   systems , robotics, and software. As frequently observed in cyber‐physical systems,  the  system  designers  may  need  experience  in  multiple

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

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.

An experimental and theoretical model of children’s search behavior in relation to target conspicuity and spatial distribution

NASA Astrophysics Data System (ADS)

Rosetti, Marcos Francisco; Pacheco-Cobos, Luis; Larralde, Hernán; Hudson, Robyn

2010-11-01

This work explores search trajectories of children attempting to find targets distributed on a playing field. This task, of ludic nature, was developed to test the effect of conspicuity and spatial distribution of targets on the searcher’s performance. The searcher’s path was recorded by a Global Positioning System (GPS) device attached to the child’s waist. Participants were not rewarded nor their performance rated. Variation in the conspicuity of the targets influenced search performance as expected; cryptic targets resulted in slower searches and longer, more tortuous paths. Extracting the main features of the paths showed that the children: (1) paid little attention to the spatial distribution and at least in the conspicuous condition approximately followed a nearest neighbor pattern of target collection, (2) were strongly influenced by the conspicuity of the targets. We implemented a simple statistical model for the search rules mimicking the children’s behavior at the level of individual (coarsened) steps. The model reproduced the main features of the children’s paths without the participation of memory or planning.

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.

Combined Cycle Engine Large-Scale Inlet for Mode Transition Experiments: System Identification Rack Hardware Design

NASA Technical Reports Server (NTRS)

Thomas, Randy; Stueber, Thomas J.

2013-01-01

The System Identification (SysID) Rack is a real-time hardware-in-the-loop data acquisition (DAQ) and control instrument rack that was designed and built to support inlet testing in the NASA Glenn Research Center 10- by 10-Foot Supersonic Wind Tunnel. This instrument rack is used to support experiments on the Combined-Cycle Engine Large-Scale Inlet for Mode Transition Experiment (CCE? LIMX). The CCE?LIMX is a testbed for an integrated dual flow-path inlet configuration with the two flow paths in an over-and-under arrangement such that the high-speed flow path is located below the lowspeed flow path. The CCE?LIMX includes multiple actuators that are designed to redirect airflow from one flow path to the other; this action is referred to as "inlet mode transition." Multiple phases of experiments have been planned to support research that investigates inlet mode transition: inlet characterization (Phase-1) and system identification (Phase-2). The SysID Rack hardware design met the following requirements to support Phase-1 and Phase-2 experiments: safely and effectively move multiple actuators individually or synchronously; sample and save effector control and position sensor feedback signals; automate control of actuator positioning based on a mode transition schedule; sample and save pressure sensor signals; and perform DAQ and control processes operating at 2.5 KHz. This document describes the hardware components used to build the SysID Rack including their function, specifications, and system interface. Furthermore, provided in this document are a SysID Rack effectors signal list (signal flow); system identification experiment setup; illustrations indicating a typical SysID Rack experiment; and a SysID Rack performance overview for Phase-1 and Phase-2 experiments. The SysID Rack described in this document was a useful tool to meet the project objectives.

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.

Automatic control of a robotic vehicle

NASA Technical Reports Server (NTRS)

Mcreynolds, S. R.

1976-01-01

Over the last several years Jet Propulsion Laboratory has been engaged in a project to develop some of the technology required to build a robotic vehicle for exploring planetary surfaces. An overview of hardware and software being developed for this project is given. Particular emphasis is placed on the description of the current design for the Vehicle System required for locomotion and the path planning algorithm.

The use of 3-D sensing techniques for on-line collision-free path planning

NASA Technical Reports Server (NTRS)

Hayward, V.; Aubry, S.; Jasiukajc, Z.

1987-01-01

The state of the art in collision prevention for manipulators with revolute joints, showing that it is a particularly computationally hard problem, is discussed. Based on the analogy with other hard or undecidable problems such as theorem proving, an extensible multi-resolution architecture for path planning, based on a collection of weak methods is proposed. Finally, the role that sensors can play for an on-line use of sensor data is examined.

SEPS mission and system integration/interface requirements for the space transportation system. [Solar Electric Propulsion System

NASA Technical Reports Server (NTRS)

Cork, M. J.; Barnett, P. M.; Shaffer, J., Jr.; Doran, B. J.

1979-01-01

Earth escape mission requirements on Solar Electric Propulsion System (SEPS), and the interface definition and planned integration between SEPS, user spacecraft, and other elements of the STS. Emphasis is placed on the Comet rendezvous mission, scheduled to be the first SEPS user. Interactive SEPS interface characteristics with spacecraft and mission, as well as the multiple organizations and inter-related development schedules required to integrate the SEPS with spacecraft and STS, require early attention to definition of interfaces in order to assure a successful path to the first SEPS launch in July 1985

Planning fuel-conservative descents with or without time constraints using a small programmable calculator: Algorithm development and flight test results

NASA Technical Reports Server (NTRS)

Knox, C. E.

1983-01-01

A simplified flight-management descent algorithm, programmed on a small programmable calculator, was developed and flight tested. It was designed to aid the pilot in planning and executing a fuel-conservative descent to arrive at a metering fix at a time designated by the air traffic control system. The algorithm may also be used for planning fuel-conservative descents when time is not a consideration. The descent path was calculated for a constant Mach/airspeed schedule from linear approximations of airplane performance with considerations given for gross weight, wind, and nonstandard temperature effects. The flight-management descent algorithm is described. The results of flight tests flown with a T-39A (Sabreliner) airplane are presented.

Description of the computations and pilot procedures for planning fuel-conservative descents with a small programmable calculator

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

Vicroy, D.D.; Knox, C.E.

A simplified flight management descent algorithm was developed and programmed on a small programmable calculator. It was designed to aid the pilot in planning and executing a fuel conservative descent to arrive at a metering fix at a time designated by the air traffic control system. The algorithm may also be used for planning fuel conservative descents when time is not a consideration. The descent path was calculated for a constant Mach/airspeed schedule from linear approximations of airplane performance with considerations given for gross weight, wind, and nonstandard temperature effects. The flight management descent algorithm and the vertical performance modelingmore » required for the DC-10 airplane is described.« less

Development and demonstration of an on-board mission planner for helicopters

NASA Technical Reports Server (NTRS)

Deutsch, Owen L.; Desai, Mukund

1988-01-01

Mission management tasks can be distributed within a planning hierarchy, where each level of the hierarchy addresses a scope of action, and associated time scale or planning horizon, and requirements for plan generation response time. The current work is focused on the far-field planning subproblem, with a scope and planning horizon encompassing the entire mission and with a response time required to be about two minutes. The far-feld planning problem is posed as a constrained optimization problem and algorithms and structural organizations are proposed for the solution. Algorithms are implemented in a developmental environment, and performance is assessed with respect to optimality and feasibility for the intended application and in comparison with alternative algorithms. This is done for the three major components of far-field planning: goal planning, waypoint path planning, and timeline management. It appears feasible to meet performance requirements on a 10 Mips flyable processor (dedicated to far-field planning) using a heuristically-guided simulated annealing technique for the goal planner, a modified A* search for the waypoint path planner, and a speed scheduling technique developed for this project.

Prediction and Warning of Transported Turbulence in Long-Haul Aircraft Operations

NASA Technical Reports Server (NTRS)

Ellrod, Gary P. (Inventor); Spence, Mark D. (Inventor); Shipley, Scott T. (Inventor)

2017-01-01

An aviation flight planning system is used for predicting and warning for intersection of flight paths with transported meteorological disturbances, such as transported turbulence and related phenomena. Sensed data and transmitted data provide real time and forecast data related to meteorological conditions. Data modelling transported meteorological disturbances are applied to the received transmitted data and the sensed data to use the data modelling transported meteorological disturbances to correlate the sensed data and received transmitted data. The correlation is used to identify transported meteorological disturbances source characteristics, and identify predicted transported meteorological disturbances trajectories from source to intersection with flight path in space and time. The correlated data are provided to a visualization system that projects coordinates of a point of interest (POI) in a selected point of view (POV) to displays the flight track and the predicted transported meteorological disturbances warnings for the flight crew.

Atlas-based system for functional neurosurgery

NASA Astrophysics Data System (ADS)

Nowinski, Wieslaw L.; Yeo, Tseng T.; Yang, Guo L.; Dow, Douglas E.

1997-05-01

This paper addresses the development of an atlas-based system for preoperative functional neurosurgery planning and training, intraoperative support and postoperative analysis. The system is based on Atlas of Stereotaxy of the Human Brain by Schaltenbrand and Wahren used for interactive segmentation and labeling of clinical data in 2D/3D, and for assisting stereotactic targeting. The atlas microseries are digitized, enhanced, segmented, labeled, aligned and organized into mutually preregistered atlas volumes 3D models of the structures are also constructed. The atlas may be interactively registered with the actual patient's data. Several other features are also provided including data reformatting, visualization, navigation, mensuration, and stereotactic path display and editing in 2D/3D. The system increases the accuracy of target definition, reduces the time of planning and time of the procedure itself. It also constitutes a research platform for the construction of more advanced neurosurgery supporting tools and brain atlases.

Robot navigation research at CESAR (Center for Engineering Systems Advanced Research)

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

Barnett, D.L.; de Saussure, G.; Pin, F.G.

1989-01-01

A considerable amount of work has been reported on the problem of robot navigation in known static terrains. Algorithms have been proposed and implemented to search for an optimum path to the goal, taking into account the finite size and shape of the robot. Not as much work has been reported on robot navigation in unknown, unstructured, or dynamic environments. A robot navigating in an unknown environment must explore with its sensors, construct an abstract representation of its global environment to plan a path to the goal, and update or revise its plan based on accumulated data obtained and processedmore » in real-time. The core of the navigation program for the CESAR robots is a production system developed on the expert-system-shell CLIPS which runs on an NCUBE hypercube on board the robot. The production system can call on C-compiled navigation procedures. The production rules can read the sensor data and address the robot's effectors. This architecture was found efficient and flexible for the development and testing of the navigation algorithms; however, in order to process intelligently unexpected emergencies, it was found necessary to be able to control the production system through externally generated asynchronous data. This led to the design of a new asynchronous production system, APS, which is now being developed on the robot. This paper will review some of the navigation algorithms developed and tested at CESAR and will discuss the need for the new APS and how it is being integrated into the robot architecture. 18 refs., 3 figs., 1 tab.« less

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.

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

Motion of an Articulated Vehicle with Two-Dimensional Sections Subject to Lateral Obstacles

NASA Astrophysics Data System (ADS)

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

2016-07-01

Some aspects of the geometry, kinematics, and dynamics of a three-section robotic vehicle with a front steerable wheel are studied. The constraints between the wheels and the flat ground are assumed nonholonomic. The vehicle moves in a narrow L-shaped corridor. A path for the characteristic points of the sections of the robot is designed. A dynamic model of the system is developed. The maximum possible dimensions of the robot that allow its unimpeded and non-stop motion are determined. The kinetostatic analysis of the load on a three-section vehicle moving along a planned path is modeled. The holonomic and nonholonomic constraint reactions between the wheels and the ground and in the joints between the sections are determined

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

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

Spider monkey ranging patterns in Mexican subtropical forest: do travel routes reflect planning?

PubMed

Valero, Alejandra; Byrne, Richard W

2007-07-01

Although it is well known that frugivorous spider monkeys (Ateles geoffroyi yucatanensis) occupy large home ranges, travelling long distances to reach highly productive resources, little is known of how they move between feeding sites. A 11 month study of spider monkey ranging patterns was carried out at the Otochma'ax Yetel Kooh reserve, Yucatán, Mexico. We followed single individuals for as long as possible each day and recorded the routes travelled with the help of a GPS (Global Positioning System) device; the 11 independently moving individuals of a group were targeted as focal subjects. Travel paths were composed of highly linear segments, each typically ending at a place where some resource was exploited. Linearity of segments did not differ between individuals, and most of the highly linear paths that led to food resources were much longer than the estimate visibility in the woodland canopy. Monkeys do not generally continue in the same ranging direction after exploiting a resource: travel paths are likely to deviate at the site of resource exploitation rather than between such sites. However, during the harshest months of the year consecutive route segments were more likely to retain the same direction of overall movement. Together, these findings suggest that while moving between feeding sites, spider monkeys use spatial memory to guide travel, and even plan more than one resource site in advance.

Optimal Propellant Maneuver Flight Demonstrations on ISS

NASA Technical Reports Server (NTRS)

Bhatt, Sagar; Bedrossian, Nazareth; Longacre, Kenneth; Nguyen, Louis

2013-01-01

In this paper, first ever flight demonstrations of Optimal Propellant Maneuver (OPM), a method of propulsive rotational state transition for spacecraft controlled using thrusters, is presented for the International Space Station (ISS). On August 1, 2012, two ISS reorientations of about 180deg each were performed using OPMs. These maneuvers were in preparation for the same-day launch and rendezvous of a Progress vehicle, also a first for ISS visiting vehicles. The first maneuver used 9.7 kg of propellant, whereas the second used 10.2 kg. Identical maneuvers performed without using OPMs would have used approximately 151.1kg and 150.9kg respectively. The OPM method is to use a pre-planned attitude command trajectory to accomplish a rotational state transition. The trajectory is designed to take advantage of the complete nonlinear system dynamics. The trajectory choice directly influences the cost of the maneuver, in this case, propellant. For example, while an eigenaxis maneuver is kinematically the shortest path between two orientations, following that path requires overcoming the nonlinear system dynamics, thereby increasing the cost of the maneuver. The eigenaxis path is used for ISS maneuvers using thrusters. By considering a longer angular path, the path dependence of the system dynamics can be exploited to reduce the cost. The benefits of OPM for the ISS include not only reduced lifetime propellant use, but also reduced loads, erosion, and contamination from thrusters due to fewer firings. Another advantage of the OPM is that it does not require ISS flight software modifications since it is a set of commands tailored to the specific attitude control architecture. The OPM takes advantage of the existing ISS control system architecture for propulsive rotation called USTO control mode1. USTO was originally developed to provide ISS Orbiter stack attitude control capability for a contingency tile-repair scenario, where the Orbiter is maneuvered using its robotic manipulator relative to the ISS. Since 2005 USTO has been used for nominal ISS operations.

An Innovative Multi-Agent Search-and-Rescue Path Planning Approach

DTIC Science & Technology

2015-03-09

search problems from search theory and artificial intelligence /distributed robotic control, and pursuit-evasion problem perspectives may be found in...Dissanayake, “Probabilistic search for a moving target in an indoor environment”, In Proc. IEEE/RSJ Int. Conf. Intelligent Robots and Systems, 2006, pp...3393-3398. [7] H. Lau, and G. Dissanayake, “Optimal search for multiple targets in a built environment”, In Proc. IEEE/RSJ Int. Conf. Intelligent

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

Analysis and design of a capsule landing system and surface vehicle control system for Mars exploration

NASA Technical Reports Server (NTRS)

Frederick, D. K.; Lashmet, P. K.; Sandor, G. N.; Shen, C. N.; Smith, E. J.; Yerazunis, S. W.

1971-01-01

Investigation of problems related to control of a mobile planetary vehicle according to a systematic plan for the exploration of Mars has been undertaken. Problem areas receiving attention include: (1) overall systems analysis; (2) vehicle configuration and dynamics; (3) toroidal wheel design and evaluation; (4) on-board navigation systems; (5) satellite-vehicle navigation systems; (6) obstacle detection systems; (7) terrain sensing, interpretation and modeling; (8) computer simulation of terrain sensor-path selection systems; and (9) chromatographic systems design concept studies. The specific tasks which have been undertaken are defined and the progress which has been achieved during the period July 1, 1971 to December 31, 1971 is summarized.

Full-Scale Accident Testing in Support of Used Nuclear Fuel Transportation.

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

Durbin, Samuel G.; Lindgren, Eric R.; Rechard, Rob P.

2014-09-01

The safe transport of spent nuclear fuel and high-level radioactive waste is an important aspect of the waste management system of the United States. The Nuclear Regulatory Commission (NRC) currently certifies spent nuclear fuel rail cask designs based primarily on numerical modeling of hypothetical accident conditions augmented with some small scale testing. However, NRC initiated a Package Performance Study (PPS) in 2001 to examine the response of full-scale rail casks in extreme transportation accidents. The objectives of PPS were to demonstrate the safety of transportation casks and to provide high-fidelity data for validating the modeling. Although work on the PPSmore » eventually stopped, the Blue Ribbon Commission on America’s Nuclear Future recommended in 2012 that the test plans be re-examined. This recommendation was in recognition of substantial public feedback calling for a full-scale severe accident test of a rail cask to verify evaluations by NRC, which find that risk from the transport of spent fuel in certified casks is extremely low. This report, which serves as the re-assessment, provides a summary of the history of the PPS planning, identifies the objectives and technical issues that drove the scope of the PPS, and presents a possible path for moving forward in planning to conduct a full-scale cask test. Because full-scale testing is expensive, the value of such testing on public perceptions and public acceptance is important. Consequently, the path forward starts with a public perception component followed by two additional components: accident simulation and first responder training. The proposed path forward presents a series of study options with several points where the package performance study could be redirected if warranted.« less

Robot-assisted three-dimensional registration for cochlear implant surgery using a common-path swept-source optical coherence tomography probe

NASA Astrophysics Data System (ADS)

Gurbani, Saumya S.; Wilkening, Paul; Zhao, Mingtao; Gonenc, Berk; Cheon, Gyeong Woo; Iordachita, Iulian I.; Chien, Wade; Taylor, Russell H.; Niparko, John K.; Kang, Jin U.

2014-05-01

Cochlear implantation offers the potential to restore sensitive hearing in patients with severe to profound deafness. However, surgical placement of the electrode array within the cochlea can produce trauma to sensorineural components, particularly if the initial turn of the cochlea is not successfully navigated as the array is advanced. In this work, we present a robot-mounted common-path swept-source optical coherence tomography endoscopic platform for three-dimensional (3-D) optical coherence tomography (OCT) registration and preoperative surgical planning for cochlear implant surgery. The platform is composed of a common-path 600-μm diameter fiber optic rotary probe attached to a five degrees of freedom robot capable of 1 μm precision movement. The system is tested on a dry fixed ex vivo human temporal bone, and we demonstrate the feasibility of a 3-D OCT registration of the cochlea to accurately describe the spatial and angular profiles of the canal formed by the scala tympani into the first cochlear turn.

'Fly Like This': Natural Language Interface for UAV Mission Planning

NASA Technical Reports Server (NTRS)

Chandarana, Meghan; Meszaros, Erica L.; Trujillo, Anna; Allen, B. Danette

2017-01-01

With the increasing presence of unmanned aerial vehicles (UAVs) in everyday environments, the user base of these powerful and potentially intelligent machines is expanding beyond exclusively highly trained vehicle operators to include non-expert system users. Scientists seeking to augment costly and often inflexible methods of data collection historically used are turning towards lower cost and reconfigurable UAVs. These new users require more intuitive and natural methods for UAV mission planning. This paper explores two natural language interfaces - gesture and speech - for UAV flight path generation through individual user studies. Subjects who participated in the user studies also used a mouse-based interface for a baseline comparison. Each interface allowed the user to build flight paths from a library of twelve individual trajectory segments. Individual user studies evaluated performance, efficacy, and ease-of-use of each interface using background surveys, subjective questionnaires, and observations on time and correctness. Analysis indicates that natural language interfaces are promising alternatives to traditional interfaces. The user study data collected on the efficacy and potential of each interface will be used to inform future intuitive UAV interface design for non-expert users.

The national ignition facility: path to ignition in the laboratory

NASA Astrophysics Data System (ADS)

Moses, E. I.; Bonanno, R. E.; Haynam, C. A.; Kauffman, R. L.; MacGowan, B. J.; Patterson, R. W., Jr.; Sawicki, R. H.; van Wonterghem, B. M.

2007-08-01

The National Ignition Facility (NIF) is a 192-beam laser facility presently under construction at LLNL. When completed, NIF will be a 1.8-MJ, 500-TW ultraviolet laser system. Its missions are to obtain fusion ignition and to perform high energy density experiments in support of the US nuclear weapons stockpile. Four of the NIF beams have been commissioned to demonstrate laser performance and to commission the target area including target and beam alignment and laser timing. During this time, NIF demonstrated on a single-beam basis that it will meet its performance goals and demonstrated its precision and flexibility for pulse shaping, pointing, timing and beam conditioning. It also performed four important experiments for Inertial Confinement Fusion and High Energy Density Science. Presently, the project is installing production hardware to complete the project in 2009 with the goal to begin ignition experiments in 2010. An integrated plan has been developed including the NIF operations, user equipment such as diagnostics and cryogenic target capability, and experiments and calculations to meet this goal. This talk will provide NIF status, the plan to complete NIF, and the path to ignition.

Optimized planning of in-service inspections of local flow-accelerated corrosion of pipeline elements used in the secondary coolant circuit of the VVER-440-based units at the Novovoronezh NPP

NASA Astrophysics Data System (ADS)

Tomarov, G. V.; Povarov, V. P.; Shipkov, A. A.; Gromov, A. F.; Budanov, V. A.; Golubeva, T. N.

2015-03-01

Matters concerned with making efficient use of the information-analytical system on the flow-accelerated corrosion problem in setting up in-service examination of the metal of pipeline elements operating in the secondary coolant circuit of the VVER-440-based power units at the Novovoronezh NPP are considered. The principles used to select samples of pipeline elements in planning ultrasonic thickness measurements for timely revealing metal thinning due to flow-accelerated corrosion along with reducing the total amount of measurements in the condensate-feedwater path are discussed.

The Path to Far-IR Interferometry in Space: Recent Developments, Plans, and Prospects

NASA Technical Reports Server (NTRS)

Leisawitz, David T.; Rinehart, Stephen A.

2012-01-01

The far-IR astrophysics community is eager to follow up Spitzer and Herschel observations with sensitive, highresolution imaging and spectroscopy, for such measurements are needed to understand merger-driven star formation and chemical enrichment in galaxies, star and planetary system formation, and the development and prevalence of waterbearing planets. The community is united in its support for a space-based interferometry mission. Through concerted efforts worldwide, the key enabling technologies are maturing. Two balloon-borne far-IR interferometers are presently under development. This paper reviews recent technological and programmatic developments, summarizes plans, and offers a vision for space-based far-IR interferometry involving international collaboration.

Modeling and optimization of a time-resolved proton radiographic imaging system for proton cancer treatment

NASA Astrophysics Data System (ADS)

Han, Bin

This dissertation describes a research project to test the clinical utility of a time-resolved proton radiographic (TRPR) imaging system by performing comprehensive Monte Carlo simulations of a physical device coupled with realistic lung cancer patient anatomy defined by 4DCT for proton therapy. A time-resolved proton radiographic imaging system was modeled through Monte Carlo simulations. A particle-tracking feature was employed to evaluate the performance of the proton imaging system, especially in its ability to visualize and quantify proton range variations during respiration. The Most Likely Path (MLP) algorithm was developed to approximate the multiple Coulomb scattering paths of protons for the purpose of image reconstruction. Spatial resolution of ˜ 1 mm and range resolution of 1.3% of the total range were achieved using the MLP algorithm. Time-resolved proton radiographs of five patient cases were reconstructed to track tumor motion and to calculate water equivalent length variations. By comparing with direct 4DCT measurement, the accuracy of tumor tracking was found to be better than 2 mm in five patient cases. Utilizing tumor tracking information to reduce margins to the planning target volume, a gated treatment plan was compared with un-gated treatment plan. The equivalent uniform dose (EUD) and the normal tissue complication probability (NTCP) were used to quantify the gain in the quality of treatments. The EUD of the OARs was found to be reduced up to 11% and the corresponding NTCP of organs at risk (OARs) was found to be reduced up to 16.5%. These results suggest that, with image guidance by proton radiography, dose to OARs can be reduced and the corresponding NTCPs can be significantly reduced. The study concludes that the proton imaging system can accurately track the motion of the tumor and detect the WEL variations, leading to potential gains in using image-guided proton radiography for lung cancer treatments.

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.

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…

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.

User's manual for a fuel-conservative descent planning algorithm implemented on a small programmable calculator

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

Vicroy, D.D.

A simplified flight management descent algorithm was developed and programmed on a small programmable calculator. It was designed to aid the pilot in planning and executing a fuel conservative descent to arrive at a metering fix at a time designated by the air traffic control system. The algorithm may also be used for planning fuel conservative descents when time is not a consideration. The descent path was calculated for a constant Mach/airspeed schedule from linear approximations of airplane performance with considerations given for gross weight, wind, and nonstandard temperature effects. An explanation and examples of how the algorithm is used,more » as well as a detailed flow chart and listing of the algorithm are contained.« less

Planning fuel-conservative descents with or without time constraints using a small programmable calculator: algorithm development and flight test results

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

Knox, C.E.

A simplified flight-management descent algorithm, programmed on a small programmable calculator, was developed and flight tested. It was designed to aid the pilot in planning and executing a fuel-conservative descent to arrive at a metering fix at a time designated by the air traffic control system. The algorithm may also be used for planning fuel-conservative descents when time is not a consideration. The descent path was calculated for a constant Mach/airspeed schedule from linear approximations of airplane performance with considerations given for gross weight, wind, and nonstandard temperature effects. The flight-management descent algorithm is described. The results of flight testsmore » flown with a T-39A (Sabreliner) airplane are presented.« less

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)

Planning fuel-conservative descents in an airline environmental using a small programmable calculator: Algorithm development and flight test results

NASA Technical Reports Server (NTRS)

Knox, C. E.; Vicroy, D. D.; Simmon, D. A.

1985-01-01

A simple, airborne, flight-management descent algorithm was developed and programmed into a small programmable calculator. The algorithm may be operated in either a time mode or speed mode. The time mode was designed to aid the pilot in planning and executing a fuel-conservative descent to arrive at a metering fix at a time designated by the air traffic control system. The speed model was designed for planning fuel-conservative descents when time is not a consideration. The descent path for both modes was calculated for a constant with considerations given for the descent Mach/airspeed schedule, gross weight, wind, wind gradient, and nonstandard temperature effects. Flight tests, using the algorithm on the programmable calculator, showed that the open-loop guidance could be useful to airline flight crews for planning and executing fuel-conservative descents.

Planning fuel-conservative descents in an airline environmental using a small programmable calculator: algorithm development and flight test results

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

Knox, C.E.; Vicroy, D.D.; Simmon, D.A.

A simple, airborne, flight-management descent algorithm was developed and programmed into a small programmable calculator. The algorithm may be operated in either a time mode or speed mode. The time mode was designed to aid the pilot in planning and executing a fuel-conservative descent to arrive at a metering fix at a time designated by the air traffic control system. The speed model was designed for planning fuel-conservative descents when time is not a consideration. The descent path for both modes was calculated for a constant with considerations given for the descent Mach/airspeed schedule, gross weight, wind, wind gradient, andmore » nonstandard temperature effects. Flight tests, using the algorithm on the programmable calculator, showed that the open-loop guidance could be useful to airline flight crews for planning and executing fuel-conservative descents.« less

Design concepts for the development of cooperative problem-solving systems

NASA Technical Reports Server (NTRS)

Smith, Philip J.; Mccoy, Elaine; Layton, Chuck; Bihari, Tom

1992-01-01

There are many problem-solving tasks that are too complex to fully automate given the current state of technology. Nevertheless, significant improvements in overall system performance could result from the introduction of well-designed computer aids. We have been studying the development of cognitive tools for one such problem-solving task, enroute flight path planning for commercial airlines. Our goal was two-fold. First, we were developing specific systems designs to help with this important practical problem. Second, we are using this context to explore general design concepts to guide in the development of cooperative problem-solving systems. These designs concepts are described.

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

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.

Speed and path control for conflict-free flight in high air traffic demand in terminal airspace

NASA Astrophysics Data System (ADS)

Rezaei, Ali

To accommodate the growing air traffic demand, flights will need to be planned and navigated with a much higher level of precision than today's aircraft flight path. The Next Generation Air Transportation System (NextGen) stands to benefit significantly in safety and efficiency from such movement of aircraft along precisely defined paths. Air Traffic Operations (ATO) relying on such precision--the Precision Air Traffic Operations or PATO--are the foundation of high throughput capacity envisioned for the future airports. In PATO, the preferred method is to manage the air traffic by assigning a speed profile to each aircraft in a given fleet in a given airspace (in practice known as (speed control). In this research, an algorithm has been developed, set in the context of a Hybrid Control System (HCS) model, that determines whether a speed control solution exists for a given fleet of aircraft in a given airspace and if so, computes this solution as a collective speed profile that assures separation if executed without deviation. Uncertainties such as weather are not considered but the algorithm can be modified to include uncertainties. The algorithm first computes all feasible sequences (i.e., all sequences that allow the given fleet of aircraft to reach destinations without violating the FAA's separation requirement) by looking at all pairs of aircraft. Then, the most likely sequence is determined and the speed control solution is constructed by a backward trajectory generation, starting with the aircraft last out and proceeds to the first out. This computation can be done for different sequences in parallel which helps to reduce the computation time. If such a solution does not exist, then the algorithm calculates a minimal path modification (known as path control) that will allow separation-compliance speed control. We will also prove that the algorithm will modify the path without creating a new separation violation. The new path will be generated by adding new waypoints in the airspace. As a byproduct, instead of minimal path modification, one can use the aircraft arrival time schedule to generate the sequence in which the aircraft reach their destinations.

Development of a low risk augmentation system for an energy efficient transport having relaxed static stability

NASA Technical Reports Server (NTRS)

Sizlo, T. R.; Berg, R. A.; Gilles, D. L.

1979-01-01

An augmentation system for a 230 passenger, twin engine aircraft designed with a relaxation of conventional longitudinal static stability was developed. The design criteria are established and candidate augmentation system control laws and hardware architectures are formulated and evaluated with respect to reliability, flying qualities, and flight path tracking performance. The selected systems are shown to satisfy the interpreted regulatory safety and reliability requirements while maintaining the present DC 10 (study baseline) level of maintainability and reliability for the total flight control system. The impact of certification of the relaxed static stability augmentation concept is also estimated with regard to affected federal regulations, system validation plan, and typical development/installation costs.

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

Electronic Neural Networks

NASA Technical Reports Server (NTRS)

Thakoor, Anil

1990-01-01

Viewgraphs on electronic neural networks for space station are presented. Topics covered include: electronic neural networks; electronic implementations; VLSI/thin film hybrid hardware for neurocomputing; computations with analog parallel processing; features of neuroprocessors; applications of neuroprocessors; neural network hardware for terrain trafficability determination; a dedicated processor for path planning; neural network system interface; neural network for robotic control; error backpropagation algorithm for learning; resource allocation matrix; global optimization neuroprocessor; and electrically programmable read only thin-film synaptic array.

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.

Situational analysis and future directions of AYUSH: An assessment through 5-year plans of India.

PubMed

Samal, Janmejaya

2015-01-01

AYUSH is an acronym for Ayurveda, Yoga and Naturopathy, Unani, Siddha, and Homeopathy. These are the six indigenous systems of medicine practiced in India. A department called Department of Indian System of medicine was created in March 1995 and renamed to AYUSH in November 2003 with a focus to provide increased attention for the development of these systems. Very recently, in 2014, a separate ministry was created under the union Government of India, which is headed by a minister of state. Planning regarding these systems of medicine was a part of 5-year planning process since 1951. Since then many developments have happened in this sector albeit the system was struggling with a great degree of uncertainty at the time of 1(st)5-year plan. A progressive path of development could be observed since the first to the 12(th)5-year plan. It was up to the 7(th)plan the growth was little sluggish and from 8(th)plan onward the growth took its pace and several innovative development processes could be observed thereafter. The system is gradually progressing ahead with a vision to be a globally accepted system, as envisaged in 11(th)5-year plan. Currently, AYUSH system is a part of mainstream health system implemented under National Rural Health Mission (NRHM). NRHM came into play in 2005 but implemented at ground level in 2006 and introduced the scheme of "Mainstreaming of AYUSH and revitalization of local health traditions" to strengthen public health services. This scheme is currently in operation in its second phase, since 1(st)April 2012, with the 12(th)5-year plan. The scheme was primarily brought in to operation with three important objectives; choice of treatment system to the patients, strengthen facility functionally and strengthen the implementation of national health programmes, however, in some places it seems to be a forced medical pluralism owing to a top-down approach by the union government without considerable involvement of the concerned community. In this study, the 5-year planning documents have been reviewed, from the 1(st)plan to 12(th)plan, to enable reflection and throw some light into the future directions of AYUSH system.

Space station automation: the role of robotics and artificial intelligence (Invited Paper)

NASA Astrophysics Data System (ADS)

Park, W. T.; Firschein, O.

1985-12-01

Automation of the space station is necessary to make more effective use of the crew, to carry out repairs that are impractical or dangerous, and to monitor and control the many space station subsystems. Intelligent robotics and expert systems play a strong role in automation, and both disciplines are highly dependent on a common artificial intelligence (Al) technology base. The AI technology base provides the reasoning and planning capabilities needed in robotic tasks, such as perception of the environment and planning a path to a goal, and in expert systems tasks, such as control of subsystems and maintenance of equipment. This paper describes automation concepts for the space station, the specific robotic and expert systems required to attain this automation, and the research and development required. It also presents an evolutionary development plan that leads to fully automatic mobile robots for servicing satellites. Finally, we indicate the sequence of demonstrations and the research and development needed to confirm the automation capabilities. We emphasize that advanced robotics requires AI, and that to advance, AI needs the "real-world" problems provided by robotics.

Aging and financial planning for retirement: interdisciplinary influences viewed through a cross-cultural lens.

PubMed

Hershey, Douglas A; Henkens, Kene; Van Dalen, Hendrik P

2010-01-01

Current theoretical models support the existence of interactions between the individual and socio-environmental forces when it comes to the formation and enactment of life plans (Friedman & Scholnick, 1997; Shanahan & Elder, 2002). In this investigation, we examine the social, economic, and psychological forces that impact financial planning for retirement. The collective force of these three broad sets of influences was examined from developmental and cross-cultural perspectives, among respondents from two countries with very different retirement financing systems. Participants were 419 American and 556 Dutch working adults, 25-64 years of age. Path analysis models were created to examine differences in planning associated with age and national origin. Compared to younger individuals, older respondents in both countries were more involved in nearly all aspects of the financial planning process. Differences across cultures were also observed in the social support mechanisms that underlie planning and the impact economic forces have on perceptions of saving adequacy. The discussion focuses on the value of developing interdisciplinary theoretical models of planning, and how such models can inform the development of savings-oriented intervention and public policy initiatives.

A Path to Planetary Protection Requirements for Human Exploration: A Literature Review and Systems Engineering Approach

NASA Technical Reports Server (NTRS)

Johnson, James E.; Conley, Cassie; Siegel, Bette

2015-01-01

As systems, technologies, and plans for the human exploration of Mars and other destinations beyond low Earth orbit begin to coalesce, it is imperative that frequent and early consideration is given to how planetary protection practices and policy will be upheld. While the development of formal planetary protection requirements for future human space systems and operations may still be a few years from fruition, guidance to appropriately influence mission and system design will be needed soon to avoid costly design and operational changes. The path to constructing such requirements is a journey that espouses key systems engineering practices of understanding shared goals, objectives and concerns, identifying key stakeholders, and iterating a draft requirement set to gain community consensus. This paper traces through each of these practices, beginning with a literature review of nearly three decades of publications addressing planetary protection concerns with respect to human exploration. Key goals, objectives and concerns, particularly with respect to notional requirements, required studies and research, and technology development needs have been compiled and categorized to provide a current 'state of knowledge'. This information, combined with the identification of key stakeholders in upholding planetary protection concerns for human missions, has yielded a draft requirement set that might feed future iteration among space system designers, exploration scientists, and the mission operations community. Combining the information collected with a proposed forward path will hopefully yield a mutually agreeable set of timely, verifiable, and practical requirements for human space exploration that will uphold international commitment to planetary protection.

Preoperative trajectory planning for closed reduction of long-bone diaphyseal fracture using a computer-assisted reduction system.

PubMed

Du, Hailong; Hu, Lei; Li, Changsheng; He, Chunqing; Zhang, Lihai; Tang, Peifu

2015-03-01

Balancing reduction accuracy with soft-tissue preservation is a challenge in orthopaedics. Computer-assisted orthopaedic surgery (CAOS) can improve accuracy and reduce radiation exposure. However, previous reports have not summarized the fracture patterns to which CAOS has been applied. We used a CAOS system and a stereolithography model to define a new fracture classification. Twenty reduction tests were performed to evaluate the effectiveness of preoperative trajectory planning. Twenty tests ran automatically and smoothly. Only three slight scratches occurred. Seventy-six path points represented displacement deviations of < 2 mm (average < 1 mm) and angulation deviation of < 1.5°. Because of the strength of muscles, mechanical sensors are used to prevent iatrogenic soft-tissue injury. Secondary fractures are prevented mainly through preoperative trajectory planning. Based on our data, a 1 mm gap between the edges of fractures spikes is sufficient to avoid emergency braking from spike interference. Copyright © 2014 John Wiley & Sons, Ltd.

Space station automation and robotics study. Operator-systems interface

NASA Technical Reports Server (NTRS)

1984-01-01

This is the final report of a Space Station Automation and Robotics Planning Study, which was a joint project of the Boeing Aerospace Company, Boeing Commercial Airplane Company, and Boeing Computer Services Company. The study is in support of the Advanced Technology Advisory Committee established by NASA in accordance with a mandate by the U.S. Congress. Boeing support complements that provided to the NASA Contractor study team by four aerospace contractors, the Stanford Research Institute (SRI), and the California Space Institute. This study identifies automation and robotics (A&R) technologies that can be advanced by requirements levied by the Space Station Program. The methodology used in the study is to establish functional requirements for the operator system interface (OSI), establish the technologies needed to meet these requirements, and to forecast the availability of these technologies. The OSI would perform path planning, tracking and control, object recognition, fault detection and correction, and plan modifications in connection with extravehicular (EV) robot operations.

Software for project-based learning of robot motion planning

NASA Astrophysics Data System (ADS)

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

2013-12-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 be explained in a simplified two-dimensional setting, but this masks many of the subtleties and complexities of the underlying problem. We have developed software for project-based learning of motion planning that enables deep learning. The projects that we have developed allow advanced undergraduate students and graduate students to reflect on the performance of existing textbook algorithms and their own variations on such algorithms. Formative assessment has been conducted at three institutions. The core of the software used for this teaching module is also used within the Robot Operating System, a widely adopted platform by the robotics research community. This allows for transfer of knowledge and skills to robotics research projects involving a large variety robot hardware platforms.

Conformal needle-based ultrasound ablation using EM-tracked conebeam CT image guidance

NASA Astrophysics Data System (ADS)

Burdette, E. Clif; Banovac, Filip; Diederich, Chris J.; Cheng, Patrick; Wilson, Emmanuel; Cleary, Kevin R.

2011-03-01

Numerous studies have demonstrated the efficacy of interstitial ablative approaches for the treatment of renal and hepatic tumors. Despite these promising results, current systems remain highly dependent on operator skill, and cannot treat many tumors because there is little control of the size and shape of the zone of necrosis, and no control over ablator trajectory within tissue once insertion has taken place. Additionally, tissue deformation and target motion make it extremely difficult to accurately place the ablator device into the target. Irregularly shaped target volumes typically require multiple insertions and several sequential thermal ablation procedures. This study demonstrated feasibility of spatially tracked image-guided conformal ultrasound (US) ablation for percutaneous directional ablation of diseased tissue. Tissue was prepared by suturing the liver within a pig belly and 1mm BBs placed to serve as needle targets. The image guided system used integrated electromagnetic tracking and cone-beam CT (CBCT) with conformable needlebased high-intensity US ablation in the interventional suite. Tomographic images from cone beam CT were transferred electronically to the image-guided tracking system (IGSTK). Paired-point registration was used to register the target specimen to CT images and enable navigation. Path planning is done by selecting the target BB on the GUI of the realtime tracking system and determining skin entry location until an optimal path is selected. Power was applied to create the desired ablation extent within 7-10 minutes at a thermal dose (>300eqm43). The system was successfully used to place the US ablator in planned target locations within ex-vivo kidney and liver through percutaneous access. Targeting accuracy was 3-4 mm. Sectioned specimens demonstrated uniform ablation within the planned target zone. Subsequent experiments were conducted for multiple ablator positions based upon treatment planning simulations. Ablation zones in liver were 73cc, 84cc, and 140cc for 3, 4, and 5 placements, respectively. These experiments demonstrate the feasibility of combining real-time spatially tracked image guidance with directional interstitial ultrasound ablation. Interstitial ultrasound ablation delivered on multiple needles permit the size and shape of the ablation zone to be "sculpted" by modifying the angle and intensity of the active US elements in the array. This paper summarizes the design and development of the first system incorporating thermal treatment planning and integration of a novel interstitial acoustic ablation device with integrated 3D electromagnetic tracking and guidance strategy.

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...

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.

Redundancy, Self-Motion, and Motor Control

PubMed Central

Martin, V.; Scholz, J. P.; Schöner, G.

2011-01-01

Outside the laboratory, human movement typically involves redundant effector systems. How the nervous system selects among the task-equivalent solutions may provide insights into how movement is controlled. We propose a process model of movement generation that accounts for the kinematics of goal-directed pointing movements performed with a redundant arm. The key element is a neuronal dynamics that generates a virtual joint trajectory. This dynamics receives input from a neuronal timer that paces end-effector motion along its path. Within this dynamics, virtual joint velocity vectors that move the end effector are dynamically decoupled from velocity vectors that do not. Moreover, the sensed real joint configuration is coupled back into this neuronal dynamics, updating the virtual trajectory so that it yields to task-equivalent deviations from the dynamic movement plan. Experimental data from participants who perform in the same task setting as the model are compared in detail to the model predictions. We discover that joint velocities contain a substantial amount of self-motion that does not move the end effector. This is caused by the low impedance of muscle joint systems and by coupling among muscle joint systems due to multiarticulatory muscles. Back-coupling amplifies the induced control errors. We establish a link between the amount of self-motion and how curved the end-effector path is. We show that models in which an inverse dynamics cancels interaction torques predict too little self-motion and too straight end-effector paths. PMID:19718817

A fuzzy logic controller for an autonomous mobile robot

NASA Technical Reports Server (NTRS)

Yen, John; Pfluger, Nathan

1993-01-01

The ability of a mobile robot system to plan and move intelligently in a dynamic system is needed if robots are to be useful in areas other than controlled environments. An example of a use for this system is to control an autonomous mobile robot in a space station, or other isolated area where it is hard or impossible for human life to exist for long periods of time (e.g., Mars). The system would allow the robot to be programmed to carry out the duties normally accomplished by a human being. Some of the duties that could be accomplished include operating instruments, transporting objects, and maintenance of the environment. The main focus of our early work has been on developing a fuzzy controller that takes a path and adapts it to a given environment. The robot only uses information gathered from the sensors, but retains the ability to avoid dynamically placed obstacles near and along the path. Our fuzzy logic controller is based on the following algorithm: (1) determine the desired direction of travel; (2) determine the allowed direction of travel; and (3) combine the desired and allowed directions in order to determine a direciton that is both desired and allowed. The desired direction of travel is determined by projecting ahead to a point along the path that is closer to the goal. This gives a local direction of travel for the robot and helps to avoid obstacles.

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.

Optimization of OSPF Routing in IP Networks

NASA Astrophysics Data System (ADS)

Bley, Andreas; Fortz, Bernard; Gourdin, Eric; Holmberg, Kaj; Klopfenstein, Olivier; Pióro, Michał; Tomaszewski, Artur; Ümit, Hakan

The Internet is a huge world-wide packet switching network comprised of more than 13,000 distinct subnetworks, referred to as Autonomous Systems (ASs) autonomous system AS . They all rely on the Internet Protocol (IP) internet protocol IP for transport of packets across the network. And most of them use shortest path routing protocols shortest path routing!protocols , such as OSPF or IS-IS, to control the routing of IP packets routing!of IP packets within an AS. The idea of the routing is extremely simple — every packet is forwarded on IP links along the shortest route between its source and destination nodes of the AS. The AS network administrator can manage the routing of packets in the AS by supplying the so-called administrative weights of IP links, which specify the link lengths that are used by the routing protocols for their shortest path computations. The main advantage of the shortest path routing policy is its simplicity, allowing for little administrative overhead. From the network engineering perspective, however, shortest path routing can pose problems in achieving satisfactory traffic handling efficiency. As all routing paths depend on the same routing metric routing!metric , it is not possible to configure the routing paths for the communication demands between different pairs of nodes explicitly or individually; the routing can be controlled only indirectly and only as a whole by modifying the routing metric. Thus, one of the main tasks when planning such networks is to find administrative link weights that induce a globally efficient traffic routing traffic!routing configuration of an AS. It turns out that this task leads to very difficult mathematical optimization problems. In this chapter, we discuss and describe exact integer programming models and solution approaches as well as practically efficient smart heuristics for such shortest path routing problems shortest path routing!problems .

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.

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.

A neuro-collision avoidance strategy for robot manipulators

NASA Technical Reports Server (NTRS)

Onema, Joel P.; Maclaunchlan, Robert A.

1992-01-01

The area of collision avoidance and path planning in robotics has received much attention in the research community. Our study centers on a combination of an artificial neural network paradigm with a motion planning strategy that insures safe motion of the Articulated Two-Link Arm with Scissor Hand System relative to an object. Whenever an obstacle is encountered, the arm attempts to slide along the obstacle surface, thereby avoiding collision by means of the local tangent strategy and its artificial neural network implementation. This combination compensates the inverse kinematics of a robot manipulator. Simulation results indicate that a neuro-collision avoidance strategy can be achieved by means of a learning local tangent method.

Very fast motion planning for highly dexterous-articulated robots

NASA Technical Reports Server (NTRS)

Challou, Daniel J.; Gini, Maria; Kumar, Vipin

1994-01-01

Due to the inherent danger of space exploration, the need for greater use of teleoperated and autonomous robotic systems in space-based applications has long been apparent. Autonomous and semi-autonomous robotic devices have been proposed for carrying out routine functions associated with scientific experiments aboard the shuttle and space station. Finally, research into the use of such devices for planetary exploration continues. To accomplish their assigned tasks, all such autonomous and semi-autonomous devices will require the ability to move themselves through space without hitting themselves or the objects which surround them. In space it is important to execute the necessary motions correctly when they are first attempted because repositioning is expensive in terms of both time and resources (e.g., fuel). Finally, such devices will have to function in a variety of different environments. Given these constraints, a means for fast motion planning to insure the correct movement of robotic devices would be ideal. Unfortunately, motion planning algorithms are rarely used in practice because of their computational complexity. Fast methods have been developed for detecting imminent collisions, but the more general problem of motion planning remains computationally intractable. However, in this paper we show how the use of multicomputers and appropriate parallel algorithms can substantially reduce the time required to synthesize paths for dexterous articulated robots with a large number of joints. We have developed a parallel formulation of the Randomized Path Planner proposed by Barraquand and Latombe. We have shown that our parallel formulation is capable of formulating plans in a few seconds or less on various parallel architectures including: the nCUBE2 multicomputer with up to 1024 processors (nCUBE2 is a registered trademark of the nCUBE corporation), and a network of workstations.

Hitchhiking Robots: A Collaborative Approach for Efficient Multi-Robot Navigation in Indoor Environments

PubMed Central

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

2017-01-01

Hitchhiking is a means of transportation gained by asking other people for a (free) ride. We developed a multi-robot system which is the first of its kind to incorporate hitchhiking in robotics, and discuss its advantages. Our method allows the hitchhiker robot to skip redundant computations in navigation like path planning, localization, obstacle avoidance, and map update by completely relying on the driver robot. This allows the hitchhiker robot, which performs only visual servoing, to save computation while navigating on the common path with the driver robot. The driver robot, in the proposed system performs all the heavy computations in navigation and updates the hitchhiker about the current localized positions and new obstacle positions in the map. The proposed system is robust to recover from ‘driver-lost’ scenario which occurs due to visual servoing failure. We demonstrate robot hitchhiking in real environments considering factors like service-time and task priority with different start and goal configurations of the driver and hitchhiker robots. We also discuss the admissible characteristics of the hitchhiker, when hitchhiking should be allowed and when not, through experimental results. PMID:28809803

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.

Hitchhiking Robots: A Collaborative Approach for Efficient Multi-Robot Navigation in Indoor Environments.

PubMed

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

2017-08-15

Hitchhiking is a means of transportation gained by asking other people for a (free) ride. We developed a multi-robot system which is the first of its kind to incorporate hitchhiking in robotics, and discuss its advantages. Our method allows the hitchhiker robot to skip redundant computations in navigation like path planning, localization, obstacle avoidance, and map update by completely relying on the driver robot. This allows the hitchhiker robot, which performs only visual servoing, to save computation while navigating on the common path with the driver robot. The driver robot, in the proposed system performs all the heavy computations in navigation and updates the hitchhiker about the current localized positions and new obstacle positions in the map. The proposed system is robust to recover from `driver-lost' scenario which occurs due to visual servoing failure. We demonstrate robot hitchhiking in real environments considering factors like service-time and task priority with different start and goal configurations of the driver and hitchhiker robots. We also discuss the admissible characteristics of the hitchhiker, when hitchhiking should be allowed and when not, through experimental results.

Design and implementation of a biomimetic turtle hydrofoil for an autonomous underwater vehicle.

PubMed

Font, Davinia; Tresanchez, Marcel; Siegentahler, Cedric; Pallejà, Tomàs; Teixidó, Mercè; Pradalier, Cedric; Palacin, Jordi

2011-01-01

This paper presents the design and implementation of a turtle hydrofoil for an Autonomous Underwater Vehicle (AUV). The final design of the AUV must have navigation performance like a turtle, which has also been the biomimetic inspiration for the design of the hydrofoil and propulsion system. The hydrofoil design is based on a National Advisory Committee for Aeronautics (NACA) 0014 hydrodynamic profile. During the design stage, four different propulsion systems were compared in terms of propulsion path, compactness, sealing and required power. The final implementation is based on a ball-and-socket mechanism because it is very compact and provides three degrees of freedom (DoF) to the hydrofoil with very few restrictions on the propulsion path. The propulsion obtained with the final implementation of the hydrofoil has been empirically evaluated in a water channel comparing different motion strategies. The results obtained have confirmed that the proposed turtle hydrofoil controlled with a mechanism with three DoF generates can be used in the future implementation of the planned AUV.

Numerical evaluation of mobile robot navigation in static indoor environment via EGAOR Iteration

NASA Astrophysics Data System (ADS)

Dahalan, A. A.; Saudi, A.; Sulaiman, J.; Din, W. R. W.

2017-09-01

One of the key issues in mobile robot navigation is the ability for the robot to move from an arbitrary start location to a specified goal location without colliding with any obstacles while traveling, also known as mobile robot path planning problem. In this paper, however, we examined the performance of a robust searching algorithm that relies on the use of harmonic potentials of the environment to generate smooth and safe path for mobile robot navigation in a static known indoor environment. The harmonic potentials will be discretized by using Laplacian’s operator to form a system of algebraic approximation equations. This algebraic linear system will be computed via 4-Point Explicit Group Accelerated Over-Relaxation (4-EGAOR) iterative method for rapid computation. The performance of the proposed algorithm will then be compared and analyzed against the existing algorithms in terms of number of iterations and execution time. The result shows that the proposed algorithm performed better than the existing methods.

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.

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.

New vision system and navigation algorithm for an autonomous ground vehicle

NASA Astrophysics Data System (ADS)

Tann, Hokchhay; Shakya, Bicky; Merchen, Alex C.; Williams, Benjamin C.; Khanal, Abhishek; Zhao, Jiajia; Ahlgren, David J.

2013-12-01

Improvements were made to the intelligence algorithms of an autonomously operating ground vehicle, Q, which competed in the 2013 Intelligent Ground Vehicle Competition (IGVC). The IGVC required the vehicle to first navigate between two white lines on a grassy obstacle course, then pass through eight GPS waypoints, and pass through a final obstacle field. Modifications to Q included a new vision system with a more effective image processing algorithm for white line extraction. The path-planning algorithm adopted the vision system, creating smoother, more reliable navigation. With these improvements, Q successfully completed the basic autonomous navigation challenge, finishing tenth out of over 50 teams.

High Temperature Materials Needs in NASA's Advanced Space Propulsion Programs

NASA Technical Reports Server (NTRS)

Eckel, Andrew J.; Glass, David E.

2005-01-01

In recent years, NASA has embarked on several new and exciting efforts in the exploration and use of space. The successful accomplishment of many planned missions and projects is dependent upon the development and deployment of previously unproven propulsion systems. Key to many of the propulsion systems is the use of emergent materials systems, particularly high temperature structural composites. A review of the general missions and benefits of utilizing high temperature materials will be presented. The design parameters and operating conditions will be presented for both specific missions/vehicles and classes of components. Key technical challenges and opportunities are identified along with suggested paths for addressing them.

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.

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.

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…

Development of a prototype multi-processing interactive software invocation system

NASA Technical Reports Server (NTRS)

Berman, W. J.

1983-01-01

The Interactive Software Invocation System (NASA-ISIS) was first transported to the M68000 microcomputer, and then rewritten in the programming language Path Pascal. Path Pascal is a significantly enhanced derivative of Pascal, allowing concurrent algorithms to be expressed using the simple and elegant concept of Path Expressions. The primary results of this contract was to verify the viability of Path Pascal as a system's development language. The NASA-ISIS implementation using Path Pascal is a prototype of a large, interactive system in Path Pascal. As such, it is an excellent demonstration of the feasibility of using Path Pascal to write even more extensive systems. It is hoped that future efforts will build upon this research and, ultimately, that a full Path Pascal/ISIS Operating System (PPIOS) might be developed.

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,…

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…

The Performance Analysis of AN Indoor Mobile Mapping System with Rgb-D Sensor

NASA Astrophysics Data System (ADS)

Tsai, G. J.; Chiang, K. W.; Chu, C. H.; Chen, Y. L.; El-Sheimy, N.; Habib, A.

2015-08-01

Over the years, Mobile Mapping Systems (MMSs) have been widely applied to urban mapping, path management and monitoring and cyber city, etc. The key concept of mobile mapping is based on positioning technology and photogrammetry. In order to achieve the integration, multi-sensor integrated mapping technology has clearly established. In recent years, the robotic technology has been rapidly developed. The other mapping technology that is on the basis of low-cost sensor has generally used in robotic system, it is known as the Simultaneous Localization and Mapping (SLAM). The objective of this study is developed a prototype of indoor MMS for mobile mapping applications, especially to reduce the costs and enhance the efficiency of data collection and validation of direct georeferenced (DG) performance. The proposed indoor MMS is composed of a tactical grade Inertial Measurement Unit (IMU), the Kinect RGB-D sensor and light detection, ranging (LIDAR) and robot. In summary, this paper designs the payload for indoor MMS to generate the floor plan. In first session, it concentrates on comparing the different positioning algorithms in the indoor environment. Next, the indoor plans are generated by two sensors, Kinect RGB-D sensor LIDAR on robot. Moreover, the generated floor plan will compare with the known plan for both validation and verification.

Achieving Maximum Integration Utilizing Requirements Flow Down

NASA Technical Reports Server (NTRS)

Archiable, Wes; Askins, Bruce

2011-01-01

A robust and experienced systems engineering team is essential for a successful program. It is often a challenge to build a core systems engineering team early enough in a program to maximize integration and assure a common path for all supporting teams in a project. Ares I was no exception. During the planning of IVGVT, the team had many challenges including lack of: early identification of stakeholders, team training in NASA s system engineering practices, solid requirements flow down and a top down documentation strategy. The IVGVT team started test planning early in the program before the systems engineering framework had been matured due to an aggressive schedule. Therefore the IVGVT team increased their involvement in the Constellation systems engineering effort. Program level requirements were established that flowed down to IVGVT aligning all stakeholders to a common set of goals. The IVGVT team utilized the APPEL REQ Development Management course providing the team a NASA focused model to follow. The IVGVT team engaged directly with the model verification and validation process to assure that a solid set of requirements drove the need for the test event. The IVGVT team looked at the initial planning state, analyzed the current state and then produced recommendations for the ideal future state of a wide range of systems engineering functions and processes. Based on this analysis, the IVGVT team was able to produce a set of lessons learned and to provide suggestions for future programs or tests to use in their initial planning phase.

The national ignition facility: Path to ignition in the laboratory

NASA Astrophysics Data System (ADS)

Moses, E. I.; Bonanno, R. E.; Haynam, C. A.; Kauffman, R. L.; MacGowan, B. J.; Patterson, R. W., Jr.; Sawicki, R. H.; van Wonterghem, B. M.

2006-06-01

The National Ignition Facility (NIF) is a 192-beam laser facility presently under construction at LLNL. When completed, NIF will be a 1.8-MJ, 500-TW ultraviolet laser system. Its missions are to obtain fusion ignition and to perform high energy density experiments in support of the U.S. nuclear weapons stockpile. Four of the NIF beams have been commissioned to demonstrate laser performance and to commission the target area including target and beam alignment and laser timing. During this time, NIF demonstrated on a single-beam basis that it will meet its performance goals and demonstrated its precision and flexibility for pulse shaping, pointing, timing and beam conditioning. It also performed four important experiments for Inertial Confinement Fusion and High Energy Density Science. Presently, the project is installing production hardware to complete the project in 2009 with the goal to begin ignition experiments in 2010. An integrated plan has been developed including the NIF operations, user equipment such as diagnostics and cryogenic target capability, and experiments and calculations to meet this goal. This talk will provide NIF status, the plan to complete NIF, and the path to ignition.

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.

Flight testing and simulation of an F-15 airplane using throttles for flight control

NASA Technical Reports Server (NTRS)

Burcham, Frank W., Jr.; Maine, Trindel; Wolf, Thomas

1992-01-01

Flight tests and simulation studies using the throttles of an F-15 airplane for emergency flight control have been conducted at the NASA Dryden Flight Research Facility. The airplane and the simulation are capable of extended up-and-away flight, using only throttles for flight path control. Initial simulation results showed that runway landings using manual throttles-only control were difficult, but possible with practice. Manual approaches flown in the airplane were much more difficult, indicating a significant discrepancy between flight and simulation. Analysis of flight data and development of improved simulation models that resolve the discrepancy are discussed. An augmented throttle-only control system that controls bank angle and flight path with appropriate feedback parameters has also been developed, evaluated in simulations, and is planned for flight in the F-15.

Classification and Prediction of RF Coupling inside A-320 and A-319 Airplanes using Feed Forward Neural Networks

NASA Technical Reports Server (NTRS)

Jafri, Madiha; Ely, Jay; Vahala, Linda

2006-01-01

Neural Network Modeling is introduced in this paper to classify and predict Interference Path Loss measurements on Airbus 319 and 320 airplanes. Interference patterns inside the aircraft are classified and predicted based on the locations of the doors, windows, aircraft structures and the communication/navigation system-of-concern. Modeled results are compared with measured data and a plan is proposed to enhance the modeling for better prediction of electromagnetic coupling problems inside aircraft.

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.

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.

Autonomous mobile platform with simultaneous localisation and mapping system for patrolling purposes

NASA Astrophysics Data System (ADS)

Mitka, Łukasz; Buratowski, Tomasz

2017-10-01

This work describes an autonomous mobile platform for supervision and surveillance purposes. The system can be adapted for mounting on different types of vehicles. The platform is based on a SLAM navigation system which performs a localization task. Sensor fusion including laser scanners, inertial measurement unit (IMU), odometry and GPS lets the system determine its position in a certain and precise way. The platform is able to create a 3D model of a supervised area and export it as a point cloud. The system can operate both inside and outside as the navigation algorithm is resistant to typical localization errors caused by wheel slippage or temporal GPS signal loss. The system is equipped with a path-planning module which allows operating in two modes. The first mode is for periodical observation of points in a selected area. The second mode is turned on in case of an alarm. When it is called, the platform moves with the fastest route to the place of the alert. The path planning is always performed online with use of the most current scans, therefore the platform is able to adjust its trajectory to the environment changes or obstacles that are in the motion. The control algorithms are developed under the Robot Operating System (ROS) since it comes with drivers for many devices used in robotics. Such a solution allows for extending the system with any type of sensor in order to incorporate its data into a created area model. Proposed appliance can be ported to other existing robotic platforms or used to develop a new platform dedicated to a specific kind of surveillance. The platform use cases are to patrol an area, such as airport or metro station, in search for dangerous substances or suspicious objects and in case of detection instantly inform security forces. Second use case is a tele-operation in hazardous area for an inspection purposes.

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...

The Evolution of the Medical School Deanship: From Patriarch to CEO to System Dean

PubMed Central

Schieffler, Danny A; Farrell, Philip M; Kahn, Marc J; Culbertson, Richard A

2017-01-01

Medical school deanship in the US has evolved during the past 200 years as the complexity of the US health care system has evolved. With the introduction of Medicare and Medicaid and the growth of the National Institutes of Health, the 19th-century and first half of the 20th-century role of the medical school dean as guild master transformed into that of resource allocator as faculty practice plans grew in scope and grew as an important source of medical school and university revenue. By 2000, the role of the medical school dean had transformed into that of CEO, with the dean having control over school mission and strategy, faculty practice plans, education, research dollars, and philanthropy. An alternative path to the Dean/CEO model has developed—the System Dean, who functions as a team player within a broader health system that determines the mission for the medical school and the related clinical enterprise. In this paper, the authors discuss the evolution of the medical school dean with respect to scope of authority and role within the health care system. PMID:28241915

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 querying system on mobile devices

NASA Astrophysics Data System (ADS)

Lin, Xing; Wang, Yifei; Tian, Yuan; Wu, Lun

2006-01-01

Traditional approaches to path querying problems are not efficient and convenient under most circumstances. A more convenient and reliable approach to this problem has to be found. This paper is devoted to a path querying solution on mobile devices. By using an improved Dijkstra's shortest path algorithm and a natural language translating module, this system can help people find the shortest path between two places through their cell phones or other mobile devices. The chosen path is prompted in text of natural language, as well as a map picture. This system would be useful in solving best path querying problems and have potential to be a profitable business system.

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.

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.

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 for assembly of strut-based structures. Thesis

NASA Technical Reports Server (NTRS)

Muenger, Rolf

1991-01-01

A path planning method with collision avoidance for a general single chain nonredundant or redundant robot is proposed. Joint range boundary overruns are also avoided. The result is a sequence of joint vectors which are passed to a trajectory planner. A potential field algorithm in joint space computes incremental joint vectors delta-q = delta-q(sub a) + delta-q(sub c) + delta-q(sub r). Adding delta-q to the robot's current joint vector leads to the next step in the path. Delta-q(sub a) is obtained by computing the minimum norm solution of the underdetermined linear system J delta-q(sub a) = x(sub a) where x(sub a) is a translational and rotational force vector that attracts the robot to its goal position and orientation. J is the manipulator Jacobian. Delta-q(sub c) is a collision avoidance term encompassing collisions between the robot (links and payload) and obstacles in the environment as well as collisions among links and payload of the robot themselves. It is obtained in joint space directly. Delta-q(sub r) is a function of the current joint vector and avoids joint range overruns. A higher level discrete search over candidate safe positions is used to provide alternatives in case the potential field algorithm encounters a local minimum and thus fails to reach the goal. The best first search algorithm A* is used for graph search. Symmetry properties of the payload and equivalent rotations are exploited to further enlarge the number of alternatives passed to the potential field algorithm.

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.

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.

Autonomous power management and distribution

NASA Technical Reports Server (NTRS)

Dolce, Jim; Kish, Jim

1990-01-01

The goal of the Autonomous Power System program is to develop and apply intelligent problem solving and control to the Space Station Freedom's electric power testbed being developed at NASA's Lewis Research Center. Objectives are to establish artificial intelligence technology paths, craft knowledge-based tools and products for power systems, and integrate knowledge-based and conventional controllers. This program represents a joint effort between the Space Station and Office of Aeronautics and Space Technology to develop and demonstrate space electric power automation technology capable of: (1) detection and classification of system operating status, (2) diagnosis of failure causes, and (3) cooperative problem solving for power scheduling and failure recovery. Program details, status, and plans will be presented.

Design of an intelligent information system for in-flight emergency assistance

NASA Technical Reports Server (NTRS)

Feyock, Stefan; Karamouzis, Stamos

1991-01-01

The present research has as its goal the development of AI tools to help flight crews cope with in-flight malfunctions. The relevant tasks in such situations include diagnosis, prognosis, and recovery plan generation. Investigation of the information requirements of these tasks has shown that the determination of paths figures largely: what components or systems are connected to what others, how are they connected, whether connections satisfying certain criteria exist, and a number of related queries. The formulation of such queries frequently requires capabilities of the second-order predicate calculus. An information system is described that features second-order logic capabilities, and is oriented toward efficient formulation and execution of such queries.

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.

Method and system for modulation of gain suppression in high average power laser systems

DOEpatents

Bayramian, Andrew James [Manteca, CA

2012-07-31

A high average power laser system with modulated gain suppression includes an input aperture associated with a first laser beam extraction path and an output aperture associated with the first laser beam extraction path. The system also includes a pinhole creation laser having an optical output directed along a pinhole creation path and an absorbing material positioned along both the first laser beam extraction path and the pinhole creation path. The system further includes a mechanism operable to translate the absorbing material in a direction crossing the first laser beam extraction laser path and a controller operable to modulate the second laser beam.

Optical Amplifier Based Space Solar Power

NASA Technical Reports Server (NTRS)

Fork, Richard L.

2001-01-01

The objective was to design a safe optical power beaming system for use in space. Research was focused on identification of strategies and structures that would enable achievement near diffraction limited optical beam quality, highly efficient electrical to optical conversion, and high average power in combination in a single system. Efforts centered on producing high efficiency, low mass of the overall system, low operating temperature, precision pointing and tracking capability, compatibility with useful satellite orbits, component and system reliability, and long component and system life in space. A system based on increasing the power handled by each individual module to an optimum and the number of modules in the complete structure was planned. We were concerned with identifying the most economical and rapid path to commercially viable safe space solar power.

CT-Guided Interventions Using a Free-Hand, Optical Tracking System: Initial Clinical Experience

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

Schubert, Tilman, E-mail: TSchubert@uhbs.ch; Jacob, Augustinus L.; Pansini, Michele

2013-08-01

PurposeThe present study was designed to evaluate the geometrical accuracy and clinical applicability of a new, free-hand, CT-guided, optical navigation system.MethodsFifteen procedures in 14 consecutive patients were retrospectively analyzed. The navigation system was applied for interventional procedures on small target lesions, in cases with long needle paths, narrow access windows, or when an out-of-plane access was expected. Mean lesion volume was 27.9 ml, and mean distance to target measured was 107.5 mm. Eleven of 15 needle trajectories were planned as out-of-plane approaches regarding the axial CT plane.ResultsNinety-one percent of the biopsies were diagnostic. All therapeutic interventions were technically successful. Targetingmore » precision was high with a mean distance of the needle tip from planned target of 1.98 mm. Mean intervention time was 1:12 h. A statistically significant correlation between angular needle deviation and intervention time (p = 0.007), respiratory movement of the target (p = 0.008), and body mass index (p = 0.02) was detected. None of the evaluated parameters correlated significantly with the distance from the needle tip to the planned target.ConclusionsThe application of a navigation system for complex CT-guided procedures provided safe and effective targeting within a reasonable intervention time in our series.« less

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…

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.

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.

Real-time fuzzy inference based robot path planning

NASA Technical Reports Server (NTRS)

Pacini, Peter J.; Teichrow, Jon S.

1990-01-01

This project addresses the problem of adaptive trajectory generation for a robot arm. Conventional trajectory generation involves computing a path in real time to minimize a performance measure such as expended energy. This method can be computationally intensive, and it may yield poor results if the trajectory is weakly constrained. Typically some implicit constraints are known, but cannot be encoded analytically. The alternative approach used here is to formulate domain-specific knowledge, including implicit and ill-defined constraints, in terms of fuzzy rules. These rules utilize linguistic terms to relate input variables to output variables. Since the fuzzy rulebase is determined off-line, only high-level, computationally light processing is required in real time. Potential applications for adaptive trajectory generation include missile guidance and various sophisticated robot control tasks, such as automotive assembly, high speed electrical parts insertion, stepper alignment, and motion control for high speed parcel transfer systems.

NASA Glenn Research Center, Propulsion Systems Laboratory: Plan to Measure Engine Core Flow Water Vapor Content

NASA Technical Reports Server (NTRS)

Oliver, Michael

2014-01-01

This presentation will be made at the 92nd AIAA Turbine Engine Testing Working Group (TETWoG), a semi-annual technical meeting of turbine engine testing professionals. The objective is to describe an effort by NASA to measure the water vapor content on the core airflow in a full scale turbine engine ice crystal icing test and to open a discussion with colleagues how to accurately conduct the measurement based on any previous collective experience with the procedure, instruments and nature of engine icing testing within the group. The presentation lays out the schematics of the location in the flow path from which the sample will be drawn, the plumbing to get it from the engine flow path to the sensor and several different water vapor measurement technologies that will be used: Tunable diode laser and infrared spectroscopy.

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

Development of an Airborne Triple-Pulse 2-Micron Integrated Path Differential Absorption Lidar (IPDA) 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; Antill, Charles W.; Remus, Ruben

2016-01-01

This presentation will provide status and details of an airborne 2-micron triple-pulse integrated path differential absorption (IPDA) lidar being developed at NASA Langley Research Center with support from NASA ESTO Instrument Incubator Program. The development of this active optical remote sensing IPDA instrument is targeted for measuring both atmospheric carbon dioxide and water vapor in the atmosphere from an airborne platform. This presentation will focus 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 seed laser locking, wavelength control, receiver and detector upgrades, laser packaging and lidar integration. Future plan for IPDA lidar system for ground integration, testing and flight validation will also be presented.

Situational analysis and future directions of AYUSH: An assessment through 5-year plans of India

PubMed Central

Samal, Janmejaya

2015-01-01

AYUSH is an acronym for Ayurveda, Yoga and Naturopathy, Unani, Siddha, and Homeopathy. These are the six indigenous systems of medicine practiced in India. A department called Department of Indian System of medicine was created in March 1995 and renamed to AYUSH in November 2003 with a focus to provide increased attention for the development of these systems. Very recently, in 2014, a separate ministry was created under the union Government of India, which is headed by a minister of state. Planning regarding these systems of medicine was a part of 5-year planning process since 1951. Since then many developments have happened in this sector albeit the system was struggling with a great degree of uncertainty at the time of 1st5-year plan. A progressive path of development could be observed since the first to the 12th5-year plan. It was up to the 7thplan the growth was little sluggish and from 8thplan onward the growth took its pace and several innovative development processes could be observed thereafter. The system is gradually progressing ahead with a vision to be a globally accepted system, as envisaged in 11th5-year plan. Currently, AYUSH system is a part of mainstream health system implemented under National Rural Health Mission (NRHM). NRHM came into play in 2005 but implemented at ground level in 2006 and introduced the scheme of “Mainstreaming of AYUSH and revitalization of local health traditions” to strengthen public health services. This scheme is currently in operation in its second phase, since 1stApril 2012, with the 12th5-year plan. The scheme was primarily brought in to operation with three important objectives; choice of treatment system to the patients, strengthen facility functionally and strengthen the implementation of national health programmes, however, in some places it seems to be a forced medical pluralism owing to a top-down approach by the union government without considerable involvement of the concerned community. In this study, the 5-year planning documents have been reviewed, from the 1stplan to 12thplan, to enable reflection and throw some light into the future directions of AYUSH system. PMID:26649240

Steering of an automated vehicle in an unstructured environment

NASA Astrophysics Data System (ADS)

Kanakaraju, Sampath; Shanmugasundaram, Sathish K.; Thyagarajan, Ramesh; Hall, Ernest L.

1999-08-01

The purpose of this paper is to describe a high-level path planning logic, which processes the data from a vision system and an ultrasonic obstacle avoidance system and steers an autonomous mobile robot between obstacles. The test bed was an autonomous root built at University of Cincinnati, and this logic was tested and debugged on this machine. Attempts have already been made to incorporate fuzzy system on a similar robot, and this paper extends them to take advantage of the robot's ZTR capability. Using the integrated vision syste, the vehicle senses its location and orientation. A rotating ultrasonic sensor is used to map the location and size of possible obstacles. With these inputs the fuzzy logic controls the speed and the steering decisions of the robot. With the incorporation of this logic, it has been observed that Bearcat II has been very successful in avoiding obstacles very well. This was achieved in the Ground Robotics Competition conducted by the AUVS in June 1999, where it travelled a distance of 154 feet in a 10ft. wide path ridden with obstacles. This logic proved to be a significant contributing factor in this feat of Bearcat II.

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.

Design and Implementation of a Biomimetic Turtle Hydrofoil for an Autonomous Underwater Vehicle

PubMed Central

Font, Davinia; Tresanchez, Marcel; Siegentahler, Cedric; Pallejà, Tomàs; Teixidó, Mercè; Pradalier, Cedric; Palacin, Jordi

2011-01-01

This paper presents the design and implementation of a turtle hydrofoil for an Autonomous Underwater Vehicle (AUV). The final design of the AUV must have navigation performance like a turtle, which has also been the biomimetic inspiration for the design of the hydrofoil and propulsion system. The hydrofoil design is based on a National Advisory Committee for Aeronautics (NACA) 0014 hydrodynamic profile. During the design stage, four different propulsion systems were compared in terms of propulsion path, compactness, sealing and required power. The final implementation is based on a ball-and-socket mechanism because it is very compact and provides three degrees of freedom (DoF) to the hydrofoil with very few restrictions on the propulsion path. The propulsion obtained with the final implementation of the hydrofoil has been empirically evaluated in a water channel comparing different motion strategies. The results obtained have confirmed that the proposed turtle hydrofoil controlled with a mechanism with three DoF generates can be used in the future implementation of the planned AUV. PMID:22247660

Glacial Lake Outburst Flood Risk in Himachal Pradesh, India: An Integrative and Anticipatory Approach to Inform Adaptation Planning

NASA Astrophysics Data System (ADS)

Allen, Simon; Linsbauer, Andreas; Huggel, Christian; Singh Randhawa, Surjeet

2016-04-01

Most research concerning the hazard from glacial lake outburst floods (GLOFs) has focused on the threat from lakes that have formed over the past century, and which continue to expand rapidly in response to recent warming of the climate system. However, attention is shifting towards the anticipation of future hazard and risk associated with new lakes that will develop as glaciers continue to retreat and dramatically different landscapes are uncovered. Nowhere will this threat be more pronounced than in the Himalaya, where the majority of the world's glaciers are found, and where the dynamics of nature interact closely with livelihoods and anthropogenic resources. Using the Indian Himalayan state of Himachal Pradesh (HP) as a case study, we combine a suite of GIS-based approaches to: 1)Implement a large-scale automated GLOF risk assessment within an integrative climate risk framework that recognizes both physical and socio-economic determining factors. 2)Expand the assessment beyond the current situation, to provide early anticipation of emerging GLOF hazard as new lakes form in response to further retreat of the Himalayan glaciers. Results clearly demonstrate a significant future increase in relative GLOF hazard levels across most Thesils of HP (administrative units), as the overall potential for GLOFs being triggered from mass movement of ice and rock avalanches increases, and as new GLOF paths affect additional land areas. Across most Thesils, the simulated increase in GLOF frequency is an order of magnitude larger than the simulated increase in GLOF affected area, as paths from newly formed glacial lakes generally tend to converge downstream within existing flood channels. In the Thesil of Kullu for example, we demonstrate a 7-fold increase in the probability of GLOF occurrence, and a 3-fold increase in the area affected by potential GLOF paths. In those situations where potential GLOFs from new lakes will flow primarily along existing flood paths, any adaptation measures implemented now will offer dual benefits - reducing not only the current GLOF risk, but also responding to the emerging risk anticipated for the coming decades. Such adaptation strategies (e.g. early warning systems, community preparedness, disaster response planning and land zoning) can be considered "low-regret" measures, i.e, responses that offer immediate benefits to the communities now while also offering benefits over a range of possible future scenarios. Conversely in locations where the formation of new lakes over the coming decades will create an entirely new threat, local authorities would be encouraged to consider long time scales in their climate adaptation planning. This is particularly relevant for new infrastructural developments (residential property, road, hydropower dams etc) where new threats could clearly emerge during the intended lifetime of any constructions.

Electricity system expansion studies to consider uncertainties and interactions in restructured markets

NASA Astrophysics Data System (ADS)

Jin, Shan

This dissertation concerns power system expansion planning under different market mechanisms. The thesis follows a three paper format, in which each paper emphasizes a different perspective. The first paper investigates the impact of market uncertainties on a long term centralized generation expansion planning problem. The problem is modeled as a two-stage stochastic program with uncertain fuel prices and demands, which are represented as probabilistic scenario paths in a multi-period tree. Two measurements, expected cost (EC) and Conditional Value-at-Risk (CVaR), are used to minimize, respectively, the total expected cost among scenarios and the risk of incurring high costs in unfavorable scenarios. We sample paths from the scenario tree to reduce the problem scale and determine the sufficient number of scenarios by computing confidence intervals on the objective values. The second paper studies an integrated electricity supply system including generation, transmission and fuel transportation with a restructured wholesale electricity market. This integrated system expansion problem is modeled as a bi-level program in which a centralized system expansion decision is made in the upper level and the operational decisions of multiple market participants are made in the lower level. The difficulty of solving a bi-level programming problem to global optimality is discussed and three problem relaxations obtained by reformulation are explored. The third paper solves a more realistic market-based generation and transmission expansion problem. It focuses on interactions among a centralized transmission expansion decision and decentralized generation expansion decisions. It allows each generator to make its own strategic investment and operational decisions both in response to a transmission expansion decision and in anticipation of a market price settled by an Independent System Operator (ISO) market clearing problem. The model poses a complicated tri-level structure including an equilibrium problem with equilibrium constraints (EPEC) sub-problem. A hybrid iterative algorithm is proposed to solve the problem efficiently and reliably.

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.

Person-like intelligent systems architectures for robotic shared control and automated operations

NASA Technical Reports Server (NTRS)

Erickson, Jon D.; Aucoin, Paschal J., Jr.; Ossorio, Peter G.

1992-01-01

An approach to rendering robotic systems as 'personlike' as possible to achieve needed capabilities is outlined. Human characteristics such as knowledge, motivation, know-how, performance, achievement and individual differences corresponding to propensities and abilities can be supplied, within limits, with computing software and hardware to robotic systems provided with sufficiently rich sensory configurations. Pushing these limits is the developmental path for more and more personlike robotic systems. The portions of the Person Concept that appear to be most directly relevant to this effort are described in the following topics: reality concepts (the state-of-affairs system and descriptive formats, behavior as intentional action, individual persons (person characteristics), social patterns of behavior (social practices), and boundary conditions (status maxims). Personlike robotic themes and considerations for a technical development plan are also discussed.

Conception et analyse d'un systeme d'optimisation de plans de vol pour les avions

NASA Astrophysics Data System (ADS)

Maazoun, Wissem

The main objective of this thesis is to develop an optimization method for the preparation of flight plans for aircrafts. The flight plan minimizes all costs associated with the flight. We determine an optimal path for an airplane from a departure airport to a destination airport. The optimal path minimizes the sum of all costs, i.e. the cost of fuel added to the cost of time (wages, rental of the aircraft, arrival delays, etc.). The optimal trajectory is obtained by considering all possible trajectories on a 3D graph (longitude, latitude and altitude) where the altitude levels are separated by 2,000 feet, and by applying a shortest path algorithm. The main task was to accurately compute fuel consumption on each edge of the graph, making sure that each arc has a minimal cost and is covered in a realistic way from the point of view of control, i.e. in accordance with the rules of navigation. To compute the cost of an arc, we take into account weather conditions (temperature, pressure, wind components, etc.). The optimization of each arc is done via the evaluation of an optimum speed that takes all costs into account. Each arc of the graph typically includes several sub-phases of the flight, e.g. altitude change, speed change, and constant speed and altitude. In the initial climb and the final descent phases, the costs are determined by considering altitude changes at constant CAS (Calibrated Air Speed) or constant Mach number. CAS and Mach number are adjusted to minimize cost. The aerodynamic model used is the one proposed by Eurocontrol, which uses the BADA (Base of Aircraft Data) tables. This model is based on the total energy equation that determines the instantaneous fuel consumption. Calculations on each arc are done by solving a system of differential equations that systematically takes all costs into account. To compute the cost of an arc, we must know the time to go through it, which is generally unknown. To have well-posed boundary conditions, we use the horizontal displacement as the independent variable of the system of differential equations. We consider the velocity components of the wind in a 3D system of coordinates to compute the instantaneous ground speed of the aircraft. To consider the cost of time, we use the cost index. The cost of an arc depends on the aircraft mass at the beginning of this arc, and this mass depends on the path. As we consider all possible paths, the cost of an arc must be computed for each trajectory to which it belongs. For a long-distance flight, the number of arcs to be considered in the graph is large and therefore the cost of an arc is typically computed many times. Our algorithm computes the costs of one million arcs in seconds while having a high accuracy. The determination of the optimal trajectory can therefore be done in a short time. To get the optimal path, the mass of the aircraft at the departure point must also be optimal. It is therefore necessary to know the optimal amount of fuel for the journey. The aircraft mass is known only at the arrival point. This mass is the mass of the aircraft including passengers, cargo and reserve fuel mass. The optimal path is determined by calculating backwards, i.e. from the arrival point to the departure point. For the determination of the optimal trajectory, we use an elliptical grid that has focal points at the departure and arrival points. The use of this grid is essential for the construction of a direct and acyclic graph. We use the Bellman-Ford algorithm on a DAG to determine the shortest path. This algorithm is easy to implement and results in short computation times. Our algorithm computes an optimal trajectory with an optimal cost for each arc. Altitude changes are done optimally with respect to the mass of the aircraft and the cost of time. Our algorithm gives the mass, speed, altitude and total cost at any point of the trajectory as well as the optimal profiles of climb and descent. A prototype has been implemented in C. We made simulations of all types of possible arcs and of several complete trajectories to illustrate the behaviour of the algorithm.

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.

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.

Routeing of power lines through least-cost path analysis and multicriteria evaluation to minimise environmental impacts

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

Bagli, Stefano, E-mail: stefano.bagli@gecosistema.i; Geneletti, Davide, E-mail: davide.geneletti@ing.unitn.i; Center for International Development, Harvard University, 79 JFK Street, Cambridge, MA 02138

2011-04-15

Least-cost path analysis (LCPA) allows designers to find the 'cheapest' way to connect two locations within a cost surface, which can be computed by combining multiple criteria, and therefore by accounting for different issues (environmental impact, economic investment, etc.). This procedure can be easily implemented with modern Geographic Information System (GIS) technologies, and consequently it has been widely employed to support planning and design of different types of linear infrastructures, ranging from roads to pipelines. This paper presents an approach based on the integration of multicriteria evaluation (MCE) and LCPA to identify the most suitable route for a 132 kVmore » power line. Criteria such as cost, visibility, population density, and ecosystem naturalness were used for the analysis. Firstly, spatial MCE and LCPA were combined to generate cost surfaces, and to identify alternative paths. Subsequently, MCE was used to compare the alternatives, and rank them according to their overall suitability. Finally, a sensitivity analysis allowed the stability of the results to be tested and the most critical factors of the evaluation to be detected. The study found that small changes in the location of the power line start and end points can result in significantly different paths, and consequently impact levels. This suggested that planners should always consider alternative potential locations of terminals in order to identify the best path. Furthermore, it was shown that the use of different weight scenarios may help making the model adaptable to varying environmental and social contexts. The approach was tested on a real-world case study in north-eastern Italy.« less

Computing the optimal path in stochastic dynamical systems

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

Bauver, Martha; Forgoston, Eric, E-mail: eric.forgoston@montclair.edu; Billings, Lora

2016-08-15

In stochastic systems, one is often interested in finding the optimal path that maximizes the probability of escape from a metastable state or of switching between metastable states. Even for simple systems, it may be impossible to find an analytic form of the optimal path, and in high-dimensional systems, this is almost always the case. In this article, we formulate a constructive methodology that is used to compute the optimal path numerically. The method utilizes finite-time Lyapunov exponents, statistical selection criteria, and a Newton-based iterative minimizing scheme. The method is applied to four examples. The first example is a two-dimensionalmore » system that describes a single population with internal noise. This model has an analytical solution for the optimal path. The numerical solution found using our computational method agrees well with the analytical result. The second example is a more complicated four-dimensional system where our numerical method must be used to find the optimal path. The third example, although a seemingly simple two-dimensional system, demonstrates the success of our method in finding the optimal path where other numerical methods are known to fail. In the fourth example, the optimal path lies in six-dimensional space and demonstrates the power of our method in computing paths in higher-dimensional spaces.« less

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

String tightening as a self-organizing phenomenon.

PubMed

Banerjee, Bonny

2007-09-01

The phenomenon of self-organization has been of special interest to the neural network community throughout the last couple of decades. In this paper, we study a variant of the self-organizing map (SOM) that models the phenomenon of self-organization of the particles forming a string when the string is tightened from one or both of its ends. The proposed variant, called the string tightening self-organizing neural network (STON), can be used to solve certain practical problems, such as computation of shortest homotopic paths, smoothing paths to avoid sharp turns, computation of convex hull, etc. These problems are of considerable interest in computational geometry, robotics path-planning, artificial intelligence (AI) (diagrammatic reasoning), very large scale integration (VLSI) routing, and geographical information systems. Given a set of obstacles and a string with two fixed terminal points in a 2-D space, the STON model continuously tightens the given string until the unique shortest configuration in terms of the Euclidean metric is reached. The STON minimizes the total length of a string on convergence by dynamically creating and selecting feature vectors in a competitive manner. Proof of correctness of this anytime algorithm and experimental results obtained by its deployment have been presented in the paper.

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.

A Flexible Path for Human and Robotic Space Exploration

NASA Technical Reports Server (NTRS)

Korsmeyer, David J.; Landis, Robert; Merrill, Raymond Gabriel; Mazanek, Daniel D.; Falck, Robert D.; Adams, Robert B.

2010-01-01

During the summer of 2009, a flexible path scenario for human and robotic space exploration was developed that enables frequent, measured, and publicly notable human exploration of space beyond low-Earth orbit (LEO). The formulation of this scenario was in support of the Exploration Beyond LEO subcommittee of the Review of U.S. Human Space Flight Plans Committee that was commissioned by President Obama. Exploration mission sequences that allow humans to visit a wide number of inner solar system destinations were investigated. The scope of destinations included the Earth-Moon and Earth-Sun Lagrange points, near-Earth objects (NEOs), the Moon, and Mars and its moons. The missions examined assumed the use of Constellation Program elements along with existing launch vehicles and proposed augmentations. Additionally, robotic missions were envisioned as complements to human exploration through precursor missions, as crew emplaced scientific investigations, and as sample gathering assistants to the human crews. The focus of the flexible path approach was to gain ever-increasing operational experience through human exploration missions ranging from a few weeks to several years in duration, beginning in deep space beyond LEO and evolving to landings on the Moon and eventually Mars.

Research on optimal path planning algorithm of task-oriented optical remote sensing satellites

NASA Astrophysics Data System (ADS)

Liu, Yunhe; Xu, Shengli; Liu, Fengjing; Yuan, Jingpeng

2015-08-01

GEO task-oriented optical remote sensing satellite, is very suitable for long-term continuous monitoring and quick access to imaging. With the development of high resolution optical payload technology and satellite attitude control technology, GEO optical remote sensing satellites will become an important developing trend for aerospace remote sensing satellite in the near future. In the paper, we focused on GEO optical remote sensing satellite plane array stare imaging characteristics and real-time leading mission of earth observation mode, targeted on satisfying needs of the user with the minimum cost of maneuver, and put forward the optimal path planning algorithm centered on transformation from geographic coordinate space to Field of plane, and finally reduced the burden of the control system. In this algorithm, bounded irregular closed area on the ground would be transformed based on coordinate transformation relations in to the reference plane for field of the satellite payload, and then using the branch and bound method to search for feasible solutions, cutting off the non-feasible solution in the solution space based on pruning strategy; and finally trimming some suboptimal feasible solutions based on the optimization index until a feasible solution for the global optimum. Simulation and visualization presentation software testing results verified the feasibility and effectiveness of the strategy.

Dynamical mechanism in aero-engine gas path system using minimum spanning tree and detrended cross-correlation analysis

NASA Astrophysics Data System (ADS)

Dong, Keqiang; Zhang, Hong; Gao, You

2017-01-01

Identifying the mutual interaction in aero-engine gas path system is a crucial problem that facilitates the understanding of emerging structures in complex system. By employing the multiscale multifractal detrended cross-correlation analysis method to aero-engine gas path system, the cross-correlation characteristics between gas path system parameters are established. Further, we apply multiscale multifractal detrended cross-correlation distance matrix and minimum spanning tree to investigate the mutual interactions of gas path variables. The results can infer that the low-spool rotor speed (N1) and engine pressure ratio (EPR) are main gas path parameters. The application of proposed method contributes to promote our understanding of the internal mechanisms and structures of aero-engine dynamics.

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.

An integrative model of evolutionary covariance: a symposium on body shape in fishes.

PubMed

Walker, Jeffrey A

2010-12-01

A major direction of current and future biological research is to understand how multiple, interacting functional systems coordinate in producing a body that works. This understanding is complicated by the fact that organisms need to work well in multiple environments, with both predictable and unpredictable environmental perturbations. Furthermore, organismal design reflects a history of past environments and not a plan for future environments. How complex, interacting functional systems evolve, then, is a truly grand challenge. In accepting the challenge, an integrative model of evolutionary covariance is developed. The model combines quantitative genetics, functional morphology/physiology, and functional ecology. The model is used to convene scientists ranging from geneticists, to physiologists, to ecologists, to engineers to facilitate the emergence of body shape in fishes as a model system for understanding how complex, interacting functional systems develop and evolve. Body shape of fish is a complex morphology that (1) results from many developmental paths and (2) functions in many different behaviors. Understanding the coordination and evolution of the many paths from genes to body shape, body shape to function, and function to a working fish body in a dynamic environment is now possible given new technologies from genetics to engineering and new theoretical models that integrate the different levels of biological organization (from genes to ecology).

Indoor radio channel modeling and mitigation of fading effects using linear and circular polarized antennas in combination for smart home system at 868 MHz

NASA Astrophysics Data System (ADS)

Wunderlich, S.; Welpot, M.; Gaspard, I.

2014-11-01

The markets for smart home products and services are expected to grow over the next years, driven by the increasing demands of homeowners considering energy monitoring, management, environmental controls and security. Many of these new systems will be installed in existing homes and offices and therefore using radio based systems for cost reduction. A drawback of radio based systems in indoor environments are fading effects which lead to a high variance of the received signal strength and thereby to a difficult predictability of the encountered path loss of the various communication links. For that reason it is necessary to derive a statistical path loss model which can be used to plan a reliable and cost effective radio network. This paper presents the results of a measurement campaign, which was performed in six buildings to deduce realistic radio channel models for a high variety of indoor radio propagation scenarios in the short range devices (SRD) band at 868 MHz. Furthermore, a potential concept to reduce the variance of the received signal strength using a circular polarized (CP) patch antenna in combination with a linear polarized antenna in an one-to-one communication link is presented.

Automatic programming of arc welding robots

NASA Astrophysics Data System (ADS)

Padmanabhan, Srikanth

Automatic programming of arc welding robots requires the geometric description of a part from a solid modeling system, expert weld process knowledge and the kinematic arrangement of the robot and positioner automatically. Current commercial solid models are incapable of storing explicitly product and process definitions of weld features. This work presents a paradigm to develop a computer-aided engineering environment that supports complete weld feature information in a solid model and to create an automatic programming system for robotic arc welding. In the first part, welding features are treated as properties or attributes of an object, features which are portions of the object surface--the topological boundary. The structure for representing the features and attributes is a graph called the Welding Attribute Graph (WAGRAPH). The method associates appropriate weld features to geometric primitives, adds welding attributes, and checks the validity of welding specifications. A systematic structure is provided to incorporate welding attributes and coordinate system information in a CSG tree. The specific implementation of this structure using a hybrid solid modeler (IDEAS) and an object-oriented programming paradigm is described. The second part provides a comprehensive methodology to acquire and represent weld process knowledge required for the proper selection of welding schedules. A methodology of knowledge acquisition using statistical methods is proposed. It is shown that these procedures did little to capture the private knowledge of experts (heuristics), but helped in determining general dependencies, and trends. A need was established for building the knowledge-based system using handbook knowledge and to allow the experts further to build the system. A methodology to check the consistency and validity for such knowledge addition is proposed. A mapping shell designed to transform the design features to application specific weld process schedules is described. A new approach using fixed path modified continuation methods is proposed in the final section to plan continuously the trajectory of weld seams in an integrated welding robot and positioner environment. The joint displacement, velocity, and acceleration histories all along the path as a function of the path parameter for the best possible welding condition are provided for the robot and the positioner to track various paths normally encountered in arc welding.

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.

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.

X-ray satellite

NASA Technical Reports Server (NTRS)

1985-01-01

A mock-up for the development of the Engineering Model (EM) and Flight Model (FM) is introduced which shortens the delay of 7 weeks regarding the previous planned launch date of September 30, to about 3 weeks maintaining the 4 weeks reserve is discussed. As compared with the new assembly integration test (EM-AIT) schedule of March 11, 1985, the EM data handling system is on the critical path. For the attitude measurement and control subsystem, sufficiently flexibility is achieved through combination of dummies and EM hardware to catch up with the existing delays.

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.

Autonomous navigation and obstacle avoidance for unmanned surface vehicles

NASA Astrophysics Data System (ADS)

Larson, Jacoby; Bruch, Michael; Ebken, John

2006-05-01

The US Navy and other Department of Defense (DoD) and Department of Homeland Security (DHS) organizations are increasingly interested in the use of unmanned surface vehicles (USVs) for a variety of missions and applications. In order for USVs to fill these roles, they must be capable of a relatively high degree of autonomous navigation. Space and Naval Warfare Systems Center, San Diego is developing core technologies required for robust USV operation in a real-world environment, primarily focusing on autonomous navigation, obstacle avoidance, and path planning.

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.

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.

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.

Channel Modeling of Miniaturized Battery-Powered Capacitive Human Body Communication Systems.

PubMed

Park, Jiwoong; Garudadri, Harinath; Mercier, Patrick P

2017-02-01

The purpose of this contribution is to estimate the path loss of capacitive human body communication (HBC) systems under practical conditions. Most prior work utilizes large grounded instruments to perform path loss measurements, resulting in overly optimistic path loss estimates for wearable HBC devices. In this paper, small battery-powered transmitter and receiver devices are implemented to measure path loss under realistic assumptions. A hybrid electrostatic finite element method simulation model is presented that validates measurements and enables rapid and accurate characterization of future capacitive HBC systems. Measurements from form-factor-accurate prototypes reveal path loss results between 31.7 and 42.2 dB from 20 to 150 MHz. Simulation results matched measurements within 2.5 dB. Comeasurements using large grounded benchtop vector network analyzer (VNA) and large battery-powered spectrum analyzer (SA) underestimate path loss by up to 33.6 and 8.2 dB, respectively. Measurements utilizing a VNA with baluns, or large battery-powered SAs with baluns still underestimate path loss by up to 24.3 and 6.7 dB, respectively. Measurements of path loss in capacitive HBC systems strongly depend on instrumentation configurations. It is thus imperative to simulate or measure path loss in capacitive HBC systems utilizing realistic geometries and grounding configurations. HBC has a great potential for many emerging wearable devices and applications; accurate path loss estimation will improve system-level design leading to viable products.

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 Petri-net coordination model for an intelligent mobile robot

NASA Technical Reports Server (NTRS)

Wang, F.-Y.; Kyriakopoulos, K. J.; Tsolkas, A.; Saridis, G. N.

1990-01-01

The authors present a Petri net model of the coordination level of an intelligent mobile robot system (IMRS). The purpose of this model is to specify the integration of the individual efforts on path planning, supervisory motion control, and vision systems that are necessary for the autonomous operation of the mobile robot in a structured dynamic environment. This is achieved by analytically modeling the various units of the system as Petri net transducers and explicitly representing the task precedence and information dependence among them. The model can also be used to simulate the task processing and to evaluate the efficiency of operations and the responsibility of decisions in the coordination level of the IMRS. Some simulation results on the task processing and learning are presented.

Prediction of Path Deviation in Robot Based Incremental Sheet Metal Forming by Means of a New Solid-Shell Finite Element Technology and a Finite Elastoplastic Model with Combined Hardening

NASA Astrophysics Data System (ADS)

Kiliclar, Yalin; Laurischkat, Roman; Vladimirov, Ivaylo N.; Reese, Stefanie

2011-08-01

The presented project deals with a robot based incremental sheet metal forming process, which is called roboforming and has been developed at the Chair of Production Systems. It is characterized by flexible shaping using a freely programmable path-synchronous movement of two industrial robots. The final shape is produced by the incremental infeed of the forming tool in depth direction and its movement along the part contour in lateral direction. However, the resulting geometries formed in roboforming deviate several millimeters from the reference geometry. This results from the compliance of the involved machine structures and the springback effects of the workpiece. The project aims to predict these deviations caused by resiliences and to carry out a compensative path planning based on this prediction. Therefore a planning tool is implemented which compensates the robots's compliance and the springback effects of the sheet metal. The forming process is simulated by means of a finite element analysis using a material model developed at the Institute of Applied Mechanics (IFAM). It is based on the multiplicative split of the deformation gradient in the context of hyperelasticity and combines nonlinear kinematic and isotropic hardening. Low-order finite elements used to simulate thin sheet structures, such as used for the experiments, have the major problem of locking, a nonphysical stiffening effect. For an efficient finite element analysis a special solid-shell finite element formulation based on reduced integration with hourglass stabilization has been developed. To circumvent different locking effects, the enhanced assumed strain (EAS) and the assumed natural strain (ANS) concepts are included in this formulation. Having such powerful tools available we obtain more accurate geometries.

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