Dynamic whole-body robotic manipulation

NASA Astrophysics Data System (ADS)

Abe, Yeuhi; Stephens, Benjamin; Murphy, Michael P.; Rizzi, Alfred A.

2013-05-01

The creation of dynamic manipulation behaviors for high degree of freedom, mobile robots will allow them to accomplish increasingly difficult tasks in the field. We are investigating how the coordinated use of the body, legs, and integrated manipulator, on a mobile robot, can improve the strength, velocity, and workspace when handling heavy objects. We envision that such a capability would aid in a search and rescue scenario when clearing obstacles from a path or searching a rubble pile quickly. Manipulating heavy objects is especially challenging because the dynamic forces are high and a legged system must coordinate all its degrees of freedom to accomplish tasks while maintaining balance. To accomplish these types of manipulation tasks, we use trajectory optimization techniques to generate feasible open-loop behaviors for our 28 dof quadruped robot (BigDog) by planning trajectories in a 13 dimensional space. We apply the Covariance Matrix Adaptation (CMA) algorithm to solve for trajectories that optimize task performance while also obeying important constraints such as torque and velocity limits, kinematic limits, and center of pressure location. These open-loop behaviors are then used to generate desired feed-forward body forces and foot step locations, which enable tracking on the robot. Some hardware results for cinderblock throwing are demonstrated on the BigDog quadruped platform augmented with a human-arm-like manipulator. The results are analogous to how a human athlete maximizes distance in the discus event by performing a precise sequence of choreographed steps.

A biologically inspired neural net for trajectory formation and obstacle avoidance.

PubMed

Glasius, R; Komoda, A; Gielen, S C

1996-06-01

In this paper we present a biologically inspired two-layered neural network for trajectory formation and obstacle avoidance. The two topographically ordered neural maps consist of analog neurons having continuous dynamics. The first layer, the sensory map, receives sensory information and builds up an activity pattern which contains the optimal solution (i.e. shortest path without collisions) for any given set of current position, target positions and obstacle positions. Targets and obstacles are allowed to move, in which case the activity pattern in the sensory map will change accordingly. The time evolution of the neural activity in the second layer, the motor map, results in a moving cluster of activity, which can be interpreted as a population vector. Through the feedforward connections between the two layers, input of the sensory map directs the movement of the cluster along the optimal path from the current position of the cluster to the target position. The smooth trajectory is the result of the intrinsic dynamics of the network only. No supervisor is required. The output of the motor map can be used for direct control of an autonomous system in a cluttered environment or for control of the actuators of a biological limb or robot manipulator. The system is able to reach a target even in the presence of an external perturbation. Computer simulations of a point robot and a multi-joint manipulator illustrate the theory.

Ultra-High Resolution Ion Mobility Separations Utilizing Traveling Waves in a 13 m Serpentine Path Length Structures for Lossless Ion Manipulations Module

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

Deng, Liulin; Ibrahim, Yehia M.; Hamid, Ahmed M.

We report the development and initial evaluation of a 13-m path length Structures for Lossless Manipulations (SLIM) module for achieving high resolution separations using traveling waves (TW) with ion mobility (IM) spectrometry. The TW SLIM module was fabricated using two mirror-image printed circuit boards with appropriately configured RF, DC and TW electrodes and positioned with a 2.75-mm inter-surface gap. Ions were effective confined between the surfaces by RF-generated pseudopotential fields and moved losslessly through a serpentine path including 44 “U” turns using TWs. The ion mobility resolution was characterized at different pressures, gaps between the SLIM surfaces, TW and RFmore » parameters. After initial optimization the SLIM IM-MS module provided about 5-fold higher resolution separations than present commercially available drift tube or traveling wave IM-MS platforms. Peak capacity and peak generation rates achieved were 246 and 370 s-1, respectively, at a TW speed of 148 m/s. The high resolution achieved in the TW SLIM IM-MS enabled e.g., isomeric sugars (Lacto-N-fucopentaose I and Lacto-N-fucopentaose II) to be baseline resolved, and peptides from a albumin tryptic digest much better resolved than with existing commercial IM-MS platforms. The present work also provides a foundation for the development of much higher resolution SLIM devices based upon both considerably longer path lengths and multi-pass designs.« less

Planar Steering of a Single Ferrofluid Drop by Optimal Minimum Power Dynamic Feedback Control of Four Electromagnets at a Distance

PubMed Central

Probst, R.; Lin, J.; Komaee, A.; Nacev, A.; Cummins, Z.

2010-01-01

Any single permanent or electro magnet will always attract a magnetic fluid. For this reason it is difficult to precisely position and manipulate ferrofluid at a distance from magnets. We develop and experimentally demonstrate optimal (minimum electrical power) 2-dimensional manipulation of a single droplet of ferrofluid by feedback control of 4 external electromagnets. The control algorithm we have developed takes into account, and is explicitly designed for, the nonlinear (fast decay in space, quadratic in magnet strength) nature of how the magnets actuate the ferrofluid, and it also corrects for electro-magnet charging time delays. With this control, we show that dynamic actuation of electro-magnets held outside a domain can be used to position a droplet of ferrofluid to any desired location and steer it along any desired path within that domain – an example of precision control of a ferrofluid by magnets acting at a distance. PMID:21218157

Study of ground state optical transfer for ultracold alkali dimers

NASA Astrophysics Data System (ADS)

Bouloufa-Maafa, Nadia; Londono, Beatriz; Borsalino, Dimitri; Vexiau, Romain; Mahecha, Jorge; Dulieu, Olivier; Luc-Koenig, Eliane

2013-05-01

Control of molecular states by laser pulses offer promising potential applications. The manipulation of molecules by external fields requires precise knowledge of the molecular structure. Our motivation is to perform a detailed analysis of the spectroscopic properties of alkali dimers, with the aim to determine efficient optical paths to form molecules in the absolute ground state and to determine the optimal parameters of the optical lattices where those molecules are manipulated to avoid losses by collisions. To this end, we use state of the art molecular potentials, R-dependent spin-orbit coupling and transition dipole moment to perform our calculations. R-dependent SO coupling are of crucial importance because the transitions occur at internuclear distances where they are affected by this R-dependence. Efficient schemes to transfer RbCs, KRb and KCs to the absolute ground state as well as the optimal parameters of the optical lattices will be presented. This work was supported in part by ``Triangle de la Physique'' under contract 2008-007T-QCCM (Quantum Control of Cold Molecules).

System, apparatus and methods to implement high-speed network analyzers

DOEpatents

Ezick, James; Lethin, Richard; Ros-Giralt, Jordi; Szilagyi, Peter; Wohlford, David E

2015-11-10

Systems, apparatus and methods for the implementation of high-speed network analyzers are provided. A set of high-level specifications is used to define the behavior of the network analyzer emitted by a compiler. An optimized inline workflow to process regular expressions is presented without sacrificing the semantic capabilities of the processing engine. An optimized packet dispatcher implements a subset of the functions implemented by the network analyzer, providing a fast and slow path workflow used to accelerate specific processing units. Such dispatcher facility can also be used as a cache of policies, wherein if a policy is found, then packet manipulations associated with the policy can be quickly performed. An optimized method of generating DFA specifications for network signatures is also presented. The method accepts several optimization criteria, such as min-max allocations or optimal allocations based on the probability of occurrence of each signature input bit.

Optimal trajectory planning of free-floating space manipulator using differential evolution algorithm

NASA Astrophysics Data System (ADS)

Wang, Mingming; Luo, Jianjun; Fang, Jing; Yuan, Jianping

2018-03-01

The existence of the path dependent dynamic singularities limits the volume of available workspace of free-floating space robot and induces enormous joint velocities when such singularities are met. In order to overcome this demerit, this paper presents an optimal joint trajectory planning method using forward kinematics equations of free-floating space robot, while joint motion laws are delineated with application of the concept of reaction null-space. Bézier curve, in conjunction with the null-space column vectors, are applied to describe the joint trajectories. Considering the forward kinematics equations of the free-floating space robot, the trajectory planning issue is consequently transferred to an optimization issue while the control points to construct the Bézier curve are the design variables. A constrained differential evolution (DE) scheme with premature handling strategy is implemented to find the optimal solution of the design variables while specific objectives and imposed constraints are satisfied. Differ from traditional methods, we synthesize null-space and specialized curve to provide a novel viewpoint for trajectory planning of free-floating space robot. Simulation results are presented for trajectory planning of 7 degree-of-freedom (DOF) kinematically redundant manipulator mounted on a free-floating spacecraft and demonstrate the feasibility and effectiveness of the proposed method.

Electric and Magnetic Manipulation of Biological Systems

NASA Astrophysics Data System (ADS)

Lee, H.; Hunt, T. P.; Liu, Y.; Ham, D.; Westervelt, R. M.

2005-06-01

New types of biological cell manipulation systems, a micropost matrix, a microelectromagnet matrix, and a microcoil array, were developed. The micropost matrix consists of post-shaped electrodes embedded in an insulating layer. With a separate ac voltage applied to each electrode, the micropost matrix generates dielectrophoretic force to trap and move individual biological cells. The microelectromagnet matrix consists of two arrays of straight wires aligned perpendicular to each other, that are covered with insulating layers. By independently controlling the current in each wire, the microelectromagnet matrix creates versatile magnetic fields to manipulate individual biological cells attached to magnetic beads. The microcoil array is a set of coils implemented in a foundry using a standard silicon fabrication technology. Current sources to the coils, and control circuits are integrated on a single chip, making the device self-contained. Versatile manipulation of biological cells was demonstrated using these devices by generating optimized electric or magnetic field patterns. A single yeast cell was trapped and positioned with microscopic resolution, and multiple yeast cells were trapped and independently moved along the separate paths for cell-sorting.

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 control of quantum rings by terahertz laser pulses.

PubMed

Räsänen, E; Castro, A; Werschnik, J; Rubio, A; Gross, E K U

2007-04-13

Complete control of single-electron states in a two-dimensional semiconductor quantum-ring model is established, opening a path into coherent laser-driven single-gate qubits. The control scheme is developed in the framework of optimal-control theory for laser pulses of two-component polarization. In terms of pulse lengths and target-state occupations, the scheme is shown to be superior to conventional control methods that exploit Rabi oscillations generated by uniform circularly polarized pulses. Current-carrying states in a quantum ring can be used to manipulate a two-level subsystem at the ring center. Combining our results, we propose a realistic approach to construct a laser-driven single-gate qubit that has switching times in the terahertz regime.

Time optimal paths for high speed maneuvering

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

Reister, D.B.; Lenhart, S.M.

1993-01-01

Recent theoretical results have completely solved the problem of determining the minimum length path for a vehicle with a minimum turning radius moving from an initial configuration to a final configuration. Time optimal paths for a constant speed vehicle are a subset of the minimum length paths. This paper uses the Pontryagin maximum principle to find time optimal paths for a constant speed vehicle. The time optimal paths consist of sequences of axes of circles and straight lines. The maximum principle introduces concepts (dual variables, bang-bang solutions, singular solutions, and transversality conditions) that provide important insight into the nature ofmore » the time optimal paths. We explore the properties of the optimal paths and present some experimental results for a mobile robot following an optimal path.« less

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.

Bending the Curve: Sensitivity to Bending of Curved Paths and Application in Room-Scale VR.

PubMed

Langbehn, Eike; Lubos, Paul; Bruder, Gerd; Steinicke, Frank

2017-04-01

Redirected walking (RDW) promises to allow near-natural walking in an infinitely large virtual environment (VE) by subtle manipulations of the virtual camera. Previous experiments analyzed the human sensitivity to RDW manipulations by focusing on the worst-case scenario, in which users walk perfectly straight ahead in the VE, whereas they are redirected on a circular path in the real world. The results showed that a physical radius of at least 22 meters is required for undetectable RDW. However, users do not always walk exactly straight in a VE. So far, it has not been investigated how much a physical path can be bent in situations in which users walk a virtual curved path instead of a straight one. Such curved walking paths can be often observed, for example, when users walk on virtual trails, through bent corridors, or when circling around obstacles. In such situations the question is not, whether or not the physical path can be bent, but how much the bending of the physical path may vary from the bending of the virtual path. In this article, we analyze this question and present redirection by means of bending gains that describe the discrepancy between the bending of curved paths in the real and virtual environment. Furthermore, we report the psychophysical experiments in which we analyzed the human sensitivity to these gains. The results reveal encouragingly wider detection thresholds than for straightforward walking. Based on our findings, we discuss the potential of curved walking and present a first approach to leverage bent paths in a way that can provide undetectable RDW manipulations even in room-scale VR.

Optimal Path Determination for Flying Vehicle to Search an Object

NASA Astrophysics Data System (ADS)

Heru Tjahjana, R.; Heri Soelistyo U, R.; Ratnasari, L.; Irawanto, B.

2018-01-01

In this paper, a method to determine optimal path for flying vehicle to search an object is proposed. Background of the paper is controlling air vehicle to search an object. Optimal path determination is one of the most popular problem in optimization. This paper describe model of control design for a flying vehicle to search an object, and focus on the optimal path that used to search an object. In this paper, optimal control model is used to control flying vehicle to make the vehicle move in optimal path. If the vehicle move in optimal path, then the path to reach the searched object also optimal. The cost Functional is one of the most important things in optimal control design, in this paper the cost functional make the air vehicle can move as soon as possible to reach the object. The axis reference of flying vehicle uses N-E-D (North-East-Down) coordinate system. The result of this paper are the theorems which say that the cost functional make the control optimal and make the vehicle move in optimal path are proved analytically. The other result of this paper also shows the cost functional which used is convex. The convexity of the cost functional is use for guarantee the existence of optimal control. This paper also expose some simulations to show an optimal path for flying vehicle to search an object. The optimization method which used to find the optimal control and optimal path vehicle in this paper is Pontryagin Minimum Principle.

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

Reister, D.B.; Lenhart, S.M.

Recent theoretical results have completely solved the problem of determining the minimum length path for a vehicle with a minimum turning radius moving from an initial configuration to a final configuration. Time optimal paths for a constant speed vehicle are a subset of the minimum length paths. This paper uses the Pontryagin maximum principle to find time optimal paths for a constant speed vehicle. The time optimal paths consist of sequences of axes of circles and straight lines. The maximum principle introduces concepts (dual variables, bang-bang solutions, singular solutions, and transversality conditions) that provide important insight into the nature ofmore » the time optimal paths. We explore the properties of the optimal paths and present some experimental results for a mobile robot following an optimal path.« less

Optimal spectral structure for simultaneous Stimulated Brillouin Scattering suppression and coherent property preservation in high power coherent beam combination system

NASA Astrophysics Data System (ADS)

Han, Kai; Xu, Xiaojun; Liu, Zejin

2013-05-01

Based on the spectral manipulation technique, the Stimulated Brillouin Scattering (SBS) suppression effect and the coherent beam combination (CBC) effect in multi-tone CBC system are researched theoretically and experimentally. To get satisfactory SBS suppression, the frequency interval of the multi-tone seed laser should be large enough, at least larger than the SBS gain bandwidth. In order to attain excellent CBC effect, the spectra of the multi-tone seed laser need to be matched with the optical path differences among the amplifier chains. Hence, a sufficiently separated matching spectrum is capable at both SBS mitigation and coherent property preservation. By comparing the SBS suppression effect and the CBC effect at various spectra, the optimal spectral structure for simultaneous SBS suppression and excellent CBC effect is found.

An improved reaction path optimization method using a chain of conformations

NASA Astrophysics Data System (ADS)

Asada, Toshio; Sawada, Nozomi; Nishikawa, Takuya; Koseki, Shiro

2018-05-01

The efficient fast path optimization (FPO) method is proposed to optimize the reaction paths on energy surfaces by using chains of conformations. No artificial spring force is used in the FPO method to ensure the equal spacing of adjacent conformations. The FPO method is applied to optimize the reaction path on two model potential surfaces. The use of this method enabled the optimization of the reaction paths with a drastically reduced number of optimization cycles for both potentials. It was also successfully utilized to define the MEP of the isomerization of the glycine molecule in water by FPO method.

Optimal cue integration in ants.

PubMed

Wystrach, Antoine; Mangan, Michael; Webb, Barbara

2015-10-07

In situations with redundant or competing sensory information, humans have been shown to perform cue integration, weighting different cues according to their certainty in a quantifiably optimal manner. Ants have been shown to merge the directional information available from their path integration (PI) and visual memory, but as yet it is not clear that they do so in a way that reflects the relative certainty of the cues. In this study, we manipulate the variance of the PI home vector by allowing ants (Cataglyphis velox) to run different distances and testing their directional choice when the PI vector direction is put in competition with visual memory. Ants show progressively stronger weighting of their PI direction as PI length increases. The weighting is quantitatively predicted by modelling the expected directional variance of home vectors of different lengths and assuming optimal cue integration. However, a subsequent experiment suggests ants may not actually compute an internal estimate of the PI certainty, but are using the PI home vector length as a proxy. © 2015 The Author(s).

Trajectory planning of free-floating space robot using Particle Swarm Optimization (PSO)

NASA Astrophysics Data System (ADS)

Wang, Mingming; Luo, Jianjun; Walter, Ulrich

2015-07-01

This paper investigates the application of Particle Swarm Optimization (PSO) strategy to trajectory planning of the kinematically redundant space robot in free-floating mode. Due to the path dependent dynamic singularities, the volume of available workspace of the space robot is limited and enormous joint velocities are required when such singularities are met. In order to overcome this effect, the direct kinematics equations in conjunction with PSO are employed for trajectory planning of free-floating space robot. The joint trajectories are parametrized with the Bézier curve to simplify the calculation. Constrained PSO scheme with adaptive inertia weight is implemented to find the optimal solution of joint trajectories while specific objectives and imposed constraints are satisfied. The proposed method is not sensitive to the singularity issue due to the application of forward kinematic equations. Simulation results are presented for trajectory planning of 7 degree-of-freedom (DOF) redundant manipulator mounted on a free-floating spacecraft and demonstrate the effectiveness of the proposed method.

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.

Mechanical manipulation of magnetic nanoparticles by magnetic force microscopy

NASA Astrophysics Data System (ADS)

Liu, Jinyun; Zhang, Wenxiao; Li, Yiquan; Zhu, Hanxing; Qiu, Renxi; Song, Zhengxun; Wang, Zuobin; Li, Dayou

2017-12-01

A method has been developed in this work for the mechanical manipulation of magnetic nanoparticles (MNPs). A helical curve was designed as the capture path to pick up and remove the target nanoparticle on a mica surface by a magnetic probe based on the magnetic force microscope (MFM). There were magnetic, tangential and pushing forces acting on the target particle during the approaching process when the tip followed the helical curve as the capture path. The magnetic force was significant when the tip was closer to the particle. The target particle can be attached on the surface of the magnetic probe tip and then be picked up after the tip retracted from the mica surface. Theoretical analysis and experimental results were presented for the pick-up and removal of MNPs. With this method, the precision and flexibility of manipulation of MNPs were improved significantly compared to the pushing or sliding of the target object away from the corresponding original location following a planned path.

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.

The effects of narrow and elevated path walking on aperture crossing.

PubMed

Hackney, Amy L; Cinelli, Michael E; Denomme, Luke T; Frank, James S

2015-06-01

The study investigated the impact that action capabilities have on identifying possibilities for action, particularly how postural threat influences the passability of apertures. To do this, the ability to maintain balance was challenged by manipulating the level of postural threat while walking. First, participants walked along a 7m path and passed through two vertical obstacles spaced 1.1-1.5×the shoulder width apart during normal walking. Next, postural threat was manipulated by having participants complete the task either walking on a narrow, ground level path or on an elevated/narrow path. Despite a decrease in walking speed as well as an increase in trunk sway in both the narrow and elevated/narrow walking conditions, the passability of apertures was only affected when the consequence of instability was greatest. In the elevated/narrow walking condition, individuals maintained a larger critical point (rotated their shoulders for larger aperture widths) compared to normal walking. However, this effect was not observed for the narrow path walking suggesting that the level of postural threat was not enough to impose similar changes to the critical point. Therefore, it appears that manipulating action capabilities by increasing postural threat does indeed influence aperture crossing behavior, however the consequence associated with instability must be high before both gait characteristics and the critical point are affected. Copyright © 2015 Elsevier B.V. All rights reserved.

Optimum swimming pathways of fish spawning migrations in rivers

USGS Publications Warehouse

McElroy, Brandon; DeLonay, Aaron; Jacobson, Robert

2012-01-01

Fishes that swim upstream in rivers to spawn must navigate complex fluvial velocity fields to arrive at their ultimate locations. One hypothesis with substantial implications is that fish traverse pathways that minimize their energy expenditure during migration. Here we present the methodological and theoretical developments necessary to test this and similar hypotheses. First, a cost function is derived for upstream migration that relates work done by a fish to swimming drag. The energetic cost scales with the cube of a fish's relative velocity integrated along its path. By normalizing to the energy requirements of holding a position in the slowest waters at the path's origin, a cost function is derived that depends only on the physical environment and not on specifics of individual fish. Then, as an example, we demonstrate the analysis of a migration pathway of a telemetrically tracked pallid sturgeon (Scaphirhynchus albus) in the Missouri River (USA). The actual pathway cost is lower than 105 random paths through the surveyed reach and is consistent with the optimization hypothesis. The implication—subject to more extensive validation—is that reproductive success in managed rivers could be increased through manipulation of reservoir releases or channel morphology to increase abundance of lower-cost migration pathways.

Focusing light through biological tissue and tissue-mimicking phantoms up to 9.6 cm in thickness with digital optical phase conjugation

NASA Astrophysics Data System (ADS)

Shen, Yuecheng; Liu, Yan; Ma, Cheng; Wang, Lihong V.

2016-08-01

Optical phase conjugation (OPC)-based wavefront shaping techniques focus light through or within scattering media, which is critically important for deep-tissue optical imaging, manipulation, and therapy. However, to date, the sample thickness in OPC experiments has been limited to only a few millimeters. Here, by using a laser with a long coherence length and an optimized digital OPC system that can safely deliver more light power, we focused 532-nm light through tissue-mimicking phantoms up to 9.6 cm thick, as well as through ex vivo chicken breast tissue up to 2.5 cm thick. Our results demonstrate that OPC can be achieved even when photons have experienced on average 1000 scattering events. The demonstrated penetration of nearly 10 cm (˜100 transport mean free paths) has never been achieved before by any optical focusing technique, and it shows the promise of OPC for deep-tissue noninvasive optical imaging, manipulation, and therapy.

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

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.

ARC Cell Science Validation (CS-V) Payload Overview

NASA Technical Reports Server (NTRS)

Gilkerson, Nikita

2017-01-01

Automated cell biology system for laboratory and International Space Station (ISS) National Laboratory research. Enhanced cell culture platform that provides undisturbed culture maintenance, including feedback temperature control, medical grade gas supply, perfusion nutrient delivery and removal of waste, and automated experiment manipulations. Programmable manipulations include: media feeds change out, injections, fraction collections, fixation, flow rate, and temperature modification within a one-piece sterile barrier flow path. Cassette provides 3 levels of containment and allows Crew access to the bioculture chamber and flow path assembly for experiment initiation, refurbishment, or sample retrieval and preservation.

Energy Optimal Path Planning: Integrating Coastal Ocean Modelling with Optimal Control

NASA Astrophysics Data System (ADS)

Subramani, D. N.; Haley, P. J., Jr.; Lermusiaux, P. F. J.

2016-02-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. 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 that govern their stochastic time-optimal reachability fronts 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. The accuracy and efficiency of the DO level-set equations for solving the governing stochastic level-set reachability fronts are quantitatively assessed, including comparisons with independent semi-analytical solutions. Energy-optimal missions are studied in wind-driven barotropic quasi-geostrophic double-gyre circulations, and in realistic data-assimilative re-analyses of multiscale coastal ocean flows. The latter re-analyses are obtained from multi-resolution 2-way nested primitive-equation simulations of tidal-to-mesoscale dynamics in the Middle Atlantic Bight and Shelbreak Front region. The effects of tidal currents, strong wind events, coastal jets, and shelfbreak fronts on the energy-optimal paths are illustrated and quantified. Results showcase the opportunities for longer-duration missions that intelligently utilize the ocean environment to save energy, rigorously integrating ocean forecasting with optimal control of autonomous vehicles.

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.

A Subsonic Aircraft Design Optimization With Neural Network and Regression Approximators

NASA Technical Reports Server (NTRS)

Patnaik, Surya N.; Coroneos, Rula M.; Guptill, James D.; Hopkins, Dale A.; Haller, William J.

2004-01-01

The Flight-Optimization-System (FLOPS) code encountered difficulty in analyzing a subsonic aircraft. The limitation made the design optimization problematic. The deficiencies have been alleviated through use of neural network and regression approximations. The insight gained from using the approximators is discussed in this paper. The FLOPS code is reviewed. Analysis models are developed and validated for each approximator. The regression method appears to hug the data points, while the neural network approximation follows a mean path. For an analysis cycle, the approximate model required milliseconds of central processing unit (CPU) time versus seconds by the FLOPS code. Performance of the approximators was satisfactory for aircraft analysis. A design optimization capability has been created by coupling the derived analyzers to the optimization test bed CometBoards. The approximators were efficient reanalysis tools in the aircraft design optimization. Instability encountered in the FLOPS analyzer was eliminated. The convergence characteristics were improved for the design optimization. The CPU time required to calculate the optimum solution, measured in hours with the FLOPS code was reduced to minutes with the neural network approximation and to seconds with the regression method. Generation of the approximators required the manipulation of a very large quantity of data. Design sensitivity with respect to the bounds of aircraft constraints is easily generated.

Fast exploration of an optimal path on the multidimensional free energy surface

PubMed Central

Chen, Changjun

2017-01-01

In a reaction, determination of an optimal path with a high reaction rate (or a low free energy barrier) is important for the study of the reaction mechanism. This is a complicated problem that involves lots of degrees of freedom. For simple models, one can build an initial path in the collective variable space by the interpolation method first and then update the whole path constantly in the optimization. However, such interpolation method could be risky in the high dimensional space for large molecules. On the path, steric clashes between neighboring atoms could cause extremely high energy barriers and thus fail the optimization. Moreover, performing simulations for all the snapshots on the path is also time-consuming. In this paper, we build and optimize the path by a growing method on the free energy surface. The method grows a path from the reactant and extends its length in the collective variable space step by step. The growing direction is determined by both the free energy gradient at the end of the path and the direction vector pointing at the product. With fewer snapshots on the path, this strategy can let the path avoid the high energy states in the growing process and save the precious simulation time at each iteration step. Applications show that the presented method is efficient enough to produce optimal paths on either the two-dimensional or the twelve-dimensional free energy surfaces of different small molecules. PMID:28542475

Kinematics, controls, and path planning results for a redundant manipulator

NASA Technical Reports Server (NTRS)

Gretz, Bruce; Tilley, Scott W.

1989-01-01

The inverse kinematics solution, a modal position control algorithm, and path planning results for a 7 degree of freedom manipulator are presented. The redundant arm consists of two links with shoulder and elbow joints and a spherical wrist. The inverse kinematics problem for tip position is solved and the redundant joint is identified. It is also shown that a locus of tip positions exists in which there are kinematic limitations on self-motion. A computationally simple modal position control algorithm has been developed which guarantees a nearly constant closed-loop dynamic response throughout the workspace. If all closed-loop poles are assigned to the same location, the algorithm can be implemented with very little computation. To further reduce the required computation, the modal gains are updated only at discrete time intervals. Criteria are developed for the frequency of these updates. For commanding manipulator movements, a 5th-order spline which minimizes jerk provides a smooth tip-space path. Schemes for deriving a corresponding joint-space trajectory are discussed. Modifying the trajectory to avoid joint torque saturation when a tip payload is added is also considered. Simulation results are presented.

Optimization of educational paths for higher education

NASA Astrophysics Data System (ADS)

Tarasyev, Alexandr A.; Agarkov, Gavriil; Medvedev, Aleksandr

2017-11-01

In our research, we combine the theory of economic behavior and the methodology of increasing efficiency of the human capital to estimate the optimal educational paths. We provide an optimization model for higher education process to analyze possible educational paths for each rational individual. The preferences of each rational individual are compared to the best economically possible educational path. The main factor of the individual choice, which is formed by the formation of optimal educational path, deals with higher salaries level in the chosen economic sector after graduation. Another factor that influences on the economic profit is the reduction of educational costs or the possibility of the budget support for the student. The main outcome of this research consists in correction of the governmental policy of investment in human capital based on the results of educational paths optimal control.

A Tunable Silk Hydrogel Device for Studying Limb Regeneration in Adult Xenopus Laevis

PubMed Central

Golding, Anne; Levin, Michael; Kaplan, David L.

2016-01-01

In certain amphibian models limb regeneration can be promoted or inhibited by the local wound bed environment. This research introduces a device that can be utilized as an experimental tool to characterize the conditions that promotes limb regeneration in the adult frog (Xenopus laevis) model. In particular, this device was designed to manipulate the local wound environment via a hydrogel insert. Initial characterization of the hydrogel insert revealed that this interaction had a significant influence on mechanical forces to the animal, due to the contraction of the hydrogel. The material and mechanical properties of the hydrogel insert were a factor in the device design in relation to the comfort of the animal and the ability to effectively manipulate the amputation site. The tunable features of the hydrogel were important in determining the pro-regenerative effects in limb regeneration, which was measured by cartilage spike formation and quantified by micro-computed tomography. The hydrogel insert was a factor in the observed morphological outcomes following amputation. Future work will focus on characterizing and optimizing the device’s observed capability to manipulate biological pathways that are essential for limb regeneration. However, the present work provides a framework for the role of a hydrogel in the device and a path forward for more systematic studies. PMID:27257960

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

PubMed

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

2009-06-22

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

JPL-ANTOPT antenna structure optimization program

NASA Technical Reports Server (NTRS)

Strain, D. M.

1994-01-01

New antenna path-length error and pointing-error structure optimization codes were recently added to the MSC/NASTRAN structural analysis computer program. Path-length and pointing errors are important measured of structure-related antenna performance. The path-length and pointing errors are treated as scalar displacements for statics loading cases. These scalar displacements can be subject to constraint during the optimization process. Path-length and pointing-error calculations supplement the other optimization and sensitivity capabilities of NASTRAN. The analysis and design functions were implemented as 'DMAP ALTERs' to the Design Optimization (SOL 200) Solution Sequence of MSC-NASTRAN, Version 67.5.

Parametric Method to Define Area of Allowable Configurations while Changing Position of Restricted Zones

NASA Astrophysics Data System (ADS)

Pritykin, F. N.; Nefedov, D. I.; Rogoza, Yu A.; Zinchenko, Yu V.

2018-03-01

The article presents the findings related to the development of the module for automatic collision detection of the manipulator with restricted zones for virtual motion modeling. It proposes the parametric method for specifying the area of allowable joint configurations. The authors study the cases when restricted zones are specified using the horizontal plane or front-projection planes. The joint coordinate space is specified by rectangular axes in the direction of which the angles defining the displacements in turning pairs are laid off. The authors present the results of modeling which enabled to develop a parametric method for specifying a set of cross-sections defining the shape and position of allowable configurations in different positions of a restricted zone. All joint points that define allowable configurations refer to the indicated sections. The area of allowable configurations is specified analytically by using several kinematic surfaces that limit it. A geometric analysis is developed based on the use of the area of allowable configurations characterizing the position of the manipulator and reported restricted zones. The paper presents numerical calculations related to virtual simulation of the manipulator path performed by the mobile robot Varan when using the developed algorithm and restricted zones. The obtained analytical dependencies allow us to define the area of allowable configurations, which is a knowledge pool to ensure the intelligent control of the manipulator path in a predefined environment. The use of the obtained region to synthesize a joint trajectory makes it possible to correct the manipulator path to foresee and eliminate deadlocks when synthesizing motions along the velocity vector.

Control devices and steering strategies in pathway surgery.

PubMed

Fan, Chunman; Jelínek, Filip; Dodou, Dimitra; Breedveld, Paul

2015-02-01

For pathway surgery, that is, minimally invasive procedures carried out transluminally or through instrument-created pathways, handheld maneuverable instruments are being developed. As the accompanying control interfaces of such instruments have not been optimized for intuitive manipulation, we investigated the effect of control mode (1DoF or 2DoF), and control device (joystick or handgrip) on human performance in a navigation task. The experiments were conducted using the Endo-PaC (Endoscopic-Path Controller), a simulator that emulates the shaft and handle of a maneuverable instrument, combined with custom-developed software animating pathway surgical scenarios. Participants were asked to guide a virtual instrument without collisions toward a target located at the end of a virtual curved tunnel. The performance was assessed in terms of task completion time, path length traveled by the virtual instrument, motion smoothness, collision metrics, subjective workload, and personal preference. The results indicate that 2DoF control leads to faster task completion and fewer collisions with the tunnel wall combined with a strong subjective preference compared with 1DoF control. Handgrip control appeared to be more intuitive to master than joystick control. However, the participants experienced greater physical demand and had longer path lengths with handgrip than joystick control. Copyright © 2015 Elsevier Inc. All rights reserved.

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.

From the physics of interacting polymers to optimizing routes on the London Underground

PubMed Central

Yeung, Chi Ho; Saad, David; Wong, K. Y. Michael

2013-01-01

Optimizing paths on networks is crucial for many applications, ranging from subway traffic to Internet communication. Because global path optimization that takes account of all path choices simultaneously is computationally hard, most existing routing algorithms optimize paths individually, thus providing suboptimal solutions. We use the physics of interacting polymers and disordered systems to analyze macroscopic properties of generic path optimization problems and derive a simple, principled, generic, and distributed routing algorithm capable of considering all individual path choices simultaneously. We demonstrate the efficacy of the algorithm by applying it to: (i) random graphs resembling Internet overlay networks, (ii) travel on the London Underground network based on Oyster card data, and (iii) the global airport network. Analytically derived macroscopic properties give rise to insightful new routing phenomena, including phase transitions and scaling laws, that facilitate better understanding of the appropriate operational regimes and their limitations, which are difficult to obtain otherwise. PMID:23898198

From the physics of interacting polymers to optimizing routes on the London Underground.

PubMed

Yeung, Chi Ho; Saad, David; Wong, K Y Michael

2013-08-20

Optimizing paths on networks is crucial for many applications, ranging from subway traffic to Internet communication. Because global path optimization that takes account of all path choices simultaneously is computationally hard, most existing routing algorithms optimize paths individually, thus providing suboptimal solutions. We use the physics of interacting polymers and disordered systems to analyze macroscopic properties of generic path optimization problems and derive a simple, principled, generic, and distributed routing algorithm capable of considering all individual path choices simultaneously. We demonstrate the efficacy of the algorithm by applying it to: (i) random graphs resembling Internet overlay networks, (ii) travel on the London Underground network based on Oyster card data, and (iii) the global airport network. Analytically derived macroscopic properties give rise to insightful new routing phenomena, including phase transitions and scaling laws, that facilitate better understanding of the appropriate operational regimes and their limitations, which are difficult to obtain otherwise.

Finite Element Method-Based Kinematics and Closed-Loop Control of Soft, Continuum Manipulators.

PubMed

Bieze, Thor Morales; Largilliere, Frederick; Kruszewski, Alexandre; Zhang, Zhongkai; Merzouki, Rochdi; Duriez, Christian

2018-06-01

This article presents a modeling methodology and experimental validation for soft manipulators to obtain forward kinematic model (FKM) and inverse kinematic model (IKM) under quasi-static conditions (in the literature, these manipulators are usually classified as continuum robots. However, their main characteristic of interest in this article is that they create motion by deformation, as opposed to the classical use of articulations). It offers a way to obtain the kinematic characteristics of this type of soft robots that is suitable for offline path planning and position control. The modeling methodology presented relies on continuum mechanics, which does not provide analytic solutions in the general case. Our approach proposes a real-time numerical integration strategy based on finite element method with a numerical optimization based on Lagrange multipliers to obtain FKM and IKM. To reduce the dimension of the problem, at each step, a projection of the model to the constraint space (gathering actuators, sensors, and end-effector) is performed to obtain the smallest number possible of mathematical equations to be solved. This methodology is applied to obtain the kinematics of two different manipulators with complex structural geometry. An experimental comparison is also performed in one of the robots, between two other geometric approaches and the approach that is showcased in this article. A closed-loop controller based on a state estimator is proposed. The controller is experimentally validated and its robustness is evaluated using Lypunov stability method.

Smisc - A collection of miscellaneous functions

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

Landon Sego, PNNL

2015-08-31

A collection of functions for statistical computing and data manipulation. These include routines for rapidly aggregating heterogeneous matrices, manipulating file names, loading R objects, sourcing multiple R files, formatting datetimes, multi-core parallel computing, stream editing, specialized plotting, etc. Smisc-package A collection of miscellaneous functions allMissing Identifies missing rows or columns in a data frame or matrix as.numericSilent Silent wrapper for coercing a vector to numeric comboList Produces all possible combinations of a set of linear model predictors cumMax Computes the maximum of the vector up to the current index cumsumNA Computes the cummulative sum of a vector without propogating NAsmore » d2binom Probability functions for the sum of two independent binomials dataIn A flexible way to import data into R. dbb The Beta-Binomial Distribution df2list Row-wise conversion of a data frame to a list dfplapply Parallelized single row processing of a data frame dframeEquiv Examines the equivalence of two dataframes or matrices dkbinom Probability functions for the sum of k independent binomials factor2character Converts all factor variables in a dataframe to character variables findDepMat Identify linearly dependent rows or columns in a matrix formatDT Converts date or datetime strings into alternate formats getExtension Filename manipulations: remove the extension or path, extract the extension or path getPath Filename manipulations: remove the extension or path, extract the extension or path grabLast Filename manipulations: remove the extension or path, extract the extension or path ifelse1 Non-vectorized version of ifelse integ Simple numerical integration routine interactionPlot Two-way Interaction Plot with Error Bar linearMap Linear mapping of a numerical vector or scalar list2df Convert a list to a data frame loadObject Loads and returns the object(s) in an ".Rdata" file more Display the contents of a file to the R terminal movAvg2 Calculate the moving average using a 2-sided window openDevice Opens a graphics device based on the filename extension p2binom Probability functions for the sum of two independent binomials padZero Pad a vector of numbers with zeros parseJob Parses a collection of elements into (almost) equal sized groups pbb The Beta-Binomial Distribution pcbinom A continuous version of the binomial cdf pkbinom Probability functions for the sum of k independent binomials plapply Simple parallelization of lapply plotFun Plot one or more functions on a single plot PowerData An example of power data pvar Prints the name and value of one or more objects qbb The Beta-Binomial Distribution rbb And numerous others (space limits reporting).« less

Energy-Aware Multipath Routing Scheme Based on Particle Swarm Optimization in Mobile Ad Hoc Networks

PubMed Central

Robinson, Y. Harold; Rajaram, M.

2015-01-01

Mobile ad hoc network (MANET) is a collection of autonomous mobile nodes forming an ad hoc network without fixed infrastructure. Dynamic topology property of MANET may degrade the performance of the network. However, multipath selection is a great challenging task to improve the network lifetime. We proposed an energy-aware multipath routing scheme based on particle swarm optimization (EMPSO) that uses continuous time recurrent neural network (CTRNN) to solve optimization problems. CTRNN finds the optimal loop-free paths to solve link disjoint paths in a MANET. The CTRNN is used as an optimum path selection technique that produces a set of optimal paths between source and destination. In CTRNN, particle swarm optimization (PSO) method is primly used for training the RNN. The proposed scheme uses the reliability measures such as transmission cost, energy factor, and the optimal traffic ratio between source and destination to increase routing performance. In this scheme, optimal loop-free paths can be found using PSO to seek better link quality nodes in route discovery phase. PSO optimizes a problem by iteratively trying to get a better solution with regard to a measure of quality. The proposed scheme discovers multiple loop-free paths by using PSO technique. PMID:26819966

Analysis and manipulation of the induced changes in the state of polarization by mirror scanners.

PubMed

Petrova-Mayor, Anna; Knudsen, Sarah

2017-05-20

The induced polarization effects of metal-coated mirrors were studied in the configurations of one- and two-mirror lidar scanners as a function of azimuth and elevation angles. The theoretical results were verified experimentally for three types of mirrors (custom enhanced gold, off-the-shelf protected gold, and protected aluminum). A method was devised and tested to maintain a desired polarization state (linear or circular) of the transmit beam for all pointing directions by means of rotating wave plates in the transmit and detection paths. Alternatively, the mirror coating can be optimized to preserve the linear polarization state of the transmitted beam. The compensation methods will enable ground-based scanning lidars to produce absolutely calibrated depolarization measurements.

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

PubMed Central

Darling, Aaron E.

2009-01-01

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

Effect of a limited-enforcement intelligent tutoring system in dermatopathology on student errors, goals and solution paths.

PubMed

Payne, Velma L; Medvedeva, Olga; Legowski, Elizabeth; Castine, Melissa; Tseytlin, Eugene; Jukic, Drazen; Crowley, Rebecca S

2009-11-01

Determine effects of a limited-enforcement intelligent tutoring system in dermatopathology on student errors, goals and solution paths. Determine if limited enforcement in a medical tutoring system inhibits students from learning the optimal and most efficient solution path. Describe the type of deviations from the optimal solution path that occur during tutoring, and how these deviations change over time. Determine if the size of the problem-space (domain scope), has an effect on learning gains when using a tutor with limited enforcement. Analyzed data mined from 44 pathology residents using SlideTutor-a Medical Intelligent Tutoring System in Dermatopathology that teaches histopathologic diagnosis and reporting skills based on commonly used diagnostic algorithms. Two subdomains were included in the study representing sub-algorithms of different sizes and complexities. Effects of the tutoring system on student errors, goal states and solution paths were determined. Students gradually increase the frequency of steps that match the tutoring system's expectation of expert performance. Frequency of errors gradually declines in all categories of error significance. Student performance frequently differs from the tutor-defined optimal path. However, as students continue to be tutored, they approach the optimal solution path. Performance in both subdomains was similar for both errors and goal differences. However, the rate at which students progress toward the optimal solution path differs between the two domains. Tutoring in superficial perivascular dermatitis, the larger and more complex domain was associated with a slower rate of approximation towards the optimal solution path. Students benefit from a limited-enforcement tutoring system that leverages diagnostic algorithms but does not prevent alternative strategies. Even with limited enforcement, students converge toward the optimal solution path.

Dynamic dominance varies with handedness: reduced interlimb asymmetries in left-handers

PubMed Central

Przybyla, Andrzej; Good, David C.; Sainburg, Robert L.

2013-01-01

Our previous studies of interlimb asymmetries during reaching movements have given rise to the dynamic-dominance hypothesis of motor lateralization. This hypothesis proposes that dominant arm control has become optimized for efficient intersegmental coordination, which is often associated with straight and smooth hand-paths, while non-dominant arm control has become optimized for controlling steady-state posture, which has been associated with greater final position accuracy when movements are mechanically perturbed, and often during movements made in the absence of visual feedback. The basis for this model of motor lateralization was derived from studies conducted in right-handed subjects. We now ask whether left-handers show similar proficiencies in coordinating reaching movements. We recruited right- and left-handers (20 per group) to perform reaching movements to three targets, in which intersegmental coordination requirements varied systematically. Our results showed that the dominant arm of both left- and right-handers were well coordinated, as reflected by fairly straight hand-paths and low errors in initial direction. Consistent with our previous studies, the non-dominant arm of right-handers showed substantially greater curvature and large errors in initial direction, most notably to targets that elicited higher intersegmental interactions. While the right, non-dominant, hand-paths of left-handers were slightly more curved than those of the dominant arm, they were also substantially more accurate and better coordinated than the non-dominant arm of right-handers. Our results indicate a similar pattern, but reduced lateralization for intersegmental coordination in left-handers. These findings suggest that left-handers develop more coordinated control of their non-dominant arms than right-handers, possibly due to environmental pressure for right-handed manipulations. PMID:22113487

Dynamic dominance varies with handedness: reduced interlimb asymmetries in left-handers.

PubMed

Przybyla, Andrzej; Good, David C; Sainburg, Robert L

2012-02-01

Our previous studies of interlimb asymmetries during reaching movements have given rise to the dynamic-dominance hypothesis of motor lateralization. This hypothesis proposes that dominant arm control has become optimized for efficient intersegmental coordination, which is often associated with straight and smooth hand-paths, while non-dominant arm control has become optimized for controlling steady-state posture, which has been associated with greater final position accuracy when movements are mechanically perturbed, and often during movements made in the absence of visual feedback. The basis for this model of motor lateralization was derived from studies conducted in right-handed subjects. We now ask whether left-handers show similar proficiencies in coordinating reaching movements. We recruited right- and left-handers (20 per group) to perform reaching movements to three targets, in which intersegmental coordination requirements varied systematically. Our results showed that the dominant arm of both left- and right-handers were well coordinated, as reflected by fairly straight hand-paths and low errors in initial direction. Consistent with our previous studies, the non-dominant arm of right-handers showed substantially greater curvature and large errors in initial direction, most notably to targets that elicited higher intersegmental interactions. While the right, non-dominant, hand-paths of left-handers were slightly more curved than those of the dominant arm, they were also substantially more accurate and better coordinated than the non-dominant arm of right-handers. Our results indicate a similar pattern, but reduced lateralization for intersegmental coordination in left-handers. These findings suggest that left-handers develop more coordinated control of their non-dominant arms than right-handers, possibly due to environmental pressure for right-handed manipulations.

An improved multi-paths optimization method for video stabilization

NASA Astrophysics Data System (ADS)

Qin, Tao; Zhong, Sheng

2018-03-01

For video stabilization, the difference between original camera motion path and the optimized one is proportional to the cropping ratio and warping ratio. A good optimized path should preserve the moving tendency of the original one meanwhile the cropping ratio and warping ratio of each frame should be kept in a proper range. In this paper we use an improved warping-based motion representation model, and propose a gauss-based multi-paths optimization method to get a smoothing path and obtain a stabilized video. The proposed video stabilization method consists of two parts: camera motion path estimation and path smoothing. We estimate the perspective transform of adjacent frames according to warping-based motion representation model. It works well on some challenging videos where most previous 2D methods or 3D methods fail for lacking of long features trajectories. The multi-paths optimization method can deal well with parallax, as we calculate the space-time correlation of the adjacent grid, and then a kernel of gauss is used to weigh the motion of adjacent grid. Then the multi-paths are smoothed while minimize the crop ratio and the distortion. We test our method on a large variety of consumer videos, which have casual jitter and parallax, and achieve good results.

Research on cutting path optimization of sheet metal parts based on ant colony algorithm

NASA Astrophysics Data System (ADS)

Wu, Z. Y.; Ling, H.; Li, L.; Wu, L. H.; Liu, N. B.

2017-09-01

In view of the disadvantages of the current cutting path optimization methods of sheet metal parts, a new method based on ant colony algorithm was proposed in this paper. The cutting path optimization problem of sheet metal parts was taken as the research object. The essence and optimization goal of the optimization problem were presented. The traditional serial cutting constraint rule was improved. The cutting constraint rule with cross cutting was proposed. The contour lines of parts were discretized and the mathematical model of cutting path optimization was established. Thus the problem was converted into the selection problem of contour lines of parts. Ant colony algorithm was used to solve the problem. The principle and steps of the algorithm were analyzed.

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

Reister, D.B.

This paper uses the Pontryagin maximum principle to find time optimal paths for a constant speed unicycle. The time optimal paths consist of sequences of arcs of circles and straight lines. The maximum principle introduced concepts (dual variables, bang-bang solutions, singular solutions, and transversality conditions) that provide important insight into the nature of the time optimal paths. 10 refs., 6 figs.

Trajectory planning and control of a 6 DOF manipulator with Stewart platform-based mechanism

NASA Technical Reports Server (NTRS)

Nguyen, Charles C.; Antrazi, Sami

1990-01-01

The trajectory planning and control was studied of a robot manipulator that has 6 degrees of freedom and was designed based on the mechanism of the Stewart Platform. First the main components of the manipulator is described along with its operation. The solutions are briefly prescribed for the forward and inverse kinematics of the manipulator. After that, two trajectory planning schemes are developed using the manipulator inverse kinematics to track straight lines and circular paths. Finally experiments conducted to study the performance of the developed planning schemes in tracking a straight line and a circle are presented and discussed.

Optimal impulsive time-fixed orbital rendezvous and interception with path constraints

NASA Technical Reports Server (NTRS)

Taur, D.-R.; Prussing, J. E.; Coverstone-Carroll, V.

1990-01-01

Minimum-fuel, impulsive, time-fixed solutions are obtained for the problem of orbital rendezvous and interception with interior path constraints. Transfers between coplanar circular orbits in an inverse-square gravitational field are considered, subject to a circular path constraint representing a minimum or maximum permissible orbital radius. Primer vector theory is extended to incorporate path constraints. The optimal number of impulses, their times and positions, and the presence of initial or final coasting arcs are determined. The existence of constraint boundary arcs and boundary points is investigated as well as the optimality of a class of singular arc solutions. To illustrate the complexities introduced by path constraints, an analysis is made of optimal rendezvous in field-free space subject to a minimum radius constraint.

An optimal resolved rate law for kindematically redundant manipulators

NASA Technical Reports Server (NTRS)

Bourgeois, B. J.

1987-01-01

The resolved rate law for a manipulator provides the instantaneous joint rates required to satisfy a given instantaneous hand motion. When the joint space has more degrees of freedom than the task space, the manipulator is kinematically redundant and the kinematic rate equations are underdetermined. These equations can be locally optimized, but the resulting pseudo-inverse solution was found to cause large joint rates in some case. A weighting matrix in the locally optimized (pseudo-inverse) solution is dynamically adjusted to control the joint motion as desired. Joint reach limit avoidance is demonstrated in a kinematically redundant planar arm model. The treatment is applicable to redundant manipulators with any number of revolute joints and to nonplanar manipulators.

Challenging prior evidence for a shared syntactic processor for language and music.

PubMed

Perruchet, Pierre; Poulin-Charronnat, Bénédicte

2013-04-01

A theoretical landmark in the growing literature comparing language and music is the shared syntactic integration resource hypothesis (SSIRH; e.g., Patel, 2008), which posits that the successful processing of linguistic and musical materials relies, at least partially, on the mastery of a common syntactic processor. Supporting the SSIRH, Slevc, Rosenberg, and Patel (Psychonomic Bulletin & Review 16(2):374-381, 2009) recently reported data showing enhanced syntactic garden path effects when the sentences were paired with syntactically unexpected chords, whereas the musical manipulation had no reliable effect on the processing of semantic violations. The present experiment replicated Slevc et al.'s (2009) procedure, except that syntactic garden paths were replaced with semantic garden paths. We observed the very same interactive pattern of results. These findings suggest that the element underpinning interactions is the garden path configuration, rather than the implication of an alleged syntactic module. We suggest that a different amount of attentional resources is recruited to process each type of linguistic manipulations, hence modulating the resources left available for the processing of music and, consequently, the effects of musical violations.

Research on NC laser combined cutting optimization model of sheet metal parts

NASA Astrophysics Data System (ADS)

Wu, Z. Y.; Zhang, Y. L.; Li, L.; Wu, L. H.; Liu, N. B.

2017-09-01

The optimization problem for NC laser combined cutting of sheet metal parts was taken as the research object in this paper. The problem included two contents: combined packing optimization and combined cutting path optimization. In the problem of combined packing optimization, the method of “genetic algorithm + gravity center NFP + geometric transformation” was used to optimize the packing of sheet metal parts. In the problem of combined cutting path optimization, the mathematical model of cutting path optimization was established based on the parts cutting constraint rules of internal contour priority and cross cutting. The model played an important role in the optimization calculation of NC laser combined cutting.

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.

Generic Equations for Constructing Smooth Paths Along Circles and Tangent Lines With Application to Airport Ground Paths

NASA Technical Reports Server (NTRS)

Barker, L. Keith

1998-01-01

The primary purpose of this publication is to develop a mathematical model to describe smooth paths along any combination of circles and tangent lines. Two consecutive circles in a path are either tangent (externally or internally) or they appear on the same (lateral) or opposite (transverse) sides of a connecting tangent line. A path may start or end on either a segment or circle. The approach is to use mathematics common to robotics to design the path as a multilink manipulator. This approach allows a hierarchical view of the problem and keeps the notation manageable. A user simply specifies a few parameters to configure a path. Necessary and sufficient conditions automatically ensure the consistency of the inputs for a smooth path. Two example runway exit paths are given, and an angle to go assists in knowing when to switch from one path element to the next.

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.

Calibration, Information, and Control Strategies for Braking to Avoid a Collision

ERIC Educational Resources Information Center

Fajen, Brett R.

2005-01-01

This study explored visual control strategies for braking to avoid collision by manipulating information about speed of self-motion. Participants watched computer-generated displays and used a brake to stop at an object in the path of motion. Global optic flow rate and edge rate were manipulated by adjusting eyeheight and ground-texture size.…

An optimal resolved rate law for kinematically redundant manipulators

NASA Technical Reports Server (NTRS)

Bourgeois, B. J.

1987-01-01

The resolved rate law for a manipulator provides the instantaneous joint rates required to satisfy a given instantaneous hand motion. When the joint space has more degrees of freedom than the task space, the manipulator is kinematically redundant and the kinematic rate equations are underdetermined. These equations can be locally optimized, but the resulting pseudo-inverse solution has been found to cause large joint rates in some cases. A weighting matrix in the locally optimized (pseudo-inverse) solution is dynamically adjusted to control the joint motion as desired. Joint reach limit avoidance is demonstrated in a kinematically redundant planar arm model. The treatment is applicable to redundant manipulators with any number of revolute joints and to non-planar manipulators.

Energy-optimal path planning in the coastal ocean

NASA Astrophysics Data System (ADS)

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

2017-05-01

We integrate data-driven ocean modeling with the stochastic Dynamically Orthogonal (DO) level-set optimization methodology to compute and study energy-optimal paths, speeds, and headings for ocean vehicles in the Middle-Atlantic Bight (MAB) region. We hindcast the energy-optimal paths from among exact time-optimal paths for the period 28 August 2006 to 9 September 2006. To do so, we first obtain a data-assimilative multiscale reanalysis, combining ocean observations with implicit two-way nested multiresolution primitive-equation simulations of the tidal-to-mesoscale dynamics in the region. Second, we solve the reduced-order stochastic DO level-set partial differential equations (PDEs) to compute the joint probability of minimum arrival time, vehicle-speed time series, and total energy utilized. Third, for each arrival time, we select the vehicle-speed time series that minimize the total energy utilization from the marginal probability of vehicle-speed and total energy. The corresponding energy-optimal path and headings are obtained through the exact particle-backtracking equation. Theoretically, the present methodology is PDE-based and provides fundamental energy-optimal predictions without heuristics. Computationally, it is 3-4 orders of magnitude faster than direct Monte Carlo methods. For the missions considered, we analyze the effects of the regional tidal currents, strong wind events, coastal jets, shelfbreak front, and other local circulations on the energy-optimal paths. Results showcase the opportunities for vehicles that intelligently utilize the ocean environment to minimize energy usage, rigorously integrating ocean forecasting with optimal control of autonomous vehicles.

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.

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

An engineering optimization method with application to STOL-aircraft approach and landing trajectories

NASA Technical Reports Server (NTRS)

Jacob, H. G.

1972-01-01

An optimization method has been developed that computes the optimal open loop inputs for a dynamical system by observing only its output. The method reduces to static optimization by expressing the inputs as series of functions with parameters to be optimized. Since the method is not concerned with the details of the dynamical system to be optimized, it works for both linear and nonlinear systems. The method and the application to optimizing longitudinal landing paths for a STOL aircraft with an augmented wing are discussed. Noise, fuel, time, and path deviation minimizations are considered with and without angle of attack, acceleration excursion, flight path, endpoint, and other constraints.

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

Investigation of progressive failure robustness and alternate load paths for damage tolerant structures

NASA Astrophysics Data System (ADS)

Marhadi, Kun Saptohartyadi

Structural optimization for damage tolerance under various unforeseen damage scenarios is computationally challenging. It couples non-linear progressive failure analysis with sampling-based stochastic analysis of random damage. The goal of this research was to understand the relationship between alternate load paths available in a structure and its damage tolerance, and to use this information to develop computationally efficient methods for designing damage tolerant structures. Progressive failure of a redundant truss structure subjected to small random variability was investigated to identify features that correlate with robustness and predictability of the structure's progressive failure. The identified features were used to develop numerical surrogate measures that permit computationally efficient deterministic optimization to achieve robustness and predictability of progressive failure. Analysis of damage tolerance on designs with robust progressive failure indicated that robustness and predictability of progressive failure do not guarantee damage tolerance. Damage tolerance requires a structure to redistribute its load to alternate load paths. In order to investigate the load distribution characteristics that lead to damage tolerance in structures, designs with varying degrees of damage tolerance were generated using brute force stochastic optimization. A method based on principal component analysis was used to describe load distributions (alternate load paths) in the structures. Results indicate that a structure that can develop alternate paths is not necessarily damage tolerant. The alternate load paths must have a required minimum load capability. Robustness analysis of damage tolerant optimum designs indicates that designs are tailored to specified damage. A design Optimized under one damage specification can be sensitive to other damages not considered. Effectiveness of existing load path definitions and characterizations were investigated for continuum structures. A load path definition using a relative compliance change measure (U* field) was demonstrated to be the most useful measure of load path. This measure provides quantitative information on load path trajectories and qualitative information on the effectiveness of the load path. The use of the U* description of load paths in optimizing structures for effective load paths was investigated.

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.

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 General Design Rule to Manipulate Photocarrier Transport Path in Solar Cells and Its Realization by the Plasmonic-Electrical Effect

NASA Astrophysics Data System (ADS)

Sha, Wei E. I.; Zhu, Hugh L.; Chen, Luzhou; Chew, Weng Cho; Choy, Wallace C. H.

2015-02-01

It is well known that transport paths of photocarriers (electrons and holes) before collected by electrodes strongly affect bulk recombination and thus electrical properties of solar cells, including open-circuit voltage and fill factor. For boosting device performance, a general design rule, tailored to arbitrary electron to hole mobility ratio, is proposed to decide the transport paths of photocarriers. Due to a unique ability to localize and concentrate light, plasmonics is explored to manipulate photocarrier transport through spatially redistributing light absorption at the active layer of devices. Without changing the active materials, we conceive a plasmonic-electrical concept, which tunes electrical properties of solar cells via the plasmon-modified optical field distribution, to realize the design rule. Incorporating spectrally and spatially configurable metallic nanostructures, thin-film solar cells are theoretically modelled and experimentally fabricated to validate the design rule and verify the plasmonic-tunable electrical properties. The general design rule, together with the plasmonic-electrical effect, contributes to the evolution of emerging photovoltaics.

Does Making Something Move Matter? Representations of Goals and Sources in Motion Events with Causal Sources

ERIC Educational Resources Information Center

Lakusta, Laura; Muentener, Paul; Petrillo, Lauren; Mullanaphy, Noelle; Muniz, Lauren

2017-01-01

Previous studies have shown a robust bias to express the goal path over the source path when describing events ("the bird flew into the pitcher," rather than "… out of the bucket into the pitcher"). Motivated by linguistic theory, this study manipulated the causal structure of events (specifically, making the source cause the…

Laser Cutting

DTIC Science & Technology

1988-06-01

gantry configuration, however, presents a cage-like barrier to the rapid loading and unloading of workpieces such as automobile bodies or body...assemblies almost as large as an automobile . System controls can follow cutting paths within a few thousandths of an inch while producing such path detail...are often called robots. Indeed, they meet the RIA* definition of an industrial robot as follows: "A reprogrammable multifunctional manipulator designed

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.

Time optimized path-choice in the termite hunting ant Megaponera analis.

PubMed

Frank, Erik T; Hönle, Philipp O; Linsenmair, K Eduard

2018-05-10

Trail network systems among ants have received a lot of scientific attention due to their various applications in problem solving of networks. Recent studies have shown that ants select the fastest available path when facing different velocities on different substrates, rather than the shortest distance. The progress of decision-making by these ants is determined by pheromone-based maintenance of paths, which is a collective decision. However, path optimization through individual decision-making remains mostly unexplored. Here we present the first study of time-optimized path selection via individual decision-making by scout ants. Megaponera analis scouts search for termite foraging sites and lead highly organized raid columns to them. The path of the scout determines the path of the column. Through installation of artificial roads around M. analis nests we were able to influence the pathway choice of the raids. After road installation 59% of all recorded raids took place completely or partly on the road, instead of the direct, i.e. distance-optimized, path through grass from the nest to the termites. The raid velocity on the road was more than double the grass velocity, the detour thus saved 34.77±23.01% of the travel time compared to a hypothetical direct path. The pathway choice of the ants was similar to a mathematical model of least time allowing us to hypothesize the underlying mechanisms regulating the behavior. Our results highlight the importance of individual decision-making in the foraging behavior of ants and show a new procedure of pathway optimization. © 2018. Published by The Company of Biologists Ltd.

Smell Detection Agent Based Optimization Algorithm

NASA Astrophysics Data System (ADS)

Vinod Chandra, S. S.

2016-09-01

In this paper, a novel nature-inspired optimization algorithm has been employed and the trained behaviour of dogs in detecting smell trails is adapted into computational agents for problem solving. The algorithm involves creation of a surface with smell trails and subsequent iteration of the agents in resolving a path. This algorithm can be applied in different computational constraints that incorporate path-based problems. Implementation of the algorithm can be treated as a shortest path problem for a variety of datasets. The simulated agents have been used to evolve the shortest path between two nodes in a graph. This algorithm is useful to solve NP-hard problems that are related to path discovery. This algorithm is also useful to solve many practical optimization problems. The extensive derivation of the algorithm can be enabled to solve shortest path problems.

On the dynamic singularities in the control of free-floating space manipulators

NASA Technical Reports Server (NTRS)

Papadopoulos, E.; Dubowsky, S.

1989-01-01

It is shown that free-floating space manipulator systems have configurations which are dynamically singular. At a dynamically singular position, the manipulator is unable to move its end effector in some direction. This problem appears in any free-floating space manipulator system that permits the vehicle to move in response to manipulator motion without correction from the vehicle's attitude control system. Dynamic singularities are functions of the dynamic properties of the system; their existence and locations cannot be predicted solely from the kinematic structure of the manipulator, unlike the singularities for fixed base manipulators. It is also shown that the location of these dynamic singularities in the workplace is dependent upon the path taken by the manipulator in reaching them. Dynamic singularities must be considered in the control, planning and design of free-floating space manipulator systems. A method for calculating these dynamic singularities is presented, and it is shown that the system parameters can be selected to reduce the effect of dynamic singularities on a system's performance.

Codification of scan path parameters and development of perimeter scan strategies for 3D bowl-shaped laser forming

NASA Astrophysics Data System (ADS)

Tavakoli, A.; Naeini, H. Moslemi; Roohi, Amir H.; Gollo, M. Hoseinpour; Shahabad, Sh. Imani

2018-01-01

In the 3D laser forming process, developing an appropriate laser scan pattern for producing specimens with high quality and uniformity is critical. This study presents certain principles for developing scan paths. Seven scan path parameters are considered, including: (1) combined linear or curved path; (2) type of combined linear path; (3) order of scan sequences; (4) the position of the start point in each scan; (5) continuous or discontinuous scan path; (6) direction of scan path; and (7) angular arrangement of combined linear scan paths. Regarding these path parameters, ten combined linear scan patterns are presented. Numerical simulations show continuous hexagonal, scan pattern, scanning from outer to inner path, is the optimized. In addition, it is observed the position of the start point and the angular arrangement of scan paths is the most effective path parameters. Also, further experimentations show four sequences due to creat symmetric condition enhance the height of the bowl-shaped products and uniformity. Finally, the optimized hexagonal pattern was compared with the similar circular one. In the hexagonal scan path, distortion value and standard deviation rather to edge height of formed specimen is very low, and the edge height despite of decreasing length of scan path increases significantly compared to the circular scan path. As a result, four-sequence hexagonal scan pattern is proposed as the optimized perimeter scan path to produce bowl-shaped product.

Self-organization and solution of shortest-path optimization problems with memristive networks

NASA Astrophysics Data System (ADS)

Pershin, Yuriy V.; Di Ventra, Massimiliano

2013-07-01

We show that memristive networks, namely networks of resistors with memory, can efficiently solve shortest-path optimization problems. Indeed, the presence of memory (time nonlocality) promotes self organization of the network into the shortest possible path(s). We introduce a network entropy function to characterize the self-organized evolution, show the solution of the shortest-path problem and demonstrate the healing property of the solution path. Finally, we provide an algorithm to solve the traveling salesman problem. Similar considerations apply to networks of memcapacitors and meminductors, and networks with memory in various dimensions.

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

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

Quad-rotor flight path energy optimization

NASA Astrophysics Data System (ADS)

Kemper, Edward

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

Better with Byzantine: Manipulation-Optimal Mechanisms

NASA Astrophysics Data System (ADS)

Othman, Abraham; Sandholm, Tuomas

A mechanism is manipulable if it is in some agents’ best interest to misrepresent their private information. The revelation principle establishes that, roughly, anything that can be accomplished by a manipulable mechanism can also be accomplished with a truthful mechanism. Yet agents often fail to play their optimal manipulations due to computational limitations or various flavors of incompetence and cognitive biases. Thus, manipulable mechanisms in particular should anticipate byzantine play. We study manipulation-optimal mechanisms: mechanisms that are undominated by truthful mechanisms when agents act fully rationally, and do better than any truthful mechanism if any agent fails to act rationally in any way. This enables the mechanism designer to do better than the revelation principle would suggest, and obviates the need to predict byzantine agents’ irrational behavior. We prove a host of possibility and impossibility results for the concept which have the impression of broadly limiting possibility. These results are largely in line with the revelation principle, although the considerations are more subtle and the impossibility not universal.

Numerical approach of collision avoidance and optimal control on robotic manipulators

NASA Technical Reports Server (NTRS)

Wang, Jyhshing Jack

1990-01-01

Collision-free optimal motion and trajectory planning for robotic manipulators are solved by a method of sequential gradient restoration algorithm. Numerical examples of a two degree-of-freedom (DOF) robotic manipulator are demonstrated to show the excellence of the optimization technique and obstacle avoidance scheme. The obstacle is put on the midway, or even further inward on purpose, of the previous no-obstacle optimal trajectory. For the minimum-time purpose, the trajectory grazes by the obstacle and the minimum-time motion successfully avoids the obstacle. The minimum-time is longer for the obstacle avoidance cases than the one without obstacle. The obstacle avoidance scheme can deal with multiple obstacles in any ellipsoid forms by using artificial potential fields as penalty functions via distance functions. The method is promising in solving collision-free optimal control problems for robotics and can be applied to any DOF robotic manipulators with any performance indices and mobile robots as well. Since this method generates optimum solution based on Pontryagin Extremum Principle, rather than based on assumptions, the results provide a benchmark against which any optimization techniques can be measured.

Local performance optimization for a class of redundant eight-degree-of-freedom manipulators

NASA Technical Reports Server (NTRS)

Williams, Robert L., II

1994-01-01

Local performance optimization for joint limit avoidance and manipulability maximization (singularity avoidance) is obtained by using the Jacobian matrix pseudoinverse and by projecting the gradient of an objective function into the Jacobian null space. Real-time redundancy optimization control is achieved for an eight-joint redundant manipulator having a three-axis spherical shoulder, a single elbow joint, and a four-axis spherical wrist. Symbolic solutions are used for both full-Jacobian and wrist-partitioned pseudoinverses, partitioned null-space projection matrices, and all objective function gradients. A kinematic limitation of this class of manipulators and the limitation's effect on redundancy resolution are discussed. Results obtained with graphical simulation are presented to demonstrate the effectiveness of local redundant manipulator performance optimization. Actual hardware experiments performed to verify the simulated results are also discussed. A major result is that the partitioned solution is desirable because of low computation requirements. The partitioned solution is suboptimal compared with the full solution because translational and rotational terms are optimized separately; however, the results show that the difference is not significant. Singularity analysis reveals that no algorithmic singularities exist for the partitioned solution. The partitioned and full solutions share the same physical manipulator singular conditions. When compared with the full solution, the partitioned solution is shown to be ill-conditioned in smaller neighborhoods of the shared singularities.

Spatio-Temporal Structure, Path Characteristics, and Perceptual Grouping in Immediate Serial Spatial Recall

PubMed Central

De Lillo, Carlo; Kirby, Melissa; Poole, Daniel

2016-01-01

Immediate serial spatial recall measures the ability to retain sequences of locations in short-term memory and is considered the spatial equivalent of digit span. It is tested by requiring participants to reproduce sequences of movements performed by an experimenter or displayed on a monitor. Different organizational factors dramatically affect serial spatial recall but they are often confounded or underspecified. Untangling them is crucial for the characterization of working-memory models and for establishing the contribution of structure and memory capacity to spatial span. We report five experiments assessing the relative role and independence of factors that have been reported in the literature. Experiment 1 disentangled the effects of spatial clustering and path-length by manipulating the distance of items displayed on a touchscreen monitor. Long-path sequences segregated by spatial clusters were compared with short-path sequences not segregated by clusters. Recall was more accurate for sequences segregated by clusters independently from path-length. Experiment 2 featured conditions where temporal pauses were introduced between or within cluster boundaries during the presentation of sequences with the same paths. Thus, the temporal structure of the sequences was either consistent or inconsistent with a hierarchical representation based on segmentation by spatial clusters but the effect of structure could not be confounded with effects of path-characteristics. Pauses at cluster boundaries yielded more accurate recall, as predicted by a hierarchical model. In Experiment 3, the systematic manipulation of sequence structure, path-length, and presence of path-crossings of sequences showed that structure explained most of the variance, followed by the presence/absence of path-crossings, and path-length. Experiments 4 and 5 replicated the results of the previous experiments in immersive virtual reality navigation tasks where the viewpoint of the observer changed dynamically during encoding and recall. This suggested that the effects of structure in spatial span are not dependent on perceptual grouping processes induced by the aerial view of the stimulus array typically afforded by spatial recall tasks. These results demonstrate the independence of coding strategies based on structure from effects of path characteristics and perceptual grouping in immediate serial spatial recall. PMID:27891101

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

Which environmental factors most strongly influence a street's appeal for bicycle transport among adults? A conjoint study using manipulated photographs.

PubMed

Mertens, Lieze; Van Dyck, Delfien; Ghekiere, Ariane; De Bourdeaudhuij, Ilse; Deforche, Benedicte; Van de Weghe, Nico; Van Cauwenberg, Jelle

2016-09-01

Micro-environmental factors (specific features within a streetscape), instead of macro-environmental factors (urban planning features), are more feasible to modify in existing neighborhoods and thus more practical to target for environmental interventions. Because it is often not possible to change the whole micro-environment at once, the current study aims to determine which micro-environmental factors should get the priority to target in physical environmental interventions increasing bicycle transport. Additionally, interaction effects among micro-environmental factors on the street's appeal for bicycle transport will be determined. In total, 1950 middle-aged adults completed a web-based questionnaire consisting of a set of 12 randomly assigned choice tasks with manipulated photographs. Seven micro-environmental factors (type of cycle path, speed limit, speed bump, vegetation, evenness of the cycle path surface, general upkeep and traffic density) were manipulated in each photograph. Conjoint analysis was used to analyze the data. Providing streets with a cycle path separated from motorized traffic seems to be the best strategy to increase the street's appeal for adults' bicycle transport. If this adjustment is not practically feasible, micro-environmental factors related to safety (i.e. speed limit, traffic density) may be more effective in promoting bicycle transport than micro-environmental factors related to comfort (i.e. evenness of the cycle path surface) or aesthetic (i.e. vegetation, general upkeep). On the other hand, when a more separated cycle path is already provided, micro-environmental factors related to comfort or aesthetic appeared to become more prominent. Findings obtained from this research could provide advice to physical environmental interventions about which environmental factors should get priority to modify in different environmental situations. The study was approved by the Ethics Committee of the Ghent University Hospital. B670201318588. Registered at 04/10/2013. http://www.ugent.be/ge/nl/faculteit/raden/ec.

Teleconnection Paths via Climate Network Direct Link Detection.

PubMed

Zhou, Dong; Gozolchiani, Avi; Ashkenazy, Yosef; Havlin, Shlomo

2015-12-31

Teleconnections describe remote connections (typically thousands of kilometers) of the climate system. These are of great importance in climate dynamics as they reflect the transportation of energy and climate change on global scales (like the El Niño phenomenon). Yet, the path of influence propagation between such remote regions, and weighting associated with different paths, are only partially known. Here we propose a systematic climate network approach to find and quantify the optimal paths between remotely distant interacting locations. Specifically, we separate the correlations between two grid points into direct and indirect components, where the optimal path is found based on a minimal total cost function of the direct links. We demonstrate our method using near surface air temperature reanalysis data, on identifying cross-latitude teleconnections and their corresponding optimal paths. The proposed method may be used to quantify and improve our understanding regarding the emergence of climate patterns on global scales.

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.

Thin-film-transistor array: an exploratory attempt for high throughput cell manipulation using electrowetting principle

NASA Astrophysics Data System (ADS)

Shaik, F. Azam; Cathcart, G.; Ihida, S.; Lereau-Bernier, M.; Leclerc, E.; Sakai, Y.; Toshiyoshi, H.; Tixier-Mita, A.

2017-05-01

In lab-on-a-chip (LoC) devices, microfluidic displacement of liquids is a key component. electrowetting on dielectric (EWOD) is a technique to move fluids, with the advantage of not requiring channels, pumps or valves. Fluids are discretized into droplets on microelectrodes and moved by applying an electric field via the electrodes to manipulate the contact angle. Micro-objects, such as biological cells, can be transported inside of these droplets. However, the design of conventional microelectrodes, made by standard micro-fabrication techniques, fixes the path of the droplets, and limits the reconfigurability of paths and thus limits the parallel processing of droplets. In that respect, thin film transistor (TFT) technology presents a great opportunity as it allows infinitely reconfigurable paths, with high parallelizability. We propose here to investigate the possibility of using TFT array devices for high throughput cell manipulation using EWOD. A COMSOL based 2D simulation coupled with a MATLAB algorithm was used to simulate the contact angle modulation, displacement and mixing of droplets. These simulations were confirmed by experimental results. The EWOD technique was applied to a droplet of culture medium containing HepG2 carcinoma cells and demonstrated no negative effects on the viability of the cells. This confirms the possibility of applying EWOD techniques to cellular applications, such as parallel cell analysis.

Path optimization method for the sign problem

NASA Astrophysics Data System (ADS)

Ohnishi, Akira; Mori, Yuto; Kashiwa, Kouji

2018-03-01

We propose a path optimization method (POM) to evade the sign problem in the Monte-Carlo calculations for complex actions. Among many approaches to the sign problem, the Lefschetz-thimble path-integral method and the complex Langevin method are promising and extensively discussed. In these methods, real field variables are complexified and the integration manifold is determined by the flow equations or stochastically sampled. When we have singular points of the action or multiple critical points near the original integral surface, however, we have a risk to encounter the residual and global sign problems or the singular drift term problem. One of the ways to avoid the singular points is to optimize the integration path which is designed not to hit the singular points of the Boltzmann weight. By specifying the one-dimensional integration-path as z = t +if(t)(f ɛ R) and by optimizing f(t) to enhance the average phase factor, we demonstrate that we can avoid the sign problem in a one-variable toy model for which the complex Langevin method is found to fail. In this proceedings, we propose POM and discuss how we can avoid the sign problem in a toy model. We also discuss the possibility to utilize the neural network to optimize the path.

Serpentine Ultralong Path with Extended Routing (SUPER) High Resolution Traveling Wave Ion Mobility-MS using Structures for Lossless Ion Manipulations

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

Deng, Liulin; Webb, Ian K.; Garimella, Sandilya V. B.

Ion mobility (IM) separations have a broad range of analytical applications, but insufficient resolution limits many applications. Here we report on traveling wave (TW) ion mobility (IM) separations in a Serpentine Ultra-long Path with Extended Routing (SUPER) Structures for Lossless Ion Manipulations (SLIM) module in conjunction with mass spectrometry (MS). The extended routing utilized multiple passes was facilitated by the introduction of a lossless ion switch at the end of the ion path that either directed ions to the MS detector or to another pass through the serpentine separation region, providing theoretically unlimited TWIM path lengths. Ions were confined inmore » the SLIM by rf fields in conjunction with a DC guard bias, enabling essentially lossless TW transmission over greatly extended paths (e.g., ~1094 meters over 81 passes through the 13.5 m serpentine path). In this multi-pass SUPER TWIM provided resolution approximately proportional to the square root of the number of passes (or path length). More than 30-fold higher IM resolution for Agilent tuning mix m/z 622 and 922 ions (~340 vs. ~10) was achieved for 40 passes compared to commercially available drift tube IM and other TWIM-based platforms. An initial evaluation of the isomeric sugars Lacto-N-hexaose and Lacto-N-neohexaose showed the isomeric structures to be baseline resolved, and a new conformational feature for Lacto-N-neohexaose was revealed after 9 passes. The new SLIM SUPER high resolution TWIM platform has broad utility in conjunction with MS and is expected to enable a broad range of previously challenging or intractable separations.« less

Design of Quiet Rotorcraft Approach Trajectories

NASA Technical Reports Server (NTRS)

Padula, Sharon L.; Burley, Casey L.; Boyd, D. Douglas, Jr.; Marcolini, Michael A.

2009-01-01

A optimization procedure for identifying quiet rotorcraft approach trajectories is proposed and demonstrated. The procedure employs a multi-objective genetic algorithm in order to reduce noise and create approach paths that will be acceptable to pilots and passengers. The concept is demonstrated by application to two different helicopters. The optimized paths are compared with one another and to a standard 6-deg approach path. The two demonstration cases validate the optimization procedure but highlight the need for improved noise prediction techniques and for additional rotorcraft acoustic data sets.

Converging Towards the Optimal Path to Extinction

DTIC Science & Technology

2011-01-01

the reproductive rate R0 should be greater than but very close to 1. However, most real diseases have R0 larger than 1.5, which translates into a...can analytically find an expression for the action along the optimal path. The expression for the action is a function of k and the reproductive number...the optimal path for a range of values of the reproductive number R0. In contrast to the prior two examples, here the action must be computed

Simulation study on dynamics model of two kinds of on-orbit soft-contact mechanism

NASA Astrophysics Data System (ADS)

Ye, X.; Dong, Z. H.; Yang, F.

2018-05-01

Aiming at the problem that the operating conditions of the space manipulator is harsh and the space manipulator could not bear the large collision momentum, this paper presents a new concept and technical method, namely soft contact technology. Based on ADAMS dynamics software, this paper compares and simulates the mechanism model of on-orbit soft-contact mechanism based on the bionic model and the integrated double joint model. The main purpose is to verify the path planning ability and the momentum buffering ability based on the different design concept mechanism. The simulation results show that both the two mechanism models have the path planning function before the space target contact, and also has the momentum buffer and controllability during the space target contact process.

Mobility-Resolved Ion Selection in Uniform Drift Field Ion Mobility Spectrometry/Mass Spectrometry: Dynamic Switching in Structures for Lossless Ion Manipulations

DOE PAGES

Webb, Ian K.; Garimella, Sandilya V. B.; Tolmachev, Aleksey V.; ...

2014-09-15

A Structures for Lossless Ion Manipulations (SLIM) module that allows ion mobility separations and the switching of ions between alternative drift paths is described. The SLIM switch component has a “Tee” configuration and allows switching of ions between a linear path and a 90-degree bend. By controlling switching times, ions can be deflected to an alternative channel as a function of their mobilities. In the initial evaluation the switch is used in a static mode and shown compatible with high performance ion mobility separations at 4 torr. In the “dynamic mode” we show that mobility-selected ions can be switched intomore » the alternative channel, and that various ion species can be independently selected based on their mobilities for time-of-flight mass spectrometer (TOF MS) IMS detection and mass analysis. Ultimately, this development also provides the basis for e.g. the selection of specific mobilities for storage and accumulation, and key modules for the assembly of SLIM devices enabling much more complex sequences of ion manipulations.« less

Characterization of applied fields for ion mobility in traveling wave based structures for lossless ion manipulations (SLIM)

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

Hamid, Ahmed M.; Prabhakaran Nair Syamala Amma, Aneesh; Garimella, Venkata BS

2018-03-21

Ion mobility (IM) is rapidly gaining attention for the analysis of biomolecules due to the ability to distinguish the shapes of ions. However, conventional constant electric field drift tube IM has limited resolving power, constrained by practical limitations on the path length and maximum applied voltage. The implementation of traveling waves (TW) in IM removes the latter limitation, allowing higher resolution to be achieved using extended path lengths. These can be readily obtainable in structures for lossless ion manipulations (SLIM), which are fabricated from electric fields that are generated by appropriate potentials applied to arrays of electrodes patterned on twomore » parallel surfaces. In this work we have investigated the relationship between the various SLIM variables, such as electrode dimensions, inter-surface gap, and the TW applied voltages, that directly impact the fields experienced by ions. Ion simulation and theoretical calculations have been utilized to understand the dependence of SLIM geometry and effective electric field. The variables explored impact both ion confinement and the observed IM resolution in Structures for Lossless Ion Manipulations (SLIM) modules.« less

Characterization of applied fields for ion mobility separations in traveling wave based structures for lossless ion manipulations (SLIM)

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

Hamid, Ahmed M.; Prabhakaran, Aneesh; Garimella, Sandilya V. B.

Ion mobility (IM) is rapidly gaining attention for the analysis of biomolecules due to the ability to distinguish the shapes of ions. However, conventional constant electric field drift tube IM has limited resolving power, constrained by practical limitations on the path length and maximum applied voltage. The implementation of traveling waves (TW) in IM removes the latter limitation, allowing higher resolution to be achieved using extended path lengths. These can be readily obtainable in structures for lossless ion manipulations (SLIM), which are fabricated from electric fields that are generated by appropriate potentials applied to arrays of electrodes patterned on twomore » parallel surfaces. In this work we have investigated the relationship between the various SLIM variables, such as electrode dimensions, inter-surface gap, and the TW applied voltages, that directly impact the fields experienced by ions. Ion simulation and theoretical calculations have been utilized to understand the dependence of SLIM geometry and effective electric field. The variables explored impact both ion confinement and the observed IM resolution in Structures for Lossless Ion Manipulations (SLIM) modules.« less

Robust Flight Path Determination for Mars Precision Landing Using Genetic Algorithms

NASA Technical Reports Server (NTRS)

Bayard, David S.; Kohen, Hamid

1997-01-01

This paper documents the application of genetic algorithms (GAs) to the problem of robust flight path determination for Mars precision landing. The robust flight path problem is defined here as the determination of the flight path which delivers a low-lift open-loop controlled vehicle to its desired final landing location while minimizing the effect of perturbations due to uncertainty in the atmospheric model and entry conditions. The genetic algorithm was capable of finding solutions which reduced the landing error from 111 km RMS radial (open-loop optimal) to 43 km RMS radial (optimized with respect to perturbations) using 200 hours of computation on an Ultra-SPARC workstation. Further reduction in the landing error is possible by going to closed-loop control which can utilize the GA optimized paths as nominal trajectories for linearization.

In Search of the Optimal Path: How Learners at Task Use an Online Dictionary

ERIC Educational Resources Information Center

Hamel, Marie-Josee

2012-01-01

We have analyzed circa 180 navigation paths followed by six learners while they performed three language encoding tasks at the computer using an online dictionary prototype. Our hypothesis was that learners who follow an "optimal path" while navigating within the dictionary, using its search and look-up functions, would have a high chance of…

A systematic FPGA acceleration design for applications based on convolutional neural networks

NASA Astrophysics Data System (ADS)

Dong, Hao; Jiang, Li; Li, Tianjian; Liang, Xiaoyao

2018-04-01

Most FPGA accelerators for convolutional neural network are designed to optimize the inner acceleration and are ignored of the optimization for the data path between the inner accelerator and the outer system. This could lead to poor performance in applications like real time video object detection. We propose a brand new systematic FPFA acceleration design to solve this problem. This design takes the data path optimization between the inner accelerator and the outer system into consideration and optimizes the data path using techniques like hardware format transformation, frame compression. It also takes fixed-point, new pipeline technique to optimize the inner accelerator. All these make the final system's performance very good, reaching about 10 times the performance comparing with the original system.

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.

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

NASA Astrophysics Data System (ADS)

Wang, Hong-Jian; Xiong, Wei

2009-03-01

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

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

NASA Astrophysics Data System (ADS)

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

2016-04-01

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

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.

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.

The Study of Intelligent Vehicle Navigation Path Based on Behavior Coordination of Particle Swarm.

PubMed

Han, Gaining; Fu, Weiping; Wang, Wen

2016-01-01

In the behavior dynamics model, behavior competition leads to the shock problem of the intelligent vehicle navigation path, because of the simultaneous occurrence of the time-variant target behavior and obstacle avoidance behavior. Considering the safety and real-time of intelligent vehicle, the particle swarm optimization (PSO) algorithm is proposed to solve these problems for the optimization of weight coefficients of the heading angle and the path velocity. Firstly, according to the behavior dynamics model, the fitness function is defined concerning the intelligent vehicle driving characteristics, the distance between intelligent vehicle and obstacle, and distance of intelligent vehicle and target. Secondly, behavior coordination parameters that minimize the fitness function are obtained by particle swarm optimization algorithms. Finally, the simulation results show that the optimization method and its fitness function can improve the perturbations of the vehicle planning path and real-time and reliability.

The Study of Intelligent Vehicle Navigation Path Based on Behavior Coordination of Particle Swarm

PubMed Central

Han, Gaining; Fu, Weiping; Wang, Wen

2016-01-01

In the behavior dynamics model, behavior competition leads to the shock problem of the intelligent vehicle navigation path, because of the simultaneous occurrence of the time-variant target behavior and obstacle avoidance behavior. Considering the safety and real-time of intelligent vehicle, the particle swarm optimization (PSO) algorithm is proposed to solve these problems for the optimization of weight coefficients of the heading angle and the path velocity. Firstly, according to the behavior dynamics model, the fitness function is defined concerning the intelligent vehicle driving characteristics, the distance between intelligent vehicle and obstacle, and distance of intelligent vehicle and target. Secondly, behavior coordination parameters that minimize the fitness function are obtained by particle swarm optimization algorithms. Finally, the simulation results show that the optimization method and its fitness function can improve the perturbations of the vehicle planning path and real-time and reliability. PMID:26880881

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.

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.

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.

Method of interplanetary trajectory optimization for the spacecraft with low thrust and swing-bys

NASA Astrophysics Data System (ADS)

Konstantinov, M. S.; Thein, M.

2017-07-01

The method developed to avoid the complexity of solving the multipoint boundary value problem while optimizing interplanetary trajectories of the spacecraft with electric propulsion and a sequence of swing-bys is presented in the paper. This method is based on the use of the preliminary problem solutions for the impulsive trajectories. The preliminary problem analyzed at the first stage of the study is formulated so that the analysis and optimization of a particular flight path is considered as the unconstrained minimum in the space of the selectable parameters. The existing methods can effectively solve this problem and make it possible to identify rational flight paths (the sequence of swing-bys) to receive the initial approximation for the main characteristics of the flight path (dates, values of the hyperbolic excess velocity, etc.). These characteristics can be used to optimize the trajectory of the spacecraft with electric propulsion. The special feature of the work is the introduction of the second (intermediate) stage of the research. At this stage some characteristics of the analyzed flight path (e.g. dates of swing-bys) are fixed and the problem is formulated so that the trajectory of the spacecraft with electric propulsion is optimized on selected sites of the flight path. The end-to-end optimization is carried out at the third (final) stage of the research. The distinctive feature of this stage is the analysis of the full set of optimal conditions for the considered flight path. The analysis of the characteristics of the optimal flight trajectories to Jupiter with Earth, Venus and Mars swing-bys for the spacecraft with electric propulsion are presented. The paper shows that the spacecraft weighing more than 7150 kg can be delivered into the vicinity of Jupiter along the trajectory with two Earth swing-bys by use of the space transportation system based on the "Angara A5" rocket launcher, the chemical upper stage "KVTK" and the electric propulsion system with input electrical power of 100 kW.

Optimization of magnet end-winding geometry

NASA Astrophysics Data System (ADS)

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

1994-03-01

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

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.

Task Decomposition Module For Telerobot Trajectory Generation

NASA Astrophysics Data System (ADS)

Wavering, Albert J.; Lumia, Ron

1988-10-01

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

Implementation of robotic force control with position accommodation

NASA Technical Reports Server (NTRS)

Ryan, Michael J.

1992-01-01

As the need for robotic manipulation in fields such as manufacturing and telerobotics increases, so does the need for effective methods of controlling the interaction forces between the manipulators and their environment. Position Accommodation (PA) is a form of robotic force control where the nominal path of the manipulator is modified in response to forces and torques sensed at the tool-tip of the manipulator. The response is tailored such that the manipulator emulates a mechanical impedance to its environment. PA falls under the category of position-based robotic force control, and may be viewed as a form of Impedance Control. The practical implementations are explored of PA into an 18 degree-of-freedom robotic testbed consisting of two PUMA 560 arms mounted on two 3 DOF positioning platforms. Single and dual-arm architectures for PA are presented along with some experimental results. Characteristics of position-based force control are discussed, along with some of the limitations of PA.

HERMIES-3: A step toward autonomous mobility, manipulation, and perception

NASA Technical Reports Server (NTRS)

Weisbin, C. R.; Burks, B. L.; Einstein, J. R.; Feezell, R. R.; Manges, W. W.; Thompson, D. H.

1989-01-01

HERMIES-III is an autonomous robot comprised of a seven degree-of-freedom (DOF) manipulator designed for human scale tasks, a laser range finder, a sonar array, an omni-directional wheel-driven chassis, multiple cameras, and a dual computer system containing a 16-node hypercube expandable to 128 nodes. The current experimental program involves performance of human-scale tasks (e.g., valve manipulation, use of tools), integration of a dexterous manipulator and platform motion in geometrically complex environments, and effective use of multiple cooperating robots (HERMIES-IIB and HERMIES-III). The environment in which the robots operate has been designed to include multiple valves, pipes, meters, obstacles on the floor, valves occluded from view, and multiple paths of differing navigation complexity. The ongoing research program supports the development of autonomous capability for HERMIES-IIB and III to perform complex navigation and manipulation under time constraints, while dealing with imprecise sensory information.

Brain-machine interface control of a manipulator using small-world neural network and shared control strategy.

PubMed

Li, Ting; Hong, Jun; Zhang, Jinhua; Guo, Feng

2014-03-15

The improvement of the resolution of brain signal and the ability to control external device has been the most important goal in BMI research field. This paper describes a non-invasive brain-actuated manipulator experiment, which defined a paradigm for the motion control of a serial manipulator based on motor imagery and shared control. The techniques of component selection, spatial filtering and classification of motor imagery were involved. Small-world neural network (SWNN) was used to classify five brain states. To verify the effectiveness of the proposed classifier, we replace the SWNN classifier by a radial basis function (RBF) networks neural network, a standard multi-layered feed-forward backpropagation network (SMN) and a multi-SVM classifier, with the same features for the classification. The results also indicate that the proposed classifier achieves a 3.83% improvement over the best results of other classifiers. We proposed a shared control method consisting of two control patterns to expand the control of BMI from the software angle. The job of path building for reaching the 'end' point was designated as an assessment task. We recorded all paths contributed by subjects and picked up relevant parameters as evaluation coefficients. With the assistance of two control patterns and series of machine learning algorithms, the proposed BMI originally achieved the motion control of a manipulator in the whole workspace. According to experimental results, we confirmed the feasibility of the proposed BMI method for 3D motion control of a manipulator using EEG during motor imagery. Copyright © 2013 Elsevier B.V. All rights reserved.

Which physical and social environmental factors are most important for adolescents' cycling for transport? An experimental study using manipulated photographs.

PubMed

Verhoeven, Hannah; Ghekiere, Ariane; Van Cauwenberg, Jelle; Van Dyck, Delfien; De Bourdeaudhuij, Ilse; Clarys, Peter; Deforche, Benedicte

2017-08-17

Ecological models emphasize that cycling for transport is determined by an interplay between individual, physical and social environmental factors. The current study investigated (a) which physical and social environmental factors determine adolescents' preferences towards cycling for transport and (b) which individual, physical and social environmental factors are associated with their intention to actually cycle for transport. An online questionnaire consisting of questions on individual and social environmental variables, and 15 choice-based conjoint tasks with manipulated photographs was completed by 882 adolescents (55.3% male; 13.9 ± 1.6 years). Within the choice tasks, participants were asked to indicate which of two situations they would prefer to cycle to a friend's house. The manipulated photographs were all modified versions of one semi-urban street which differed in the following physical micro-environmental attributes (separation of cycle path, evenness of cycle path, speed limit, speed bump, traffic density, amount of vegetation and maintenance). In addition, each photograph was accompanied by two sentences which described varying cycling distances and co-participation in cycling (i.e. cycling alone or with a friend). After each choice task participants were also asked if they would actually cycle in that situation in real life (i.e. intention). Hierarchical Bayes analyses were performed to calculate relative importances and part-worth utilities of environmental attributes. Logistic regression analyses were performed to investigate which individual, physical and social environmental factors were associated with adolescents' intention to actually cycle for transport. Adolescents' preference to cycle for transport was predominantly determined by separation of cycle path, followed by shorter cycling distance and co-participation in cycling. Higher preferences were observed for a separation between the cycle path and motorized traffic by means of a hedge versus a curb, versus a marked line. Similar findings were observed for intention to cycle. Furthermore, evenness of the cycle path and general maintenance of the street were also of considerable importance among adolescents, but to a lesser extent. Results of this experimental study justify investment by local governments in well-separated cycling infrastructure, which seemed to be more important than cycling distance and the social environment.

Distributed Method to Optimal Profile Descent

NASA Astrophysics Data System (ADS)

Kim, Geun I.

Current ground automation tools for Optimal Profile Descent (OPD) procedures utilize path stretching and speed profile change to maintain proper merging and spacing requirements at high traffic terminal area. However, low predictability of aircraft's vertical profile and path deviation during decent add uncertainty to computing estimated time of arrival, a key information that enables the ground control center to manage airspace traffic effectively. This paper uses an OPD procedure that is based on a constant flight path angle to increase the predictability of the vertical profile and defines an OPD optimization problem that uses both path stretching and speed profile change while largely maintaining the original OPD procedure. This problem minimizes the cumulative cost of performing OPD procedures for a group of aircraft by assigning a time cost function to each aircraft and a separation cost function to a pair of aircraft. The OPD optimization problem is then solved in a decentralized manner using dual decomposition techniques under inter-aircraft ADS-B mechanism. This method divides the optimization problem into more manageable sub-problems which are then distributed to the group of aircraft. Each aircraft solves its assigned sub-problem and communicate the solutions to other aircraft in an iterative process until an optimal solution is achieved thus decentralizing the computation of the optimization problem.

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.

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.

Exact and explicit optimal solutions for trajectory planning and control of single-link flexible-joint manipulators

NASA Technical Reports Server (NTRS)

Chen, Guanrong

1991-01-01

An optimal trajectory planning problem for a single-link, flexible joint manipulator is studied. A global feedback-linearization is first applied to formulate the nonlinear inequality-constrained optimization problem in a suitable way. Then, an exact and explicit structural formula for the optimal solution of the problem is derived and the solution is shown to be unique. It turns out that the optimal trajectory planning and control can be done off-line, so that the proposed method is applicable to both theoretical analysis and real time tele-robotics control engineering.

The approach for shortest paths in fire succor based on component GIS technology

NASA Astrophysics Data System (ADS)

Han, Jie; Zhao, Yong; Dai, K. W.

2007-06-01

Fire safety is an important issue for the national economy and people's living. Efficiency and exactness of fire department succor directly relate to safety of peoples' lives and property. Many disadvantages of the traditional fire system have been emerged in practical applications. The preparation of pumpers is guided by wireless communication or wire communication, so its real-time and accurate performances are much poorer. The information about the reported fire, such as the position, disaster and map, et al., for alarm and command was processed by persons, which slows the reaction speed and delays the combat opportunity. In order to solve these disadvantages, it has an important role to construct a modern fire command center based on high technology. The construction of modern fire command center can realize the modernization and automation of fire command and management. It will play a great role in protecting safety of peoples' lives and property. The center can enhance battle ability and can reduce the direct and indirect loss of fire damage at most. With the development of science technology, Geographic Information System (GIS) has becoming a new information industry for hardware production, software development, data collection, space analysis and counseling. With the popularization of computers and the development of GIS, GIS has gained increasing broad applications for its strong functionality. Network analysis is one of the most important functions of GIS, and the most elementary and pivotal issue of network analysis is the calculation of shortest paths. The shortest paths are mostly applied to some emergent systems such as 119 fire alarms. These systems mainly require that the computation time of the optimal path should be 1-3 seconds. And during traveling, the next running path of the vehicles should be calculated in time. So the implement of the shortest paths must have a high efficiency. In this paper, the component GIS technology was applied to collect and record the data information (such as, the situation of this disaster, map and road status et al) of the reported fire firstly. The ant colony optimization was used to calculate the shortest path of fire succor secondly. The optimization results were sent to the pumpers, which can let pumpers choose the shortest paths intelligently and come to fire position with least time. The programming method for shortest paths is proposed in section 3. There are three parts in this section. The elementary framework of the proposed programming method is presented in part one. The systematic framework of GIS component is described in part two. The ant colony optimization employed is presented in part three. In section 4, a simple application instance was presented to demonstrate the proposed programming method. There are three parts in this section. The distributed Web application based on component GIS was described in part one. The optimization results without traffic constraint were presented in part two. The optimization results with traffic constraint were presented in part three. The contributions of this paper can be summarized as follows. (1) It proposed an effective approach for shortest paths in fire succor based on component GIS technology. This proposed approach can achieve the real-time decisions of shortest paths for fire succor. (2) It applied the ant colony optimization to implement the shortest path decision. The traffic information was considered in the shortest path decision using ant colony optimization. The final application instance suggests that the proposed approach is feasible, correct and valid.

Neighboring extremals of dynamic optimization problems with path equality constraints

NASA Technical Reports Server (NTRS)

Lee, A. Y.

1988-01-01

Neighboring extremals of dynamic optimization problems with path equality constraints and with an unknown parameter vector are considered in this paper. With some simplifications, the problem is reduced to solving a linear, time-varying two-point boundary-value problem with integral path equality constraints. A modified backward sweep method is used to solve this problem. Two example problems are solved to illustrate the validity and usefulness of the solution technique.

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.

Extended shortest path selection for package routing of complex networks

NASA Astrophysics Data System (ADS)

Ye, Fan; Zhang, Lei; Wang, Bing-Hong; Liu, Lu; Zhang, Xing-Yi

The routing strategy plays a very important role in complex networks such as Internet system and Peer-to-Peer networks. However, most of the previous work concentrates only on the path selection, e.g. Flooding and Random Walk, or finding the shortest path (SP) and rarely considering the local load information such as SP and Distance Vector Routing. Flow-based Routing mainly considers load balance and still cannot achieve best optimization. Thus, in this paper, we propose a novel dynamic routing strategy on complex network by incorporating the local load information into SP algorithm to enhance the traffic flow routing optimization. It was found that the flow in a network is greatly affected by the waiting time of the network, so we should not consider only choosing optimized path for package transformation but also consider node congestion. As a result, the packages should be transmitted with a global optimized path with smaller congestion and relatively short distance. Analysis work and simulation experiments show that the proposed algorithm can largely enhance the network flow with the maximum throughput within an acceptable calculating time. The detailed analysis of the algorithm will also be provided for explaining the efficiency.

Simulation based optimized beam velocity in additive manufacturing

NASA Astrophysics Data System (ADS)

Vignat, Frédéric; Béraud, Nicolas; Villeneuve, François

2017-08-01

Manufacturing good parts with additive technologies rely on melt pool dimension and temperature and are controlled by manufacturing strategies often decided on machine side. Strategies are built on beam path and variable energy input. Beam path are often a mix of contour and hatching strategies filling the contours at each slice. Energy input depend on beam intensity and speed and is determined from simple thermal models to control melt pool dimensions and temperature and ensure porosity free material. These models take into account variation in thermal environment such as overhanging surfaces or back and forth hatching path. However not all the situations are correctly handled and precision is limited. This paper proposes new method to determine energy input from full built chamber 3D thermal simulation. Using the results of the simulation, energy is modified to keep melt pool temperature in a predetermined range. The paper present first an experimental method to determine the optimal range of temperature. In a second part the method to optimize the beam speed from the simulation results is presented. Finally, the optimized beam path is tested in the EBM machine and built part are compared with part built with ordinary beam path.

Generalized gradient algorithm for trajectory optimization

NASA Technical Reports Server (NTRS)

Zhao, Yiyuan; Bryson, A. E.; Slattery, R.

1990-01-01

The generalized gradient algorithm presented and verified as a basis for the solution of trajectory optimization problems improves the performance index while reducing path equality constraints, and terminal equality constraints. The algorithm is conveniently divided into two phases, of which the first, 'feasibility' phase yields a solution satisfying both path and terminal constraints, while the second, 'optimization' phase uses the results of the first phase as initial guesses.

Kinematically Optimal Robust Control of Redundant Manipulators

NASA Astrophysics Data System (ADS)

Galicki, M.

2017-12-01

This work deals with the problem of the robust optimal task space trajectory tracking subject to finite-time convergence. Kinematic and dynamic equations of a redundant manipulator are assumed to be uncertain. Moreover, globally unbounded disturbances are allowed to act on the manipulator when tracking the trajectory by the endeffector. Furthermore, the movement is to be accomplished in such a way as to minimize both the manipulator torques and their oscillations thus eliminating the potential robot vibrations. Based on suitably defined task space non-singular terminal sliding vector variable and the Lyapunov stability theory, we derive a class of chattering-free robust kinematically optimal controllers, based on the estimation of transpose Jacobian, which seem to be effective in counteracting both uncertain kinematics and dynamics, unbounded disturbances and (possible) kinematic and/or algorithmic singularities met on the robot trajectory. The numerical simulations carried out for a redundant manipulator of a SCARA type consisting of the three revolute kinematic pairs and operating in a two-dimensional task space, illustrate performance of the proposed controllers as well as comparisons with other well known control schemes.

Development path and current status of the NANIVID: a new device for cancer cell studies.

PubMed

Raja, Waseem Khan; Padgen, Michael R; Williams, James K; Gertler, Frank B; Wyckoff, Jeffrey B; Condeelis, John S; Castracane, James

2012-03-29

Cancer cells create a unique microenvironment in vivo that enables migration to distant organs. To better understand the tumor micro-environment, special tools and devices are required to monitor the interactions between different cell types and the effects of particular chemical gradients. Our study presents the design and optimization of a versatile chemotaxis device, the nano-intravital device (NANIVID), which consists of etched and bonded glass substrates that create a soluble factor reservoir. The device contains a customized hydrogel blend that is loaded with epidermal growth factor (EGF), which diffuses from the outlet to create a chemotactic gradient that can be sustained for many hours in order to attract specific cells to the device. A microelectrode array is under development for quantification of cell collection and will be incorporated into future device generations. Additionally, the NANIVID can be modified to generate gradients of other soluble factors in order to initiate controlled changes to the microenvironment including the induction of hypoxia, manipulation of extracellular matrix stiffness, etc. The focus of the article is to present the design and optimization of the device towards wide ranging applications of cancer cell dynamics in vitro and, ultimately, implantation for in vivo investigations.

From Mollusks to Medicine: A Venomics Approach for the Discovery and Characterization of Therapeutics from Terebridae Peptide Toxins.

PubMed

Verdes, Aida; Anand, Prachi; Gorson, Juliette; Jannetti, Stephen; Kelly, Patrick; Leffler, Abba; Simpson, Danny; Ramrattan, Girish; Holford, Mandë

2016-04-19

Animal venoms comprise a diversity of peptide toxins that manipulate molecular targets such as ion channels and receptors, making venom peptides attractive candidates for the development of therapeutics to benefit human health. However, identifying bioactive venom peptides remains a significant challenge. In this review we describe our particular venomics strategy for the discovery, characterization, and optimization of Terebridae venom peptides, teretoxins. Our strategy reflects the scientific path from mollusks to medicine in an integrative sequential approach with the following steps: (1) delimitation of venomous Terebridae lineages through taxonomic and phylogenetic analyses; (2) identification and classification of putative teretoxins through omics methodologies, including genomics, transcriptomics, and proteomics; (3) chemical and recombinant synthesis of promising peptide toxins; (4) structural characterization through experimental and computational methods; (5) determination of teretoxin bioactivity and molecular function through biological assays and computational modeling; (6) optimization of peptide toxin affinity and selectivity to molecular target; and (7) development of strategies for effective delivery of venom peptide therapeutics. While our research focuses on terebrids, the venomics approach outlined here can be applied to the discovery and characterization of peptide toxins from any venomous taxa.

A Method to Analyze and Optimize the Load Sharing of Split Path Transmissions

NASA Technical Reports Server (NTRS)

Krantz, Timothy L.

1996-01-01

Split-path transmissions are promising alternatives to the common planetary transmissions for rotorcraft. Heretofore, split-path designs proposed for or used in rotorcraft have featured load-sharing devices that add undesirable weight and complexity to the designs. A method was developed to analyze and optimize the load sharing in split-path transmissions without load-sharing devices. The method uses the clocking angle as a design parameter to optimize for equal load sharing. In addition, the clocking angle tolerance necessary to maintain acceptable load sharing can be calculated. The method evaluates the effects of gear-shaft twisting and bending, tooth bending, Hertzian deformations within bearings, and movement of bearing supports on load sharing. It was used to study the NASA split-path test gearbox and the U.S. Army's Comanche helicopter main rotor gearbox. Acceptable load sharing was found to be achievable and maintainable by using proven manufacturing processes. The analytical results compare favorably to available experimental data.

Fast wavefront optimization for focusing through biological tissue (Conference Presentation)

NASA Astrophysics Data System (ADS)

Blochet, Baptiste; Bourdieu, Laurent; Gigan, Sylvain

2017-02-01

The propagation of light in biological tissues is rapidly dominated by multiple scattering: ballistic light is exponentially attenuated, which limits the penetration depth of conventional microscopy techniques. For coherent light, the recombination of the different scattered paths creates a complex interference: speckle. Recently, different wavefront shaping techniques have been developed to coherently manipulate the speckle. It opens the possibility to focus light through complex media and ultimately to image in them, provided however that the medium can be considered as stationary. We have studied the possibility to focus in and through time-varying biological tissues. Their intrinsic temporal dynamics creates a fast decorrelation of the speckle pattern. Therefore, focusing through biological tissues requires fast wavefront shaping devices, sensors and algorithms. We have investigated the use of a MEMS-based spatial light modulator (SLM) and a fast photodetector, combined with FPGA electronics to implement a closed-loop optimization. Our optimization process is just limited by the temporal dynamics of the SLM (200µs) and the computation time (45µs), thus corresponding to a rate of 4 kHz. To our knowledge, it's the fastest closed loop optimization using phase modulators. We have studied the focusing through colloidal solutions of TiO2 particles in glycerol, allowing tunable temporal stability, and scattering properties similar to biological tissues. We have shown that our set-up fulfills the required characteristics (speed, enhancement) to focus through biological tissues. We are currently investigating the focusing through acute rat brain slices and the memory effect in dynamic scattering media.

Configuration Synthesis and Efficient Motion Programming of Robot Manipulators

DTIC Science & Technology

1991-03-15

Gupta and Ma 90- Robotica 8:81-84]. When a set of discrete stations are specified along a robot task path, it becomes necessary to find a related...velocity Jacobian relations for the manipulator [Singh 87-MS Thesis][Gupta and Singh 89- Robotica 7:159-1641 and [Cheng 89-PhD Thesis][Cheng and Gupta...1987; Robotica 7:159-164, 1989 (revised). K. C. Gupta, "Kinematics of a Robot with Continuous Roll Wrist," IEEE J. Robotics and Automation 4(4):440-443

APPARATUS FOR PRODUCING AND MANIPULATING PLASMAS

DOEpatents

Colgate, S.A.; Ferguson, J.P.; Furth, H.P.; Wright, R.E.

1960-07-26

An electrical pinch discharge apparatus is described for producing and manipulating high-temperature plasmas. The apparatus may be of either the linear or toroidal pinch discharge type. Arrangements are provided whereby stabilizing fields may be trapped in the plasma external to the main pinch discharge path and the boundary condition of the stabilizing field programed so as to stabilize the discharge or to promote instabilities in the discharge as desired. The produced plasmas may be employed for various purposes, and fusion neutrons have been produced with the apparatus.

Singular-Arc Time-Optimal Trajectory of Aircraft in Two-Dimensional Wind Field

NASA Technical Reports Server (NTRS)

Nguyen, Nhan

2006-01-01

This paper presents a study of a minimum time-to-climb trajectory analysis for aircraft flying in a two-dimensional altitude dependent wind field. The time optimal control problem possesses a singular control structure when the lift coefficient is taken as a control variable. A singular arc analysis is performed to obtain an optimal control solution on the singular arc. Using a time-scale separation with the flight path angle treated as a fast state, the dimensionality of the optimal control solution is reduced by eliminating the lift coefficient control. A further singular arc analysis is used to decompose the original optimal control solution into the flight path angle solution and a trajectory solution as a function of the airspeed and altitude. The optimal control solutions for the initial and final climb segments are computed using a shooting method with known starting values on the singular arc The numerical results of the shooting method show that the optimal flight path angle on the initial and final climb segments are constant. The analytical approach provides a rapid means for analyzing a time optimal trajectory for aircraft performance.

Energy efficiency analysis of the manipulation process by the industrial objects with the use of Bernoulli gripping devices

NASA Astrophysics Data System (ADS)

Savkiv, Volodymyr; Mykhailyshyn, Roman; Duchon, Frantisek; Mikhalishin, Mykhailo

2017-11-01

The article deals with the topical issue of reducing energy consumption for transportation of industrial objects. The energy efficiency of the process of objects manipulation with the use of the orientation optimization method while gripping with the help of different methods has been studied. The analysis of the influence of the constituent parts of inertial forces, that affect the object of manipulation, on the necessary force characteristics and energy consumption of Bernoulli gripping device has been proposed. The economic efficiency of the use of the optimal orientation of Bernoulli gripping device while transporting the object of manipulation in comparison to the transportation without re-orientation has been proved.

Online POMDP Algorithms for Very Large Observation Spaces

DTIC Science & Technology

2017-06-06

stochastic optimization: From sets to paths." In Advances in Neural Information Processing Systems, pp. 1585- 1593 . 2015. • Luo, Yuanfu, Haoyu Bai...and Wee Sun Lee. "Adaptive stochastic optimization: From sets to paths." In Advances in Neural Information Processing Systems, pp. 1585- 1593 . 2015

Routing and spectrum assignment based on ant colony optimization of minimum consecutiveness loss in elastic optical networks

NASA Astrophysics Data System (ADS)

Wang, Fu; Liu, Bo; Zhang, Lijia; Xin, Xiangjun; Tian, Qinghua; Zhang, Qi; Rao, Lan; Tian, Feng; Luo, Biao; Liu, Yingjun; Tang, Bao

2016-10-01

Elastic Optical Networks are considered to be a promising technology for future high-speed network. In this paper, we propose a RSA algorithm based on the ant colony optimization of minimum consecutiveness loss (ACO-MCL). Based on the effect of the spectrum consecutiveness loss on the pheromone in the ant colony optimization, the path and spectrum of the minimal impact on the network are selected for the service request. When an ant arrives at the destination node from the source node along a path, we assume that this path is selected for the request. We calculate the consecutiveness loss of candidate-neighbor link pairs along this path after the routing and spectrum assignment. Then, the networks update the pheromone according to the value of the consecutiveness loss. We save the path with the smallest value. After multiple iterations of the ant colony optimization, the final selection of the path is assigned for the request. The algorithms are simulated in different networks. The results show that ACO-MCL algorithm performs better in blocking probability and spectrum efficiency than other algorithms. Moreover, the ACO-MCL algorithm can effectively decrease spectrum fragmentation and enhance available spectrum consecutiveness. Compared with other algorithms, the ACO-MCL algorithm can reduce the blocking rate by at least 5.9% in heavy load.

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.

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.

The Complexity of Parallel Algorithms,

DTIC Science & Technology

1985-11-01

programns have been written for se(luiential coiipn ters. Many p~eop~le want coimp ~ilers dihal. will c(nimpile t he, code for parallel machines, to avoid...between two vertices. We also rely on parallel algorithms for maintaining data structures and manipulating graphs. We do not go into the details of these...Jpatlis and maintain connected coimp ~onents. The routine is: - 35 .- ExtendPath(r, Q, V) begin P +-0; s 4- while there is a path in V - P from s to a vertex

Optimism and depression: a new look at social support as a mediator among women at risk for breast cancer.

PubMed

Garner, Melissa J; McGregor, Bonnie A; Murphy, Karly M; Koenig, Alex L; Dolan, Emily D; Albano, Denise

2015-12-01

Breast cancer risk is a chronic stressor associated with depression. Optimism is associated with lower levels of depression among breast cancer survivors. However, to our knowledge, no studies have explored the relationship between optimism and depression among women at risk for breast cancer. We hypothesized that women at risk for breast cancer who have higher levels of optimism would report lower levels of depression and that social support would mediate this relationship. Participants (N = 199) with elevated distress were recruited from the community and completed self-report measures of depression, optimism, and social support. Participants were grouped based on their family history of breast cancer. Path analysis was used to examine the cross-sectional relationship between optimism, social support, and depressive symptoms in each group. Results indicated that the variance in depressive symptoms was partially explained through direct paths from optimism and social support among women with a family history of breast cancer. The indirect path from optimism to depressive symptoms via social support was significant (β = -.053; 90% CI = -.099 to -.011, p = .037) in this group. However, among individuals without a family history of breast cancer, the indirect path from optimism to depressive symptoms via social support was not significant. These results suggest that social support partially mediates the relationship between optimism and depression among women at risk for breast cancer. Social support may be an important intervention target to reduce depression among women at risk for breast cancer. Copyright © 2015 John Wiley & Sons, Ltd.

An improved hierarchical A * algorithm in the optimization of parking lots

NASA Astrophysics Data System (ADS)

Wang, Yong; Wu, Junjuan; Wang, Ying

2017-08-01

In the parking lot parking path optimization, the traditional evaluation index is the shortest distance as the best index and it does not consider the actual road conditions. Now, the introduction of a more practical evaluation index can not only simplify the hardware design of the boot system but also save the software overhead. Firstly, we establish the parking lot network graph RPCDV mathematical model and all nodes in the network is divided into two layers which were constructed using different evaluation function base on the improved hierarchical A * algorithm which improves the time optimal path search efficiency and search precision of the evaluation index. The final results show that for different sections of the program attribute parameter algorithm always faster the time to find the optimal path.

Comparison of Genetic Algorithm and Hill Climbing for Shortest Path Optimization Mapping

NASA Astrophysics Data System (ADS)

Fronita, Mona; Gernowo, Rahmat; Gunawan, Vincencius

2018-02-01

Traveling Salesman Problem (TSP) is an optimization to find the shortest path to reach several destinations in one trip without passing through the same city and back again to the early departure city, the process is applied to the delivery systems. This comparison is done using two methods, namely optimization genetic algorithm and hill climbing. Hill Climbing works by directly selecting a new path that is exchanged with the neighbour's to get the track distance smaller than the previous track, without testing. Genetic algorithms depend on the input parameters, they are the number of population, the probability of crossover, mutation probability and the number of generations. To simplify the process of determining the shortest path supported by the development of software that uses the google map API. Tests carried out as much as 20 times with the number of city 8, 16, 24 and 32 to see which method is optimal in terms of distance and time computation. Based on experiments conducted with a number of cities 3, 4, 5 and 6 producing the same value and optimal distance for the genetic algorithm and hill climbing, the value of this distance begins to differ with the number of city 7. The overall results shows that these tests, hill climbing are more optimal to number of small cities and the number of cities over 30 optimized using genetic algorithms.

Apparatus and Methods for Manipulation and Optimization of Biological Systems

NASA Technical Reports Server (NTRS)

Sun, Ren (Inventor); Ho, Chih-Ming (Inventor); Wong, Pak Kin (Inventor); Yu, Fuqu (Inventor)

2014-01-01

The invention provides systems and methods for manipulating biological systems, for example to elicit a more desired biological response from a biological sample, such as a tissue, organ, and/or a cell. In one aspect, the invention operates by efficiently searching through a large parametric space of stimuli and system parameters to manipulate, control, and optimize the response of biological samples sustained in the system. In one aspect, the systems and methods of the invention use at least one optimization algorithm to modify the actuator's control inputs for stimulation, responsive to the sensor's output of response signals. The invention can be used, e.g., to optimize any biological system, e.g., bioreactors for proteins, and the like, small molecules, polysaccharides, lipids, and the like. Another use of the apparatus and methods includes is for the discovery of key parameters in complex biological systems.

Development of a sensor coordinated kinematic model for neural network controller training

NASA Technical Reports Server (NTRS)

Jorgensen, Charles C.

1990-01-01

A robotic benchmark problem useful for evaluating alternative neural network controllers is presented. Specifically, it derives two camera models and the kinematic equations of a multiple degree of freedom manipulator whose end effector is under observation. The mapping developed include forward and inverse translations from binocular images to 3-D target position and the inverse kinematics of mapping point positions into manipulator commands in joint space. Implementation is detailed for a three degree of freedom manipulator with one revolute joint at the base and two prismatic joints on the arms. The example is restricted to operate within a unit cube with arm links of 0.6 and 0.4 units respectively. The development is presented in the context of more complex simulations and a logical path for extension of the benchmark to higher degree of freedom manipulators is presented.

A new optimal seam method for seamless image stitching

NASA Astrophysics Data System (ADS)

Xue, Jiale; Chen, Shengyong; Cheng, Xu; Han, Ying; Zhao, Meng

2017-07-01

A novel optimal seam method which aims to stitch those images with overlapping area more seamlessly has been propos ed. Considering the traditional gradient domain optimal seam method and fusion algorithm result in bad color difference measurement and taking a long time respectively, the input images would be converted to HSV space and a new energy function is designed to seek optimal stitching path. To smooth the optimal stitching path, a simplified pixel correction and weighted average method are utilized individually. The proposed methods exhibit performance in eliminating the stitching seam compared with the traditional gradient optimal seam and high efficiency with multi-band blending algorithm.

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

An Optimization Principle for Deriving Nonequilibrium Statistical Models of Hamiltonian Dynamics

NASA Astrophysics Data System (ADS)

Turkington, Bruce

2013-08-01

A general method for deriving closed reduced models of Hamiltonian dynamical systems is developed using techniques from optimization and statistical estimation. Given a vector of resolved variables, selected to describe the macroscopic state of the system, a family of quasi-equilibrium probability densities on phase space corresponding to the resolved variables is employed as a statistical model, and the evolution of the mean resolved vector is estimated by optimizing over paths of these densities. Specifically, a cost function is constructed to quantify the lack-of-fit to the microscopic dynamics of any feasible path of densities from the statistical model; it is an ensemble-averaged, weighted, squared-norm of the residual that results from submitting the path of densities to the Liouville equation. The path that minimizes the time integral of the cost function determines the best-fit evolution of the mean resolved vector. The closed reduced equations satisfied by the optimal path are derived by Hamilton-Jacobi theory. When expressed in terms of the macroscopic variables, these equations have the generic structure of governing equations for nonequilibrium thermodynamics. In particular, the value function for the optimization principle coincides with the dissipation potential that defines the relation between thermodynamic forces and fluxes. The adjustable closure parameters in the best-fit reduced equations depend explicitly on the arbitrary weights that enter into the lack-of-fit cost function. Two particular model reductions are outlined to illustrate the general method. In each example the set of weights in the optimization principle contracts into a single effective closure parameter.

Modified dwell time optimization model and its applications in subaperture polishing.

PubMed

Dong, Zhichao; Cheng, Haobo; Tam, Hon-Yuen

2014-05-20

The optimization of dwell time is an important procedure in deterministic subaperture polishing. We present a modified optimization model of dwell time by iterative and numerical method, assisted by extended surface forms and tool paths for suppressing the edge effect. Compared with discrete convolution and linear equation models, the proposed model has essential compatibility with arbitrary tool paths, multiple tool influence functions (TIFs) in one optimization, and asymmetric TIFs. The emulational fabrication of a Φ200  mm workpiece by the proposed model yields a smooth, continuous, and non-negative dwell time map with a root-mean-square (RMS) convergence rate of 99.6%, and the optimization costs much less time. By the proposed model, influences of TIF size and path interval to convergence rate and polishing time are optimized, respectively, for typical low and middle spatial-frequency errors. Results show that (1) the TIF size is nonlinear inversely proportional to convergence rate and polishing time. A TIF size of ~1/7 workpiece size is preferred; (2) the polishing time is less sensitive to path interval, but increasing the interval markedly reduces the convergence rate. A path interval of ~1/8-1/10 of the TIF size is deemed to be appropriate. The proposed model is deployed on a JR-1800 and MRF-180 machine. Figuring results of Φ920  mm Zerodur paraboloid and Φ100  mm Zerodur plane by them yield RMS of 0.016λ and 0.013λ (λ=632.8  nm), respectively, and thereby validate the feasibility of proposed dwell time model used for subaperture polishing.

Optimizing Motion Planning for Hyper Dynamic Manipulator

NASA Astrophysics Data System (ADS)

Aboura, Souhila; Omari, Abdelhafid; Meguenni, Kadda Zemalache

2012-01-01

This paper investigates the optimal motion planning for an hyper dynamic manipulator. As case study, we consider a golf swing robot which is consisting with two actuated joint and a mechanical stoppers. Genetic Algorithm (GA) technique is proposed to solve the optimal golf swing motion which is generated by Fourier series approximation. The objective function for GA approach is to minimizing the intermediate and final state, minimizing the robot's energy consummation and maximizing the robot's speed. Obtained simulation results show the effectiveness of the proposed scheme.

Advanced interactive display formats for terminal area traffic control

NASA Technical Reports Server (NTRS)

Grunwald, Arthur J.

1996-01-01

This report describes the basic design considerations for perspective air traffic control displays. A software framework has been developed for manual viewing parameter setting (MVPS) in preparation for continued, ongoing developments on automated viewing parameter setting (AVPS) schemes. Two distinct modes of MVPS operations are considered, both of which utilize manipulation pointers imbedded in the three-dimensional scene: (1) direct manipulation of the viewing parameters -- in this mode the manipulation pointers act like the control-input device, through which the viewing parameter changes are made. Part of the parameters are rate controlled, and part of them position controlled. This mode is intended for making fast, iterative small changes in the parameters. (2) Indirect manipulation of the viewing parameters -- this mode is intended primarily for introducing large, predetermined changes in the parameters. Requests for changes in viewing parameter setting are entered manually by the operator by moving viewing parameter manipulation pointers on the screen. The motion of these pointers, which are an integral part of the 3-D scene, is limited to the boundaries of the screen. This arrangement has been chosen in order to preserve the correspondence between the spatial lay-outs of the new and the old viewing parameter setting, a feature which contributes to preventing spatial disorientation of the operator. For all viewing operations, e.g. rotation, translation and ranging, the actual change is executed automatically by the system, through gradual transitions with an exponentially damped, sinusoidal velocity profile, in this work referred to as 'slewing' motions. The slewing functions, which eliminate discontinuities in the viewing parameter changes, are designed primarily for enhancing the operator's impression that he, or she, is dealing with an actually existing physical system, rather than an abstract computer-generated scene. The proposed, continued research efforts will deal with the development of automated viewing parameter setting schemes. These schemes employ an optimization strategy, aimed at identifying the best possible vantage point, from which the air traffic control scene can be viewed for a given traffic situation. They determine whether a change in viewing parameter setting is required and determine the dynamic path along which the change to the new viewing parameter setting should take place.

Understanding and applying open-path optical sensing data

NASA Astrophysics Data System (ADS)

Virag, Peter; Kricks, Robert J.

1999-02-01

During the last 10 years, open-path air monitors have evolved to yield reliable and effective measurements of single and multiple compounds on a real-time basis. To many individuals within the optical remote sensing community, the attributes of open-path and its the potential uses seem unlimited. Then why has the market has been stagnant for the last few years? The reason may center on how open-path information is applied and how well the end user understands that information. We constantly try to compare open-path data to risk/health or safety levels that are based for use at a single point and for a specific averaging period often far longer than a typical open-path data point. Often this approach is perceived as putting a square peg in a round hole. This perception may be well founded, as open-path data at times may need to go through extensive data manipulation and assumptions before it can be applied. This paper will review pervious open-path monitoring programs and their success in applying the data collected. We will also look at how open-path data is being currently used, some previous pitfalls in data use, alternate methods of data interpretation, and how open-path data can be best practically applied to fit current needs.

Robust Video Stabilization Using Particle Keypoint Update and l1-Optimized Camera Path

PubMed Central

Jeon, Semi; Yoon, Inhye; Jang, Jinbeum; Yang, Seungji; Kim, Jisung; Paik, Joonki

2017-01-01

Acquisition of stabilized video is an important issue for various type of digital cameras. This paper presents an adaptive camera path estimation method using robust feature detection to remove shaky artifacts in a video. The proposed algorithm consists of three steps: (i) robust feature detection using particle keypoints between adjacent frames; (ii) camera path estimation and smoothing; and (iii) rendering to reconstruct a stabilized video. As a result, the proposed algorithm can estimate the optimal homography by redefining important feature points in the flat region using particle keypoints. In addition, stabilized frames with less holes can be generated from the optimal, adaptive camera path that minimizes a temporal total variation (TV). The proposed video stabilization method is suitable for enhancing the visual quality for various portable cameras and can be applied to robot vision, driving assistant systems, and visual surveillance systems. PMID:28208622

Optimization of carbon mitigation paths in the power sector of Shenzhen, China

NASA Astrophysics Data System (ADS)

Li, Xin; Hu, Guangxiao; Duan, Ying; Ji, Junping

2017-08-01

This paper studied the carbon mitigation paths of the power sector in Shenzhen, China from a supply-side perspective. We investigated the carbon mitigation potentials and investments of seventeen mitigation technologies in the power sector, and employed a linear programming method to optimize the mitigation paths. The results show that: 1) The total carbon mitigation potential is 5.95 MtCO2 in 2020 in which the adjustment of power supply structure, technical improvements of existing coal- and gas-fired power plant account for 87.5%,6.5% and 6.0%, respectively. 2) In the optimal path, the avoided carbon dioxide to meet the local government’s mitigation goal in power sector is 1.26 MtCO2.The adjustment of power supply structure and technical improvement of the coal-fired power plants are the driving factors of carbon mitigation, with contributions to total carbon mitigation are 72.6% and 27.4%, respectively.

Unpredictable food supply modifies costs of reproduction and hampers individual optimization.

PubMed

Török, János; Hegyi, Gergely; Tóth, László; Könczey, Réka

2004-11-01

Investment into the current reproductive attempt is thought to be at the expense of survival and/or future reproduction. Individuals are therefore expected to adjust their decisions to their physiological state and predictable aspects of environmental quality. The main predictions of the individual optimization hypothesis for bird clutch sizes are: (1) an increase in the number of recruits with an increasing number of eggs in natural broods, with no corresponding impairment of parental survival or future reproduction, and (2) a decrease in the fitness of parents in response to both negative and positive brood size manipulation, as a result of a low number of recruits, poor future reproduction of parents, or both. We analysed environmental influences on costs and optimization of reproduction on 6 years of natural and experimentally manipulated broods in a Central European population of the collared flycatcher. Based on dramatic differences in caterpillar availability, we classified breeding seasons as average and rich food years. The categorization was substantiated by the majority of present and future fitness components of adults and offspring. Neither observational nor experimental data supported the individual optimization hypothesis, in contrast to a Scandinavian population of the species. The quality of fledglings deteriorated, and the number of recruits did not increase with natural clutch size. Manipulation revealed significant costs of reproduction to female parents in terms of future reproductive potential. However, the influence of manipulation on recruitment was linear, with no significant polynomial effect. The number of recruits increased with manipulation in rich food years and tended to decrease in average years, so control broods did not recruit more young than manipulated broods in any of the year types. This indicates that females did not optimize their clutch size, and that they generally laid fewer eggs than optimal in rich food years. Mean yearly clutch size did not follow food availability, which suggests that females cannot predict food supply of the brood-rearing period at the beginning of the season. This lack of information on future food conditions seems to prevent them from accurately estimating their optimal clutch size for each season. Our results suggest that individual optimization may not be a general pattern even within a species, and alternative mechanisms are needed to explain clutch size variation.

Predictor laws for pictorial flight displays

NASA Technical Reports Server (NTRS)

Grunwald, A. J.

1985-01-01

Two predictor laws are formulated and analyzed: (1) a circular path law based on constant accelerations perpendicular to the path and (2) a predictor law based on state transition matrix computations. It is shown that for both methods the predictor provides the essential lead zeros for the path-following task. However, in contrast to the circular path law, the state transition matrix law furnishes the system with additional zeros that entirely cancel out the higher-frequency poles of the vehicle dynamics. On the other hand, the circular path law yields a zero steady-state error in following a curved trajectory with a constant radius. A combined predictor law is suggested that utilizes the advantages of both methods. A simple analysis shows that the optimal prediction time mainly depends on the level of precision required in the path-following task, and guidelines for determining the optimal prediction time are given.

Multi-hop path tracing of mobile robot with multi-range image

NASA Astrophysics Data System (ADS)

Choudhury, Ramakanta; Samal, Chandrakanta; Choudhury, Umakanta

2010-02-01

It is well known that image processing depends heavily upon image representation technique . This paper intends to find out the optimal path of mobile robots for a specified area where obstacles are predefined as well as modified. Here the optimal path is represented by using the Quad tree method. Since there has been rising interest in the use of quad tree, we have tried to use the successive subdivision of images into quadrants from which the quad tree is developed. In the quad tree, obstacles-free area and the partial filled area are represented with different notations. After development of quad tree the algorithm is used to find the optimal path by employing neighbor finding technique, with a view to move the robot from the source to destination. The algorithm, here , permeates through the entire tree, and tries to locate the common ancestor for computation. The computation and the algorithm, aim at easing the ability of the robot to trace the optimal path with the help of adjacencies between the neighboring nodes as well as determining such adjacencies in the horizontal, vertical and diagonal directions. In this paper efforts have been made to determine the movement of the adjacent block in the quad tree and to detect the transition between the blocks equal size and finally generate the result.

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.

Development of the Symbolic Manipulator Laboratory modeling package for the kinematic design and optimization of the Future Armor Rearm System robot. Ammunition Logistics Program

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

March-Leuba, S.; Jansen, J.F.; Kress, R.L.

1992-08-01

A new program package, Symbolic Manipulator Laboratory (SML), for the automatic generation of both kinematic and static manipulator models in symbolic form is presented. Critical design parameters may be identified and optimized using symbolic models as shown in the sample application presented for the Future Armor Rearm System (FARS) arm. The computer-aided development of the symbolic models yields equations with reduced numerical complexity. Important considerations have been placed on the closed form solutions simplification and on the user friendly operation. The main emphasis of this research is the development of a methodology which is implemented in a computer program capablemore » of generating symbolic kinematic and static forces models of manipulators. The fact that the models are obtained trigonometrically reduced is among the most significant results of this work and the most difficult to implement. Mathematica, a commercial program that allows symbolic manipulation, is used to implement the program package. SML is written such that the user can change any of the subroutines or create new ones easily. To assist the user, an on-line help has been written to make of SML a user friendly package. Some sample applications are presented. The design and optimization of the 5-degrees-of-freedom (DOF) FARS manipulator using SML is discussed. Finally, the kinematic and static models of two different 7-DOF manipulators are calculated symbolically.« less

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…

Optimizing Retransmission Threshold in Wireless Sensor Networks

PubMed Central

Bi, Ran; Li, Yingshu; Tan, Guozhen; Sun, Liang

2016-01-01

The retransmission threshold in wireless sensor networks is critical to the latency of data delivery in the networks. However, existing works on data transmission in sensor networks did not consider the optimization of the retransmission threshold, and they simply set the same retransmission threshold for all sensor nodes in advance. The method did not take link quality and delay requirement into account, which decreases the probability of a packet passing its delivery path within a given deadline. This paper investigates the problem of finding optimal retransmission thresholds for relay nodes along a delivery path in a sensor network. The object of optimizing retransmission thresholds is to maximize the summation of the probability of the packet being successfully delivered to the next relay node or destination node in time. A dynamic programming-based distributed algorithm for finding optimal retransmission thresholds for relay nodes along a delivery path in the sensor network is proposed. The time complexity is OnΔ·max1≤i≤n{ui}, where ui is the given upper bound of the retransmission threshold of sensor node i in a given delivery path, n is the length of the delivery path and Δ is the given upper bound of the transmission delay of the delivery path. If Δ is greater than the polynomial, to reduce the time complexity, a linear programming-based (1+pmin)-approximation algorithm is proposed. Furthermore, when the ranges of the upper and lower bounds of retransmission thresholds are big enough, a Lagrange multiplier-based distributed O(1)-approximation algorithm with time complexity O(1) is proposed. Experimental results show that the proposed algorithms have better performance. PMID:27171092

Robust Accurate Non-Invasive Analyte Monitor

DOEpatents

Robinson, Mark R.

1998-11-03

An improved method and apparatus for determining noninvasively and in vivo one or more unknown values of a known characteristic, particularly the concentration of an analyte in human tissue. The method includes: (1) irradiating the tissue with infrared energy (400 nm-2400 nm) having at least several wavelengths in a given range of wavelengths so that there is differential absorption of at least some of the wavelengths by the tissue as a function of the wavelengths and the known characteristic, the differential absorption causeing intensity variations of the wavelengths incident from the tissue; (2) providing a first path through the tissue; (3) optimizing the first path for a first sub-region of the range of wavelengths to maximize the differential absorption by at least some of the wavelengths in the first sub-region; (4) providing a second path through the tissue; and (5) optimizing the second path for a second sub-region of the range, to maximize the differential absorption by at least some of the wavelengths in the second sub-region. In the preferred embodiment a third path through the tissue is provided for, which path is optimized for a third sub-region of the range. With this arrangement, spectral variations which are the result of tissue differences (e.g., melanin and temperature) can be reduced. At least one of the paths represents a partial transmission path through the tissue. This partial transmission path may pass through the nail of a finger once and, preferably, twice. Also included are apparatus for: (1) reducing the arterial pulsations within the tissue; and (2) maximizing the blood content i the tissue.

Local position control: A new concept for control of manipulators

NASA Technical Reports Server (NTRS)

Kelly, Frederick A.

1988-01-01

Resolved motion rate control is currently one of the most frequently used methods of manipulator control. It is currently used in the Space Shuttle remote manipulator system (RMS) and in prosthetic devices. Position control is predominately used in locating the end-effector of an industrial manipulator along a path with prescribed timing. In industrial applications, resolved motion rate control is inappropriate since position error accumulates. This is due to velocity being the control variable. In some applications this property is an advantage rather than a disadvantage. It may be more important for motion to end as soon as the input command is removed rather than reduce the position error to zero. Local position control is a new concept for manipulator control which retains the important properties of resolved motion rate control, but reduces the drift. Local position control can be considered to be a generalization of resolved position and resolved rate control. It places both control schemes on a common mathematical basis.

Telemanipulator design and optimization software

NASA Astrophysics Data System (ADS)

Cote, Jean; Pelletier, Michel

1995-12-01

For many years, industrial robots have been used to execute specific repetitive tasks. In those cases, the optimal configuration and location of the manipulator only has to be found once. The optimal configuration or position where often found empirically according to the tasks to be performed. In telemanipulation, the nature of the tasks to be executed is much wider and can be very demanding in terms of dexterity and workspace. The position/orientation of the robot's base could be required to move during the execution of a task. At present, the choice of the initial position of the teleoperator is usually found empirically which can be sufficient in the case of an easy or repetitive task. In the converse situation, the amount of time wasted to move the teleoperator support platform has to be taken into account during the execution of the task. Automatic optimization of the position/orientation of the platform or a better designed robot configuration could minimize these movements and save time. This paper will present two algorithms. The first algorithm is used to optimize the position and orientation of a given manipulator (or manipulators) with respect to the environment on which a task has to be executed. The second algorithm is used to optimize the position or the kinematic configuration of a robot. For this purpose, the tasks to be executed are digitized using a position/orientation measurement system and a compact representation based on special octrees. Given a digitized task, the optimal position or Denavit-Hartenberg configuration of the manipulator can be obtained numerically. Constraints on the robot design can also be taken into account. A graphical interface has been designed to facilitate the use of the two optimization algorithms.

Trajectory control of robot manipulators with closed-kinematic chain mechanism

NASA Technical Reports Server (NTRS)

Nguyen, Charles C.; Pooran, Farhad J.; Premack, Timothy

1987-01-01

The problem of Cartesian trajectory control of a closed-kinematic chain mechanism robot manipulator, recently built at CAIR to study the assembly of NASA hardware for the future Space Station, is considered. The study is performed by both computer simulation and experimentation for tracking of three different paths: a straight line, a sinusoid, and a circle. Linearization and pole placement methods are employed to design controller gains. Results show that the controllers are robust and there are good agreements between simulation and experimentation. The results also show excellent tracking quality and small overshoots.

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.

Microfluidics Transport and Path Control via Programmable Electrowetting on Dielectric

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

Theodore W. Von Bitner, Ph.D.

2002-08-22

This research was conducted in collaboration with Professor Chang-Jin Kim of the University of California, Los Angeles. In phase I, the IOS-UCLA collaboration demonstrated the transport and manipulation of insulting liquid droplets using the principles of EWOD. A postage stamp sized array of electronically addressable Teflon pads, whose surface tension characteristics could be altered on command through computer algorithms, was developed and tested using deionized water as the liquid. Going beyond the tasks originally proposed for Phase I, droplet manipulation was achieved and droplet stability in the EWOD device was examined.

The desert ant odometer: a stride integrator that accounts for stride length and walking speed.

PubMed

Wittlinger, Matthias; Wehner, Rüdiger; Wolf, Harald

2007-01-01

Desert ants, Cataglyphis, use path integration as a major means of navigation. Path integration requires measurement of two parameters, namely, direction and distance of travel. Directional information is provided by a celestial compass, whereas distance measurement is accomplished by a stride integrator, or pedometer. Here we examine the recently demonstrated pedometer function in more detail. By manipulating leg lengths in foraging desert ants we could also change their stride lengths. Ants with elongated legs ('stilts') or shortened legs ('stumps') take larger or shorter strides, respectively, and misgauge travel distance. Travel distance is overestimated by experimental animals walking on stilts, and underestimated by animals walking on stumps - strongly indicative of stride integrator function in distance measurement. High-speed video analysis was used to examine the actual changes in stride length, stride frequency and walking speed caused by the manipulations of leg length. Unexpectedly, quantitative characteristics of walking behaviour remained almost unaffected by imposed changes in leg length, demonstrating remarkable robustness of leg coordination and walking performance. These data further allowed normalisation of homing distances displayed by manipulated animals with regard to scaling and speed effects. The predicted changes in homing distance are in quantitative agreement with the experimental data, further supporting the pedometer hypothesis.

Using the Gurobi Solvers on the Peregrine System | High-Performance

Science.gov Websites

Peregrine System Gurobi Optimizer is a suite of solvers for mathematical programming. It is licensed for ('GRB_MATLAB_PATH') >> path(path,grb) Gurobi and GAMS GAMS is a high-level modeling system for mathematical

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

Mann, R.C.; Fujimura, K.; Unseren, M.A.

One of the frontiers in intelligent machine research is the understanding of how constructive cooperation among multiple autonomous agents can be effected. The effort at the Center for Engineering Systems Advanced Research (CESAR)at the Oak Ridge National Laboratory (ORNL) focuses on two problem areas: (1) cooperation by multiple mobile robots in dynamic, incompletely known environments; and (2) cooperating robotic manipulators. Particular emphasis is placed on experimental evaluation of research and developments using the CESAR robot system testbeds, including three mobile robots, and a seven-axis, kinematically redundant mobile manipulator. This paper summarizes initial results of research addressing the decoupling of positionmore » and force control for two manipulators holding a common object, and the path planning for multiple robots in a common workspace. 15 refs., 3 figs.« less

An Optimization-Driven Analysis Pipeline to Uncover Biomarkers and Signaling Paths: Cervix Cancer.

PubMed

Lorenzo, Enery; Camacho-Caceres, Katia; Ropelewski, Alexander J; Rosas, Juan; Ortiz-Mojer, Michael; Perez-Marty, Lynn; Irizarry, Juan; Gonzalez, Valerie; Rodríguez, Jesús A; Cabrera-Rios, Mauricio; Isaza, Clara

2015-06-01

Establishing how a series of potentially important genes might relate to each other is relevant to understand the origin and evolution of illnesses, such as cancer. High-throughput biological experiments have played a critical role in providing information in this regard. A special challenge, however, is that of trying to conciliate information from separate microarray experiments to build a potential genetic signaling path. This work proposes a two-step analysis pipeline, based on optimization, to approach meta-analysis aiming to build a proxy for a genetic signaling path.

Optimal Patrol to Detect Attacks at Dispersed Heterogeneous Locations

DTIC Science & Technology

2013-12-01

path with one revisit SPR2 Shortest path with two revisits SPR3 Shortest path with three revisits TSP Traveling salesman problem UAV Unmanned aerial...path patrol pattern. Finding the shortest-path patrol pattern is an example of solving a traveling salesman problem , as described in Section 16.5 of...use of patrol paths based on the traveling salesman prob- lem (TSP), where patrollers follow the shortest Hamiltonian cycle in a graph in order to

Corrections to scaling for watersheds, optimal path cracks, and bridge lines

NASA Astrophysics Data System (ADS)

Fehr, E.; Schrenk, K. J.; Araújo, N. A. M.; Kadau, D.; Grassberger, P.; Andrade, J. S., Jr.; Herrmann, H. J.

2012-07-01

We study the corrections to scaling for the mass of the watershed, the bridge line, and the optimal path crack in two and three dimensions (2D and 3D). We disclose that these models have numerically equivalent fractal dimensions and leading correction-to-scaling exponents. We conjecture all three models to possess the same fractal dimension, namely, df=1.2168±0.0005 in 2D and df=2.487±0.003 in 3D, and the same exponent of the leading correction, Ω=0.9±0.1 and Ω=1.0±0.1, respectively. The close relations between watersheds, optimal path cracks in the strong disorder limit, and bridge lines are further supported by either heuristic or exact arguments.

Modeling of tool path for the CNC sheet cutting machines

NASA Astrophysics Data System (ADS)

Petunin, Aleksandr A.

2015-11-01

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

Exploring chemical reaction mechanisms through harmonic Fourier beads path optimization.

PubMed

Khavrutskii, Ilja V; Smith, Jason B; Wallqvist, Anders

2013-10-28

Here, we apply the harmonic Fourier beads (HFB) path optimization method to study chemical reactions involving covalent bond breaking and forming on quantum mechanical (QM) and hybrid QM∕molecular mechanical (QM∕MM) potential energy surfaces. To improve efficiency of the path optimization on such computationally demanding potentials, we combined HFB with conjugate gradient (CG) optimization. The combined CG-HFB method was used to study two biologically relevant reactions, namely, L- to D-alanine amino acid inversion and alcohol acylation by amides. The optimized paths revealed several unexpected reaction steps in the gas phase. For example, on the B3LYP∕6-31G(d,p) potential, we found that alanine inversion proceeded via previously unknown intermediates, 2-iminopropane-1,1-diol and 3-amino-3-methyloxiran-2-ol. The CG-HFB method accurately located transition states, aiding in the interpretation of complex reaction mechanisms. Thus, on the B3LYP∕6-31G(d,p) potential, the gas phase activation barriers for the inversion and acylation reactions were 50.5 and 39.9 kcal∕mol, respectively. These barriers determine the spontaneous loss of amino acid chirality and cleavage of peptide bonds in proteins. We conclude that the combined CG-HFB method further advances QM and QM∕MM studies of reaction mechanisms.

Multistructural microiteration technique for geometry optimization and reaction path calculation in large systems.

PubMed

Suzuki, Kimichi; Morokuma, Keiji; Maeda, Satoshi

2017-10-05

We propose a multistructural microiteration (MSM) method for geometry optimization and reaction path calculation in large systems. MSM is a simple extension of the geometrical microiteration technique. In conventional microiteration, the structure of the non-reaction-center (surrounding) part is optimized by fixing atoms in the reaction-center part before displacements of the reaction-center atoms. In this method, the surrounding part is described as the weighted sum of multiple surrounding structures that are independently optimized. Then, geometric displacements of the reaction-center atoms are performed in the mean field generated by the weighted sum of the surrounding parts. MSM was combined with the QM/MM-ONIOM method and applied to chemical reactions in aqueous solution or enzyme. In all three cases, MSM gave lower reaction energy profiles than the QM/MM-ONIOM-microiteration method over the entire reaction paths with comparable computational costs. © 2017 Wiley Periodicals, Inc. © 2017 Wiley Periodicals, Inc.

A path-oriented knowledge representation system: Defusing the combinatorial system

NASA Technical Reports Server (NTRS)

Karamouzis, Stamos T.; Barry, John S.; Smith, Steven L.; Feyock, Stefan

1995-01-01

LIMAP is a programming system oriented toward efficient information manipulation over fixed finite domains, and quantification over paths and predicates. A generalization of Warshall's Algorithm to precompute paths in a sparse matrix representation of semantic nets is employed to allow questions involving paths between components to be posed and answered easily. LIMAP's ability to cache all paths between two components in a matrix cell proved to be a computational obstacle, however, when the semantic net grew to realistic size. The present paper describes a means of mitigating this combinatorial explosion to an extent that makes the use of the LIMAP representation feasible for problems of significant size. The technique we describe radically reduces the size of the search space in which LIMAP must operate; semantic nets of more than 500 nodes have been attacked successfully. Furthermore, it appears that the procedure described is applicable not only to LIMAP, but to a number of other combinatorially explosive search space problems found in AI as well.

Stereoscopic display technologies, interaction paradigms, and rendering approaches for neurosurgical visualization

NASA Astrophysics Data System (ADS)

Cooperstock, Jeremy R.; Wang, Guangyu

2009-02-01

We conducted a comparative study of different stereoscopic display modalities (head-mounted display, polarized projection, and multiview lenticular display) to evaluate their efficacy in supporting manipulation and understanding of 3D content, specifically, in the context of neurosurgical visualization. Our study was intended to quantify the differences in resulting task performance between these choices of display technology. The experimental configuration involved a segmented brain vasculature and a simulated tumor. Subjects were asked to manipulate the vasculature and a pen-like virtual probe in order to define a vessel-free path from cortical surface to the targeted tumor. Because of the anatomical complexity, defining such a path can be a challenging task. To evaluate the system, we quantified performance differences under three different stereoscopic viewing conditions. Our results indicate that, on average, participants achieved best performance using polarized projection, and worst with the multiview lenticular display. These quantitative measurements were further reinforced by the subjects' responses to our post-test questionnaire regarding personal preferences.

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

Webb, Ian K.; Garimella, Sandilya V. B.; Tolmachev, Aleksey V.

A Structures for Lossless Ion Manipulations (SLIM) module that allows ion mobility separations and the switching of ions between alternative drift paths is described. The SLIM switch component has a “Tee” configuration and allows switching of ions between a linear path and a 90-degree bend. By controlling switching times, ions can be deflected to an alternative channel as a function of their mobilities. In the initial evaluation the switch is used in a static mode and shown compatible with high performance ion mobility separations at 4 torr. In the “dynamic mode” we show that mobility-selected ions can be switched intomore » the alternative channel, and that various ion species can be independently selected based on their mobilities for time-of-flight mass spectrometer (TOF MS) IMS detection and mass analysis. Ultimately, this development also provides the basis for e.g. the selection of specific mobilities for storage and accumulation, and key modules for the assembly of SLIM devices enabling much more complex sequences of ion manipulations.« less

TU-G-BRB-01: Continuous Path Optimization for Non-Coplanar Variant SAD IMRT Delivery Using C-Arm Machines.

PubMed

Ruan, D; Dong, P; Low, D; Sheng, K

2012-06-01

To develop and investigate a continuous path optimization methodology to traverse prescribed non-coplanar IMRT beams with variant SADs, by orchestrating the couch and gantry movement with zero-collision, minimal patient motion consequence and machine travel time. We convert the given collision zone definition and the prescribed beam location/angles to a tumor-centric coordinate, and represent the traversing path as a continuous open curve. We proceed to optimize a composite objective function consisting of (1) a strong attraction energy to ensure all prescribed beams are en-route, (2) a penalty for patient-motion inducing couch motion, and (3) a penalty for travel-time inducing overall path-length. Feasibility manifold is defined as complement to collision zone and the optimization is performed with a level set representation evolved with variational flows. The proposed method has been implemented and tested on clinically derived data. In the absence of any existing solutions for the same problem, we validate by: (1) visual inspecting the generated path rendered in the 3D tumor-centric coordinates, and (2) comparing with a traveling-salesman (TSP) solution obtained from relaxing the variant SADs and continuous collision-avoidance requirement. The proposed method has generated delivery paths that are smooth and intuitively appealing. Under relaxed settings, our results outperform the generic TSP solutions and agree with specially tuned versions. We have proposed a novel systematic approach that automatically determines the continuous path to cover non-coplanar, varying SAD IMRT beams. The proposed approach accommodates patient-specific collision zone definition and ensures its avoidance continuously. The differential penalty to couch and gantry motions allows customizable tradeoff between patient geometry stability and delivery efficiency. This development paves the path to achieve safe, accurate and efficient non-coplanar IMRT delivery with the advanced robotic controls in new-generation C-arm systems, enabling practical harvesting of the dose benefit offered by non-coplanar, variant SAD IMRT treatment. © 2012 American Association of Physicists in Medicine.

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.

Generation of elliptical and circular vector hollow beams with different polarizations by a Mach-Zehnder-type optical path

NASA Astrophysics Data System (ADS)

Wang, Zhizhang; Pei, Chunying; Xia, Meng; Yin, Yaling; Xia, Yong; Yin, Jianping

2018-01-01

We present an experimental approach to convert linearly polarized Gaussian beams into elliptical and circular vector hollow beams (VHBs) with different polarization states. The scheme employed is based on a Mach-Zehnder-type optical path combined with a reflective spatial light modulator (SLM) in each path. The resulting VHBs have radial, azimuthal, and other polarization states. Our studies also show that the size of the generated VHBs remains constant during the propagation in free space over a certain distance, and can be controlled by the axial ratio of the SLM’s binary phase plate. These studies deliver great optical parameters and hold promising applications in the fields of optical trapping and manipulation of particles.

Authorship attribution based on Life-Like Network Automata.

PubMed

Machicao, Jeaneth; Corrêa, Edilson A; Miranda, Gisele H B; Amancio, Diego R; Bruno, Odemir M

2018-01-01

The authorship attribution is a problem of considerable practical and technical interest. Several methods have been designed to infer the authorship of disputed documents in multiple contexts. While traditional statistical methods based solely on word counts and related measurements have provided a simple, yet effective solution in particular cases; they are prone to manipulation. Recently, texts have been successfully modeled as networks, where words are represented by nodes linked according to textual similarity measurements. Such models are useful to identify informative topological patterns for the authorship recognition task. However, there is no consensus on which measurements should be used. Thus, we proposed a novel method to characterize text networks, by considering both topological and dynamical aspects of networks. Using concepts and methods from cellular automata theory, we devised a strategy to grasp informative spatio-temporal patterns from this model. Our experiments revealed an outperformance over structural analysis relying only on topological measurements, such as clustering coefficient, betweenness and shortest paths. The optimized results obtained here pave the way for a better characterization of textual networks.

Optimal exploration systems

NASA Astrophysics Data System (ADS)

Klesh, Andrew T.

This dissertation studies optimal exploration, defined as the collection of information about given objects of interest by a mobile agent (the explorer) using imperfect sensors. The key aspects of exploration are kinematics (which determine how the explorer moves in response to steering commands), energetics (which determine how much energy is consumed by motion and maneuvers), informatics (which determine the rate at which information is collected) and estimation (which determines the states of the objects). These aspects are coupled by the steering decisions of the explorer. We seek to improve exploration by finding trade-offs amongst these couplings and the components of exploration: the Mission, the Path and the Agent. A comprehensive model of exploration is presented that, on one hand, accounts for these couplings and on the other hand is simple enough to allow analysis. This model is utilized to pose and solve several exploration problems where an objective function is to be minimized. Specific functions to be considered are the mission duration and the total energy. These exploration problems are formulated as optimal control problems and necessary conditions for optimality are obtained in the form of two-point boundary value problems. An analysis of these problems reveals characteristics of optimal exploration paths. Several regimes are identified for the optimal paths including the Watchtower, Solar and Drag regime, and several non-dimensional parameters are derived that determine the appropriate regime of travel. The so-called Power Ratio is shown to predict the qualitative features of the optimal paths, provide a metric to evaluate an aircrafts design and determine an aircrafts capability for flying perpetually. Optimal exploration system drivers are identified that provide perspective as to the importance of these various regimes of flight. A bank-to-turn solar-powered aircraft flying at constant altitude on Mars is used as a specific platform for analysis using the coupled model. Flight-paths found with this platform are presented that display the optimal exploration problem characteristics. These characteristics are used to form heuristics, such as a Generalized Traveling Salesman Problem solver, to simplify the exploration problem. These heuristics are used to empirically show the successful completion of an exploration mission by a physical explorer.

Transmission Index Research of Parallel Manipulators Based on Matrix Orthogonal Degree

NASA Astrophysics Data System (ADS)

Shao, Zhu-Feng; Mo, Jiao; Tang, Xiao-Qiang; Wang, Li-Ping

2017-11-01

Performance index is the standard of performance evaluation, and is the foundation of both performance analysis and optimal design for the parallel manipulator. Seeking the suitable kinematic indices is always an important and challenging issue for the parallel manipulator. So far, there are extensive studies in this field, but few existing indices can meet all the requirements, such as simple, intuitive, and universal. To solve this problem, the matrix orthogonal degree is adopted, and generalized transmission indices that can evaluate motion/force transmissibility of fully parallel manipulators are proposed. Transmission performance analysis of typical branches, end effectors, and parallel manipulators is given to illustrate proposed indices and analysis methodology. Simulation and analysis results reveal that proposed transmission indices possess significant advantages, such as normalized finite (ranging from 0 to 1), dimensionally homogeneous, frame-free, intuitive and easy to calculate. Besides, proposed indices well indicate the good transmission region and relativity to the singularity with better resolution than the traditional local conditioning index, and provide a novel tool for kinematic analysis and optimal design of fully parallel manipulators.

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.

Grey-Theory-Based Optimization Model of Emergency Logistics Considering Time Uncertainty.

PubMed

Qiu, Bao-Jian; Zhang, Jiang-Hua; Qi, Yuan-Tao; Liu, Yang

2015-01-01

Natural disasters occur frequently in recent years, causing huge casualties and property losses. Nowadays, people pay more and more attention to the emergency logistics problems. This paper studies the emergency logistics problem with multi-center, multi-commodity, and single-affected-point. Considering that the path near the disaster point may be damaged, the information of the state of the paths is not complete, and the travel time is uncertainty, we establish the nonlinear programming model that objective function is the maximization of time-satisfaction degree. To overcome these drawbacks: the incomplete information and uncertain time, this paper firstly evaluates the multiple roads of transportation network based on grey theory and selects the reliable and optimal path. Then simplify the original model under the scenario that the vehicle only follows the optimal path from the emergency logistics center to the affected point, and use Lingo software to solve it. The numerical experiments are presented to show the feasibility and effectiveness of the proposed method.

Grey-Theory-Based Optimization Model of Emergency Logistics Considering Time Uncertainty

PubMed Central

Qiu, Bao-Jian; Zhang, Jiang-Hua; Qi, Yuan-Tao; Liu, Yang

2015-01-01

Natural disasters occur frequently in recent years, causing huge casualties and property losses. Nowadays, people pay more and more attention to the emergency logistics problems. This paper studies the emergency logistics problem with multi-center, multi-commodity, and single-affected-point. Considering that the path near the disaster point may be damaged, the information of the state of the paths is not complete, and the travel time is uncertainty, we establish the nonlinear programming model that objective function is the maximization of time-satisfaction degree. To overcome these drawbacks: the incomplete information and uncertain time, this paper firstly evaluates the multiple roads of transportation network based on grey theory and selects the reliable and optimal path. Then simplify the original model under the scenario that the vehicle only follows the optimal path from the emergency logistics center to the affected point, and use Lingo software to solve it. The numerical experiments are presented to show the feasibility and effectiveness of the proposed method. PMID:26417946

Manipulation and handling processes off-line programming and optimization with use of K-Roset

NASA Astrophysics Data System (ADS)

Gołda, G.; Kampa, A.

2017-08-01

Contemporary trends in development of efficient, flexible manufacturing systems require practical implementation of modern “Lean production” concepts for maximizing customer value through minimizing all wastes in manufacturing and logistics processes. Every FMS is built on the basis of automated and robotized production cells. Except flexible CNC machine tools and other equipments, the industrial robots are primary elements of the system. In the studies, authors look for wastes of time and cost in real tasks of robots, during manipulation processes. According to aspiration for optimization of handling and manipulation processes with use of the robots, the application of modern off-line programming methods and computer simulation, is the best solution and it is only way to minimize unnecessary movements and other instructions. The modelling process of robotized production cell and offline programming of Kawasaki robots in AS-Language will be described. The simulation of robotized workstation will be realized with use of virtual reality software K-Roset. Authors show the process of industrial robot’s programs improvement and optimization in terms of minimizing the number of useless manipulator movements and unnecessary instructions. This is realized in order to shorten the time of production cycles. This will also reduce costs of handling, manipulations and technological process.

Comparison of some evolutionary algorithms for optimization of the path synthesis problem

NASA Astrophysics Data System (ADS)

Grabski, Jakub Krzysztof; Walczak, Tomasz; Buśkiewicz, Jacek; Michałowska, Martyna

2018-01-01

The paper presents comparison of the results obtained in a mechanism synthesis by means of some selected evolutionary algorithms. The optimization problem considered in the paper as an example is the dimensional synthesis of the path generating four-bar mechanism. In order to solve this problem, three different artificial intelligence algorithms are employed in this study.

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.

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.

Hierarchical heuristic search using a Gaussian mixture model for UAV coverage planning.

PubMed

Lin, Lanny; Goodrich, Michael A

2014-12-01

During unmanned aerial vehicle (UAV) search missions, efficient use of UAV flight time requires flight paths that maximize the probability of finding the desired subject. The probability of detecting the desired subject based on UAV sensor information can vary in different search areas due to environment elements like varying vegetation density or lighting conditions, making it likely that the UAV can only partially detect the subject. This adds another dimension of complexity to the already difficult (NP-Hard) problem of finding an optimal search path. We present a new class of algorithms that account for partial detection in the form of a task difficulty map and produce paths that approximate the payoff of optimal solutions. The algorithms use the mode goodness ratio heuristic that uses a Gaussian mixture model to prioritize search subregions. The algorithms search for effective paths through the parameter space at different levels of resolution. We compare the performance of the new algorithms against two published algorithms (Bourgault's algorithm and LHC-GW-CONV algorithm) in simulated searches with three real search and rescue scenarios, and show that the new algorithms outperform existing algorithms significantly and can yield efficient paths that yield payoffs near the optimal.

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

Concentric Tube Robot Design and Optimization Based on Task and Anatomical Constraints

PubMed Central

Bergeles, Christos; Gosline, Andrew H.; Vasilyev, Nikolay V.; Codd, Patrick J.; del Nido, Pedro J.; Dupont, Pierre E.

2015-01-01

Concentric tube robots are catheter-sized continuum robots that are well suited for minimally invasive surgery inside confined body cavities. These robots are constructed from sets of pre-curved superelastic tubes and are capable of assuming complex 3D curves. The family of 3D curves that the robot can assume depends on the number, curvatures, lengths and stiffnesses of the tubes in its tube set. The robot design problem involves solving for a tube set that will produce the family of curves necessary to perform a surgical procedure. At a minimum, these curves must enable the robot to smoothly extend into the body and to manipulate tools over the desired surgical workspace while respecting anatomical constraints. This paper introduces an optimization framework that utilizes procedureor patient-specific image-based anatomical models along with surgical workspace requirements to generate robot tube set designs. The algorithm searches for designs that minimize robot length and curvature and for which all paths required for the procedure consist of stable robot configurations. Two mechanics-based kinematic models are used. Initial designs are sought using a model assuming torsional rigidity. These designs are then refined using a torsionally-compliant model. The approach is illustrated with clinically relevant examples from neurosurgery and intracardiac surgery. PMID:26380575

Spatial Updating Strategy Affects the Reference Frame in Path Integration.

PubMed

He, Qiliang; McNamara, Timothy P

2018-06-01

This study investigated how spatial updating strategies affected the selection of reference frames in path integration. Participants walked an outbound path consisting of three successive waypoints in a featureless environment and then pointed to the first waypoint. We manipulated the alignment of participants' final heading at the end of the outbound path with their initial heading to examine the adopted reference frame. We assumed that the initial heading defined the principal reference direction in an allocentric reference frame. In Experiment 1, participants were instructed to use a configural updating strategy and to monitor the shape of the outbound path while they walked it. Pointing performance was best when the final heading was aligned with the initial heading, indicating the use of an allocentric reference frame. In Experiment 2, participants were instructed to use a continuous updating strategy and to keep track of the location of the first waypoint while walking the outbound path. Pointing performance was equivalent regardless of the alignment between the final and the initial headings, indicating the use of an egocentric reference frame. These results confirmed that people could employ different spatial updating strategies in path integration (Wiener, Berthoz, & Wolbers Experimental Brain Research 208(1) 61-71, 2011), and suggested that these strategies could affect the selection of the reference frame for path integration.

Combining control input with flight path data to evaluate pilot performance in transport aircraft.

PubMed

Ebbatson, Matt; Harris, Don; Huddlestone, John; Sears, Rodney

2008-11-01

When deriving an objective assessment of piloting performance from flight data records, it is common to employ metrics which purely evaluate errors in flight path parameters. The adequacy of pilot performance is evaluated from the flight path of the aircraft. However, in large jet transport aircraft these measures may be insensitive and require supplementing with frequency-based measures of control input parameters. Flight path and control input data were collected from pilots undertaking a jet transport aircraft conversion course during a series of symmetric and asymmetric approaches in a flight simulator. The flight path data were analyzed for deviations around the optimum flight path while flying an instrument landing approach. Manipulation of the flight controls was subject to analysis using a series of power spectral density measures. The flight path metrics showed no significant differences in performance between the symmetric and asymmetric approaches. However, control input frequency domain measures revealed that the pilots employed highly different control strategies in the pitch and yaw axes. The results demonstrate that to evaluate pilot performance fully in large aircraft, it is necessary to employ performance metrics targeted at both the outer control loop (flight path) and the inner control loop (flight control) parameters in parallel, evaluating both the product and process of a pilot's performance.

a Walking Disturbance Index Suggestions for Optimized Path Search for the People with Reduced Mobility

NASA Astrophysics Data System (ADS)

Moon, M.; Bang, Y.; Yu, K.; Kim, J.

2015-10-01

Recently, due to the increased penetration of smart devices and the development of geographic information system (GIS) technology, various route guidance services for pedestrians have been developed. However, until now, pedestrian navigation services for the people with reduced mobility (people who experience discomfort in transportation) including wheelchair users, the elderly, and pregnant women have not been provided. In this study, we present a walking disturbance index methodology for searching an optimized path for the people with reduced mobility by defining the factors that affect the walking of the people with reduced mobility and deriving the weights of these factors. In future research, we expect to be able to provide a navigation system that gives an optimized path for the people with reduced mobility using this method.

System and method for optimal load and source scheduling in context aware homes

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

Shetty, Pradeep; Foslien Graber, Wendy; Mangsuli, Purnaprajna R.

A controller for controlling energy consumption in a home includes a constraints engine to define variables for multiple appliances in the home corresponding to various home modes and persona of an occupant of the home. A modeling engine models multiple paths of energy utilization of the multiple appliances to place the home into a desired state from a current context. An optimal scheduler receives the multiple paths of energy utilization and generates a schedule as a function of the multiple paths and a selected persona to place the home in a desired state.

Rapid optimization of tension distribution for cable-driven parallel manipulators with redundant cables

NASA Astrophysics Data System (ADS)

Ouyang, Bo; Shang, Weiwei

2016-03-01

The solution of tension distributions is infinite for cable-driven parallel manipulators(CDPMs) with redundant cables. A rapid optimization method for determining the optimal tension distribution is presented. The new optimization method is primarily based on the geometry properties of a polyhedron and convex analysis. The computational efficiency of the optimization method is improved by the designed projection algorithm, and a fast algorithm is proposed to determine which two of the lines are intersected at the optimal point. Moreover, a method for avoiding the operating point on the lower tension limit is developed. Simulation experiments are implemented on a six degree-of-freedom(6-DOF) CDPM with eight cables, and the results indicate that the new method is one order of magnitude faster than the standard simplex method. The optimal distribution of tension distribution is thus rapidly established on real-time by the proposed method.

Research and development at ORNL/CESAR towards cooperating robotic systems for hazardous environments

NASA Technical Reports Server (NTRS)

Mann, R. C.; Fujimura, K.; Unseren, M. A.

1992-01-01

One of the frontiers in intelligent machine research is the understanding of how constructive cooperation among multiple autonomous agents can be effected. The effort at the Center for Engineering Systems Advanced Research (CESAR) at the Oak Ridge National Laboratory (ORNL) focuses on two problem areas: (1) cooperation by multiple mobile robots in dynamic, incompletely known environments; and (2) cooperating robotic manipulators. Particular emphasis is placed on experimental evaluation of research and developments using the CESAR robot system testbeds, including three mobile robots, and a seven-axis, kinematically redundant mobile manipulator. This paper summarizes initial results of research addressing the decoupling of position and force control for two manipulators holding a common object, and the path planning for multiple robots in a common workspace.

A new performance index for the repetitive motion of mobile manipulators.

PubMed

Xiao, Lin; Zhang, Yunong

2014-02-01

A mobile manipulator is a robotic device composed of a mobile platform and a stationary manipulator fixed to the platform. To achieve the repetitive motion control of mobile manipulators, the mobile platform and the manipulator have to realize the repetitive motion simultaneously. To do so, a novel quadratic performance index is, for the first time, designed and presented in this paper, of which the effectiveness is analyzed by following a neural dynamics method. Then, a repetitive motion scheme is proposed by combining the criterion, physical constraints, and integrated kinematical equations of mobile manipulators, which is further reformulated as a quadratic programming (QP) subject to equality and bound constraints. In addition, two important Bridge theorems are established to prove that such a QP can be converted equivalently into a linear variational inequality, and then equivalently into a piecewise-linear projection equation (PLPE). A real-time numerical algorithm based on PLPE is thus developed and applied for the online solution of the resultant QP. Two tracking-path tasks demonstrate the effectiveness and accuracy of the repetitive motion scheme. In addition, comparisons between the nonrepetitive and repetitive motion further validate the superiority and novelty of the proposed scheme.

Prescribed fire effects on activity and movement of cattle in mesic sagebrush steppe

USDA-ARS?s Scientific Manuscript database

Prescribed fire has long been used worldwide for livestock and wildlife management. The efficacy of prescribed fire for manipulating grazing animal distribution and diet quality has been well studied in many ecosystems but prescribed-fire effects on activity budgets and movement path characteristic...

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.

An Application of Multi-Criteria Shortest Path to a Customizable Hex-Map Environment

DTIC Science & Technology

2015-03-26

forces which could act as intermediate destinations or obstacles to movement through the network. This is similar to a traveling salesman problem ...118 Abstract The shortest path problem of finding the optimal path through a complex network is well-studied in the field of operations research. This...research presents an applica- tion of the shortest path problem to a customizable map with terrain features and enemy engagement risk. The PathFinder

End-point controller design for an experimental two-link flexible manipulator using convex optimization

NASA Technical Reports Server (NTRS)

Oakley, Celia M.; Barratt, Craig H.

1990-01-01

Recent results in linear controller design are used to design an end-point controller for an experimental two-link flexible manipulator. A nominal 14-state linear-quadratic-Gaussian (LQG) controller was augmented with a 528-tap finite-impulse-response (FIR) filter designed using convex optimization techniques. The resulting 278-state controller produced improved end-point trajectory tracking and disturbance rejection in simulation and experimentally in real time.

Coherent control of plasma dynamics by feedback-optimized wavefront manipulation

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

He, Z.-H.; Hou, B.; Gao, G.

2015-05-15

Plasmas generated by an intense laser pulse can support coherent structures such as large amplitude wakefield that can affect the outcome of an experiment. We investigate the coherent control of plasma dynamics by feedback-optimized wavefront manipulation using a deformable mirror. The experimental outcome is directly used as feedback in an evolutionary algorithm for optimization of the phase front of the driving laser pulse. In this paper, we applied this method to two different experiments: (i) acceleration of electrons in laser driven plasma waves and (ii) self-compression of optical pulses induced by ionization nonlinearity. The manipulation of the laser wavefront leadsmore » to orders of magnitude improvement to electron beam properties such as the peak charge, beam divergence, and transverse emittance. The demonstration of coherent control for plasmas opens new possibilities for future laser-based accelerators and their applications.« less

Liouville action as path-integral complexity: from continuous tensor networks to AdS/CFT

NASA Astrophysics Data System (ADS)

Caputa, Pawel; Kundu, Nilay; Miyaji, Masamichi; Takayanagi, Tadashi; Watanabe, Kento

2017-11-01

We propose an optimization procedure for Euclidean path-integrals that evaluate CFT wave functionals in arbitrary dimensions. The optimization is performed by minimizing certain functional, which can be interpreted as a measure of computational complexity, with respect to background metrics for the path-integrals. In two dimensional CFTs, this functional is given by the Liouville action. We also formulate the optimization for higher dimensional CFTs and, in various examples, find that the optimized hyperbolic metrics coincide with the time slices of expected gravity duals. Moreover, if we optimize a reduced density matrix, the geometry becomes two copies of the entanglement wedge and reproduces the holographic entanglement entropy. Our approach resembles a continuous tensor network renormalization and provides a concrete realization of the proposed interpretation of AdS/CFT as tensor networks. The present paper is an extended version of our earlier report arXiv:1703.00456 and includes many new results such as evaluations of complexity functionals, energy stress tensor, higher dimensional extensions and time evolutions of thermofield double states.

Coercion in the Evolution of Plant-Microbe Communication: A Perspective.

PubMed

Rowe, S L; Norman, J S; Friesen, M L

2018-06-06

Plants and microbes are dependent on chemical signals as a means of interkingdom communication. There are two predicted paths for the evolution of these signals. Ritualization is the oft-assumed pathway for the evolution of plant-microbe communication systems. In this process, chemical signals, which benefit both receiver and sender, evolve from chemical cues, which benefit only the receiver. However, plant-microbe signaling may evolve from coercive interactions as well, a process known as sensory manipulation. Here, we aim to highlight the prevalence of coercive interactions and discuss sensory manipulation in the context of plant-microbe interactions. We present two examples of stabilized coercion: microbial coercion of plants via the release of phytohormones and plant coercion of microbes via manipulation of quorum-sensing compounds. Furthermore, we provide an evolutionary framework for the emergence of signaling from coercive plant-microbe interactions through the process of sensory manipulation. We hope that researchers will recognize the relevance of coercive interactions in plant-microbe systems and consider sensory manipulation as a plausible evolutionary trajectory for the emergence of plant-microbe signaling.

Visualizing Motion Patterns in Acupuncture Manipulation.

PubMed

Lee, Ye-Seul; Jung, Won-Mo; Lee, In-Seon; Lee, Hyangsook; Park, Hi-Joon; Chae, Younbyoung

2016-07-16

Acupuncture manipulation varies widely among practitioners in clinical settings, and it is difficult to teach novice students how to perform acupuncture manipulation techniques skillfully. The Acupuncture Manipulation Education System (AMES) is an open source software system designed to enhance acupuncture manipulation skills using visual feedback. Using a phantom acupoint and motion sensor, our method for acupuncture manipulation training provides visual feedback regarding the actual movement of the student's acupuncture manipulation in addition to the optimal or intended movement, regardless of whether the manipulation skill is lifting, thrusting, or rotating. Our results show that students could enhance their manipulation skills by training using this method. This video shows the process of manufacturing phantom acupoints and discusses several issues that may require the attention of individuals interested in creating phantom acupoints or operating this system.

A path-oriented matrix-based knowledge representation system

NASA Technical Reports Server (NTRS)

Feyock, Stefan; Karamouzis, Stamos T.

1993-01-01

Experience has shown that designing a good representation is often the key to turning hard problems into simple ones. Most AI (Artificial Intelligence) search/representation techniques are oriented toward an infinite domain of objects and arbitrary relations among them. In reality much of what needs to be represented in AI can be expressed using a finite domain and unary or binary predicates. Well-known vector- and matrix-based representations can efficiently represent finite domains and unary/binary predicates, and allow effective extraction of path information by generalized transitive closure/path matrix computations. In order to avoid space limitations a set of abstract sparse matrix data types was developed along with a set of operations on them. This representation forms the basis of an intelligent information system for representing and manipulating relational data.

Assessment of Masonry Buildings Subjected to Landslide-Induced Settlements: From Load Path Method to Evolutionary Optimization Method

NASA Astrophysics Data System (ADS)

Palmisano, Fabrizio; Elia, Angelo

2017-10-01

One of the main difficulties, when dealing with landslide structural vulnerability, is the diagnosis of the causes of crack patterns. This is also due to the excessive complexity of models based on classical structural mechanics that makes them inappropriate especially when there is the necessity to perform a rapid vulnerability assessment at the territorial scale. This is why, a new approach, based on a ‘simple model’ (i.e. the Load Path Method, LPM), has been proposed by Palmisano and Elia for the interpretation of the behaviour of masonry buildings subjected to landslide-induced settlements. However, the LPM is very useful for rapidly finding the 'most plausible solution' instead of the exact solution. To find the solution, optimization algorithms are necessary. In this scenario, this article aims to show how the Bidirectional Evolutionary Structural Optimization method by Huang and Xie, can be very useful to optimize the strut-and-tie models obtained by using the Load Path Method.

Optimization of MLS receivers for multipath environments

NASA Technical Reports Server (NTRS)

Mcalpine, G. A.; Irwin, S. H.; NELSON; Roleyni, G.

1977-01-01

Optimal design studies of MLS angle-receivers and a theoretical design-study of MLS DME-receivers are reported. The angle-receiver results include an integration of the scan data processor and tracking filter components of the optimal receiver into a unified structure. An extensive simulation study comparing the performance of the optimal and threshold receivers in a wide variety of representative dynamical interference environments was made. The optimal receiver was generally superior. A simulation of the performance of the threshold and delay-and-compare receivers in various signal environments was performed. An analysis of combined errors due to lateral reflections from vertical structures with small differential path delays, specular ground reflections with neglible differential path delays, and thermal noise in the receivers is provided.

Apparatus and method for controlling autotroph cultivation

DOEpatents

Fuxman, Adrian M; Tixier, Sebastien; Stewart, Gregory E; Haran, Frank M; Backstrom, Johan U; Gerbrandt, Kelsey

2013-07-02

A method includes receiving at least one measurement of a dissolved carbon dioxide concentration of a mixture of fluid containing an autotrophic organism. The method also includes determining an adjustment to one or more manipulated variables using the at least one measurement. The method further includes generating one or more signals to modify the one or more manipulated variables based on the determined adjustment. The one or more manipulated variables could include a carbon dioxide flow rate, an air flow rate, a water temperature, and an agitation level for the mixture. At least one model relates the dissolved carbon dioxide concentration to one or more manipulated variables, and the adjustment could be determined by using the at least one model to drive the dissolved carbon dioxide concentration to at least one target that optimize a goal function. The goal function could be to optimize biomass growth rate, nutrient removal and/or lipid production.

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.

Impulsive noise suppression in color images based on the geodesic digital paths

NASA Astrophysics Data System (ADS)

Smolka, Bogdan; Cyganek, Boguslaw

2015-02-01

In the paper a novel filtering design based on the concept of exploration of the pixel neighborhood by digital paths is presented. The paths start from the boundary of a filtering window and reach its center. The cost of transitions between adjacent pixels is defined in the hybrid spatial-color space. Then, an optimal path of minimum total cost, leading from pixels of the window's boundary to its center is determined. The cost of an optimal path serves as a degree of similarity of the central pixel to the samples from the local processing window. If a pixel is an outlier, then all the paths starting from the window's boundary will have high costs and the minimum one will also be high. The filter output is calculated as a weighted mean of the central pixel and an estimate constructed using the information on the minimum cost assigned to each image pixel. So, first the costs of optimal paths are used to build a smoothed image and in the second step the minimum cost of the central pixel is utilized for construction of the weights of a soft-switching scheme. The experiments performed on a set of standard color images, revealed that the efficiency of the proposed algorithm is superior to the state-of-the-art filtering techniques in terms of the objective restoration quality measures, especially for high noise contamination ratios. The proposed filter, due to its low computational complexity, can be applied for real time image denoising and also for the enhancement of video streams.

[Analysis of optimal plan of multiple acupuncture manipulations for shoulder pain after stroke at different stages].

PubMed

Chen, Dachun; Gao, Jianyu; Chen, Lu; Hao, Zhuanzhuan; Fan, Gangqi

2015-12-01

To observe the effects between acupuncture combined with rehabilitation and simple rehabilitation for shoulder pain after stroke, and to select the best plan of acupuncture manipulations at different stages by orthogonal design. Ninety patients were treated with comprehensive rehabilitation, and nine cases without acupuncture were arranged into a control group. Eighty-one patients of orthogonal design were applied by acupuncture with the same acupoints and course. The VAS score and its weighted value were regarded as the observation indices,and the effects between the acupuncture group and the control group were compared. The optimal plans of acupuncture manipulations of the early stage and the later stage were chosen after the first course treatment and the third course treatment separately. The acupuncture depth (factor A:A: shallow depth less than 25 mm, A(II): modest depth 25-40 mm, A(III): deep depth 40-50 mm), the acupuncture angle (factor B:B(I): perpendicular insertion, B(II): horizontal insertion, B(III): oblique insertion), needle manipulated frequency (factor C: C(I): zero time, C(II): one time, C(III): three times) and needle retained time(factor D:D(I):20 min, D(II): 30 min, D(III): 60 min) were studied. The differences among all factors and the diversity among major factors at different stages were analyzed. (1) Acupuncture combined with rehabilitation at the early and the later stage acquired better improvement than simple rehabilitation (all P < 0.01). (2) The optimal acupuncture manipulation plan at the early stage was A(III) B(III) C(I) D(I), which was deep acupuncture and oblique insertion for 20 min with zero-time manipulation; the optimal acupuncture manipulation plan at the later stage was A(III) B(III) C(III) D(I), which was deep acupuncture and oblique insertion for 20 min with three-time manipulation. (3) There was significance for acupuncture depth and angle at the early stage (both P < 0.01) and there was significance for insertion depth, acupuncture angle and manipulating frequency at the later stage (all P < 0.05). (4) At the early stage, the insertion depth was statistically significant between A(I) and A(II), A(I) and A(III), A(II) and A(III) (P < 0.05, P < 0.01), and the statistical significance was existed between B(I) and B(III) (P < 0.01). At the later stage, the insertion depth was statistically significant between A(I) and A(III), A(III) and A(II), A(I) and A(II) (P < 0.05, P < 0.01), and the statistical significance was existed between C(I) and C(III), C(II) and C(III) (P < 0.05). Acupuncture combined with rehabilitation acquire apparent effect for shoulder pain after stroke. At the early stage,the optimal plan is deep and oblique insertion for 20 min with zero-time manipulation. At the later stage, the best plan is deep and oblique insertion for 20 min with 3-time manipulation.

Quantum correlation of path-entangled two-photon states in waveguide arrays with defects

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

Dou, Yiling; Xu, Lei; Han, Bin

We study the quantum correlation of path-entangled states of two photons in coupled one-dimensional waveguide arrays with lattice defects. Both off-diagonal and diagonal defects are considered, which show different effects on the quantum correlation of path-entangled two-photon states. Two-photon bunching or anti-bunching effects can be observed and controlled. The two photons are found to have a tendency to bunch at the side lobes with a repulsive off-diagonal defect, and the path-entanglement of the input two-photon state can be preserved during the propagation. We also found that defect modes may play an important role on the two-photon correlation of path-entangled statesmore » in the waveguide arrays. Due to the quantum interference effect, intriguing evolution dynamics of the two-photon correlation matrix elements with oscillation frequencies being either twice of or the same as that of a classical light wave, depending on the position of the correlation matrix element, is observed. Our results show that it is possible to manipulate the two-photon correlation properties of path-entangled states in waveguide arrays with lattice defects.« less

Effect of reflected and refracted signals on coherent underwater acoustic communication: results from the Kauai experiment (KauaiEx 2003).

PubMed

Rouseff, Daniel; Badiey, Mohsen; Song, Aijun

2009-11-01

The performance of a communications equalizer is quantified in terms of the number of acoustic paths that are treated as usable signal. The analysis uses acoustical and oceanographic data collected off the Hawaiian Island of Kauai. Communication signals were measured on an eight-element vertical array at two different ranges, 1 and 2 km, and processed using an equalizer based on passive time-reversal signal processing. By estimating the Rayleigh parameter, it is shown that all paths reflected by the sea surface at both ranges undergo incoherent scattering. It is demonstrated that some of these incoherently scattered paths are still useful for coherent communications. At range of 1 km, optimal communications performance is achieved when six acoustic paths are retained and all paths with more than one reflection off the sea surface are rejected. Consistent with a model that ignores loss from near-surface bubbles, the performance improves by approximately 1.8 dB when increasing the number of retained paths from four to six. The four-path results though are more stable and require less frequent channel estimation. At range of 2 km, ray refraction is observed and communications performance is optimal when some paths with two sea-surface reflections are retained.

Optimal Predictive Control for Path Following of a Full Drive-by-Wire Vehicle at Varying Speeds

NASA Astrophysics Data System (ADS)

SONG, Pan; GAO, Bolin; XIE, Shugang; FANG, Rui

2017-05-01

The current research of the global chassis control problem for the full drive-by-wire vehicle focuses on the control allocation (CA) of the four-wheel-distributed traction/braking/steering systems. However, the path following performance and the handling stability of the vehicle can be enhanced a step further by automatically adjusting the vehicle speed to the optimal value. The optimal solution for the combined longitudinal and lateral motion control (MC) problem is given. First, a new variable step-size spatial transformation method is proposed and utilized in the prediction model to derive the dynamics of the vehicle with respect to the road, such that the tracking errors can be explicitly obtained over the prediction horizon at varying speeds. Second, a nonlinear model predictive control (NMPC) algorithm is introduced to handle the nonlinear coupling between any two directions of the vehicular planar motion and computes the sequence of the optimal motion states for following the desired path. Third, a hierarchical control structure is proposed to separate the motion controller into a NMPC based path planner and a terminal sliding mode control (TSMC) based path follower. As revealed through off-line simulations, the hierarchical methodology brings nearly 1700% improvement in computational efficiency without loss of control performance. Finally, the control algorithm is verified through a hardware in-the-loop simulation system. Double-lane-change (DLC) test results show that by using the optimal predictive controller, the root-mean-square (RMS) values of the lateral deviations and the orientation errors can be reduced by 41% and 30%, respectively, comparing to those by the optimal preview acceleration (OPA) driver model with the non-preview speed-tracking method. Additionally, the average vehicle speed is increased by 0.26 km/h with the peak sideslip angle suppressed to 1.9°. This research proposes a novel motion controller, which provides the full drive-by-wire vehicle with better lane-keeping and collision-avoidance capabilities during autonomous driving.

Simulation based optimization on automated fibre placement process

NASA Astrophysics Data System (ADS)

Lei, Shi

2018-02-01

In this paper, a software simulation (Autodesk TruPlan & TruFiber) based method is proposed to optimize the automate fibre placement (AFP) process. Different types of manufacturability analysis are introduced to predict potential defects. Advanced fibre path generation algorithms are compared with respect to geometrically different parts. Major manufacturing data have been taken into consideration prior to the tool paths generation to achieve high success rate of manufacturing.

Is addiction a failure of rationality?

PubMed

Ferguson, Brian

2012-01-01

This note argues that addiction itself can be seen as a form of double failure, specifically the failure to stick to a predetermined optimal lifetime consumption path for an addictive commodity, which failure might be the result of bad luck, and the failure to adjust the level of consumption of the addictive commodity once the consumer is off their optimal path, which might be seen as a failure of judgment.

Springback effects during single point incremental forming: Optimization of the tool path

NASA Astrophysics Data System (ADS)

Giraud-Moreau, Laurence; Belchior, Jérémy; Lafon, Pascal; Lotoing, Lionel; Cherouat, Abel; Courtielle, Eric; Guines, Dominique; Maurine, Patrick

2018-05-01

Incremental sheet forming is an emerging process to manufacture sheet metal parts. This process is more flexible than conventional one and well suited for small batch production or prototyping. During the process, the sheet metal blank is clamped by a blank-holder and a small-size smooth-end hemispherical tool moves along a user-specified path to deform the sheet incrementally. Classical three-axis CNC milling machines, dedicated structure or serial robots can be used to perform the forming operation. Whatever the considered machine, large deviations between the theoretical shape and the real shape can be observed after the part unclamping. These deviations are due to both the lack of stiffness of the machine and residual stresses in the part at the end of the forming stage. In this paper, an optimization strategy of the tool path is proposed in order to minimize the elastic springback induced by residual stresses after unclamping. A finite element model of the SPIF process allowing the shape prediction of the formed part with a good accuracy is defined. This model, based on appropriated assumptions, leads to calculation times which remain compatible with an optimization procedure. The proposed optimization method is based on an iterative correction of the tool path. The efficiency of the method is shown by an improvement of the final shape.

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.

Performance Benefits with Scene-Linked HUD Symbology: An Attentional Phenomenon?

NASA Technical Reports Server (NTRS)

Levy, Jonathan L.; Foyle, David C.; McCann, Robert S.; Null, Cynthia H. (Technical Monitor)

1999-01-01

Previous research has shown that in a simulated flight task, navigating a path defined by ground markers while maintaining a target altitude is more accurate when an altitude indicator appears in a virtual "scenelinked" format (projected symbology moving as if it were part of the out-the-window environment) compared to the fixed-location, superimposed format found on present-day HUDs (Foyle, McCann & Shelden, 1995). One explanation of the scene-linked performance advantage is that attention can be divided between scene-linked symbology and the outside world more efficiently than between standard (fixed-position) HUD symbology and the outside world. The present study tested two alternative explanations by manipulating the location of the scene-linked HUD symbology relative to the ground path markers. Scene-linked symbology yielded better ground path-following performance than standard fixed-location superimposed symbology regardless of whether the scene-linked symbology appeared directly along the ground path or at various distances off the path. The results support the explanation that the performance benefits found with scene-linked symbology are attentional.

Quadcopter Path Following Control Design Using Output Feedback with Command Generator Tracker LOS Based At Square Path

NASA Astrophysics Data System (ADS)

Nugraha, A. T.; Agustinah, T.

2018-01-01

Quadcopter an unstable system, underactuated and nonlinear in quadcopter control research developments become an important focus of attention. In this study, following the path control method for position on the X and Y axis, used structure-Generator Tracker Command (CGT) is tested. Attitude control and position feedback quadcopter is compared using the optimal output. The addition of the H∞ performance optimal output feedback control is used to maintain the stability and robustness of quadcopter. Iterative numerical techniques Linear Matrix Inequality (LMI) is used to find the gain controller. The following path control problems is solved using the method of LQ regulators with output feedback. Simulations show that the control system can follow the paths that have been defined in the form of a reference signal square shape. The result of the simulation suggest that the method which used can bring the yaw angle at the expected value algorithm. Quadcopter can do automatically following path with cross track error mean X=0.5 m and Y=0.2 m.

Nanoscale imaging of clinical specimens using pathology-optimized expansion microscopy

PubMed Central

Zhao, Yongxin; Bucur, Octavian; Irshad, Humayun; Chen, Fei; Weins, Astrid; Stancu, Andreea L.; Oh, Eun-Young; DiStasio, Marcello; Torous, Vanda; Glass, Benjamin; Stillman, Isaac E.; Schnitt, Stuart J.; Beck, Andrew H.; Boyden, Edward S.

2017-01-01

Expansion microscopy (ExM), a method for improving the resolution of light microscopy by physically expanding the specimen, has not been applied to clinical tissue samples. Here we report a clinically optimized form of ExM that supports nanoscale imaging of human tissue specimens that have been fixed with formalin, embedded in paraffin, stained with hematoxylin and eosin (H&E), and/or fresh frozen. The method, which we call expansion pathology (ExPath), converts clinical samples into an ExM-compatible state, then applies an ExM protocol with protein anchoring and mechanical homogenization steps optimized for clinical samples. ExPath enables ~70 nm resolution imaging of diverse biomolecules in intact tissues using conventional diffraction-limited microscopes, and standard antibody and fluorescent DNA in situ hybridization reagents. We use ExPath for optical diagnosis of kidney minimal-change disease, which previously required electron microscopy (EM), and demonstrate high-fidelity computational discrimination between early breast neoplastic lesions that to date have challenged human judgment. ExPath may enable the routine use of nanoscale imaging in pathology and clinical research. PMID:28714966

A star recognition method based on the Adaptive Ant Colony algorithm for star sensors.

PubMed

Quan, Wei; Fang, Jiancheng

2010-01-01

A new star recognition method based on the Adaptive Ant Colony (AAC) algorithm has been developed to increase the star recognition speed and success rate for star sensors. This method draws circles, with the center of each one being a bright star point and the radius being a special angular distance, and uses the parallel processing ability of the AAC algorithm to calculate the angular distance of any pair of star points in the circle. The angular distance of two star points in the circle is solved as the path of the AAC algorithm, and the path optimization feature of the AAC is employed to search for the optimal (shortest) path in the circle. This optimal path is used to recognize the stellar map and enhance the recognition success rate and speed. The experimental results show that when the position error is about 50″, the identification success rate of this method is 98% while the Delaunay identification method is only 94%. The identification time of this method is up to 50 ms.

Nanoscale imaging of clinical specimens using pathology-optimized expansion microscopy.

PubMed

Zhao, Yongxin; Bucur, Octavian; Irshad, Humayun; Chen, Fei; Weins, Astrid; Stancu, Andreea L; Oh, Eun-Young; DiStasio, Marcello; Torous, Vanda; Glass, Benjamin; Stillman, Isaac E; Schnitt, Stuart J; Beck, Andrew H; Boyden, Edward S

2017-08-01

Expansion microscopy (ExM), a method for improving the resolution of light microscopy by physically expanding a specimen, has not been applied to clinical tissue samples. Here we report a clinically optimized form of ExM that supports nanoscale imaging of human tissue specimens that have been fixed with formalin, embedded in paraffin, stained with hematoxylin and eosin, and/or fresh frozen. The method, which we call expansion pathology (ExPath), converts clinical samples into an ExM-compatible state, then applies an ExM protocol with protein anchoring and mechanical homogenization steps optimized for clinical samples. ExPath enables ∼70-nm-resolution imaging of diverse biomolecules in intact tissues using conventional diffraction-limited microscopes and standard antibody and fluorescent DNA in situ hybridization reagents. We use ExPath for optical diagnosis of kidney minimal-change disease, a process that previously required electron microscopy, and we demonstrate high-fidelity computational discrimination between early breast neoplastic lesions for which pathologists often disagree in classification. ExPath may enable the routine use of nanoscale imaging in pathology and clinical research.

Efficient evaluation of atom tunneling combined with electronic structure calculations.

PubMed

Ásgeirsson, Vilhjálmur; Arnaldsson, Andri; Jónsson, Hannes

2018-03-14

Methodology for finding optimal tunneling paths and evaluating tunneling rates for atomic rearrangements is described. First, an optimal JWKB tunneling path for a system with fixed energy is obtained using a line integral extension of the nudged elastic band method. Then, a calculation of the dynamics along the path is used to determine the temperature at which it corresponds to an optimal Feynman path for thermally activated tunneling (instanton) and a harmonic approximation is used to estimate the transition rate. The method is illustrated with calculations for a modified two-dimensional Müller-Brown surface but is efficient enough to be used in combination with electronic structure calculations of the energy and atomic forces in systems containing many atoms. An example is presented where tunneling is the dominant mechanism well above room temperature as an H 3 BNH 3 molecule dissociates to form H 2 . Also, a solid-state example is presented where density functional theory calculations of H atom tunneling in a Ta crystal give close agreement with experimental measurements on hydrogen diffusion over a wide range in temperature.

Creating Cycling-Friendly Environments for Children: Which Micro-Scale Factors Are Most Important? An Experimental Study Using Manipulated Photographs

PubMed Central

Ghekiere, Ariane; Deforche, Benedicte; Mertens, Lieze; De Bourdeaudhuij, Ilse; Clarys, Peter; de Geus, Bas; Cardon, Greet; Nasar, Jack; Salmon, Jo; Van Cauwenberg, Jelle

2015-01-01

Background Increasing participation in transportation cycling represents a useful strategy for increasing children’s physical activity levels. Knowledge on how to design environments to encourage adoption and maintenance of transportation cycling is limited and relies mainly on observational studies. The current study experimentally investigates the relative importance of micro-scale environmental factors for children’s transportation cycling, as these micro-scale factors are easier to change within an existing neighborhood compared to macro-scale environmental factors (i.e. connectivity, land-use mix, …). Methods Researchers recruited children and their parents (n = 1232) via 45 randomly selected schools across Flanders and completed an online questionnaire which consisted of 1) demographic questions; and 2) a choice-based conjoint (CBC) task. During this task, participants chose between two photographs which we had experimentally manipulated in seven micro-scale environmental factors: type of cycle path; evenness of cycle path; traffic speed; traffic density; presence of speed bumps; environmental maintenance; and vegetation. Participants indicated which route they preferred to (let their child) cycle along. To find the relative importance of these micro-scale environmental factors, we conducted Hierarchical Bayes analyses. Results Type of cycle path emerged as the most important factor by far among both children and their parents, followed by traffic density and maintenance, and evenness of the cycle path among children. Among parents, speed limits and maintenance emerged as second most important, followed by evenness of the cycle path, and traffic density. Conclusion Findings indicate that improvements in micro-scale environmental factors might be effective for increasing children’s transportation cycling, since they increase the perceived supportiveness of the physical environment for transportation cycling. Investments in creating a clearly designated space for the young cyclist, separated from motorized traffic, appears to be the most effective way to increase perceived supportiveness. Future research should confirm our laboratory findings with experimental on-site research. PMID:26625119

Creating Cycling-Friendly Environments for Children: Which Micro-Scale Factors Are Most Important? An Experimental Study Using Manipulated Photographs.

PubMed

Ghekiere, Ariane; Deforche, Benedicte; Mertens, Lieze; De Bourdeaudhuij, Ilse; Clarys, Peter; de Geus, Bas; Cardon, Greet; Nasar, Jack; Salmon, Jo; Van Cauwenberg, Jelle

2015-01-01

Increasing participation in transportation cycling represents a useful strategy for increasing children's physical activity levels. Knowledge on how to design environments to encourage adoption and maintenance of transportation cycling is limited and relies mainly on observational studies. The current study experimentally investigates the relative importance of micro-scale environmental factors for children's transportation cycling, as these micro-scale factors are easier to change within an existing neighborhood compared to macro-scale environmental factors (i.e. connectivity, land-use mix, …). Researchers recruited children and their parents (n = 1232) via 45 randomly selected schools across Flanders and completed an online questionnaire which consisted of 1) demographic questions; and 2) a choice-based conjoint (CBC) task. During this task, participants chose between two photographs which we had experimentally manipulated in seven micro-scale environmental factors: type of cycle path; evenness of cycle path; traffic speed; traffic density; presence of speed bumps; environmental maintenance; and vegetation. Participants indicated which route they preferred to (let their child) cycle along. To find the relative importance of these micro-scale environmental factors, we conducted Hierarchical Bayes analyses. Type of cycle path emerged as the most important factor by far among both children and their parents, followed by traffic density and maintenance, and evenness of the cycle path among children. Among parents, speed limits and maintenance emerged as second most important, followed by evenness of the cycle path, and traffic density. Findings indicate that improvements in micro-scale environmental factors might be effective for increasing children's transportation cycling, since they increase the perceived supportiveness of the physical environment for transportation cycling. Investments in creating a clearly designated space for the young cyclist, separated from motorized traffic, appears to be the most effective way to increase perceived supportiveness. Future research should confirm our laboratory findings with experimental on-site research.

A cost-effective intelligent robotic system with dual-arm dexterous coordination and real-time vision

NASA Technical Reports Server (NTRS)

Marzwell, Neville I.; Chen, Alexander Y. K.

1991-01-01

Dexterous coordination of manipulators based on the use of redundant degrees of freedom, multiple sensors, and built-in robot intelligence represents a critical breakthrough in development of advanced manufacturing technology. A cost-effective approach for achieving this new generation of robotics has been made possible by the unprecedented growth of the latest microcomputer and network systems. The resulting flexible automation offers the opportunity to improve the product quality, increase the reliability of the manufacturing process, and augment the production procedures for optimizing the utilization of the robotic system. Moreover, the Advanced Robotic System (ARS) is modular in design and can be upgraded by closely following technological advancements as they occur in various fields. This approach to manufacturing automation enhances the financial justification and ensures the long-term profitability and most efficient implementation of robotic technology. The new system also addresses a broad spectrum of manufacturing demand and has the potential to address both complex jobs as well as highly labor-intensive tasks. The ARS prototype employs the decomposed optimization technique in spatial planning. This technique is implemented to the framework of the sensor-actuator network to establish the general-purpose geometric reasoning system. The development computer system is a multiple microcomputer network system, which provides the architecture for executing the modular network computing algorithms. The knowledge-based approach used in both the robot vision subsystem and the manipulation control subsystems results in the real-time image processing vision-based capability. The vision-based task environment analysis capability and the responsive motion capability are under the command of the local intelligence centers. An array of ultrasonic, proximity, and optoelectronic sensors is used for path planning. The ARS currently has 18 degrees of freedom made up by two articulated arms, one movable robot head, and two charged coupled device (CCD) cameras for producing the stereoscopic views, and articulated cylindrical-type lower body, and an optional mobile base. A functional prototype is demonstrated.

Traffic-engineering-aware shortest-path routing and its application in IP-over-WDM networks [Invited

NASA Astrophysics Data System (ADS)

Lee, Youngseok; Mukherjee, Biswanath

2004-03-01

Single shortest-path routing is known to perform poorly for Internet traffic engineering (TE) where the typical optimization objective is to minimize the maximum link load. Splitting traffic uniformly over equal-cost multiple shortest paths in open shortest path first and intermediate system-intermediate system protocols does not always minimize the maximum link load when multiple paths are not carefully selected for the global traffic demand matrix. However, a TE-aware shortest path among all the equal-cost multiple shortest paths between each ingress-egress pair can be selected such that the maximum link load is significantly reduced. IP routers can use the globally optimal TE-aware shortest path without any change to existing routing protocols and without any serious configuration overhead. While calculating TE-aware shortest paths, the destination-based forwarding constraint at a node should be satisfied, because an IP router will forward a packet to the next hop toward the destination by looking up the destination prefix. We present a mathematical problem formulation for finding a set of TE-aware shortest paths for the given network as an integer linear program, and we propose a simple heuristic for solving large instances of the problem. Then we explore the usage of our proposed algorithm for the integrated TE method in IP-over-WDM networks. The proposed algorithm is evaluated through simulations in IP networks as well as in IP-over-WDM networks.

An Experimental Testbed for a Free-Floating Manipulator

DTIC Science & Technology

1993-12-01

brushless servo amplifiers are four quadrant , 20 kHz PWM amplifiers that provide economical control of brushless motors rated from 1/3 to 2 Hp shaft Watts...backplanes that came out of the Versa-Module- Europa consortium [Ref. 15]. The VME is a bus that acts as the path and translator of information between

A Classroom Demonstration of Rayleigh Light Scattering in Optically Active and Inactive Systems.

ERIC Educational Resources Information Center

Pecina, Monica Avalos; Smith, Charles A.

1999-01-01

Argues that the concept of optical activity is vague to students because it is difficult for instructors to demonstrate the phenomenon in the classroom. Presents a demonstration that allows students to observe and manipulate the optical path of polarized light through optically inactive and active solutions. (CCM)

Viewing Social Scenes: A Visual Scan-Path Study Comparing Fragile X Syndrome and Williams Syndrome

ERIC Educational Resources Information Center

Williams, Tracey A.; Porter, Melanie A.; Langdon, Robyn

2013-01-01

Fragile X syndrome (FXS) and Williams syndrome (WS) are both genetic disorders which present with similar cognitive-behavioral problems, but distinct social phenotypes. Despite these social differences both syndromes display poor social relations which may result from abnormal social processing. This study aimed to manipulate the location of…

Ion manipulation device with electrical breakdown protection

DOEpatents

Chen, Tsung-Chi; Tang, Keqi; Ibrahim, Yehia M; Smith, Richard D; Anderson, Gordon A; Baker, Erin M

2014-12-02

An ion manipulation method and device is disclosed. The device includes a pair of substantially parallel surfaces. An array of inner electrodes is contained within, and extends substantially along the length of, each parallel surface. The device includes a first outer array of electrodes and a second outer array of electrodes. Each outer array of electrodes is positioned on either side of the inner electrodes, and is contained within and extends substantially along the length of each parallel surface. A DC voltage is applied to the first and second outer array of electrodes. A RF voltage, with a superimposed electric field, is applied to the inner electrodes by applying the DC voltages to each electrode. Ions either move between the parallel surfaces within an ion confinement area or along paths in the direction of the electric field, or can be trapped in the ion confinement area. The surfaces are housed in a chamber, and at least one electrically insulative shield is coupled to an inner surface of the chamber for increasing a mean-free-path between two adjacent electrodes in the chamber.

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.

Tracking trade transactions in water resource systems: A node-arc optimization formulation

NASA Astrophysics Data System (ADS)

Erfani, Tohid; Huskova, Ivana; Harou, Julien J.

2013-05-01

We formulate and apply a multicommodity network flow node-arc optimization model capable of tracking trade transactions in complex water resource systems. The model uses a simple node to node network connectivity matrix and does not require preprocessing of all possible flow paths in the network. We compare the proposed node-arc formulation with an existing arc-path (flow path) formulation and explain the advantages and difficulties of both approaches. We verify the proposed formulation model on a hypothetical water distribution network. Results indicate the arc-path model solves the problem with fewer constraints, but the proposed formulation allows using a simple network connectivity matrix which simplifies modeling large or complex networks. The proposed algorithm allows converting existing node-arc hydroeconomic models that broadly represent water trading to ones that also track individual supplier-receiver relationships (trade transactions).

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.

Proper alignment of the microscope.

PubMed

Rottenfusser, Rudi

2013-01-01

The light microscope is merely the first element of an imaging system in a research facility. Such a system may include high-speed and/or high-resolution image acquisition capabilities, confocal technologies, and super-resolution methods of various types. Yet more than ever, the proverb "garbage in-garbage out" remains a fact. Image manipulations may be used to conceal a suboptimal microscope setup, but an artifact-free image can only be obtained when the microscope is optimally aligned, both mechanically and optically. Something else is often overlooked in the quest to get the best image out of the microscope: Proper sample preparation! The microscope optics can only do its job when its design criteria are matched to the specimen or vice versa. The specimen itself, the mounting medium, the cover slip, and the type of immersion medium (if applicable) are all part of the total optical makeup. To get the best results out of a microscope, understanding the functions of all of its variable components is important. Only then one knows how to optimize these components for the intended application. Different approaches might be chosen to discuss all of the microscope's components. We decided to follow the light path which starts with the light source and ends at the camera or the eyepieces. To add more transparency to this sequence, the section up to the microscope stage was called the "Illuminating Section", to be followed by the "Imaging Section" which starts with the microscope objective. After understanding the various components, we can start "working with the microscope." To get the best resolution and contrast from the microscope, the practice of "Koehler Illumination" should be understood and followed by every serious microscopist. Step-by-step instructions as well as illustrations of the beam path in an upright and inverted microscope are included in this chapter. A few practical considerations are listed in Section 3. Copyright © 2013 Elsevier Inc. All rights reserved.

Comparison Of Reaction Barriers In Energy And Free Energy For Enzyme Catalysis

NASA Astrophysics Data System (ADS)

Andrés Cisneros, G.; Yang, Weitao

Reaction paths on potential energy surfaces obtained from QM/MM calculations of enzymatic or solution reactions depend on the starting structure employed for the path calculations. The free energies associated with these paths should be more reliable for studying reaction mechanisms, because statistical averages are used. To investigate this, the role of enzyme environment fluctuations on reaction paths has been studied with an ab initio QM/MM method for the first step of the reaction catalyzed by 4-oxalocrotonate tautomerase (4OT). Four minimum energy paths (MEPs) are compared, which have been determined with two different methods. The first path (path A) has been determined with a procedure that combines the nudged elastic band (NEB) method and a second order parallel path optimizer recently developed in our group. The second path (path B) has also been determined by the combined procedure, however, the enzyme environment has been relaxed by molecular dynamics (MD) simulations. The third path (path C) has been determined with the coordinate driving (CD) method, using the enzyme environment from path B. We compare these three paths to a previously determined path (path D) determined with the CD method. In all four cases the QM/MM-FE method (Y. Zhang et al., JCP, 112, 3483) was employed to obtain the free energy barriers for all four paths. In the case of the combined procedure, the reaction path is approximated by a small number of images which are optimized to the MEP in parallel, which results in a reduced computational cost. However, this does not allow the FEP calculation on the MEP. In order to perform FEP calculations on these paths, we introduce a modification to the NEB method that enables the addition of as many extra images to the path as needed for the FEP calculations. The calculated potential energy barriers show differences in the activation barrier between the calculated paths of as much as 5.17 kcal/mol. However, the largest free energy barrier difference is 1.58 kcal/mol. These results show the importance of the inclusion of the environment fluctuation in the calculation of enzymatic activation barriers

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.

Nanophononics at low temperature: manipulating heat at the nanoscale

NASA Astrophysics Data System (ADS)

Bourgeois, Olivier

2014-03-01

Nanophononics is an emerging field of condensed matter that deals with transport of thermal phonons at small length scales. When the section of a waveguide becomes smaller than the mean free path or the phonon wavelength, heat transfer are strongly affected. Here, I will present the results we obtained by ultra- sensitive measurements of thermal conductance of suspended nano-objects (nanowires and membranes) using the 3 ω method. This experimental set-up allows the measurement of power as small as a fraction of femtoWatt (10-15 Watt). These experiments show that the concepts of mean free path and dominant wavelength are crucial to understand the phonon thermal transport below 10K. The phonon transport, at this temperature, is well described by the Casimir-Ziman model used here to treat the data. The contribution of the thermal contact between a nanowire and the heat bath has been estimated to be close to one, thanks to the fact that the nanowire are made out of monolithic single crystal. Strong reduction of thermal conductance has been obtained in serpentine nanowire where the transport of ballistic phonons is blocked. Moreover, in corrugated silicon nanowire, we showed that the corrugations induce significant backscattering of phonon that severely reduces the mean free path, beating in some cases, the Casimir limit. These experiments demonstrate the ability to manipulate ballistic phonons by adjusting the geometry of thermal conductors, and hence manipulate heat transfer. Finally, the use of these new concepts of engineering ballistic phonons at the nanoscale allows considering the development of new nanostructured materials for thermoelectrics at room temperature, opening exciting prospects for future applications in the energy recovery. J.-S. Heron, T. Fournier, N. Mingo and O. Bourgeois, Nano Letters 9, 1861 (2009). J-S. Heron, C. Bera, T. Fournier, N. Mingo, and O. Bourgeois, Phys. Rev. B 82, 155458 (2010). C. Blanc, A. Rajabpour, S. Volz, T. Fournier, and O. Bourgeois, Appl. Phys. Lett. 103, 043109 (2013). EU Merging Project grant Agreement No. 309150.

Minimal entropy probability paths between genome families.

PubMed

Ahlbrandt, Calvin; Benson, Gary; Casey, William

2004-05-01

We develop a metric for probability distributions with applications to biological sequence analysis. Our distance metric is obtained by minimizing a functional defined on the class of paths over probability measures on N categories. The underlying mathematical theory is connected to a constrained problem in the calculus of variations. The solution presented is a numerical solution, which approximates the true solution in a set of cases called rich paths where none of the components of the path is zero. The functional to be minimized is motivated by entropy considerations, reflecting the idea that nature might efficiently carry out mutations of genome sequences in such a way that the increase in entropy involved in transformation is as small as possible. We characterize sequences by frequency profiles or probability vectors, in the case of DNA where N is 4 and the components of the probability vector are the frequency of occurrence of each of the bases A, C, G and T. Given two probability vectors a and b, we define a distance function based as the infimum of path integrals of the entropy function H( p) over all admissible paths p(t), 0 < or = t< or =1, with p(t) a probability vector such that p(0)=a and p(1)=b. If the probability paths p(t) are parameterized as y(s) in terms of arc length s and the optimal path is smooth with arc length L, then smooth and "rich" optimal probability paths may be numerically estimated by a hybrid method of iterating Newton's method on solutions of a two point boundary value problem, with unknown distance L between the abscissas, for the Euler-Lagrange equations resulting from a multiplier rule for the constrained optimization problem together with linear regression to improve the arc length estimate L. Matlab code for these numerical methods is provided which works only for "rich" optimal probability vectors. These methods motivate a definition of an elementary distance function which is easier and faster to calculate, works on non-rich vectors, does not involve variational theory and does not involve differential equations, but is a better approximation of the minimal entropy path distance than the distance //b-a//(2). We compute minimal entropy distance matrices for examples of DNA myostatin genes and amino-acid sequences across several species. Output tree dendograms for our minimal entropy metric are compared with dendograms based on BLAST and BLAST identity scores.

The Optimal Capital Stock and Consumption Evolution for Non Zero Consumers Growth Rate in the Framework of Ramsey Model on Finite Horizon

NASA Astrophysics Data System (ADS)

Bonchiş, N.; Balint, Şt.

2010-09-01

In this paper the Ramsey optimal growth of the capital stock and consumption on finite horizon is analyzed when the growth rate of consumers is strictly positive. The main purpose is to establish the dependence of the optimal capital stock and consumption evolution on the growth rate of consumers. The analysis reveals: for any initial value k0≥0 there exists a unique optimal evolution path of length N+1 for the capital stock; if k0 is strictly positive then all the elements of the optimal capital stock evolution path are strictly positives except the last one which is zero; the optimal capital stock evolution of length N+1 starting from k0≥0 satisfies the Euler equation; the value function VN is strictly increasing, strictly concave and continuous on R+. The family of functions {VN-T}T = 0…N-1 satisfies the Bellman equation and it is the unique solution of this equation which is both continuous and satisfies the transversality condition. The Mangasarian Lemma is also satisfied. For N tending to infinity the optimal evolution path of length N of the capital stock tends to those on the infinite time horizon. For any k0>0 the value function in k0 decreases when the consumers growth rate increases.

A new optimization tool path planning for 3-axis end milling of free-form surfaces based on efficient machining intervals

NASA Astrophysics Data System (ADS)

Vu, Duy-Duc; Monies, Frédéric; Rubio, Walter

2018-05-01

A large number of studies, based on 3-axis end milling of free-form surfaces, seek to optimize tool path planning. Approaches try to optimize the machining time by reducing the total tool path length while respecting the criterion of the maximum scallop height. Theoretically, the tool path trajectories that remove the most material follow the directions in which the machined width is the largest. The free-form surface is often considered as a single machining area. Therefore, the optimization on the entire surface is limited. Indeed, it is difficult to define tool trajectories with optimal feed directions which generate largest machined widths. Another limiting point of previous approaches for effectively reduce machining time is the inadequate choice of the tool. Researchers use generally a spherical tool on the entire surface. However, the gains proposed by these different methods developed with these tools lead to relatively small time savings. Therefore, this study proposes a new method, using toroidal milling tools, for generating toolpaths in different regions on the machining surface. The surface is divided into several regions based on machining intervals. These intervals ensure that the effective radius of the tool, at each cutter-contact points on the surface, is always greater than the radius of the tool in an optimized feed direction. A parallel plane strategy is then used on the sub-surfaces with an optimal specific feed direction for each sub-surface. This method allows one to mill the entire surface with efficiency greater than with the use of a spherical tool. The proposed method is calculated and modeled using Maple software to find optimal regions and feed directions in each region. This new method is tested on a free-form surface. A comparison is made with a spherical cutter to show the significant gains obtained with a toroidal milling cutter. Comparisons with CAM software and experimental validations are also done. The results show the efficiency of the method.

Controlled manipulation and actuation of micro-objects with magnetotactic bacteria

NASA Astrophysics Data System (ADS)

Martel, Sylvain; Tremblay, Charles C.; Ngakeng, Serge; Langlois, Guillaume

2006-12-01

Bacterial actuation and manipulation are demonstrated where Magnetospirillum gryphiswaldense magnetotactic bacteria (MTB) are used to push 3μm beads at an average velocity of 7.5μms-1 along preplanned paths by modifying the torque on a chain of magnetosomes in the bacterium with a directional magnetic field of at least 0.5G generated from a small programmed electrical current. But measured average thrusts of 0.5 and 4pN of the flagellar motor of a single Magnetospirillum gryphiswaldense and MC-1 MTB suggest that average velocities greater than 16 and 128μms-1, respectively could be achieved.

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.

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.

Single step optimization of manipulator maneuvers with variable structure control

NASA Technical Reports Server (NTRS)

Chen, N.; Dwyer, T. A. W., III

1987-01-01

One step ahead optimization has been recently proposed for spacecraft attitude maneuvers as well as for robot manipulator maneuvers. Such a technique yields a discrete time control algorithm implementable as a sequence of state-dependent, quadratic programming problems for acceleration optimization. Its sensitivity to model accuracy, for the required inversion of the system dynamics, is shown in this paper to be alleviated by a fast variable structure control correction, acting between the sampling intervals of the slow one step ahead discrete time acceleration command generation algorithm. The slow and fast looping concept chosen follows that recently proposed for optimal aiming strategies with variable structure control. Accelerations required by the VSC correction are reserved during the slow one step ahead command generation so that the ability to overshoot the sliding surface is guaranteed.

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.

Floquet Engineering of Optical Solenoids and Quantized Charge Pumping along Tailored Paths in Two-Dimensional Chern Insulators

NASA Astrophysics Data System (ADS)

Wang, Botao; Ünal, F. Nur; Eckardt, André

2018-06-01

The insertion of a local magnetic flux, as the one created by a thin solenoid, plays an important role in gedanken experiments of quantum Hall physics. By combining Floquet engineering of artificial magnetic fields with the ability of single-site addressing in quantum gas microscopes, we propose a scheme for the realization of such local solenoid-type magnetic fields in optical lattices. We show that it can be employed to manipulate and probe elementary excitations of a topological Chern insulator. This includes quantized adiabatic charge pumping along tailored paths inside the bulk, as well as the controlled population of edge modes.

Simultaneous realization of slow and fast acoustic waves using a fractal structure of Koch curve.

PubMed

Ding, Jin; Fan, Li; Zhang, Shu-Yi; Zhang, Hui; Yu, Wei-Wei

2018-01-24

An acoustic metamaterial based on a fractal structure, the Koch curve, is designed to simultaneously realize slow and fast acoustic waves. Owing to the multiple transmitting paths in the structure resembling the Koch curve, the acoustic waves travelling along different paths interfere with each other. Therefore, slow waves are created on the basis of the resonance of a Koch-curve-shaped loop, and meanwhile, fast waves even with negative group velocities are obtained due to the destructive interference of two acoustic waves with opposite phases. Thus, the transmission of acoustic wave can be freely manipulated with the Koch-curve shaped structure.

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

March-Leuba, S.; Jansen, J.F.; Kress, R.L.

A new program package, Symbolic Manipulator Laboratory (SML), for the automatic generation of both kinematic and static manipulator models in symbolic form is presented. Critical design parameters may be identified and optimized using symbolic models as shown in the sample application presented for the Future Armor Rearm System (FARS) arm. The computer-aided development of the symbolic models yields equations with reduced numerical complexity. Important considerations have been placed on the closed form solutions simplification and on the user friendly operation. The main emphasis of this research is the development of a methodology which is implemented in a computer program capablemore » of generating symbolic kinematic and static forces models of manipulators. The fact that the models are obtained trigonometrically reduced is among the most significant results of this work and the most difficult to implement. Mathematica, a commercial program that allows symbolic manipulation, is used to implement the program package. SML is written such that the user can change any of the subroutines or create new ones easily. To assist the user, an on-line help has been written to make of SML a user friendly package. Some sample applications are presented. The design and optimization of the 5-degrees-of-freedom (DOF) FARS manipulator using SML is discussed. Finally, the kinematic and static models of two different 7-DOF manipulators are calculated symbolically.« less

Base reaction optimization of redundant manipulators for space applications

NASA Technical Reports Server (NTRS)

Chung, C. L.; Desa, S.; Desilva, C. W.

1988-01-01

One of the problems associated with redundant manipulators which were proposed for space applications is that the reactions transmitted to the base of the manipulator as a result of the motion of the manipulator will cause undesirable effects on the dynamic behavior of the supporting space structure. It is therefore necessary to minimize the magnitudes of the forces and moments transmitted to the base. It is shown that kinematic redundancy can be used to solve the dynamic problem of minimizing the magnitude of the base reactions. The methodology described is applied to a four degree-of-freedom spatial manipulator with one redundant degree-of-freedom.

Autonomous Control Modes and Optimized Path Guidance for Shipboard Landing in High Sea States

DTIC Science & Technology

2016-04-28

Contract # N00014-14-C-0004 Autonomous Control Modes and Optimized Path Guidance for Shipboard Landing in High Sea States Progress Report...Aviation (ONR BAA12-SN-0028). This project addresses the Sea Based Aviation (SBA) initiative in Advanced Handling Qualities for Rotorcraft. Landing a...and a degraded visual environment, workload during the landing task begins to approach the limits of a human pilot’s capability. It is a similarly

A statistical-based scheduling algorithm in automated data path synthesis

NASA Technical Reports Server (NTRS)

Jeon, Byung Wook; Lursinsap, Chidchanok

1992-01-01

In this paper, we propose a new heuristic scheduling algorithm based on the statistical analysis of the cumulative frequency distribution of operations among control steps. It has a tendency of escaping from local minima and therefore reaching a globally optimal solution. The presented algorithm considers the real world constraints such as chained operations, multicycle operations, and pipelined data paths. The result of the experiment shows that it gives optimal solutions, even though it is greedy in nature.

Light extraction efficiency of GaN-based LED with pyramid texture by using ray path analysis.

PubMed

Pan, Jui-Wen; Wang, Chia-Shen

2012-09-10

We study three different gallium-nitride (GaN) based light emitting diode (LED) cases based on the different locations of the pyramid textures. In case 1, the pyramid texture is located on the sapphire top surface, in case 2, the pyramid texture is locate on the P-GaN top surface, while in case 3, the pyramid texture is located on both the sapphire and P-GaN top surfaces. We study the relationship between the light extraction efficiency (LEE) and angle of slant of the pyramid texture. The optimization of total LEE was highest for case 3 among the three cases. Moreover, the seven escape paths along which most of the escaped photon flux propagated were selected in a simulation of the LEDs. The seven escape paths were used to estimate the slant angle for the optimization of LEE and to precisely analyze the photon escape path.

The path of placement of a removable partial denture: a microscope based approach to survey and design

PubMed Central

2015-01-01

This article reviews the topic of how to identify and develop a removable partial denture (RPD) path of placement, and provides a literature review of the concept of the RPD path of placement, also known as the path of insertion. An optimal RPD path of placement, guided by mutually parallel guide planes, ensures that the RPD flanges fit intimately over edentulous ridge structures and that the framework fits intimately with guide plane surfaces, which prevents food collecting empty spaces between the intaglio surface of the framework and intraoral surfaces, and ensures that RPD clasps engage adequate numbers of tooth undercuts to ensure RPD retention. The article covers topics such as the causes of obstructions to RPD intra-oral seating, the causes of food collecting empty spaces that may exist around an RPD, and how to identify if a guide plane is parallel with the projected RPD path of placement. The article presents a method of using a surgical operating microscope, or high magnification (6-8x or greater) binocular surgical loupes telescopes, combined with co-axial illumination, to identify a preliminary path of placement for an arch. This preliminary path of placement concept may help to guide a dentist or a dental laboratory technician when surveying a master cast of the arch to develop an RPD path of placement, or in verifying that intra-oral contouring has aligned teeth surfaces optimally with the RPD path of placement. In dentistry, a well-fitting RPD reduces long-term periodontal or structural damage to abutment teeth. PMID:25722842

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.

A Comparison of IRT Proficiency Estimation Methods under Adaptive Multistage Testing

ERIC Educational Resources Information Center

Kim, Sooyeon; Moses, Tim; Yoo, Hanwook

2015-01-01

This inquiry is an investigation of item response theory (IRT) proficiency estimators' accuracy under multistage testing (MST). We chose a two-stage MST design that includes four modules (one at Stage 1, three at Stage 2) and three difficulty paths (low, middle, high). We assembled various two-stage MST panels (i.e., forms) by manipulating two…

Nonlinear dynamic analysis and optimal trajectory planning of a high-speed macro-micro manipulator

NASA Astrophysics Data System (ADS)

Yang, Yi-ling; Wei, Yan-ding; Lou, Jun-qiang; Fu, Lei; Zhao, Xiao-wei

2017-09-01

This paper reports the nonlinear dynamic modeling and the optimal trajectory planning for a flexure-based macro-micro manipulator, which is dedicated to the large-scale and high-speed tasks. In particular, a macro- micro manipulator composed of a servo motor, a rigid arm and a compliant microgripper is focused. Moreover, both flexure hinges and flexible beams are considered. By combining the pseudorigid-body-model method, the assumed mode method and the Lagrange equation, the overall dynamic model is derived. Then, the rigid-flexible-coupling characteristics are analyzed by numerical simulations. After that, the microscopic scale vibration excited by the large-scale motion is reduced through the trajectory planning approach. Especially, a fitness function regards the comprehensive excitation torque of the compliant microgripper is proposed. The reference curve and the interpolation curve using the quintic polynomial trajectories are adopted. Afterwards, an improved genetic algorithm is used to identify the optimal trajectory by minimizing the fitness function. Finally, the numerical simulations and experiments validate the feasibility and the effectiveness of the established dynamic model and the trajectory planning approach. The amplitude of the residual vibration reduces approximately 54.9%, and the settling time decreases 57.1%. Therefore, the operation efficiency and manipulation stability are significantly improved.

Achieving High Resolution Ion Mobility Separations Using Traveling Waves in Compact Multiturn Structures for Lossless Ion Manipulations

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

Hamid, Ahmed M.; Garimella, Sandilya V. B.; Ibrahim, Yehia M.

We report on ion mobility separations (IMS) achievable using traveling waves in a Structures for Lossless Ion Manipulations (TW-SLIM) module having a 44-cm path length and sixteen 90º turns. The performance of the TW-SLIM module was evaluated for ion transmission, and ion mobility separations with different RF, TW parameters and SLIM surface gaps in conjunction with mass spectrometry. In this work TWs were created by the transient and dynamic application of DC potentials. The TW-SLIM module demonstrated highly robust performance and the ion mobility resolution achieved even with sixteen close spaced turns was comparable to a similar straight path TW-SLIMmore » module. We found an ion mobility peak capacity of ~ 31 and peak generation rate of 780 s-1 for TW speeds of <210 m/s using the current multi-turn TW-SLIM module. The separations achieved for isomers of peptides and tetrasaccharides were found to be comparable to those from a ~ 0.9-m drift tube-based IMS-MS platform operated at the same pressure (4 torr). The combined attributes of flexible design, low voltage requirements and lossless ion transmission through multiple turns for the present TW-SLIM module provides a basis for SLIM devices capable of achieving much greater ion mobility resolutions via greatly extended ion path lengths and compact serpentine designs that do not significantly impact the instrumentation profile, a direction described in a companion manuscript.« less

The Edge-Disjoint Path Problem on Random Graphs by Message-Passing.

PubMed

Altarelli, Fabrizio; Braunstein, Alfredo; Dall'Asta, Luca; De Bacco, Caterina; Franz, Silvio

2015-01-01

We present a message-passing algorithm to solve a series of edge-disjoint path problems on graphs based on the zero-temperature cavity equations. Edge-disjoint paths problems are important in the general context of routing, that can be defined by incorporating under a unique framework both traffic optimization and total path length minimization. The computation of the cavity equations can be performed efficiently by exploiting a mapping of a generalized edge-disjoint path problem on a star graph onto a weighted maximum matching problem. We perform extensive numerical simulations on random graphs of various types to test the performance both in terms of path length minimization and maximization of the number of accommodated paths. In addition, we test the performance on benchmark instances on various graphs by comparison with state-of-the-art algorithms and results found in the literature. Our message-passing algorithm always outperforms the others in terms of the number of accommodated paths when considering non trivial instances (otherwise it gives the same trivial results). Remarkably, the largest improvement in performance with respect to the other methods employed is found in the case of benchmarks with meshes, where the validity hypothesis behind message-passing is expected to worsen. In these cases, even though the exact message-passing equations do not converge, by introducing a reinforcement parameter to force convergence towards a sub optimal solution, we were able to always outperform the other algorithms with a peak of 27% performance improvement in terms of accommodated paths. On random graphs, we numerically observe two separated regimes: one in which all paths can be accommodated and one in which this is not possible. We also investigate the behavior of both the number of paths to be accommodated and their minimum total length.

The Edge-Disjoint Path Problem on Random Graphs by Message-Passing

PubMed Central

2015-01-01

We present a message-passing algorithm to solve a series of edge-disjoint path problems on graphs based on the zero-temperature cavity equations. Edge-disjoint paths problems are important in the general context of routing, that can be defined by incorporating under a unique framework both traffic optimization and total path length minimization. The computation of the cavity equations can be performed efficiently by exploiting a mapping of a generalized edge-disjoint path problem on a star graph onto a weighted maximum matching problem. We perform extensive numerical simulations on random graphs of various types to test the performance both in terms of path length minimization and maximization of the number of accommodated paths. In addition, we test the performance on benchmark instances on various graphs by comparison with state-of-the-art algorithms and results found in the literature. Our message-passing algorithm always outperforms the others in terms of the number of accommodated paths when considering non trivial instances (otherwise it gives the same trivial results). Remarkably, the largest improvement in performance with respect to the other methods employed is found in the case of benchmarks with meshes, where the validity hypothesis behind message-passing is expected to worsen. In these cases, even though the exact message-passing equations do not converge, by introducing a reinforcement parameter to force convergence towards a sub optimal solution, we were able to always outperform the other algorithms with a peak of 27% performance improvement in terms of accommodated paths. On random graphs, we numerically observe two separated regimes: one in which all paths can be accommodated and one in which this is not possible. We also investigate the behavior of both the number of paths to be accommodated and their minimum total length. PMID:26710102

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

Spatial Manipulation of Heat Flow by Surface Boundaries at the Nanoscale

NASA Astrophysics Data System (ADS)

Malhotra, Abhinav; Maldovan, Martin

The precise manipulation of phonon transport properties is central to controlling thermal transport in semiconductor nanostructures. The physical understanding, prediction, and control of thermal phonon heat spectra and thermal conductivity accumulation functions - which establish the proportion of heat transported by phonons with different frequencies and mean-free-paths - has attracted significant attention in recent years. In this talk, we advance the possibilities of manipulating heat by spatially modulating thermal transport in nanostructures. We show that phonon scattering at interfaces impacts the most preferred physical pathway used by heat energy flow in thermal transport in nanostructures. The role of introducing boundaries with different surface conditions on resultant thermal flux is presented and methodologies to enhance these spatial modulations are discussed. This talk aims to advance the fundamental understanding on the nature of heat transport at nanoscale with potential applications in multiple research areas ranging from energy materials to optoelectronics.

Authorship attribution based on Life-Like Network Automata

PubMed Central

Machicao, Jeaneth; Corrêa, Edilson A.; Miranda, Gisele H. B.; Amancio, Diego R.

2018-01-01

The authorship attribution is a problem of considerable practical and technical interest. Several methods have been designed to infer the authorship of disputed documents in multiple contexts. While traditional statistical methods based solely on word counts and related measurements have provided a simple, yet effective solution in particular cases; they are prone to manipulation. Recently, texts have been successfully modeled as networks, where words are represented by nodes linked according to textual similarity measurements. Such models are useful to identify informative topological patterns for the authorship recognition task. However, there is no consensus on which measurements should be used. Thus, we proposed a novel method to characterize text networks, by considering both topological and dynamical aspects of networks. Using concepts and methods from cellular automata theory, we devised a strategy to grasp informative spatio-temporal patterns from this model. Our experiments revealed an outperformance over structural analysis relying only on topological measurements, such as clustering coefficient, betweenness and shortest paths. The optimized results obtained here pave the way for a better characterization of textual networks. PMID:29566100

Gender differences in loss of psychological resources following experimentally-induced vicarious stress.

PubMed

Ben-Zur, Hasida; Zeidner, Moshe

2012-07-01

The present research focuses on gender differences in resource loss, perceived threat, and negative affective reactions induced by experimental manipulation of vicarious stress. Israeli students (54.7% women) were randomly allocated to one of two conditions: (1) Threat Condition (n=98), in which participants were exposed to a video film depicting terror attacks and (2) Control Condition (n=30), in which participants viewed a video film depicting a series of non-emotive news broadcasts. Participants also completed measures of mastery, optimism, and self-esteem. The data indicated that whereas under the Threat Condition women scored lower on psychological resources and higher on perceived threat than men, no significant gender differences were observed under the Control Condition. A path analysis revealed that gender was directly related to perceived threat and resource loss, which, in turn, were related to negative affect. In addition, a greater sense of mastery was related to lower resource loss. Overall, these experimental findings suggest that gender and mastery bear prominent effects on cognitive and emotional reactions to vicarious life threat.

A new adaptive algorithm for automated feature extraction in exponentially damped signals for health monitoring of smart structures

NASA Astrophysics Data System (ADS)

Qarib, Hossein; Adeli, Hojjat

2015-12-01

In this paper authors introduce a new adaptive signal processing technique for feature extraction and parameter estimation in noisy exponentially damped signals. The iterative 3-stage method is based on the adroit integration of the strengths of parametric and nonparametric methods such as multiple signal categorization, matrix pencil, and empirical mode decomposition algorithms. The first stage is a new adaptive filtration or noise removal scheme. The second stage is a hybrid parametric-nonparametric signal parameter estimation technique based on an output-only system identification technique. The third stage is optimization of estimated parameters using a combination of the primal-dual path-following interior point algorithm and genetic algorithm. The methodology is evaluated using a synthetic signal and a signal obtained experimentally from transverse vibrations of a steel cantilever beam. The method is successful in estimating the frequencies accurately. Further, it estimates the damping exponents. The proposed adaptive filtration method does not include any frequency domain manipulation. Consequently, the time domain signal is not affected as a result of frequency domain and inverse transformations.

Dijkstra Methode for Optimalize Recommendation System of Garbage Transportation Time in Surakarta City

NASA Astrophysics Data System (ADS)

Hartatik; Purbayu, A.; Triyono, L.

2018-03-01

Major problem that often occurs in waste transportation in each region is the route of garbage transportation. Determination of this route should become a major concern because it affects fuel consumption and also the working time from the employee. Therefore, in this research we will develop an application to optimize with pigeonhole and dijsktra algorithm. Pigeonhole algorithm is used to determine which garbage trucks should be taken in a particular TPS. Time optimization is done by determining the shortest path that can be skipped for each garbage truck. Data generated from Pigeonhole then used to determine the shortest path by using Dijkstra algorithm.

The effects of spatially displaced visual feedback on remote manipulator performance

NASA Technical Reports Server (NTRS)

Smith, Randy L.; Stuart, Mark A.

1993-01-01

The results of this evaluation have important implications for the arrangement of remote manipulation worksites and the design of workstations for telerobot operations. This study clearly illustrates the deleterious effects that can accompany the performance of remote manipulator tasks when viewing conditions are less than optimal. Future evaluations should emphasize telerobot camera locations and the use of image/graphical enhancement techniques in an attempt to lessen the adverse effects of displaced visual feedback. An important finding in this evaluation is the extent to which results from previously performed direct manipulation studies can be generalized to remote manipulation studies. Even though the results obtained were very similar to those of the direct manipulation evaluations, there were differences as well. This evaluation has demonstrated that generalizations to remote manipulation applications based upon the results of direct manipulation studies are quite useful, but they should be made cautiously.

Autonomous Control Modes and Optimized Path Guidance for Shipboard Landing in High Sea States

DTIC Science & Technology

2016-08-12

Performing Organization: The Pennsylvania State University Department of Aerospace Engineering 231C Hammond Building University Park, PA 16802 Attn...Plant Models Used in the Study The H-60 class model was developed and distributed by ART to both NAVAIR and Penn State research teams. The model...To) 07 109 I 201 4 tD 07 I 08 12016 ’t TITLE AND SUBTITLE Autonomous Control Modes and Optimized Path Guidance for Shipboard Landing in High Sea States

Autonomous Control Modes and Optimized Path Guidance for Shipboard Landing in High Sea States

DTIC Science & Technology

2017-04-15

50 0 50 Singular Values Frequency (rad/s) S in g u la r V a lu e s ( d B ) controller . The non -output variables can be estimated by reliable linear...Contract # N00014-14-C-0004 Autonomous Control Modes and Optimized Path Guidance for Shipboard Landing in High Sea States Progress Report...recovery of a VTOL UAV. There is a clear need for additional levels of stability and control augmentation and, ultimately, fully autonomous landing

Maximal Sensitive Dependence and the Optimal Path to Epidemic Extinction

DTIC Science & Technology

2010-01-01

1996; Elgart and Kamenev, 2004). Instead, in this article, we will employ an eikonal approximation to recast the problem in terms of an effective...a control strategy on the extinction rate can be determined by its effect on the optimal path (Dykman et al., 2008). Through the use of the eikonal ...the solution of Eqs. (6a)–(6b) in the eikonal form (Elgart and Kamenev, 2004; Doering et al., 2005; Kubo et al., 1973; Wentzell, 1976; Gang, 1987

Apparatus and methods for manipulation and optimization of biological systems

NASA Technical Reports Server (NTRS)

Sun, Ren (Inventor); Ho, Chih-Ming (Inventor); Wong, Pak Kin (Inventor); Yu, Fuqu (Inventor)

2012-01-01

The invention provides systems and methods for manipulating, e.g., optimizing and controlling, biological systems, e.g., for eliciting a more desired biological response of biological sample, such as a tissue, organ, and/or a cell. In one aspect, systems and methods of the invention operate by efficiently searching through a large parametric space of stimuli and system parameters to manipulate, control, and optimize the response of biological samples sustained in the system, e.g., a bioreactor. In alternative aspects, systems include a device for sustaining cells or tissue samples, one or more actuators for stimulating the samples via biochemical, electromagnetic, thermal, mechanical, and/or optical stimulation, one or more sensors for measuring a biological response signal of the samples resulting from the stimulation of the sample. In one aspect, the systems and methods of the invention use at least one optimization algorithm to modify the actuator's control inputs for stimulation, responsive to the sensor's output of response signals. The compositions and methods of the invention can be used, e.g., to for systems optimization of any biological manufacturing or experimental system, e.g., bioreactors for proteins, e.g., therapeutic proteins, polypeptides or peptides for vaccines, and the like, small molecules (e.g., antibiotics), polysaccharides, lipids, and the like. Another use of the apparatus and methods includes combination drug therapy, e.g. optimal drug cocktail, directed cell proliferations and differentiations, e.g. in tissue engineering, e.g. neural progenitor cells differentiation, and discovery of key parameters in complex biological systems.

Epidemic extinction paths in complex networks

NASA Astrophysics Data System (ADS)

Hindes, Jason; Schwartz, Ira B.

2017-05-01

We study the extinction of long-lived epidemics on finite complex networks induced by intrinsic noise. Applying analytical techniques to the stochastic susceptible-infected-susceptible model, we predict the distribution of large fluctuations, the most probable or optimal path through a network that leads to a disease-free state from an endemic state, and the average extinction time in general configurations. Our predictions agree with Monte Carlo simulations on several networks, including synthetic weighted and degree-distributed networks with degree correlations, and an empirical high school contact network. In addition, our approach quantifies characteristic scaling patterns for the optimal path and distribution of large fluctuations, both near and away from the epidemic threshold, in networks with heterogeneous eigenvector centrality and degree distributions.

Epidemic extinction paths in complex networks.

PubMed

Hindes, Jason; Schwartz, Ira B

2017-05-01

We study the extinction of long-lived epidemics on finite complex networks induced by intrinsic noise. Applying analytical techniques to the stochastic susceptible-infected-susceptible model, we predict the distribution of large fluctuations, the most probable or optimal path through a network that leads to a disease-free state from an endemic state, and the average extinction time in general configurations. Our predictions agree with Monte Carlo simulations on several networks, including synthetic weighted and degree-distributed networks with degree correlations, and an empirical high school contact network. In addition, our approach quantifies characteristic scaling patterns for the optimal path and distribution of large fluctuations, both near and away from the epidemic threshold, in networks with heterogeneous eigenvector centrality and degree distributions.

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

Molecular reorientation in assembled CO structures and contrast inversion in STM

NASA Astrophysics Data System (ADS)

Niemi, Eeva; Nieminen, Jouko

2004-10-01

Recent scanning tunneling microscopy experiments [S. Zöphel, J. Repp, G. Meyer, K.-H. Rieder, Chem. Phys. Lett. 310 (1999) 145; A.J. Heinrich, C.P. Lutz, J.A. Gupta, D.M. Eigler, Science 298 (2002) 1381] for CO on Cu(1 1 1) and Cu(2 1 1) surfaces show CO monomers as dark depressions, whereas dimers and trimers appear as bright patterns. The dark image of a monomer has been shown to result from a destructive interference between two tunneling paths [J. Nieminen, E. Niemi, K.-H. Rieder, Surf. Sci. 552 (2004) L47]. In this Letter, we show how switching between tunneling channels within the through molecule path can be induced by reorientation of a molecule. Hence, a destructive interference between through vacuum and through molecule paths can be reversed into constructive interference by manipulating the adsorbate geometry.

Intelligent control of neurosurgical robot MM-3 using dynamic motion scaling.

PubMed

Ko, Sunho; Nakazawa, Atsushi; Kurose, Yusuke; Harada, Kanako; Mitsuishi, Mamoru; Sora, Shigeo; Shono, Naoyuki; Nakatomi, Hirofumi; Saito, Nobuhito; Morita, Akio

2017-05-01

OBJECTIVE Advanced and intelligent robotic control is necessary for neurosurgical robots, which require great accuracy and precision. In this article, the authors propose methods for dynamically and automatically controlling the motion-scaling ratio of a master-slave neurosurgical robotic system to reduce the task completion time. METHODS Three dynamic motion-scaling modes were proposed and compared with the conventional fixed motion-scaling mode. These 3 modes were defined as follows: 1) the distance between a target point and the tip of the slave manipulator, 2) the distance between the tips of the slave manipulators, and 3) the velocity of the master manipulator. Five test subjects, 2 of whom were neurosurgeons, sutured 0.3-mm artificial blood vessels using the MM-3 neurosurgical robot in each mode. RESULTS The task time, total path length, and helpfulness score were evaluated. Although no statistically significant differences were observed, the mode using the distance between the tips of the slave manipulators improves the suturing performance. CONCLUSIONS Dynamic motion scaling has great potential for the intelligent and accurate control of neurosurgical robots.

The KALI multi-arm robot programming and control environment

NASA Technical Reports Server (NTRS)

Backes, Paul; Hayati, Samad; Hayward, Vincent; Tso, Kam

1989-01-01

The KALI distributed robot programming and control environment is described within the context of its use in the Jet Propulsion Laboratory (JPL) telerobot project. The purpose of KALI is to provide a flexible robot programming and control environment for coordinated multi-arm robots. Flexibility, both in hardware configuration and software, is desired so that it can be easily modified to test various concepts in robot programming and control, e.g., multi-arm control, force control, sensor integration, teleoperation, and shared control. In the programming environment, user programs written in the C programming language describe trajectories for multiple coordinated manipulators with the aid of KALI function libraries. A system of multiple coordinated manipulators is considered within the programming environment as one motion system. The user plans the trajectory of one controlled Cartesian frame associated with a motion system and describes the positions of the manipulators with respect to that frame. Smooth Cartesian trajectories are achieved through a blending of successive path segments. The manipulator and load dynamics are considered during trajectory generation so that given interface force limits are not exceeded.

Acoustic manipulation: Bessel beams and active carriers

NASA Astrophysics Data System (ADS)

Rajabi, Majid; Mojahed, Alireza

2017-10-01

In this paper, we address the interaction of zero-order acoustic Bessel beams as an acoustic manipulation tool, with an active spherical shell, as a carrier in drug, agent, or material delivery systems, in order to investigate the controllability of exerted acoustic radiation force as the driver. The active body is comprised of a spherical elastic shell stimulated in its monopole mode of vibrations with the same frequency as the incident wave field via an internally bonded and spatially uniformly excited piezoelectric actuator. The main aim of this work is to examine the performance of a nondiffracting and self-reconstructing zero-order Bessel beam to obtain the full manipulability condition of active carriers in comparison with the case of a plane wave field. The results unveil some unique potentials of the Bessel beams in the company of active carriers, with emphasis on the consumed power of the actuation system. This paper will widen the path toward the single-beam robust acoustic manipulation techniques and may lead to the prospect of combined tweezers and fields, with applications in delivery systems, microswimmers, and trapper designs.

Increasing Optimism Protects Against Pain-Induced Impairment in Task-Shifting Performance.

PubMed

Boselie, Jantine J L M; Vancleef, Linda M G; Peters, Madelon L

2017-04-01

Persistent pain can lead to difficulties in executive task performance. Three core executive functions that are often postulated are inhibition, updating, and shifting. Optimism, the tendency to expect that good things happen in the future, has been shown to protect against pain-induced performance deterioration in executive function updating. This study tested whether this protective effect of a temporary optimistic state by means of a writing and visualization exercise extended to executive function shifting. A 2 (optimism: optimism vs no optimism) × 2 (pain: pain vs no pain) mixed factorial design was conducted. Participants (N = 61) completed a shifting task once with and once without concurrent painful heat stimulation after an optimism or neutral manipulation. Results showed that shifting performance was impaired when experimental heat pain was applied during task execution, and that optimism counteracted pain-induced deterioration in task-shifting performance. Experimentally-induced heat pain impairs shifting task performance and manipulated optimism or induced optimism counteracted this pain-induced performance deterioration. Identifying psychological factors that may diminish the negative effect of persistent pain on the ability to function in daily life is imperative. Copyright © 2016 American Pain Society. Published by Elsevier Inc. All rights reserved.

Optimizing the Compressive Strength of Strain-Hardenable Stretch-Formed Microtruss Architectures

NASA Astrophysics Data System (ADS)

Yu, Bosco; Abu Samk, Khaled; Hibbard, Glenn D.

2015-05-01

The mechanical performance of stretch-formed microtrusses is determined by both the internal strut architecture and the accumulated plastic strain during fabrication. The current study addresses the question of optimization, by taking into consideration the interdependency between fabrication path, material properties and architecture. Low carbon steel (AISI1006) and aluminum (AA3003) material systems were investigated experimentally, with good agreement between measured values and the analytical model. The compressive performance of the microtrusses was then optimized on a minimum weight basis under design constraints such as fixed starting sheet thickness and final microtruss height by satisfying the Karush-Kuhn-Tucker condition. The optimization results were summarized as carpet plots in order to meaningfully visualize the interdependency between architecture, microstructural state, and mechanical performance, enabling material and processing path selection.

Optimal short-range trajectories for helicopters

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

Slater, G.L.; Erzberger, H.

1982-12-01

An optimal flight path algorithm using a simplified altitude state model and a priori climb cruise descent flight profile was developed and applied to determine minimum fuel and minimum cost trajectories for a helicopter flying a fixed range trajectory. In addition, a method was developed for obtaining a performance model in simplified form which is based on standard flight manual data and which is applicable to the computation of optimal trajectories. The entire performance optimization algorithm is simple enough that on line trajectory optimization is feasible with a relatively small computer. The helicopter model used is the Silorsky S-61N. Themore » results show that for this vehicle the optimal flight path and optimal cruise altitude can represent a 10% fuel saving on a minimum fuel trajectory. The optimal trajectories show considerable variability because of helicopter weight, ambient winds, and the relative cost trade off between time and fuel. In general, reasonable variations from the optimal velocities and cruise altitudes do not significantly degrade the optimal cost. For fuel optimal trajectories, the optimum cruise altitude varies from the maximum (12,000 ft) to the minimum (0 ft) depending on helicopter weight.« less

Manipulating the Gradient

ERIC Educational Resources Information Center

Gaze, Eric C.

2005-01-01

We introduce a cooperative learning, group lab for a Calculus III course to facilitate comprehension of the gradient vector and directional derivative concepts. The lab is a hands-on experience allowing students to manipulate a tangent plane and empirically measure the effect of partial derivatives on the direction of optimal ascent. (Contains 7…

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.

Application of GA, PSO, and ACO algorithms to path planning of autonomous underwater vehicles

NASA Astrophysics Data System (ADS)

Aghababa, Mohammad Pourmahmood; Amrollahi, Mohammad Hossein; Borjkhani, Mehdi

2012-09-01

In this paper, an underwater vehicle was modeled with six dimensional nonlinear equations of motion, controlled by DC motors in all degrees of freedom. Near-optimal trajectories in an energetic environment for underwater vehicles were computed using a numerical solution of a nonlinear optimal control problem (NOCP). An energy performance index as a cost function, which should be minimized, was defined. The resulting problem was a two-point boundary value problem (TPBVP). A genetic algorithm (GA), particle swarm optimization (PSO), and ant colony optimization (ACO) algorithms were applied to solve the resulting TPBVP. Applying an Euler-Lagrange equation to the NOCP, a conjugate gradient penalty method was also adopted to solve the TPBVP. The problem of energetic environments, involving some energy sources, was discussed. Some near-optimal paths were found using a GA, PSO, and ACO algorithms. Finally, the problem of collision avoidance in an energetic environment was also taken into account.

Advanced 3D mesh manipulation in stereolithographic files and post-print processing for the manufacturing of patient-specific vascular flow phantoms

NASA Astrophysics Data System (ADS)

O'Hara, Ryan P.; Chand, Arpita; Vidiyala, Sowmya; Arechavala, Stacie M.; Mitsouras, Dimitrios; Rudin, Stephen; Ionita, Ciprian N.

2016-03-01

Complex vascular anatomies can cause the failure of image-guided endovascular procedures. 3D printed patient-specific vascular phantoms provide clinicians and medical device companies the ability to preemptively plan surgical treatments, test the likelihood of device success, and determine potential operative setbacks. This research aims to present advanced mesh manipulation techniques of stereolithographic (STL) files segmented from medical imaging and post-print surface optimization to match physiological vascular flow resistance. For phantom design, we developed three mesh manipulation techniques. The first method allows outlet 3D mesh manipulations to merge superfluous vessels into a single junction, decreasing the number of flow outlets and making it feasible to include smaller vessels. Next we introduced Boolean operations to eliminate the need to manually merge mesh layers and eliminate errors of mesh self-intersections that previously occurred. Finally we optimize support addition to preserve the patient anatomical geometry. For post-print surface optimization, we investigated various solutions and methods to remove support material and smooth the inner vessel surface. Solutions of chloroform, alcohol and sodium hydroxide were used to process various phantoms and hydraulic resistance was measured and compared with values reported in literature. The newly mesh manipulation methods decrease the phantom design time by 30 - 80% and allow for rapid development of accurate vascular models. We have created 3D printed vascular models with vessel diameters less than 0.5 mm. The methods presented in this work could lead to shorter design time for patient specific phantoms and better physiological simulations.

Advanced 3D Mesh Manipulation in Stereolithographic Files and Post-Print Processing for the Manufacturing of Patient-Specific Vascular Flow Phantoms.

PubMed

O'Hara, Ryan P; Chand, Arpita; Vidiyala, Sowmya; Arechavala, Stacie M; Mitsouras, Dimitrios; Rudin, Stephen; Ionita, Ciprian N

2016-02-27

Complex vascular anatomies can cause the failure of image-guided endovascular procedures. 3D printed patient-specific vascular phantoms provide clinicians and medical device companies the ability to preemptively plan surgical treatments, test the likelihood of device success, and determine potential operative setbacks. This research aims to present advanced mesh manipulation techniques of stereolithographic (STL) files segmented from medical imaging and post-print surface optimization to match physiological vascular flow resistance. For phantom design, we developed three mesh manipulation techniques. The first method allows outlet 3D mesh manipulations to merge superfluous vessels into a single junction, decreasing the number of flow outlets and making it feasible to include smaller vessels. Next we introduced Boolean operations to eliminate the need to manually merge mesh layers and eliminate errors of mesh self-intersections that previously occurred. Finally we optimize support addition to preserve the patient anatomical geometry. For post-print surface optimization, we investigated various solutions and methods to remove support material and smooth the inner vessel surface. Solutions of chloroform, alcohol and sodium hydroxide were used to process various phantoms and hydraulic resistance was measured and compared with values reported in literature. The newly mesh manipulation methods decrease the phantom design time by 30 - 80% and allow for rapid development of accurate vascular models. We have created 3D printed vascular models with vessel diameters less than 0.5 mm. The methods presented in this work could lead to shorter design time for patient specific phantoms and better physiological simulations.

Advanced 3D Mesh Manipulation in Stereolithographic Files and Post-Print Processing for the Manufacturing of Patient-Specific Vascular Flow Phantoms

PubMed Central

O’Hara, Ryan P.; Chand, Arpita; Vidiyala, Sowmya; Arechavala, Stacie M.; Mitsouras, Dimitrios; Rudin, Stephen; Ionita, Ciprian N.

2017-01-01

Complex vascular anatomies can cause the failure of image-guided endovascular procedures. 3D printed patient-specific vascular phantoms provide clinicians and medical device companies the ability to preemptively plan surgical treatments, test the likelihood of device success, and determine potential operative setbacks. This research aims to present advanced mesh manipulation techniques of stereolithographic (STL) files segmented from medical imaging and post-print surface optimization to match physiological vascular flow resistance. For phantom design, we developed three mesh manipulation techniques. The first method allows outlet 3D mesh manipulations to merge superfluous vessels into a single junction, decreasing the number of flow outlets and making it feasible to include smaller vessels. Next we introduced Boolean operations to eliminate the need to manually merge mesh layers and eliminate errors of mesh self-intersections that previously occurred. Finally we optimize support addition to preserve the patient anatomical geometry. For post-print surface optimization, we investigated various solutions and methods to remove support material and smooth the inner vessel surface. Solutions of chloroform, alcohol and sodium hydroxide were used to process various phantoms and hydraulic resistance was measured and compared with values reported in literature. The newly mesh manipulation methods decrease the phantom design time by 30 – 80% and allow for rapid development of accurate vascular models. We have created 3D printed vascular models with vessel diameters less than 0.5 mm. The methods presented in this work could lead to shorter design time for patient specific phantoms and better physiological simulations. PMID:28649165

Characterization of applied fields for ion mobility separations in traveling wave based structures for lossless ion manipulations (SLIM)

DOE PAGES

Hamid, Ahmed M.; Prabhakaran, Aneesh; Garimella, Sandilya V. B.; ...

2018-03-26

Ion mobility (IM) is rapidly gaining attention for the separation and analysis of biomolecules due to the ability to distinguish the shapes of ions. However, conventional constant electric field drift tube IM separations have limited resolving power, constrained by practical limitations on the path length and maximum applied voltage. The implementation of traveling waves (TW) in IM removes the latter limitation, allowing higher resolution to be achieved using extended path lengths. Both of these can be readily obtained in Structures for Lossless Ion Manipulations (SLIM), which are fabricated from arrays of electrodes patterned on two parallel surfaces where potentials aremore » applied to generate appropriate electric fields between the surfaces. Here we have investigated the relationship between the primary SLIM variables, such as electrode dimensions, inter-surface gap, and the applied TW voltages, that directly impact the fields experienced by ions. Ion trajectory simulations and theoretical calculations have been utilized to understand the dependence of SLIM geometry and effective electric fields on IM resolution. The variables explored impact both ion confinement and the observed IM resolution using SLIM modules.« less

Characterization of applied fields for ion mobility separations in traveling wave based structures for lossless ion manipulations (SLIM)

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

Hamid, Ahmed M.; Prabhakaran, Aneesh; Garimella, Sandilya V. B.

Ion mobility (IM) is rapidly gaining attention for the separation and analysis of biomolecules due to the ability to distinguish the shapes of ions. However, conventional constant electric field drift tube IM separations have limited resolving power, constrained by practical limitations on the path length and maximum applied voltage. The implementation of traveling waves (TW) in IM removes the latter limitation, allowing higher resolution to be achieved using extended path lengths. Both of these can be readily obtained in Structures for Lossless Ion Manipulations (SLIM), which are fabricated from arrays of electrodes patterned on two parallel surfaces where potentials aremore » applied to generate appropriate electric fields between the surfaces. Here we have investigated the relationship between the primary SLIM variables, such as electrode dimensions, inter-surface gap, and the applied TW voltages, that directly impact the fields experienced by ions. Ion trajectory simulations and theoretical calculations have been utilized to understand the dependence of SLIM geometry and effective electric fields on IM resolution. The variables explored impact both ion confinement and the observed IM resolution using SLIM modules.« less

Upconverting nanoparticles for optimizing scintillator based detection systems

DOEpatents

Kross, Brian; McKisson, John E; McKisson, John; Weisenberger, Andrew; Xi, Wenze; Zom, Carl

2013-09-17

An upconverting device for a scintillation detection system is provided. The detection system comprises a scintillator material, a sensor, a light transmission path between the scintillator material and the sensor, and a plurality of upconverting nanoparticles particles positioned in the light transmission path.

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.

Method to Create Arbitrary Sidewall Geometries in 3-Dimensions Using Liga with a Stochastic Optimization Framework

NASA Technical Reports Server (NTRS)

Eyre, Francis B. (Inventor); Fink, Wolfgang (Inventor)

2011-01-01

Disclosed herein is a method of making a three dimensional mold comprising the steps of providing a mold substrate; exposing the substrate with an electromagnetic radiation source for a period of time sufficient to render the portion of the mold substrate susceptible to a developer to produce a modified mold substrate; and developing the modified mold with one or more developing reagents to remove the portion of the mold substrate rendered susceptible to the developer from the mold substrate, to produce the mold having a desired mold shape, wherein the electromagnetic radiation source has a fixed position, and wherein during the exposing step, the mold substrate is manipulated according to a manipulation algorithm in one or more dimensions relative to the electromagnetic radiation source; and wherein the manipulation algorithm is determined using stochastic optimization computations.

Interferometry with non-classical motional states of a Bose-Einstein condensate.

PubMed

van Frank, S; Negretti, A; Berrada, T; Bücker, R; Montangero, S; Schaff, J-F; Schumm, T; Calarco, T; Schmiedmayer, J

2014-05-30

The Ramsey interferometer is a prime example of precise control at the quantum level. It is usually implemented using internal states of atoms, molecules or ions, for which powerful manipulation procedures are now available. Whether it is possible to control external degrees of freedom of more complex, interacting many-body systems at this level remained an open question. Here we demonstrate a two-pulse Ramsey-type interferometer for non-classical motional states of a Bose-Einstein condensate in an anharmonic trap. The control sequences used to manipulate the condensate wavefunction are obtained from optimal control theory and are directly optimized to maximize the interferometric contrast. They permit a fast manipulation of the atomic ensemble compared to the intrinsic decay processes and many-body dephasing effects. This allows us to reach an interferometric contrast of 92% in the experimental implementation.

Study on the measuring distance for blood glucose infrared spectral measuring by Monte Carlo simulation

NASA Astrophysics Data System (ADS)

Li, Xiang

2016-10-01

Blood glucose monitoring is of great importance for controlling diabetes procedure and preventing the complications. At present, the clinical blood glucose concentration measurement is invasive and could be replaced by noninvasive spectroscopy analytical techniques. Among various parameters of optical fiber probe used in spectrum measuring, the measurement distance is the key one. The Monte Carlo technique is a flexible method for simulating light propagation in tissue. The simulation is based on the random walks that photons make as they travel through tissue, which are chosen by statistically sampling the probability distributions for step size and angular deflection per scattering event. The traditional method for determine the optimal distance between transmitting fiber and detector is using Monte Carlo simulation to find out the point where most photons come out. But there is a problem. In the epidermal layer there is no artery, vein or capillary vessel. Thus, when photons propagate and interactive with tissue in epidermal layer, no information is given to the photons. A new criterion is proposed to determine the optimal distance, which is named effective path length in this paper. The path length of each photons travelling in dermis is recorded when running Monte-Carlo simulation, which is the effective path length defined above. The sum of effective path length of every photon at each point is calculated. The detector should be place on the point which has most effective path length. Then the optimal measuring distance between transmitting fiber and detector is determined.

Shortest multiple disconnected path for the analysis of entanglements in two- and three-dimensional polymeric systems

NASA Astrophysics Data System (ADS)

Kröger, Martin

2005-06-01

We present an algorithm which returns a shortest path and related number of entanglements for a given configuration of a polymeric system in 2 or 3 dimensions. Rubinstein and Helfand, and later Everaers et al. introduced a concept to extract primitive paths for dense polymeric melts made of linear chains (a multiple disconnected multibead 'path'), where each primitive path is defined as a path connecting the (space-fixed) ends of a polymer under the constraint of non-interpenetration (excluded volume) between primitive paths of different chains, such that the multiple disconnected path fulfills a minimization criterion. The present algorithm uses geometrical operations and provides a—model independent—efficient approximate solution to this challenging problem. Primitive paths are treated as 'infinitely' thin (we further allow for finite thickness to model excluded volume), and tensionless lines rather than multibead chains, excluded volume is taken into account without a force law. The present implementation allows to construct a shortest multiple disconnected path (SP) for 2D systems (polymeric chain within spherical obstacles) and an optimal SP for 3D systems (collection of polymeric chains). The number of entanglements is then simply obtained from the SP as either the number of interior kinks, or from the average length of a line segment. Further, information about structure and potentially also the dynamics of entanglements is immediately available from the SP. We apply the method to study the 'concentration' dependence of the degree of entanglement in phantom chain systems. Program summaryTitle of program:Z Catalogue number:ADVG Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADVG Program obtainable from: CPC Program Library, Queen's University of Belfast, N. Ireland Computer for which the program is designed and others on which it has been tested: Silicon Graphics (Irix), Sun (Solaris), PC (Linux) Operating systems or monitors under which the program has been tested: UNIX, Linux Program language used: USANSI Fortran 77 and Fortran 90 Memory required to execute with typical data: 1 MByte No. of lines in distributed program, including test data, etc.: 10 660 No. of bytes in distributed program, including test data, etc.: 119 551 Distribution formet:tar.gz Nature of physical problem: The problem is to obtain primitive paths substantiating a shortest multiple disconnected path (SP) for a given polymer configuration (chains of particles, with or without additional single particles as obstacles for the 2D case). Primitive paths are here defined as in [M. Rubinstein, E. Helfand, J. Chem. Phys. 82 (1985) 2477; R. Everaers, S.K. Sukumaran, G.S. Grest, C. Svaneborg, A. Sivasubramanian, K. Kremer, Science 303 (2004) 823] as the shortest line (path) respecting 'topological' constraints (from neighboring polymers or point obstacles) between ends of polymers. There is a unique solution for the 2D case. For the 3D case it is unique if we construct a primitive path of a single chain embedded within fixed line obstacles [J.S.B. Mitchell, Geometric shortest paths and network optimization, in: J.-R. Sack, J. Urrutia (Eds.), Handbook of Computational Geometry, Elsevier, Amsterdam, 2000, pp. 633-701]. For a large 3D configuration made of several chains, short is meant to be the Euclidean shortest multiple disconnected path (SP) where primitive paths are constructed for all chains simultaneously. While the latter problem, in general, does not possess a unique solution, the algorithm must return a locally optimal solution, robust against minor displacements of the disconnected path and chain re-labeling. The problem is solved if the number of kinks (or entanglements Z), explicitly deduced from the SP, is quite insensitive to the exact conformation of the SP which allows to estimate Z with a small error. Efficient method of solution: Primitive paths are constructed from the given polymer configuration (a non-shortest multiple disconnected path, including obstacles, if present) by first replacing each polymer contour by a line with a number of 'kinks' (beads, nodes) and 'segments' (edges). To obtain primitive paths, defined to be uncrossable by any other objects (neighboring primitive paths, line or point obstacles), the algorithm minimizes the length of all primitive paths consecutively, until a final minimum Euclidean length of the SP is reached. Fast geometric operations rather than dynamical methods are used to minimize the contour lengths of the primitive paths. Neighbor lists are used to keep track of potentially intersecting segments of other chains. Periodic boundary conditions are employed. A finite small line thickness is used in order to make sure that entanglements are not 'lost' due to finite precision of representation of numbers. Restrictions on the complexity of the problem: For a single chain embedded within fixed line or point obstacles, the algorithm returns the exact SP. For more complex problems, the algorithm returns a locally optimal SP. Except for exotic, probably rare, configurations it turns out that different locally optimal SPs possess quite an identical number of nodes. In general, the problem constructing the SP is known to be NP-hard [J.S.B. Mitchell, Geometric shortest paths and network optimization, in: J.-R. Sack, J. Urrutia (Eds.), Handbook of Computational Geometry, Elsevier, Amsterdam, 2000, pp. 633-701], and we offer a solution which should suffice to analyze physical problems, and gives an estimate about the precision and uniqueness of the result (from a standard deviation by varying the parameter: cyclicswitch). The program is NOT restricted to handle systems for which segment lengths of the SP exceed half the box size. Typical running time: Typical running times are approximately two orders of magnitude shorter compared with the ones needed for a corresponding molecular dynamics approach, and scale mostly linearly with system size. We provide a benchmark table.

Comparison of workload measures on computer-generated primary flight displays

NASA Technical Reports Server (NTRS)

Nataupsky, Mark; Abbott, Terence S.

1987-01-01

Four Air Force pilots were used as subjects to assess a battery of subjective and physiological workload measures in a flight simulation environment in which two computer-generated primary flight display configurations were evaluated. A high- and low-workload task was created by manipulating flight path complexity. Both SWAT and the NASA-TLX were shown to be effective in differentiating the high and low workload path conditions. Physiological measures were inconclusive. A battery of workload measures continues to be necessary for an understanding of the data. Based on workload, opinion, and performance data, it is fruitful to pursue research with a primary flight display and a horizontal situation display integrated into a single display.

Laser-assisted guiding of electric discharges around objects

PubMed Central

Clerici, Matteo; Hu, Yi; Lassonde, Philippe; Milián, Carles; Couairon, Arnaud; Christodoulides, Demetrios N.; Chen, Zhigang; Razzari, Luca; Vidal, François; Légaré, François; Faccio, Daniele; Morandotti, Roberto

2015-01-01

Electric breakdown in air occurs for electric fields exceeding 34 kV/cm and results in a large current surge that propagates along unpredictable trajectories. Guiding such currents across specific paths in a controllable manner could allow protection against lightning strikes and high-voltage capacitor discharges. Such capabilities can be used for delivering charge to specific targets, for electronic jamming, or for applications associated with electric welding and machining. We show that judiciously shaped laser radiation can be effectively used to manipulate the discharge along a complex path and to produce electric discharges that unfold along a predefined trajectory. Remarkably, such laser-induced arcing can even circumvent an object that completely occludes the line of sight. PMID:26601188

Integration of polarization-multiplexing and phase-shifting in nanometric two dimensional self-mixing measurement.

PubMed

Tao, Yufeng; Xia, Wei; Wang, Ming; Guo, Dongmei; Hao, Hui

2017-02-06

Integration of phase manipulation and polarization multiplexing was introduced to self-mixing interferometry (SMI) for high-sensitive measurement. Light polarizations were used to increase measuring path number and predict manifold merits for potential applications. Laser source was studied as a microwave-photonic resonator optically-injected by double reflected lights on a two-feedback-factor analytical model. Independent external paths exploited magnesium-oxide doped lithium niobate crystals at perpendicular polarizations to transfer interferometric phases into amplitudes of harmonics. Theoretical resolutions reached angstrom level. By integrating two techniques, this SMI outperformed the conventional single-path SMIs by simultaneous dual-targets measurement on single laser tube with high sensitivity and low speckle noise. In experimental demonstration, by nonlinear filtering method, a custom-made phase-resolved algorithm real-time figured out instantaneous two-dimensional displacements with nanometer resolution. Experimental comparisons to lock-in technique and a commercial Ploytec-5000 laser Doppler velocity meter validated this two-path SMI in micron range without optical cross-talk. Moreover, accuracy subjected to slewing rates of crystals could be flexibly adjusted.

Optimization of Supersonic Transport Trajectories

NASA Technical Reports Server (NTRS)

Ardema, Mark D.; Windhorst, Robert; Phillips, James

1998-01-01

This paper develops a near-optimal guidance law for generating minimum fuel, time, or cost fixed-range trajectories for supersonic transport aircraft. The approach uses a choice of new state variables along with singular perturbation techniques to time-scale decouple the dynamic equations into multiple equations of single order (second order for the fast dynamics). Application of the maximum principle to each of the decoupled equations, as opposed to application to the original coupled equations, avoids the two point boundary value problem and transforms the problem from one of a functional optimization to one of multiple function optimizations. It is shown that such an approach produces well known aircraft performance results such as minimizing the Brequet factor for minimum fuel consumption and the energy climb path. Furthermore, the new state variables produce a consistent calculation of flight path angle along the trajectory, eliminating one of the deficiencies in the traditional energy state approximation. In addition, jumps in the energy climb path are smoothed out by integration of the original dynamic equations at constant load factor. Numerical results performed for a supersonic transport design show that a pushover dive followed by a pullout at nominal load factors are sufficient maneuvers to smooth the jump.

Social Milieu Oriented Routing: A New Dimension to Enhance Network Security in WSNs.

PubMed

Liu, Lianggui; Chen, Li; Jia, Huiling

2016-02-19

In large-scale wireless sensor networks (WSNs), in order to enhance network security, it is crucial for a trustor node to perform social milieu oriented routing to a target a trustee node to carry out trust evaluation. This challenging social milieu oriented routing with more than one end-to-end Quality of Trust (QoT) constraint has proved to be NP-complete. Heuristic algorithms with polynomial and pseudo-polynomial-time complexities are often used to deal with this challenging problem. However, existing solutions cannot guarantee the efficiency of searching; that is, they can hardly avoid obtaining partial optimal solutions during a searching process. Quantum annealing (QA) uses delocalization and tunneling to avoid falling into local minima without sacrificing execution time. This has been proven a promising way to many optimization problems in recently published literatures. In this paper, for the first time, with the help of a novel approach, that is, configuration path-integral Monte Carlo (CPIMC) simulations, a QA-based optimal social trust path (QA_OSTP) selection algorithm is applied to the extraction of the optimal social trust path in large-scale WSNs. Extensive experiments have been conducted, and the experiment results demonstrate that QA_OSTP outperforms its heuristic opponents.

Optimal symmetric flight with an intermediate vehicle model

NASA Technical Reports Server (NTRS)

Menon, P. K. A.; Kelley, H. J.; Cliff, E. M.

1983-01-01

Optimal flight in the vertical plane with a vehicle model intermediate in complexity between the point-mass and energy models is studied. Flight-path angle takes on the role of a control variable. Range-open problems feature subarcs of vertical flight and singular subarcs. The class of altitude-speed-range-time optimization problems with fuel expenditure unspecified is investigated and some interesting phenomena uncovered. The maximum-lift-to-drag glide appears as part of the family, final-time-open, with appropriate initial and terminal transient exceeding level-flight drag, some members exhibiting oscillations. Oscillatory paths generally fail the Jacobi test for durations exceeding a period and furnish a minimum only for short-duration problems.

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

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.

Optimized resolved rate control of seven-degree-of-freedom Laboratory Telerobotic Manipulator (LTM) with application to three-dimensional graphics simulation

NASA Technical Reports Server (NTRS)

Barker, L. Keith; Mckinney, William S., Jr.

1989-01-01

The Laboratory Telerobotic Manipulator (LTM) is a seven-degree-of-freedom robot arm. Two of the arms were delivered to Langley Research Center for ground-based research to assess the use of redundant degree-of-freedom robot arms in space operations. Resolved-rate control equations for the LTM are derived. The equations are based on a scheme developed at the Oak Ridge National Laboratory for computing optimized joint angle rates in real time. The optimized joint angle rates actually represent a trade-off, as the hand moves, between small rates (least-squares solution) and those rates which work toward satisfying a specified performance criterion of joint angles. In singularities where the optimization scheme cannot be applied, alternate control equations are devised. The equations developed were evaluated using a real-time computer simulation to control a 3-D graphics model of the LTM.

Solving fuzzy shortest path problem by genetic algorithm

NASA Astrophysics Data System (ADS)

Syarif, A.; Muludi, K.; Adrian, R.; Gen, M.

2018-03-01

Shortest Path Problem (SPP) is known as one of well-studied fields in the area Operations Research and Mathematical Optimization. It has been applied for many engineering and management designs. The objective is usually to determine path(s) in the network with minimum total cost or traveling time. In the past, the cost value for each arc was usually assigned or estimated as a deteministic value. For some specific real world applications, however, it is often difficult to determine the cost value properly. One way of handling such uncertainty in decision making is by introducing fuzzy approach. With this situation, it will become difficult to solve the problem optimally. This paper presents the investigations on the application of Genetic Algorithm (GA) to a new SPP model in which the cost values are represented as Triangular Fuzzy Number (TFN). We adopts the concept of ranking fuzzy numbers to determine how good the solutions. Here, by giving his/her degree value, the decision maker can determine the range of objective value. This would be very valuable for decision support system in the real world applications.Simulation experiments were carried out by modifying several test problems with 10-25 nodes. It is noted that the proposed approach is capable attaining a good solution with different degree of optimism for the tested problems.

Interpolating between random walks and optimal transportation routes: Flow with multiple sources and targets

NASA Astrophysics Data System (ADS)

Guex, Guillaume

2016-05-01

In recent articles about graphs, different models proposed a formalism to find a type of path between two nodes, the source and the target, at crossroads between the shortest-path and the random-walk path. These models include a freely adjustable parameter, allowing to tune the behavior of the path toward randomized movements or direct routes. This article presents a natural generalization of these models, namely a model with multiple sources and targets. In this context, source nodes can be viewed as locations with a supply of a certain good (e.g. people, money, information) and target nodes as locations with a demand of the same good. An algorithm is constructed to display the flow of goods in the network between sources and targets. With again a freely adjustable parameter, this flow can be tuned to follow routes of minimum cost, thus displaying the flow in the context of the optimal transportation problem or, by contrast, a random flow, known to be similar to the electrical current flow if the random-walk is reversible. Moreover, a source-targetcoupling can be retrieved from this flow, offering an optimal assignment to the transportation problem. This algorithm is described in the first part of this article and then illustrated with case studies.

Homography-based control scheme for mobile robots with nonholonomic and field-of-view constraints.

PubMed

López-Nicolás, Gonzalo; Gans, Nicholas R; Bhattacharya, Sourabh; Sagüés, Carlos; Guerrero, Josechu J; Hutchinson, Seth

2010-08-01

In this paper, we present a visual servo controller that effects optimal paths for a nonholonomic differential drive robot with field-of-view constraints imposed by the vision system. The control scheme relies on the computation of homographies between current and goal images, but unlike previous homography-based methods, it does not use the homography to compute estimates of pose parameters. Instead, the control laws are directly expressed in terms of individual entries in the homography matrix. In particular, we develop individual control laws for the three path classes that define the language of optimal paths: rotations, straight-line segments, and logarithmic spirals. These control laws, as well as the switching conditions that define how to sequence path segments, are defined in terms of the entries of homography matrices. The selection of the corresponding control law requires the homography decomposition before starting the navigation. We provide a controllability and stability analysis for our system and give experimental results.

Reflexive obstacle avoidance for kinematically-redundant manipulators

NASA Technical Reports Server (NTRS)

Karlen, James P.; Thompson, Jack M., Jr.; Farrell, James D.; Vold, Havard I.

1989-01-01

Dexterous telerobots incorporating 17 or more degrees of freedom operating under coordinated, sensor-driven computer control will play important roles in future space operations. They will also be used on Earth in assignments like fire fighting, construction and battlefield support. A real time, reflexive obstacle avoidance system, seen as a functional requirement for such massively redundant manipulators, was developed using arm-mounted proximity sensors to control manipulator pose. The project involved a review and analysis of alternative proximity sensor technologies for space applications, the development of a general-purpose algorithm for synthesizing sensor inputs, and the implementation of a prototypical system for demonstration and testing. A 7 degree of freedom Robotics Research K-2107HR manipulator was outfitted with ultrasonic proximity sensors as a testbed, and Robotics Research's standard redundant motion control algorithm was modified such that an object detected by sensor arrays located at the elbow effectively applies a force to the manipulator elbow, normal to the axis. The arm is repelled by objects detected by the sensors, causing the robot to steer around objects in the workspace automatically while continuing to move its tool along the commanded path without interruption. The mathematical approach formulated for synthesizing sensor inputs can be employed for redundant robots of any kinematic configuration.

Effective use of congestion in complex networks

NASA Astrophysics Data System (ADS)

Echagüe, Juan; Cholvi, Vicent; Kowalski, Dariusz R.

2018-03-01

In this paper, we introduce a congestion-aware routing protocol that selects the paths according to the congestion of nodes in the network. The aim is twofold: on one hand, and in order to prevent the networks from collapsing, it provides a good tolerance to nodes' overloads; on the other hand, and in order to guarantee efficient communication, it also incentivize the routes to follow short paths. We analyze the performance of our proposed routing strategy by means of a series of experiments carried out by using simulations. We show that it provides a tolerance to collapse close to the optimal value. Furthermore, the average length of the paths behaves optimally up to the certain value of packet generation rate ρ and it grows in a linear fashion with the increase of ρ.

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.

Rhythmic Effects of Syntax Processing in Music and Language.

PubMed

Jung, Harim; Sontag, Samuel; Park, YeBin S; Loui, Psyche

2015-01-01

Music and language are human cognitive and neural functions that share many structural similarities. Past theories posit a sharing of neural resources between syntax processing in music and language (Patel, 2003), and a dynamic attention network that governs general temporal processing (Large and Jones, 1999). Both make predictions about music and language processing over time. Experiment 1 of this study investigates the relationship between rhythmic expectancy and musical and linguistic syntax in a reading time paradigm. Stimuli (adapted from Slevc et al., 2009) were sentences broken down into segments; each sentence segment was paired with a musical chord and presented at a fixed inter-onset interval. Linguistic syntax violations appeared in a garden-path design. During the critical region of the garden-path sentence, i.e., the particular segment in which the syntactic unexpectedness was processed, expectancy violations for language, music, and rhythm were each independently manipulated: musical expectation was manipulated by presenting out-of-key chords and rhythmic expectancy was manipulated by perturbing the fixed inter-onset interval such that the sentence segments and musical chords appeared either early or late. Reading times were recorded for each sentence segment and compared for linguistic, musical, and rhythmic expectancy. Results showed main effects of rhythmic expectancy and linguistic syntax expectancy on reading time. There was also an effect of rhythm on the interaction between musical and linguistic syntax: effects of violations in musical and linguistic syntax showed significant interaction only during rhythmically expected trials. To test the effects of our experimental design on rhythmic and linguistic expectancies, independently of musical syntax, Experiment 2 used the same experimental paradigm, but the musical factor was eliminated-linguistic stimuli were simply presented silently, and rhythmic expectancy was manipulated at the critical region. Experiment 2 replicated effects of rhythm and language, without an interaction. Together, results suggest that the interaction of music and language syntax processing depends on rhythmic expectancy, and support a merging of theories of music and language syntax processing with dynamic models of attentional entrainment.

Intelligent Robotic Systems Study (IRSS), phase 2

NASA Technical Reports Server (NTRS)

1990-01-01

Under the Intelligent Robotics System Study (IRSS) contract, a generalized robotic control architecture was developed for use with the ProtoFlight Manipulator Arm (PFMA). The controller built for the PFMA provides localized position based force control, teleoperation and advanced path recording and playback capabilities. Various hand controllers can be used with the system in conjunction with a synthetic time delay capability to provide a realistic test bed for typical satellite servicing tasks. The configuration of the IRSS system is illustrated and discussed. The PFMA has six computer controllable degrees of freedom (DOF) plus a seventh manually indexable DOF, making the manipulator a pseudo 7 DOF mechanism. Because the PFMA was not developed to operate in a gravity field, but rather in space, it is counter balanced at the shoulder, elbow and wrist and a spring counterbalance has been added near the wrist to provide additional support. Built with long slender intra-joint linkages, the PFMA has a workspace nearly 2 meters deep and possesses sufficient dexterity to perform numerous satellite servicing tasks. The manipulator is arranged in a shoulder-yaw, pitch, elbow-pitch, and wrist-pitch, yaw, roll configuration, with an indexable shoulder roll joint. Digital control of the PFMA is implemented using a variety of single board computers developed by Heurikon Corporation and other manufacturers. The IRSS controller is designed to be a multi-rate, multi-tasking system. Independent joint servos run at a 134 Hz rate and position based impedance control functions at 67 Hz. Autonomous path generation and hand controller inputs are processed at a 33 Hz.

An optimization model for metabolic pathways.

PubMed

Planes, F J; Beasley, J E

2009-10-15

Different mathematical methods have emerged in the post-genomic era to determine metabolic pathways. These methods can be divided into stoichiometric methods and path finding methods. In this paper we detail a novel optimization model, based upon integer linear programming, to determine metabolic pathways. Our model links reaction stoichiometry with path finding in a single approach. We test the ability of our model to determine 40 annotated Escherichia coli metabolic pathways. We show that our model is able to determine 36 of these 40 pathways in a computationally effective manner.

Tool path strategy and cutting process monitoring in intelligent machining

NASA Astrophysics Data System (ADS)

Chen, Ming; Wang, Chengdong; An, Qinglong; Ming, Weiwei

2018-06-01

Intelligent machining is a current focus in advanced manufacturing technology, and is characterized by high accuracy and efficiency. A central technology of intelligent machining—the cutting process online monitoring and optimization—is urgently needed for mass production. In this research, the cutting process online monitoring and optimization in jet engine impeller machining, cranio-maxillofacial surgery, and hydraulic servo valve deburring are introduced as examples of intelligent machining. Results show that intelligent tool path optimization and cutting process online monitoring are efficient techniques for improving the efficiency, quality, and reliability of machining.

Simulation in production of open rotor propellers: from optimal surface geometry to automated control of mechanical treatment

NASA Astrophysics Data System (ADS)

Grinyok, A.; Boychuk, I.; Perelygin, D.; Dantsevich, I.

2018-03-01

A complex method of the simulation and production design of open rotor propellers was studied. An end-to-end diagram was proposed for the evaluating, designing and experimental testing the optimal geometry of the propeller surface, for the machine control path generation as well as for simulating the cutting zone force condition and its relationship with the treatment accuracy which was defined by the propeller elastic deformation. The simulation data provided the realization of the combined automated path control of the cutting tool.

A three degree of freedom manipulator used for store separation wind tunnel test

NASA Astrophysics Data System (ADS)

Wei, R.; Che, B.-H.; Sun, C.-B.; Zhang, J.; Lu, Y.-Q.

2018-06-01

A three degree of freedom manipulator is presented, which is used for store separation wind tunnel test. It is a kind of mechatronics product, have small volume and large moment of torque. The paper researched the design principle of wind tunnel test equipment, also introduced the transmission principle design, physical design, control system design, drive element selection calculation and verification, dynamics computation and static structural computation of the manipulator. To satisfy the design principle of wind tunnel test equipment, some optimization design are made include optimizes the structure of drive element and cable, fairing configuration, overall dimension so that to make the device more suitable for the wind tunnel test. Some tests are made to verify the parameters of the manipulator. The results show that the device improves the load from 100 Nm to 250 Nm, control accuracy from 0.1°to 0.05°in pitch and yaw, also improves load from 10 Nm to 20 Nm, control accuracy from 0.1°to 0.05°in roll.

Rational manipulation of digital EEG: pearls and pitfalls.

PubMed

Seneviratne, Udaya

2014-12-01

The advent of digital EEG has provided greater flexibility and more opportunities in data analysis to optimize the diagnostic yield. Changing the filter settings, sensitivity, montages, and time-base are possible rational manipulations to achieve this goal. The options to use polygraphy, video, and quantification are additional useful features. Aliasing and loss of data are potential pitfalls in the use of digital EEG. This review illustrates some common clinical scenarios where rational manipulations can enhance the diagnostic EEG yield and potential pitfalls in the process.

The Application of Optimal Defaults to Improve Elementary School Lunch Selections: Proof of Concept

ERIC Educational Resources Information Center

Loeb, Katharine L.; Radnitz, Cynthia; Keller, Kathleen L.; Schwartz, Marlene B.; Zucker, Nancy; Marcus, Sue; Pierson, Richard N.; Shannon, Michael; DeLaurentis, Danielle

2018-01-01

Background: In this study, we applied behavioral economics to optimize elementary school lunch choices via parent-driven decisions. Specifically, this experiment tested an optimal defaults paradigm, examining whether strategically manipulating the health value of a default menu could be co-opted to improve school-based lunch selections. Methods:…

Dynamics and control of DNA sequence amplification

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

Marimuthu, Karthikeyan; Chakrabarti, Raj, E-mail: raj@pmc-group.com, E-mail: rajc@andrew.cmu.edu; Division of Fundamental Research, PMC Advanced Technology, Mount Laurel, New Jersey 08054

2014-10-28

DNA amplification is the process of replication of a specified DNA sequence in vitro through time-dependent manipulation of its external environment. A theoretical framework for determination of the optimal dynamic operating conditions of DNA amplification reactions, for any specified amplification objective, is presented based on first-principles biophysical modeling and control theory. Amplification of DNA is formulated as a problem in control theory with optimal solutions that can differ considerably from strategies typically used in practice. Using the Polymerase Chain Reaction as an example, sequence-dependent biophysical models for DNA amplification are cast as control systems, wherein the dynamics of the reactionmore » are controlled by a manipulated input variable. Using these control systems, we demonstrate that there exists an optimal temperature cycling strategy for geometric amplification of any DNA sequence and formulate optimal control problems that can be used to derive the optimal temperature profile. Strategies for the optimal synthesis of the DNA amplification control trajectory are proposed. Analogous methods can be used to formulate control problems for more advanced amplification objectives corresponding to the design of new types of DNA amplification reactions.« less

Dynamic modeling and adaptive vibration suppression of a high-speed macro-micro manipulator

NASA Astrophysics Data System (ADS)

Yang, Yi-ling; Wei, Yan-ding; Lou, Jun-qiang; Fu, Lei; Fang, Sheng; Chen, Te-huan

2018-05-01

This paper presents a dynamic modeling and microscopic vibration suppression for a flexible macro-micro manipulator dedicated to high-speed operation. The manipulator system mainly consists of a macro motion stage and a flexible micromanipulator bonded with one macro-fiber-composite actuator. Based on Hamilton's principle and the Bouc-Wen hysteresis equation, the nonlinear dynamic model is obtained. Then, a hybrid control scheme is proposed to simultaneously suppress the elastic vibration during and after the motor motion. In particular, the hybrid control strategy is composed of a trajectory planning approach and an adaptive variable structure control. Moreover, two optimization indices regarding the comprehensive torques and synthesized vibrations are designed, and the optimal trajectories are acquired using a genetic algorithm. Furthermore, a nonlinear fuzzy regulator is used to adjust the switching gain in the variable structure control. Thus, a fuzzy variable structure control with nonlinear adaptive control law is achieved. A series of experiments are performed to verify the effectiveness and feasibility of the established system model and hybrid control strategy. The excited vibration during the motor motion and the residual vibration after the motor motion are decreased. Meanwhile, the settling time is shortened. Both the manipulation stability and operation efficiency of the manipulator are improved by the proposed hybrid strategy.

Optimizing Vowel Formant Measurements in Four Acoustic Analysis Systems for Diverse Speaker Groups

PubMed Central

Derdemezis, Ekaterini; Kent, Ray D.; Fourakis, Marios; Reinicke, Emily L.; Bolt, Daniel M.

2016-01-01

Purpose This study systematically assessed the effects of select linear predictive coding (LPC) analysis parameter manipulations on vowel formant measurements for diverse speaker groups using 4 trademarked Speech Acoustic Analysis Software Packages (SAASPs): CSL, Praat, TF32, and WaveSurfer. Method Productions of 4 words containing the corner vowels were recorded from 4 speaker groups with typical development (male and female adults and male and female children) and 4 speaker groups with Down syndrome (male and female adults and male and female children). Formant frequencies were determined from manual measurements using a consensus analysis procedure to establish formant reference values, and from the 4 SAASPs (using both the default analysis parameters and with adjustments or manipulations to select parameters). Smaller differences between values obtained from the SAASPs and the consensus analysis implied more optimal analysis parameter settings. Results Manipulations of default analysis parameters in CSL, Praat, and TF32 yielded more accurate formant measurements, though the benefit was not uniform across speaker groups and formants. In WaveSurfer, manipulations did not improve formant measurements. Conclusions The effects of analysis parameter manipulations on accuracy of formant-frequency measurements varied by SAASP, speaker group, and formant. The information from this study helps to guide clinical and research applications of SAASPs. PMID:26501214

ELASTIC NET FOR COX'S PROPORTIONAL HAZARDS MODEL WITH A SOLUTION PATH ALGORITHM.

PubMed

Wu, Yichao

2012-01-01

For least squares regression, Efron et al. (2004) proposed an efficient solution path algorithm, the least angle regression (LAR). They showed that a slight modification of the LAR leads to the whole LASSO solution path. Both the LAR and LASSO solution paths are piecewise linear. Recently Wu (2011) extended the LAR to generalized linear models and the quasi-likelihood method. In this work we extend the LAR further to handle Cox's proportional hazards model. The goal is to develop a solution path algorithm for the elastic net penalty (Zou and Hastie (2005)) in Cox's proportional hazards model. This goal is achieved in two steps. First we extend the LAR to optimizing the log partial likelihood plus a fixed small ridge term. Then we define a path modification, which leads to the solution path of the elastic net regularized log partial likelihood. Our solution path is exact and piecewise determined by ordinary differential equation systems.

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.

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.

Vibrotactile sensory substitution for object manipulation: amplitude versus pulse train frequency modulation.

PubMed

Stepp, Cara E; Matsuoka, Yoky

2012-01-01

Incorporating sensory feedback with prosthetic devices is now possible, but the optimal methods of providing such feedback are still unknown. The relative utility of amplitude and pulse train frequency modulated stimulation paradigms for providing vibrotactile feedback for object manipulation was assessed in 10 participants. The two approaches were studied during virtual object manipulation using a robotic interface as a function of presentation order and a simultaneous cognitive load. Despite the potential pragmatic benefits associated with pulse train frequency modulated vibrotactile stimulation, comparison of the approach with amplitude modulation indicates that amplitude modulation vibrotactile stimulation provides superior feedback for object manipulation.

Design and Evaluation of a Dynamic Programming Flight Routing Algorithm Using the Convective Weather Avoidance Model

NASA Technical Reports Server (NTRS)

Ng, Hok K.; Grabbe, Shon; Mukherjee, Avijit

2010-01-01

The optimization of traffic flows in congested airspace with varying convective weather is a challenging problem. One approach is to generate shortest routes between origins and destinations while meeting airspace capacity constraint in the presence of uncertainties, such as weather and airspace demand. This study focuses on development of an optimal flight path search algorithm that optimizes national airspace system throughput and efficiency in the presence of uncertainties. The algorithm is based on dynamic programming and utilizes the predicted probability that an aircraft will deviate around convective weather. It is shown that the running time of the algorithm increases linearly with the total number of links between all stages. The optimal routes minimize a combination of fuel cost and expected cost of route deviation due to convective weather. They are considered as alternatives to the set of coded departure routes which are predefined by FAA to reroute pre-departure flights around weather or air traffic constraints. A formula, which calculates predicted probability of deviation from a given flight path, is also derived. The predicted probability of deviation is calculated for all path candidates. Routes with the best probability are selected as optimal. The predicted probability of deviation serves as a computable measure of reliability in pre-departure rerouting. The algorithm can also be extended to automatically adjust its design parameters to satisfy the desired level of reliability.

Selectively starving cancer cells through dietary manipulation: methods and clinical implications.

PubMed

Simone, Brittany A; Champ, Colin E; Rosenberg, Anne L; Berger, Adam C; Monti, Daniel A; Dicker, Adam P; Simone, Nicole L

2013-07-01

As the link between obesity and metabolic syndrome and cancer becomes clearer, the need to determine the optimal way to incorporate dietary manipulation in the treatment of cancer patients becomes increasingly important. Metabolic-based therapies, such as caloric restriction, intermittent fasting and a ketogenic diet, have the ability to decrease the incidence of spontaneous tumors and slow the growth of primary tumors, and may have an effect on distant metastases in animal models. Despite the abundance of preclinical data demonstrating the benefit of dietary modification for cancer, to date there are few clinical trials targeting diet as an intervention for cancer patients. We hypothesize that this may be due, in part, to the fact that several different types of diet modification exist with no clear recommendations regarding the optimal method. This article will delineate three commonly used methods of dietary manipulation to assess the potential of each as a regimen for cancer therapy.

Ion manipulations in structures for lossless ion manipulations (SLIM): computational evaluation of a 90° turn and a switch

DOE PAGES

Garimella, Sandilya V. B.; Ibrahim, Yehia. M.; Webb, Ian K.; ...

2015-08-19

The process of redirecting ions through 90° turns and ‘tee’ switches utilizing Structures for Lossless Ion Manipulations (SLIM) was evaluated using theoretical and simulation methods at 4 Torr pressure. SIMION simulations were used to optimize and evaluate conditions for performing turns without loss of signal intensity or ion mobility resolving power. Fundamental considerations indicated that the “race track” effect during ion turns may incur only small losses to the ion mobility resolving power at 4 Torr pressure for the typical plume widths predicted in an optimized SLIM ‘tee’ switch design. The dynamic switching of ions into orthogonal channels was alsomore » evaluated using SIMION ion trajectory simulations, and achieved similar performance. Simulation results were in close agreement with experimental results and were used to refine SLIM designs and applied potentials for their use.« less

Optimal design for robust control of uncertain flexible joint manipulators: a fuzzy dynamical system approach

NASA Astrophysics Data System (ADS)

Han, Jiang; Chen, Ye-Hwa; Zhao, Xiaomin; Dong, Fangfang

2018-04-01

A novel fuzzy dynamical system approach to the control design of flexible joint manipulators with mismatched uncertainty is proposed. Uncertainties of the system are assumed to lie within prescribed fuzzy sets. The desired system performance includes a deterministic phase and a fuzzy phase. First, by creatively implanting a fictitious control, a robust control scheme is constructed to render the system uniformly bounded and uniformly ultimately bounded. Both the manipulator modelling and control scheme are deterministic and not IF-THEN heuristic rules-based. Next, a fuzzy-based performance index is proposed. An optimal design problem for a control design parameter is formulated as a constrained optimisation problem. The global solution to this problem can be obtained from solving two quartic equations. The fuzzy dynamical system approach is systematic and is able to assure the deterministic performance as well as to minimise the fuzzy performance index.

Evolvable Neuronal Paths: A Novel Basis for Information and Search in the Brain

PubMed Central

Fernando, Chrisantha; Vasas, Vera; Szathmáry, Eörs; Husbands, Phil

2011-01-01

We propose a previously unrecognized kind of informational entity in the brain that is capable of acting as the basis for unlimited hereditary variation in neuronal networks. This unit is a path of activity through a network of neurons, analogous to a path taken through a hidden Markov model. To prove in principle the capabilities of this new kind of informational substrate, we show how a population of paths can be used as the hereditary material for a neuronally implemented genetic algorithm, (the swiss-army knife of black-box optimization techniques) which we have proposed elsewhere could operate at somatic timescales in the brain. We compare this to the same genetic algorithm that uses a standard ‘genetic’ informational substrate, i.e. non-overlapping discrete genotypes, on a range of optimization problems. A path evolution algorithm (PEA) is defined as any algorithm that implements natural selection of paths in a network substrate. A PEA is a previously unrecognized type of natural selection that is well suited for implementation by biological neuronal networks with structural plasticity. The important similarities and differences between a standard genetic algorithm and a PEA are considered. Whilst most experiments are conducted on an abstract network model, at the conclusion of the paper a slightly more realistic neuronal implementation of a PEA is outlined based on Izhikevich spiking neurons. Finally, experimental predictions are made for the identification of such informational paths in the brain. PMID:21887266

Sensory feedback in a bump attractor model of path integration.

PubMed

Poll, Daniel B; Nguyen, Khanh; Kilpatrick, Zachary P

2016-04-01

Mammalian spatial navigation systems utilize several different sensory information channels. This information is converted into a neural code that represents the animal's current position in space by engaging place cell, grid cell, and head direction cell networks. In particular, sensory landmark (allothetic) cues can be utilized in concert with an animal's knowledge of its own velocity (idiothetic) cues to generate a more accurate representation of position than path integration provides on its own (Battaglia et al. The Journal of Neuroscience 24(19):4541-4550 (2004)). We develop a computational model that merges path integration with feedback from external sensory cues that provide a reliable representation of spatial position along an annular track. Starting with a continuous bump attractor model, we explore the impact of synaptic spatial asymmetry and heterogeneity, which disrupt the position code of the path integration process. We use asymptotic analysis to reduce the bump attractor model to a single scalar equation whose potential represents the impact of asymmetry and heterogeneity. Such imperfections cause errors to build up when the network performs path integration, but these errors can be corrected by an external control signal representing the effects of sensory cues. We demonstrate that there is an optimal strength and decay rate of the control signal when cues appear either periodically or randomly. A similar analysis is performed when errors in path integration arise from dynamic noise fluctuations. Again, there is an optimal strength and decay of discrete control that minimizes the path integration error.

Visual influence on path integration in darkness indicates a multimodal representation of large-scale space

PubMed Central

Tcheang, Lili; Bülthoff, Heinrich H.; Burgess, Neil

2011-01-01

Our ability to return to the start of a route recently performed in darkness is thought to reflect path integration of motion-related information. Here we provide evidence that motion-related interoceptive representations (proprioceptive, vestibular, and motor efference copy) combine with visual representations to form a single multimodal representation guiding navigation. We used immersive virtual reality to decouple visual input from motion-related interoception by manipulating the rotation or translation gain of the visual projection. First, participants walked an outbound path with both visual and interoceptive input, and returned to the start in darkness, demonstrating the influences of both visual and interoceptive information in a virtual reality environment. Next, participants adapted to visual rotation gains in the virtual environment, and then performed the path integration task entirely in darkness. Our findings were accurately predicted by a quantitative model in which visual and interoceptive inputs combine into a single multimodal representation guiding navigation, and are incompatible with a model of separate visual and interoceptive influences on action (in which path integration in darkness must rely solely on interoceptive representations). Overall, our findings suggest that a combined multimodal representation guides large-scale navigation, consistent with a role for visual imagery or a cognitive map. PMID:21199934

Memory-efficient dynamic programming backtrace and pairwise local sequence alignment.

PubMed

Newberg, Lee A

2008-08-15

A backtrace through a dynamic programming algorithm's intermediate results in search of an optimal path, or to sample paths according to an implied probability distribution, or as the second stage of a forward-backward algorithm, is a task of fundamental importance in computational biology. When there is insufficient space to store all intermediate results in high-speed memory (e.g. cache) existing approaches store selected stages of the computation, and recompute missing values from these checkpoints on an as-needed basis. Here we present an optimal checkpointing strategy, and demonstrate its utility with pairwise local sequence alignment of sequences of length 10,000. Sample C++-code for optimal backtrace is available in the Supplementary Materials. Supplementary data is available at Bioinformatics online.

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.

On-chip immunomagnetic separation of bacteria by in-flow dynamic manipulation of paramagnetic beads

NASA Astrophysics Data System (ADS)

Ahmed, Shakil; Noh, Jong Wook; Hoyland, James; de Oliveira Hansen, Roana; Erdmann, Helmut; Rubahn, Horst-Günter

2016-11-01

Every year, millions of people all over the world fall ill due to the consumption of unsafe food, where consumption of contaminated and spoiled animal origin product is the main cause for diseases due to bacterial growth. This leads to an intense need for efficient methods for detection of food-related bacteria. In this work, we present a method for integration of immunomagnetic separation of bacteria into microfluidic technology by applying an alternating magnetic field, which manipulates the paramagnetic beads into a sinusoidal path across the whole microchannel, increasing the probability for bacteria capture. The optimum channel geometry, flow rate and alternating magnetic field frequency were investigated, resulting in a capture efficiency of 68 %.

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

PubMed

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

2005-08-01

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

A Method for Improving the Pose Accuracy of a Robot Manipulator Based on Multi-Sensor Combined Measurement and Data Fusion

PubMed Central

Liu, Bailing; Zhang, Fumin; Qu, Xinghua

2015-01-01

An improvement method for the pose accuracy of a robot manipulator by using a multiple-sensor combination measuring system (MCMS) is presented. It is composed of a visual sensor, an angle sensor and a series robot. The visual sensor is utilized to measure the position of the manipulator in real time, and the angle sensor is rigidly attached to the manipulator to obtain its orientation. Due to the higher accuracy of the multi-sensor, two efficient data fusion approaches, the Kalman filter (KF) and multi-sensor optimal information fusion algorithm (MOIFA), are used to fuse the position and orientation of the manipulator. The simulation and experimental results show that the pose accuracy of the robot manipulator is improved dramatically by 38%∼78% with the multi-sensor data fusion. Comparing with reported pose accuracy improvement methods, the primary advantage of this method is that it does not require the complex solution of the kinematics parameter equations, increase of the motion constraints and the complicated procedures of the traditional vision-based methods. It makes the robot processing more autonomous and accurate. To improve the reliability and accuracy of the pose measurements of MCMS, the visual sensor repeatability is experimentally studied. An optimal range of 1 × 0.8 × 1 ∼ 2 × 0.8 × 1 m in the field of view (FOV) is indicated by the experimental results. PMID:25850067

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.

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.

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.

The terminal area automated path generation problem

NASA Technical Reports Server (NTRS)

Hsin, C.-C.

1977-01-01

The automated terminal area path generation problem in the advanced Air Traffic Control System (ATC), has been studied. Definitions, input, output and the interrelationships with other ATC functions have been discussed. Alternatives in modeling the problem have been identified. Problem formulations and solution techniques are presented. In particular, the solution of a minimum effort path stretching problem (path generation on a given schedule) has been carried out using the Newton-Raphson trajectory optimization method. Discussions are presented on the effect of different delivery time, aircraft entry position, initial guess on the boundary conditions, etc. Recommendations are made on real-world implementations.

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.

A universal six-joint robot controller

NASA Technical Reports Server (NTRS)

Bihn, D. G.; Hsia, T. C.

1987-01-01

A general purpose six-axis robotic manipulator controller was designed and implemented to serve as a research tool for the investigation of the practical and theoretical aspects of various control strategies in robotics. A 80286-based Intel System 310 running the Xenix operating servo software as well as the higher level software (e.g., kinematics and path planning) were employed. A Multibus compatible interface board was designed and constructed to handle I/O signals from the robot manipulator's joint motors. From the design point of view, the universal controller is capable of driving robot manipulators equipped with D.C. joint motors and position optical encoders. To test its functionality, the controller is connected to the joint motor D.C. power amplifier of a PUMA 560 arm bypassing completely the manufacturer-supplied Unimation controller. A controller algorithm consisting of local PD control laws was written and installed into the Xenix operating system. Additional software drivers were implemented to allow application programs access to the interface board. All software was written in the C language.

Path-programmable water droplet manipulations on an adhesion controlled superhydrophobic surface

PubMed Central

Seo, Jungmok; Lee, Seoung-Ki; Lee, Jaehong; Seung Lee, Jung; Kwon, Hyukho; Cho, Seung-Woo; Ahn, Jong-Hyun; Lee, Taeyoon

2015-01-01

Here, we developed a novel and facile method to control the local water adhesion force of a thin and stretchable superhydrophobic polydimethylsiloxane (PDMS) substrate with micro-pillar arrays that allows the individual manipulation of droplet motions including moving, merging and mixing. When a vacuum pressure was applied below the PDMS substrate, a local dimple structure was formed and the water adhesion force of structure was significantly changed owing to the dynamically varied pillar density. With the help of the lowered water adhesion force and the slope angle of the formed dimple structure, the motion of individual water droplets could be precisely controlled, which facilitated the creation of a droplet-based microfluidic platform capable of a programmable manipulation of droplets. We showed that the platform could be used in newer and emerging microfluidic operations such as surface-enhanced Raman spectroscopy with extremely high sensing capability (10−15 M) and in vitro small interfering RNA transfection with enhanced transfection efficiency of ~80%. PMID:26202206

Dialogue-Based Activities and Manipulatives to Engage Liberal Arts Majors in Mathematics

ERIC Educational Resources Information Center

Price, James C.

2015-01-01

This article presents four inquiry-based learning activities developed for a liberal arts math course. The activities cover four topics: the Pythagorean theorem, interest theory, optimization, and the Monty Hall problem. Each activity consists of a dialogue, with a theme and characters related to the topic, and a manipulative, that allow students…

Optimization of IBF parameters based on adaptive tool-path algorithm

NASA Astrophysics Data System (ADS)

Deng, Wen Hui; Chen, Xian Hua; Jin, Hui Liang; Zhong, Bo; Hou, Jin; Li, An Qi

2018-03-01

As a kind of Computer Controlled Optical Surfacing(CCOS) technology. Ion Beam Figuring(IBF) has obvious advantages in the control of surface accuracy, surface roughness and subsurface damage. The superiority and characteristics of IBF in optical component processing are analyzed from the point of view of removal mechanism. For getting more effective and automatic tool path with the information of dwell time, a novel algorithm is proposed in this thesis. Based on the removal functions made through our IBF equipment and the adaptive tool-path, optimized parameters are obtained through analysis the residual error that would be created in the polishing process. A Φ600 mm plane reflector element was used to be a simulation instance. The simulation result shows that after four combinations of processing, the surface accuracy of PV (Peak Valley) value and the RMS (Root Mean Square) value was reduced to 4.81 nm and 0.495 nm from 110.22 nm and 13.998 nm respectively in the 98% aperture. The result shows that the algorithm and optimized parameters provide a good theoretical for high precision processing of IBF.

Analysis of explicit model predictive control for path-following control

PubMed Central

2018-01-01

In this paper, explicit Model Predictive Control(MPC) is employed for automated lane-keeping systems. MPC has been regarded as the key to handle such constrained systems. However, the massive computational complexity of MPC, which employs online optimization, has been a major drawback that limits the range of its target application to relatively small and/or slow problems. Explicit MPC can reduce this computational burden using a multi-parametric quadratic programming technique(mp-QP). The control objective is to derive an optimal front steering wheel angle at each sampling time so that autonomous vehicles travel along desired paths, including straight, circular, and clothoid parts, at high entry speeds. In terms of the design of the proposed controller, a method of choosing weighting matrices in an optimization problem and the range of horizons for path-following control are described through simulations. For the verification of the proposed controller, simulation results obtained using other control methods such as MPC, Linear-Quadratic Regulator(LQR), and driver model are employed, and CarSim, which reflects the features of a vehicle more realistically than MATLAB/Simulink, is used for reliable demonstration. PMID:29534080

Analysis of explicit model predictive control for path-following control.

PubMed

Lee, Junho; Chang, Hyuk-Jun

2018-01-01

In this paper, explicit Model Predictive Control(MPC) is employed for automated lane-keeping systems. MPC has been regarded as the key to handle such constrained systems. However, the massive computational complexity of MPC, which employs online optimization, has been a major drawback that limits the range of its target application to relatively small and/or slow problems. Explicit MPC can reduce this computational burden using a multi-parametric quadratic programming technique(mp-QP). The control objective is to derive an optimal front steering wheel angle at each sampling time so that autonomous vehicles travel along desired paths, including straight, circular, and clothoid parts, at high entry speeds. In terms of the design of the proposed controller, a method of choosing weighting matrices in an optimization problem and the range of horizons for path-following control are described through simulations. For the verification of the proposed controller, simulation results obtained using other control methods such as MPC, Linear-Quadratic Regulator(LQR), and driver model are employed, and CarSim, which reflects the features of a vehicle more realistically than MATLAB/Simulink, is used for reliable demonstration.

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.

Aircraft Trajectory Optimization and Contrails Avoidance in the Presence of Winds

NASA Technical Reports Server (NTRS)

Ng, Hok K.; Chen, Neil Y.

2010-01-01

There are indications that persistent contrails can lead to adverse climate change, although the complete effect on climate forcing is still uncertain. A flight trajectory optimization algorithm with fuel and contrails models, which develops alternative flight paths, provides policy makers the necessary data to make tradeoffs between persistent contrails mitigation and aircraft fuel consumption. This study develops an algorithm that calculates wind-optimal trajectories for cruising aircraft while avoiding the regions of airspace prone to persistent contrails formation. The optimal trajectories are developed by solving a non-linear optimal control problem with path constraints. The regions of airspace favorable to persistent contrails formation are modeled as penalty areas that aircraft should avoid and are adjustable. The tradeoff between persistent contrails formation and additional fuel consumption is investigated, with and without altitude optimization, for 12 city-pairs in the continental United States. Without altitude optimization, the reduction in contrail travel times is gradual with increase in total fuel consumption. When altitude is optimized, a two percent increase in total fuel consumption can reduce the total travel times through contrail regions by more than six times. Allowing further increase in fuel consumption does not seem to result in proportionate decrease in contrail travel times.

Optical Manipulation along Optical Axis with Polarization Sensitive Meta-lens.

PubMed

Markovich, Hen; Shishkin, Ivan; Hendler, Netta; Ginzburg, Pavel

2018-06-27

The ability to manipulate small objects with focused laser beams opens a broad spectrum of opportunities in fundamental and applied studies, where a precise control over mechanical path and stability is required. While conventional optical tweezers are based on bulky diffractive optical elements, developing compact integrable within a fluid cell trapping devices is highly demanded. Here, plasmonic polarization sensitive metasurface-based lens, embedded within a fluid, is demonstrated to provide several stable trapping centers along the optical axis. The position of a particle is controlled with the polarization of the incident light, interacting with plasmonic nanoscale patch antennas, organized within overlapping Fresnel zones of the lens. While standard diffractive optical elements face challenges to trap objects in lateral direction outside the depth of focus, bi-focal Fresnel meta-lens demonstrates the capability to manipulate a bead along 4 micrometers line. Additional fluorescent module, incorporated within the optical trapping setup, was implemented and enabled accurate mapping of optical potential via a particle tracking algorithm. Auxiliary micro- and nano- structures, integrated within fluidic devices, provide numerous opportunities to achieve flexible optomechanical manipulation, including, transport, trapping and sorting, which are highly demanded in lab-on-a-chip applications and many others.

Collision-free motion of two robot arms in a common workspace

NASA Technical Reports Server (NTRS)

Basta, Robert A.; Mehrotra, Rajiv; Varanasi, Murali R.

1987-01-01

Collision-free motion of two robot arms in a common workspace is investigated. A collision-free motion is obtained by detecting collisions along the preplanned trajectories using a sphere model for the wrist of each robot and then modifying the paths and/or trajectories of one or both robots to avoid the collision. Detecting and avoiding collisions are based on the premise that: preplanned trajectories of the robots follow a straight line; collisions are restricted to between the wrists of the two robots (which corresponds to the upper three links of PUMA manipulators); and collisions never occur between the beginning points or end points on the straight line paths. The collision detection algorithm is described and some approaches to collision avoidance are discussed.

Characterization and control of self-motions in redundant manipulators

NASA Technical Reports Server (NTRS)

Burdick, J.; Seraji, Homayoun

1989-01-01

The presence of redundant degrees of freedom in a manipulator structure leads to a physical phenomenon known as a self-motion, which is a continuous motion of the manipulator joints that leaves the end-effector motionless. In the first part of the paper, a global manifold mapping reformulation of manipulator kinematics is reviewed, and the inverse kinematic solution for redundant manipulators is developed in terms of self-motion manifolds. Global characterizations of the self-motion manifolds in terms of their number, geometry, homotopy class, and null space are reviewed using examples. Much previous work in redundant manipulator control has been concerned with the redundancy resolution problem, in which methods are developed to determine, or resolve, the motion of the joints in order to achieve end-effector trajectory control while optimizing additional objective functions. Redundancy resolution problems can be equivalently posed as the control of self-motions. Alternatives for redundancy resolution are briefly discussed.

Optimizing concentration of shifter additive for plastic scintillators of different size

NASA Astrophysics Data System (ADS)

Adadurov, A. F.; Zhmurin, P. N.; Lebedev, V. N.; Titskaya, V. D.

2009-02-01

This paper concerns the influence of wavelength shifting (secondary) luminescent additive (LA 2) on the light yield of polystyrene-based plastic scintillator (PS) taking self-absorption into account. Calculations of light yield dependence on concentration of 1.4-bis(2-(5-phenyloxazolyl)-benzene (POPOP) as LA 2 were made for various path lengths of photons in PS. It is shown that there is an optimal POPOP concentration ( Copt), which provides a maximum light yield for a given path length. This optimal concentration is determined by the competition of luminescence and self-reflection processes. Copt values were calculated for PS of different dimensions. For small PS, Copt≈0.02%, which agree with a common (standard) value of POPOP concentration. For higher PS dimensions, the optimal POPOP concentration is decreased (to Copt≈0.006% for 320×30×2 cm sample), reducing the light yield from PS by almost 35%.

AC signal characterization for optimization of a CMOS single-electron pump

NASA Astrophysics Data System (ADS)

Murray, Roy; Perron, Justin K.; Stewart, M. D., Jr.; Zimmerman, Neil M.

2018-02-01

Pumping single electrons at a set rate is being widely pursued as an electrical current standard. Semiconductor charge pumps have been pursued in a variety of modes, including single gate ratchet, a variety of 2-gate ratchet pumps, and 2-gate turnstiles. Whether pumping with one or two AC signals, lower error rates can result from better knowledge of the properties of the AC signal at the device. In this work, we operated a CMOS single-electron pump with a 2-gate ratchet style measurement and used the results to characterize and optimize our two AC signals. Fitting this data at various frequencies revealed both a difference in signal path length and attenuation between our two AC lines. Using this data, we corrected for the difference in signal path length and attenuation by applying an offset in both the phase and the amplitude at the signal generator. Operating the device as a turnstile while using the optimized parameters determined from the 2-gate ratchet measurement led to much flatter, more robust charge pumping plateaus. This method was useful in tuning our device up for optimal charge pumping, and may prove useful to the semiconductor quantum dot community to determine signal attenuation and path differences at the device.

Optimal control to modelling motorcycle rider steering: local versus global coordinate systems in rider preview

NASA Astrophysics Data System (ADS)

Rowell, S.; Popov, A. A.; Meijaard, J. P.

2010-04-01

The response of a motorcycle is heavily dependent on the rider's control actions, and consequently a means of replicating the rider's behaviour provides an important extension to motorcycle dynamics. The primary objective here is to develop effective path-following simulations and to understand how riders control motorcycles. Optimal control theory is applied to the tracking of roadway by a motorcycle, using a non-linear motorcycle model operating in free control by steering torque input. A path-following controller with road preview is designed by minimising tracking errors and control effort. Tight controls with high weightings on performance and loose controls with high weightings on control power are defined. Special attention is paid to the modelling of multipoint preview in local and global coordinate systems. The controller model is simulated over a standard single lane-change manoeuvre. It is argued that the local coordinates point of view is more representative of the way that a human rider operates and interprets information. The simulations suggest that for accurate path following, using optimal control, the problem must be solved by the local coordinates approach in order to achieve accurate results with short preview horizons. Furthermore, some weaknesses of the optimal control approach are highlighted here.

Magnetic manipulation device for the optimization of cell processing conditions.

PubMed

Ito, Hiroshi; Kato, Ryuji; Ino, Kosuke; Honda, Hiroyuki

2010-02-01

Variability in human cell phenotypes make it's advancements in optimized cell processing necessary for personalized cell therapy. Here we propose a strategy of palm-top sized device to assist physically manipulating cells for optimizing cell preparations. For the design of such a device, we combined two conventional approaches: multi-well plate formatting and magnetic cell handling using magnetite cationic liposomes (MCLs). From our previous works, we showed the labeling applications of MCL on adhesive cells for various tissue engineering approaches. To feasibly transfer cells in multi-well plate, we here evaluated the magnetic response of MCL-labeled suspension type cells. The cell handling performance of Jurkat cells proved to be faster and more robust compared to MACS (Magnetic Cell Sorting) bead methods. To further confirm our strategy, prototype palm-top sized device "magnetic manipulation device (MMD)" was designed. In the device, the actual cell transportation efficacy of Jurkat cells was satisfying. Moreover, as a model of the most distributed clinical cell processing, primary peripheral blood mononuclear cells (PBMCs) from different volunteers were evaluated. By MMD, individual PBMCs indicated to have optimum Interleukin-2 (IL-2) concentrations for the expansion. Such huge differences of individual cells indicated that MMD, our proposing efficient and self-contained support tool, could assist the feasible and cost-effective optimization of cell processing in clinical facilities. Copyright (c) 2009 The Society for Biotechnology, Japan. Published by Elsevier B.V. All rights reserved.

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.

A comparison of optimal and noise-abatement trajectories of a tilt-rotor aircraft

NASA Technical Reports Server (NTRS)

Schmitz, F. H.; Stepniewski, W. Z.; Gibs, J.; Hinterkeuser, W. Z.

1972-01-01

The potential benefits of flight path control to optimize performance and/or reduce the noise of a tilt-rotor aircraft operating in the takeoff and landing phases of flight are investigated. A theoretical performance-acoustic model is developed and then mathematically flown to yield representative takeoff and landing profiles. Minimum-time and minimum-fuel trajectories are compared to proposed noise-abatement profiles to assess the reductions in annoyance possible through flight path control. Significant reductions are feasible if a nearly vertical-takeoff flight profile is flown near the landing site; however, the time expended and fuel consumed increase.

The risk of manipulation under anesthesia due to unsatisfactory knee flexion after fast-track total knee arthroplasty.

PubMed

Wied, Christian; Thomsen, Morten G; Kallemose, Thomas; Myhrmann, Lis; Jensen, Lotte S; Husted, Henrik; Troelsen, Anders

2015-10-01

Fast-track TKA has significantly shortened the time available for physiotherapists to optimize knee ROM before discharge. Safety aspects concerning knee stiffness and the need for manipulation in a fast-track setting need to be illuminated. The study aims were to analyze if fast-track TKA can be considered safe considering rates of knee manipulation and if there is an association between knee ROM at time of discharge and the need for later manipulation. Primary TKAs operated in 2011 at our institution were eligible for inclusion. The study group consisted of 359 TKAs. Manipulation of the knee was performed in 21 of 359 TKAs (5.8%). Seventy-one percent were discharged with a flexion ≥70° combined with an extension deficit of ≤10°. The occurrence of MUA for these patients was 4.3%. The prevalence of knee manipulation showed a statistically significant association with the achieved knee flexion at discharge (p=0.02). Median length of stay was two days. Compared with literature findings fast-track TKA surgery may be considered safe based on the acceptable rate of knee manipulations after TKA (5.8%). We suggest ROM of ≥70° flexion combined with an extension deficit of ≤10° as an "optimal-zone" for ROM at discharge. The reason for this is the low occurrence of MUA (4.3%) in relation to the large amount of TKAs it represents (71%). The indication for MUA is multifactorial and ROM at discharge serves only as an indicator of later MUA risk. Copyright © 2015 Elsevier B.V. All rights reserved.

Frequency dependence of trapped flux sensitivity in SRF cavities

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

Checchin, M.; Martinello, M.; Grassellino, A.

In this paper, we present the frequency dependence of the vortex surface resistance of bulk niobium accelerating cavities as a function of different state-of-the-art surface treatments. Higher flux surface resistance per amount of trapped magnetic field - sensitivity - is observed for higher frequencies, in agreement with our theoretical model. Higher sensitivity is observed for N-doped cavities, which possess an intermediate value of electron mean-free-path, compared to 120° C and EP/BCP cavities. Experimental results from our study showed that the sensitivity has a non-monotonic trend as a function of the mean-free-path, including at frequencies other than 1.3 GHz, and thatmore » the vortex response to the rf field can be tuned from the pinning regime to flux-flow regime by manipulating the frequency and/or the mean-free-path of the resonator, as reported in our previous studies. The frequency dependence of the trapped flux sensitivity to the amplitude of the accelerating gradient is also highlighted.« less

Frequency dependence of trapped flux sensitivity in SRF cavities

DOE PAGES

Checchin, M.; Martinello, M.; Grassellino, A.; ...

2018-02-13

In this paper, we present the frequency dependence of the vortex surface resistance of bulk niobium accelerating cavities as a function of different state-of-the-art surface treatments. Higher flux surface resistance per amount of trapped magnetic field - sensitivity - is observed for higher frequencies, in agreement with our theoretical model. Higher sensitivity is observed for N-doped cavities, which possess an intermediate value of electron mean-free-path, compared to 120° C and EP/BCP cavities. Experimental results from our study showed that the sensitivity has a non-monotonic trend as a function of the mean-free-path, including at frequencies other than 1.3 GHz, and thatmore » the vortex response to the rf field can be tuned from the pinning regime to flux-flow regime by manipulating the frequency and/or the mean-free-path of the resonator, as reported in our previous studies. The frequency dependence of the trapped flux sensitivity to the amplitude of the accelerating gradient is also highlighted.« less

Movement of foraging Tundra Swans explained by spatial pattern in cryptic food densities.

PubMed

Klaassen, Raymond H G; Nolet, Bart A; Bankert, Daniëlle

2006-09-01

We tested whether Tundra Swans use information on the spatial distribution of cryptic food items (below ground Sago pondweed tubers) to shape their movement paths. In a continuous environment, swans create their own food patches by digging craters, which they exploit in several feeding bouts. Series of short (<1 m) intra-patch movements alternate with longer inter-patch movements (>1 m). Tuber biomass densities showed a positive spatial auto-correlation at a short distance (<3 m), but not at a larger distance (3-8 m). Based on the spatial pattern of the food distribution (which is assumed to be pre-harvest information for the swan) and the energy costs and benefits for different food densities at various distances, we calculated the optimal length of an inter-patch movement. A swan that moves to the patch with the highest gain rate was predicted to move to the adjacent patch (at 1 m) if the food density in the current patch had been high (>25 g/m2) and to a more distant patch (at 7-8 m) if the food density in the current patch had been low (<25 g/m2). This prediction was tested by measuring the response of swans to manipulated tuber densities. In accordance with our predictions, swans moved a long distance (>3 m) from a low-density patch and a short distance (<3 m) from a high-density patch. The quantitative agreement between prediction and observation was greater for swans feeding in pairs than for solitary swans. The result of this movement strategy is that swans visit high-density patches at a higher frequency than on offer and, consequently, achieve a 38% higher long-term gain rate. Swans also take advantage of spatial variance in food abundance by regulating the time in patches, staying longer and consuming more food from rich than from poor patches. We can conclude that the shape of the foraging path is a reflection of the spatial pattern in the distribution of tuber densities and can be understood from an optimal foraging perspective.

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.

Automatic Generation of Mechanical Assembly Sequences

DTIC Science & Technology

1988-12-01

Planning Algorithm for General Robot Manipulators. In AAAI-86 Proceedings of the F~th National Conference on Artifcial Intelligence , pages 626-631...topic in artificial intelligence , and the Al approach has dominated much of the research in robot task planning using domain-independent methods. The...computed, using the data in the relational model: " The GEOMETRIC-FEASIBILITY predicate which is true if there exists a collision-free path to bring the two

Joint Manipulation: Toward a General Theory of High-Velocity, Low-Amplitude Thrust Techniques.

PubMed

Harwich, Andrew S

2017-12-01

The objective of this study was to describe the initial stage of a generalized theory of high-velocity, low-amplitude thrust (HVLAT) techniques for joint manipulation. This study examined the movements described by authors from the fields of osteopathy, chiropractic, and physical therapy to produce joint cavitation in both the metacarpophalangeal (MCP) joint and the cervical spine apophysial joint. This study qualitatively compared the kinetics, the similarities, and the differences between MCP cavitation and cervical facet joint cavitation. A qualitative vector analysis of forces and movements was undertaken by constructing computer-generated, simplified graphical models of the MCP joint and a typical cervical apophysial joint and imposing the motions dictated by the clinical technique. Comparing the path to cavitation of 2 modes of HVLAT for the MCP joint, namely, distraction and hyperflexion, it was found that the hyperflexion method requires an axis of rotation, the hinge axis, which is also required for cervical HVLAT. These results show that there is an analogue of cervical HVLAT in one of the MCP joint HVLATs. The study demonstrated that in a theoretical model, the path to joint cavitation is the same for asymmetric separation of the joint surfaces in the cervical spine and the MCP joints.

Language influences music harmony perception: effects of shared syntactic integration resources beyond attention

PubMed Central

Willems, Roel M.; Hagoort, Peter

2016-01-01

Many studies have revealed shared music–language processing resources by finding an influence of music harmony manipulations on concurrent language processing. However, the nature of the shared resources has remained ambiguous. They have been argued to be syntax specific and thus due to shared syntactic integration resources. An alternative view regards them as related to general attention and, thus, not specific to syntax. The present experiments evaluated these accounts by investigating the influence of language on music. Participants were asked to provide closure judgements on harmonic sequences in order to assess the appropriateness of sequence endings. At the same time participants read syntactic garden-path sentences. Closure judgements revealed a change in harmonic processing as the result of reading a syntactically challenging word. We found no influence of an arithmetic control manipulation (experiment 1) or semantic garden-path sentences (experiment 2). Our results provide behavioural evidence for a specific influence of linguistic syntax processing on musical harmony judgements. A closer look reveals that the shared resources appear to be needed to hold a harmonic key online in some form of syntactic working memory or unification workspace related to the integration of chords and words. Overall, our results support the syntax specificity of shared music–language processing resources. PMID:26998339

An estimate of the shadow price of water in the southern Ogallala Aquifer

USDA-ARS?s Scientific Manuscript database

In this paper, we attempt to quantify the shadow price of an additional inch of groundwater resource left in situ for the Southern Ogallala Aquifer. Previous authors have shown the degree to which the optimal resource extraction path may diverge from the competitive extraction path based upon varyin...

Terrain Following Control Based on an Optimized Spline Model of Aircraft Motion

DTIC Science & Technology

1975-11-01

constraints, a smooth path through the final data points may not satisfy the norma acceleration constraints between sample points. This latter assertion is...for the reference path in the table. Sae copromise betwen the two effects is required. The accelerations given in Table 7-2 are those measured at the

Computation of rare transitions in the barotropic quasi-geostrophic equations

NASA Astrophysics Data System (ADS)

Laurie, Jason; Bouchet, Freddy

2015-01-01

We investigate the theoretical and numerical computation of rare transitions in simple geophysical turbulent models. We consider the barotropic quasi-geostrophic and two-dimensional Navier-Stokes equations in regimes where bistability between two coexisting large-scale attractors exist. By means of large deviations and instanton theory with the use of an Onsager-Machlup path integral formalism for the transition probability, we show how one can directly compute the most probable transition path between two coexisting attractors analytically in an equilibrium (Langevin) framework and numerically otherwise. We adapt a class of numerical optimization algorithms known as minimum action methods to simple geophysical turbulent models. We show that by numerically minimizing an appropriate action functional in a large deviation limit, one can predict the most likely transition path for a rare transition between two states. By considering examples where theoretical predictions can be made, we show that the minimum action method successfully predicts the most likely transition path. Finally, we discuss the application and extension of such numerical optimization schemes to the computation of rare transitions observed in direct numerical simulations and experiments and to other, more complex, turbulent systems.

jFuzz: A Concolic Whitebox Fuzzer for Java

NASA Technical Reports Server (NTRS)

Jayaraman, Karthick; Harvison, David; Ganesh, Vijay; Kiezun, Adam

2009-01-01

We present jFuzz, a automatic testing tool for Java programs. jFuzz is a concolic whitebox fuzzer, built on the NASA Java PathFinder, an explicit-state Java model checker, and a framework for developing reliability and analysis tools for Java. Starting from a seed input, jFuzz automatically and systematically generates inputs that exercise new program paths. jFuzz uses a combination of concrete and symbolic execution, and constraint solving. Time spent on solving constraints can be significant. We implemented several well-known optimizations and name-independent caching, which aggressively normalizes the constraints to reduce the number of calls to the constraint solver. We present preliminary results due to the optimizations, and demonstrate the effectiveness of jFuzz in creating good test inputs. The source code of jFuzz is available as part of the NASA Java PathFinder. jFuzz is intended to be a research testbed for investigating new testing and analysis techniques based on concrete and symbolic execution. The source code of jFuzz is available as part of the NASA Java PathFinder.

Morphological awareness and reading comprehension: Examining mediating factors.

PubMed

Levesque, Kyle C; Kieffer, Michael J; Deacon, S Hélène

2017-08-01

The relation between morphological awareness-defined as the awareness of and ability to manipulate the smallest units of meaning in language-and reading comprehension remains in need of specification. In this study, we evaluated four potential intervening variables through which morphological awareness may contribute indirectly to reading comprehension. We assessed word reading and vocabulary as well as children's ability to read and analyze the meaning of morphologically complex words (morphological decoding and morphological analysis, respectively). Controls of phonological awareness and nonverbal ability were included in the model. Participants were 221 English-speaking children in Grade 3. Multivariate path analyses revealed evidence of two indirect relations and one direct relation between morphological awareness and reading comprehension. In the first indirect path, morphological awareness contributed to morphological decoding, which then influenced word reading and finally reading comprehension. In a second indirect path, morphological awareness contributed to morphological analysis, which contributed to reading comprehension. Finally, in a direct path, morphological awareness contributed to reading comprehension beyond all other variables. These findings inform as to the potential mechanisms underlying the relation between morphological awareness and reading comprehension in children. Copyright © 2017 Elsevier Inc. All rights reserved.

Unraveling the Processing Parameters in Friction Stir Welding

NASA Technical Reports Server (NTRS)

Schneider, Judy; Nunes, Arthur C., Jr.

2005-01-01

In friction stir welding (FSW), a rotating threaded pin tool is translated along a weld seam, literally stirring the edges of the seam together. To determine optimal processing parameters for producing a defect free weld, a better understanding of the resulting metal deformation flow path or paths is required. In this study, various markers are used to trace the flow paths of the metal. X-ray radiographs record the segmentation and position of the wire. Several variations in the trajectories can be differentiated within the weld zone.

Cooperative 3D Path Optimization (C3PO) Simulation

DTIC Science & Technology

2015-11-10

is the starting point for the path. As branches are added, they are checked to make sure they meet the requirements that the unmanned vehicle (UV...tune the maximum branch size for the tree to get longer branches. It makes sense that in open space this would lead to smaller (by number of nodes...starting with very high maximum branch size and gradually make it smaller as suitable paths can’t be found. The authors would also like to try this

Development and Performance Evaluation of Image-Based Robotic Waxing System for Detailing Automobiles

PubMed Central

Hsu, Bing-Cheng

2018-01-01

Waxing is an important aspect of automobile detailing, aimed at protecting the finish of the car and preventing rust. At present, this delicate work is conducted manually due to the need for iterative adjustments to achieve acceptable quality. This paper presents a robotic waxing system in which surface images are used to evaluate the quality of the finish. An RGB-D camera is used to build a point cloud that details the sheet metal components to enable path planning for a robot manipulator. The robot is equipped with a multi-axis force sensor to measure and control the forces involved in the application and buffing of wax. Images of sheet metal components that were waxed by experienced car detailers were analyzed using image processing algorithms. A Gaussian distribution function and its parameterized values were obtained from the images for use as a performance criterion in evaluating the quality of surfaces prepared by the robotic waxing system. Waxing force and dwell time were optimized using a mathematical model based on the image-based criterion used to measure waxing performance. Experimental results demonstrate the feasibility of the proposed robotic waxing system and image-based performance evaluation scheme. PMID:29757940

Software for Acoustic Rendering

NASA Technical Reports Server (NTRS)

Miller, Joel D.

2003-01-01

SLAB is a software system that can be run on a personal computer to simulate an acoustic environment in real time. SLAB was developed to enable computational experimentation in which one can exert low-level control over a variety of signal-processing parameters, related to spatialization, for conducting psychoacoustic studies. Among the parameters that can be manipulated are the number and position of reflections, the fidelity (that is, the number of taps in finite-impulse-response filters), the system latency, and the update rate of the filters. Another goal in the development of SLAB was to provide an inexpensive means of dynamic synthesis of virtual audio over headphones, without need for special-purpose signal-processing hardware. SLAB has a modular, object-oriented design that affords the flexibility and extensibility needed to accommodate a variety of computational experiments and signal-flow structures. SLAB s spatial renderer has a fixed signal-flow architecture corresponding to a set of parallel signal paths from each source to a listener. This fixed architecture can be regarded as a compromise that optimizes efficiency at the expense of complete flexibility. Such a compromise is necessary, given the design goal of enabling computational psychoacoustic experimentation on inexpensive personal computers.

Fine tuning classical and quantum molecular dynamics using a generalized Langevin equation

NASA Astrophysics Data System (ADS)

Rossi, Mariana; Kapil, Venkat; Ceriotti, Michele

2018-03-01

Generalized Langevin Equation (GLE) thermostats have been used very effectively as a tool to manipulate and optimize the sampling of thermodynamic ensembles and the associated static properties. Here we show that a similar, exquisite level of control can be achieved for the dynamical properties computed from thermostatted trajectories. We develop quantitative measures of the disturbance induced by the GLE to the Hamiltonian dynamics of a harmonic oscillator, and show that these analytical results accurately predict the behavior of strongly anharmonic systems. We also show that it is possible to correct, to a significant extent, the effects of the GLE term onto the corresponding microcanonical dynamics, which puts on more solid grounds the use of non-equilibrium Langevin dynamics to approximate quantum nuclear effects and could help improve the prediction of dynamical quantities from techniques that use a Langevin term to stabilize dynamics. Finally we address the use of thermostats in the context of approximate path-integral-based models of quantum nuclear dynamics. We demonstrate that a custom-tailored GLE can alleviate some of the artifacts associated with these techniques, improving the quality of results for the modeling of vibrational dynamics of molecules, liquids, and solids.

Experimental evolution of protein–protein interaction networks

PubMed Central

Kaçar, Betül; Gaucher, Eric A.

2013-01-01

The modern synthesis of evolutionary theory and genetics has enabled us to discover underlying molecular mechanisms of organismal evolution. We know that in order to maximize an organism's fitness in a particular environment, individual interactions among components of protein and nucleic acid networks need to be optimized by natural selection, or sometimes through random processes, as the organism responds to changes and/or challenges in the environment. Despite the significant role of molecular networks in determining an organism's adaptation to its environment, we still do not know how such inter- and intra-molecular interactions within networks change over time and contribute to an organism's evolvability while maintaining overall network functions. One way to address this challenge is to identify connections between molecular networks and their host organisms, to manipulate these connections, and then attempt to understand how such perturbations influence molecular dynamics of the network and thus influence evolutionary paths and organismal fitness. In the present review, we discuss how integrating evolutionary history with experimental systems that combine tools drawn from molecular evolution, synthetic biology and biochemistry allow us to identify the underlying mechanisms of organismal evolution, particularly from the perspective of protein interaction networks. PMID:23849056

Dynamic analysis of a needle insertion for soft materials: Arbitrary Lagrangian-Eulerian-based three-dimensional finite element analysis.

PubMed

Yamaguchi, Satoshi; Tsutsui, Kihei; Satake, Koji; Morikawa, Shigehiro; Shirai, Yoshiaki; Tanaka, Hiromi T

2014-10-01

Our goal was to develop a three-dimensional finite element model that enables dynamic analysis of needle insertion for soft materials. To demonstrate large deformation and fracture, we used the arbitrary Lagrangian-Eulerian (ALE) method for fluid analysis. We performed ALE-based finite element analysis for 3% agar gel and three types of copper needle with bevel tips. To evaluate simulation results, we compared the needle deflection and insertion force with corresponding experimental results acquired with a uniaxial manipulator. We studied the shear stress distribution of agar gel on various time scales. For 30°, 45°, and 60°, differences in deflections of each needle between both sets of results were 2.424, 2.981, and 3.737mm, respectively. For the insertion force, there was no significant difference for mismatching area error (p<0.05) between simulation and experimental results. Our results have the potential to be a stepping stone to develop pre-operative surgical planning to estimate an optimal needle insertion path for MR image-guided microwave coagulation therapy and for analyzing large deformation and fracture in biological tissues. Copyright © 2014 Elsevier Ltd. All rights reserved.

Development and Performance Evaluation of Image-Based Robotic Waxing System for Detailing Automobiles.

PubMed

Lin, Chi-Ying; Hsu, Bing-Cheng

2018-05-14

Waxing is an important aspect of automobile detailing, aimed at protecting the finish of the car and preventing rust. At present, this delicate work is conducted manually due to the need for iterative adjustments to achieve acceptable quality. This paper presents a robotic waxing system in which surface images are used to evaluate the quality of the finish. An RGB-D camera is used to build a point cloud that details the sheet metal components to enable path planning for a robot manipulator. The robot is equipped with a multi-axis force sensor to measure and control the forces involved in the application and buffing of wax. Images of sheet metal components that were waxed by experienced car detailers were analyzed using image processing algorithms. A Gaussian distribution function and its parameterized values were obtained from the images for use as a performance criterion in evaluating the quality of surfaces prepared by the robotic waxing system. Waxing force and dwell time were optimized using a mathematical model based on the image-based criterion used to measure waxing performance. Experimental results demonstrate the feasibility of the proposed robotic waxing system and image-based performance evaluation scheme.

Equation-based languages – A new paradigm for building energy modeling, simulation and optimization

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

Wetter, Michael; Bonvini, Marco; Nouidui, Thierry S.

Most of the state-of-the-art building simulation programs implement models in imperative programming languages. This complicates modeling and excludes the use of certain efficient methods for simulation and optimization. In contrast, equation-based modeling languages declare relations among variables, thereby allowing the use of computer algebra to enable much simpler schematic modeling and to generate efficient code for simulation and optimization. We contrast the two approaches in this paper. We explain how such manipulations support new use cases. In the first of two examples, we couple models of the electrical grid, multiple buildings, HVAC systems and controllers to test a controller thatmore » adjusts building room temperatures and PV inverter reactive power to maintain power quality. In the second example, we contrast the computing time for solving an optimal control problem for a room-level model predictive controller with and without symbolic manipulations. As a result, exploiting the equation-based language led to 2, 200 times faster solution« less

Optimal control of complex atomic quantum systems

PubMed Central

van Frank, S.; Bonneau, M.; Schmiedmayer, J.; Hild, S.; Gross, C.; Cheneau, M.; Bloch, I.; Pichler, T.; Negretti, A.; Calarco, T.; Montangero, S.

2016-01-01

Quantum technologies will ultimately require manipulating many-body quantum systems with high precision. Cold atom experiments represent a stepping stone in that direction: a high degree of control has been achieved on systems of increasing complexity. However, this control is still sub-optimal. In many scenarios, achieving a fast transformation is crucial to fight against decoherence and imperfection effects. Optimal control theory is believed to be the ideal candidate to bridge the gap between early stage proof-of-principle demonstrations and experimental protocols suitable for practical applications. Indeed, it can engineer protocols at the quantum speed limit – the fastest achievable timescale of the transformation. Here, we demonstrate such potential by computing theoretically and verifying experimentally the optimal transformations in two very different interacting systems: the coherent manipulation of motional states of an atomic Bose-Einstein condensate and the crossing of a quantum phase transition in small systems of cold atoms in optical lattices. We also show that such processes are robust with respect to perturbations, including temperature and atom number fluctuations. PMID:27725688

Optimal control of complex atomic quantum systems.

PubMed

van Frank, S; Bonneau, M; Schmiedmayer, J; Hild, S; Gross, C; Cheneau, M; Bloch, I; Pichler, T; Negretti, A; Calarco, T; Montangero, S

2016-10-11

Quantum technologies will ultimately require manipulating many-body quantum systems with high precision. Cold atom experiments represent a stepping stone in that direction: a high degree of control has been achieved on systems of increasing complexity. However, this control is still sub-optimal. In many scenarios, achieving a fast transformation is crucial to fight against decoherence and imperfection effects. Optimal control theory is believed to be the ideal candidate to bridge the gap between early stage proof-of-principle demonstrations and experimental protocols suitable for practical applications. Indeed, it can engineer protocols at the quantum speed limit - the fastest achievable timescale of the transformation. Here, we demonstrate such potential by computing theoretically and verifying experimentally the optimal transformations in two very different interacting systems: the coherent manipulation of motional states of an atomic Bose-Einstein condensate and the crossing of a quantum phase transition in small systems of cold atoms in optical lattices. We also show that such processes are robust with respect to perturbations, including temperature and atom number fluctuations.

Equation-based languages – A new paradigm for building energy modeling, simulation and optimization

DOE PAGES

Wetter, Michael; Bonvini, Marco; Nouidui, Thierry S.

2016-04-01

Most of the state-of-the-art building simulation programs implement models in imperative programming languages. This complicates modeling and excludes the use of certain efficient methods for simulation and optimization. In contrast, equation-based modeling languages declare relations among variables, thereby allowing the use of computer algebra to enable much simpler schematic modeling and to generate efficient code for simulation and optimization. We contrast the two approaches in this paper. We explain how such manipulations support new use cases. In the first of two examples, we couple models of the electrical grid, multiple buildings, HVAC systems and controllers to test a controller thatmore » adjusts building room temperatures and PV inverter reactive power to maintain power quality. In the second example, we contrast the computing time for solving an optimal control problem for a room-level model predictive controller with and without symbolic manipulations. As a result, exploiting the equation-based language led to 2, 200 times faster solution« less

High degree-of-freedom dynamic manipulation

NASA Astrophysics Data System (ADS)

Murphy, Michael P.; Stephens, Benjamin; Abe, Yeuhi; Rizzi, Alfred A.

2012-06-01

The creation of high degree of freedom dynamic mobile manipulation techniques and behaviors will allow robots to accomplish difficult tasks in the field. We are investigating the use of the body and legs of legged robots to improve the strength, velocity, and workspace of an integrated manipulator to accomplish dynamic manipulation. This is an especially challenging task, as all of the degrees of freedom are active at all times, the dynamic forces generated are high, and the legged system must maintain robust balance throughout the duration of the tasks. To accomplish this goal, we are utilizing trajectory optimization techniques to generate feasible open-loop behaviors for our 28 dof quadruped robot (BigDog) by planning the trajectories in a 13 dimensional space. Covariance Matrix Adaptation techniques are utilized to optimize for several criteria such as payload capability and task completion speed while also obeying constraints such as torque and velocity limits, kinematic limits, and center of pressure location. These open-loop behaviors are then used to generate feed-forward terms, which are subsequently used online to improve tracking and maintain low controller gains. Some initial results on one of our existing balancing quadruped robots with an additional human-arm-like manipulator are demonstrated on robot hardware, including dynamic lifting and throwing of heavy objects 16.5kg cinder blocks, using motions that resemble a human athlete more than typical robotic motions. Increased payload capacity is accomplished through coordinated body motion.

The Ways of the Hand: A Study of Hand Function among Blind, Visually Impaired and Visually Impaired Multi-Handicapped Children and Adolescents.

ERIC Educational Resources Information Center

Rogow, Sally M.

1987-01-01

The manual development of 148 blind, visually impaired, and visually impaired multi-handicapped students, aged 3-19, was studied. Results indicated a significant relationship between object manipulation and speech, and an inverse relationship between object manipulation and stereotypic hand mannerisms. Optimal development of manual functions and…

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.

Quantum optimal control of isomerization dynamics of a one-dimensional reaction-path model dominated by a competing dissociation channel

NASA Astrophysics Data System (ADS)

Kurosaki, Yuzuru; Artamonov, Maxim; Ho, Tak-San; Rabitz, Herschel

2009-07-01

Quantum wave packet optimal control simulations with intense laser pulses have been carried out for studying molecular isomerization dynamics of a one-dimensional (1D) reaction-path model involving a dominant competing dissociation channel. The 1D intrinsic reaction coordinate model mimics the ozone open→cyclic ring isomerization along the minimum energy path that successively connects the ozone cyclic ring minimum, the transition state (TS), the open (global) minimum, and the dissociative O2+O asymptote on the O3 ground-state A1' potential energy surface. Energetically, the cyclic ring isomer, the TS barrier, and the O2+O dissociation channel lie at ˜0.05, ˜0.086, and ˜0.037 hartree above the open isomer, respectively. The molecular orientation of the modeled ozone is held constant with respect to the laser-field polarization and several optimal fields are found that all produce nearly perfect isomerization. The optimal control fields are characterized by distinctive high temporal peaks as well as low frequency components, thereby enabling abrupt transfer of the time-dependent wave packet over the TS from the open minimum to the targeted ring minimum. The quick transition of the ozone wave packet avoids detrimental leakage into the competing O2+O channel. It is possible to obtain weaker optimal laser fields, resulting in slower transfer of the wave packets over the TS, when a reduced level of isomerization is satisfactory.

ELASTIC NET FOR COX’S PROPORTIONAL HAZARDS MODEL WITH A SOLUTION PATH ALGORITHM

PubMed Central

Wu, Yichao

2012-01-01

For least squares regression, Efron et al. (2004) proposed an efficient solution path algorithm, the least angle regression (LAR). They showed that a slight modification of the LAR leads to the whole LASSO solution path. Both the LAR and LASSO solution paths are piecewise linear. Recently Wu (2011) extended the LAR to generalized linear models and the quasi-likelihood method. In this work we extend the LAR further to handle Cox’s proportional hazards model. The goal is to develop a solution path algorithm for the elastic net penalty (Zou and Hastie (2005)) in Cox’s proportional hazards model. This goal is achieved in two steps. First we extend the LAR to optimizing the log partial likelihood plus a fixed small ridge term. Then we define a path modification, which leads to the solution path of the elastic net regularized log partial likelihood. Our solution path is exact and piecewise determined by ordinary differential equation systems. PMID:23226932

A preliminary path analysis of expectancy and patient-provider encounter in an open-label randomized controlled trial of spinal manipulation for cervicogenic headache.

PubMed

Haas, Mitchell; Aickin, Mikel; Vavrek, Darcy

2010-01-01

The purpose of this article was to present a preliminary model to identify the effects of expectancy of treatment success and the patient-provider encounter (PPE) on outcomes in an open-label randomized trial. Eighty participants with chronic cervicogenic headache (CGH) were randomized to 4 groups: 2 levels of treatment dose (8 or 16) and 2 levels of therapy from a chiropractor (spinal manipulation or light massage). Providers were instructed to have equal enthusiasm for all care. Structural equation modeling with standardized path coefficients (beta) was used in a path analysis to identify the effects of patient expectancy and the PPE on CGH pain. The model included monthly pain from baseline to 12 weeks. Expectancy and PPE were evaluated on Likert scales. The patient-provider encounter was measured as patient perception of chiropractor enthusiasm, confidence, and comfort with care. Baseline patient expectancy was balanced across groups. The PPE measures were balanced across groups and consistent over the 8-week treatment period. Treatment and baseline pain had the strongest effects on pain outcomes (|beta| = .46-.59). Expectations had little effect on pain (abs value(beta) < .15). The patient-provider encounter had a weak effect on pain (abs value(beta)= .03-.27) and on subsequent confidence in treatment success (abs value(beta)= .09 and .12). Encouraging equipoise in the PPE and balancing expectancy across treatment groups may protect against some confounding related to the absence of blinding in a randomized controlled trial of pain. In this trial, their effects were found to be small relative to the effects of treatment and baseline values. Copyright 2010 National University of Health Sciences. Published by Mosby, Inc. All rights reserved.

Inverse optimal self-tuning PID control design for an autonomous underwater vehicle

NASA Astrophysics Data System (ADS)

Rout, Raja; Subudhi, Bidyadhar

2017-01-01

This paper presents a new approach to path following control design for an autonomous underwater vehicle (AUV). A NARMAX model of the AUV is derived first and then its parameters are adapted online using the recursive extended least square algorithm. An adaptive Propotional-Integral-Derivative (PID) controller is developed using the derived parameters to accomplish the path following task of an AUV. The gain parameters of the PID controller are tuned using an inverse optimal control technique, which alleviates the problem of solving Hamilton-Jacobian equation and also satisfies an error cost function. Simulation studies were pursued to verify the efficacy of the proposed control algorithm. From the obtained results, it is envisaged that the proposed NARMAX model-based self-tuning adaptive PID control provides good path following performance even in the presence of uncertainty arising due to ocean current or hydrodynamic parameter.

Multiagent Flight Control in Dynamic Environments with Cooperative Coevolutionary Algorithms

NASA Technical Reports Server (NTRS)

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

2014-01-01

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

Multiagent Flight Control in Dynamic Environments with Cooperative Coevolutionary Algorithms

NASA Technical Reports Server (NTRS)

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

2014-01-01

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

Genetic Algorithm for Traveling Salesman Problem with Modified Cycle Crossover Operator

PubMed Central

Mohamd Shoukry, Alaa; Gani, Showkat

2017-01-01

Genetic algorithms are evolutionary techniques used for optimization purposes according to survival of the fittest idea. These methods do not ensure optimal solutions; however, they give good approximation usually in time. The genetic algorithms are useful for NP-hard problems, especially the traveling salesman problem. The genetic algorithm depends on selection criteria, crossover, and mutation operators. To tackle the traveling salesman problem using genetic algorithms, there are various representations such as binary, path, adjacency, ordinal, and matrix representations. In this article, we propose a new crossover operator for traveling salesman problem to minimize the total distance. This approach has been linked with path representation, which is the most natural way to represent a legal tour. Computational results are also reported with some traditional path representation methods like partially mapped and order crossovers along with new cycle crossover operator for some benchmark TSPLIB instances and found improvements. PMID:29209364

Genetic Algorithm for Traveling Salesman Problem with Modified Cycle Crossover Operator.

PubMed

Hussain, Abid; Muhammad, Yousaf Shad; Nauman Sajid, M; Hussain, Ijaz; Mohamd Shoukry, Alaa; Gani, Showkat

2017-01-01

Genetic algorithms are evolutionary techniques used for optimization purposes according to survival of the fittest idea. These methods do not ensure optimal solutions; however, they give good approximation usually in time. The genetic algorithms are useful for NP-hard problems, especially the traveling salesman problem. The genetic algorithm depends on selection criteria, crossover, and mutation operators. To tackle the traveling salesman problem using genetic algorithms, there are various representations such as binary, path, adjacency, ordinal, and matrix representations. In this article, we propose a new crossover operator for traveling salesman problem to minimize the total distance. This approach has been linked with path representation, which is the most natural way to represent a legal tour. Computational results are also reported with some traditional path representation methods like partially mapped and order crossovers along with new cycle crossover operator for some benchmark TSPLIB instances and found improvements.

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.

Graph drawing using tabu search coupled with path relinking.

PubMed

Dib, Fadi K; Rodgers, Peter

2018-01-01

Graph drawing, or the automatic layout of graphs, is a challenging problem. There are several search based methods for graph drawing which are based on optimizing an objective function which is formed from a weighted sum of multiple criteria. In this paper, we propose a new neighbourhood search method which uses a tabu search coupled with path relinking to optimize such objective functions for general graph layouts with undirected straight lines. To our knowledge, before our work, neither of these methods have been previously used in general multi-criteria graph drawing. Tabu search uses a memory list to speed up searching by avoiding previously tested solutions, while the path relinking method generates new solutions by exploring paths that connect high quality solutions. We use path relinking periodically within the tabu search procedure to speed up the identification of good solutions. We have evaluated our new method against the commonly used neighbourhood search optimization techniques: hill climbing and simulated annealing. Our evaluation examines the quality of the graph layout (objective function's value) and the speed of layout in terms of the number of evaluated solutions required to draw a graph. We also examine the relative scalability of each method. Our experimental results were applied to both random graphs and a real-world dataset. We show that our method outperforms both hill climbing and simulated annealing by producing a better layout in a lower number of evaluated solutions. In addition, we demonstrate that our method has greater scalability as it can layout larger graphs than the state-of-the-art neighbourhood search methods. Finally, we show that similar results can be produced in a real world setting by testing our method against a standard public graph dataset.

Graph drawing using tabu search coupled with path relinking

PubMed Central

Rodgers, Peter

2018-01-01

Graph drawing, or the automatic layout of graphs, is a challenging problem. There are several search based methods for graph drawing which are based on optimizing an objective function which is formed from a weighted sum of multiple criteria. In this paper, we propose a new neighbourhood search method which uses a tabu search coupled with path relinking to optimize such objective functions for general graph layouts with undirected straight lines. To our knowledge, before our work, neither of these methods have been previously used in general multi-criteria graph drawing. Tabu search uses a memory list to speed up searching by avoiding previously tested solutions, while the path relinking method generates new solutions by exploring paths that connect high quality solutions. We use path relinking periodically within the tabu search procedure to speed up the identification of good solutions. We have evaluated our new method against the commonly used neighbourhood search optimization techniques: hill climbing and simulated annealing. Our evaluation examines the quality of the graph layout (objective function’s value) and the speed of layout in terms of the number of evaluated solutions required to draw a graph. We also examine the relative scalability of each method. Our experimental results were applied to both random graphs and a real-world dataset. We show that our method outperforms both hill climbing and simulated annealing by producing a better layout in a lower number of evaluated solutions. In addition, we demonstrate that our method has greater scalability as it can layout larger graphs than the state-of-the-art neighbourhood search methods. Finally, we show that similar results can be produced in a real world setting by testing our method against a standard public graph dataset. PMID:29746576

Use of combined radar and radiometer systems in space for precipitation measurement: Some ideas

NASA Technical Reports Server (NTRS)

Moore, R. K.

1981-01-01

A brief survey is given of some fundamental physical concepts of optimal polarization characteristics of a transmission path or scatter ensemble of hydrometers. It is argued that, based on this optimization concept, definite advances in remote atmospheric sensing are to be expected. Basic properties of Kennaugh's optimal polarization theory are identified.

Improved Modeling of Intelligent Tutoring Systems Using Ant Colony Optimization

ERIC Educational Resources Information Center

Rastegarmoghadam, Mahin; Ziarati, Koorush

2017-01-01

Swarm intelligence approaches, such as ant colony optimization (ACO), are used in adaptive e-learning systems and provide an effective method for finding optimal learning paths based on self-organization. The aim of this paper is to develop an improved modeling of adaptive tutoring systems using ACO. In this model, the learning object is…

Design Genetic Algorithm Optimization Education Software Based Fuzzy Controller for a Tricopter Fly Path Planning

ERIC Educational Resources Information Center

Tran, Huu-Khoa; Chiou, Juing -Shian; Peng, Shou-Tao

2016-01-01

In this paper, the feasibility of a Genetic Algorithm Optimization (GAO) education software based Fuzzy Logic Controller (GAO-FLC) for simulating the flight motion control of Unmanned Aerial Vehicles (UAVs) is designed. The generated flight trajectories integrate the optimized Scaling Factors (SF) fuzzy controller gains by using GAO algorithm. The…

Do Dogs Know Related Rates Rather than Optimization?

ERIC Educational Resources Information Center

Perruchet, Pierre; Gallego, Jorge

2006-01-01

Although dogs seemingly follow the optimal path where they get to a ball thrown into the water, they certainly do not know the minimization function proposed in the calculus books. Trading the optimization problem for a related rates problem leads to a mathematically identical solution, which, it is argued here, is a more plausible model for the…

How do protozoa respond to intense magnetic fields?

NASA Astrophysics Data System (ADS)

Guevorkian, Karine

2005-03-01

Most microorganisms such as Paramecium Caudatum, swim in helical paths in nature. In the absence of any external stimuli (e.g. obstacles, electric field, heat, etc.) the axes of these helical paths, which define the trajectories, are straight lines and are distributed in random directions. Our experiments reveal that these trajectories can be manipulated by applying intense DC magnetic fields of the order of several Tesla. Swimming paramecia, for example, align their trajectories with magnetic fields in excess of about 7 Tesla in fraction of a second. We will describe this phenomenon in fields up to 25 T. We will address whether this effect is an active or passive response to the magnetic torque exerted on the diamagnetically anisotropic structures in Paramecium. In addition we will present results for other species as they are obtained.

Optimal multiguidance integration in insect navigation.

PubMed

Hoinville, Thierry; Wehner, Rüdiger

2018-03-13

In the last decades, desert ants have become model organisms for the study of insect navigation. In finding their way, they use two major navigational routines: path integration using a celestial compass and landmark guidance based on sets of panoramic views of the terrestrial environment. It has been claimed that this information would enable the insect to acquire and use a centralized cognitive map of its foraging terrain. Here, we present a decentralized architecture, in which the concurrently operating path integration and landmark guidance routines contribute optimally to the directions to be steered, with "optimal" meaning maximizing the certainty (reliability) of the combined information. At any one time during its journey, the animal computes a path integration (global) vector and landmark guidance (local) vector, in which the length of each vector is proportional to the certainty of the individual estimates. Hence, these vectors represent the limited knowledge that the navigator has at any one place about the direction of the goal. The sum of the global and local vectors indicates the navigator's optimal directional estimate. Wherever applied, this decentralized model architecture is sufficient to simulate the results of quite a number of diverse cue-conflict experiments, which have recently been performed in various behavioral contexts by different authors in both desert ants and honeybees. They include even those experiments that have deliberately been designed by former authors to strengthen the evidence for a metric cognitive map in bees.

Optically controlled electrophoresis with a photoconductive substrate

NASA Astrophysics Data System (ADS)

Inami, Wataru; Nagashima, Taiki; Kawata, Yoshimasa

2018-05-01

A photoconductive substrate is used to perform electrophoresis. Light-induced micro-particle flow manipulation is demonstrated without using a fabricated flow channel. The path along which the particles were moved was formed by an illuminated light pattern on the substrate. Because the substrate conductivity and electric field distribution can be modified by light illumination, the forces acting on the particles can be controlled. This technique has potential applications as a high functionality analytical device.

Comparison of primary optics in amonix CPV arrays

NASA Astrophysics Data System (ADS)

Nayak, Aditya; Kinsey, Geoffrey S.; Liu, Mingguo; Bagienski, William; Garboushian, Vahan

2012-10-01

The Amonix CPV system utilizes an acrylic Fresnel lens Primary Optical Element (POE) and a reflective Secondary Optical Element (SOE). Improvements in the optical design have contributed to more than 10% increase in rated power last year. In order to further optimize the optical power path, Amonix is looking at various trade-offs in optics, including, concentration, optical materials, reliability, and cost. A comparison of optical materials used for manufacturing the primary optical element and optical design trade off's used to maximize power output will be presented. Optimization of the power path has led to the demonstration of a module lens-area efficiency of 35% in outdoor testing at Amonix.

Development of Advanced Methods of Structural and Trajectory Analysis for Transport Aircraft

NASA Technical Reports Server (NTRS)

Ardema, Mark D.; Windhorst, Robert; Phillips, James

1998-01-01

This paper develops a near-optimal guidance law for generating minimum fuel, time, or cost fixed-range trajectories for supersonic transport aircraft. The approach uses a choice of new state variables along with singular perturbation techniques to time-scale decouple the dynamic equations into multiple equations of single order (second order for the fast dynamics). Application of the maximum principle to each of the decoupled equations, as opposed to application to the original coupled equations, avoids the two point boundary value problem and transforms the problem from one of a functional optimization to one of multiple function optimizations. It is shown that such an approach produces well known aircraft performance results such as minimizing the Brequet factor for minimum fuel consumption and the energy climb path. Furthermore, the new state variables produce a consistent calculation of flight path angle along the trajectory, eliminating one of the deficiencies in the traditional energy state approximation. In addition, jumps in the energy climb path are smoothed out by integration of the original dynamic equations at constant load factor. Numerical results performed for a supersonic transport design show that a pushover dive followed by a pullout at nominal load factors are sufficient maneuvers to smooth the jump.

Algorithms for Heterogeneous, Multiple Depot, Multiple Unmanned Vehicle Path Planning Problems

DOE PAGES

Sundar, Kaarthik; Rathinam, Sivakumar

2016-12-26

Unmanned vehicles, both aerial and ground, are being used in several monitoring applications to collect data from a set of targets. This article addresses a problem where a group of heterogeneous aerial or ground vehicles with different motion constraints located at distinct depots visit a set of targets. The vehicles also may be equipped with different sensors, and therefore, a target may not be visited by any vehicle. The objective is to find an optimal path for each vehicle starting and ending at its respective depot such that each target is visited at least once by some vehicle, the vehicle–targetmore » constraints are satisfied, and the sum of the length of the paths for all the vehicles is minimized. Two variants of this problem are formulated (one for ground vehicles and another for aerial vehicles) as mixed-integer linear programs and a branchand- cut algorithm is developed to compute an optimal solution to each of the variants. Computational results show that optimal solutions for problems involving 100 targets and 5 vehicles can be obtained within 300 seconds on average, further corroborating the effectiveness of the proposed approach.« less

Optimization of digital designs

NASA Technical Reports Server (NTRS)

Miles, Lowell H. (Inventor); Whitaker, Sterling R. (Inventor)

2009-01-01

An application specific integrated circuit is optimized by translating a first representation of its digital design to a second representation. The second representation includes multiple syntactic expressions that admit a representation of a higher-order function of base Boolean values. The syntactic expressions are manipulated to form a third representation of the digital design.

Telerobotic control of the seven-degree-of-freedom CESAR manipulator

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

Babcock, S.M.; Dubey, R.V.; Euler, J.A.

1988-01-01

The application of a computationally efficient kinematic control scheme for manipulators with redundant degrees of freedom to the unilateral telerobotic control of seven-degree-of-freedom manipulator (CESARM) at the Oak Ridge National Laboratory Center for Engineering Systems Advanced Research is presented. The kinematic control scheme uses a gradient projection optimization method, which eliminates that need to determine the generalized inverse of the Jacobian when solving for joint velocities, given Cartesian end-effector velocities. A six-degree-of-freedom (nonreplica) master controller is used. Performance indices for redundancy resolution are discussed. 5 ref., 6 figs.

Alternative Constraint Handling Technique for Four-Bar Linkage Path Generation

NASA Astrophysics Data System (ADS)

Sleesongsom, S.; Bureerat, S.

2018-03-01

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

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.

Trajectory Tracking of a Planer Parallel Manipulator by Using Computed Force Control Method

NASA Astrophysics Data System (ADS)

Bayram, Atilla

2017-03-01

Despite small workspace, parallel manipulators have some advantages over their serial counterparts in terms of higher speed, acceleration, rigidity, accuracy, manufacturing cost and payload. Accordingly, this type of manipulators can be used in many applications such as in high-speed machine tools, tuning machine for feeding, sensitive cutting, assembly and packaging. This paper presents a special type of planar parallel manipulator with three degrees of freedom. It is constructed as a variable geometry truss generally known planar Stewart platform. The reachable and orientation workspaces are obtained for this manipulator. The inverse kinematic analysis is solved for the trajectory tracking according to the redundancy and joint limit avoidance. Then, the dynamics model of the manipulator is established by using Virtual Work method. The simulations are performed to follow the given planar trajectories by using the dynamic equations of the variable geometry truss manipulator and computed force control method. In computed force control method, the feedback gain matrices for PD control are tuned with fixed matrices by trail end error and variable ones by means of optimization with genetic algorithm.

A Robot Trajectory Optimization Approach for Thermal Barrier Coatings Used for Free-Form Components

NASA Astrophysics Data System (ADS)

Cai, Zhenhua; Qi, Beichun; Tao, Chongyuan; Luo, Jie; Chen, Yuepeng; Xie, Changjun

2017-10-01

This paper is concerned with a robot trajectory optimization approach for thermal barrier coatings. As the requirements of high reproducibility of complex workpieces increase, an optimal thermal spraying trajectory should not only guarantee an accurate control of spray parameters defined by users (e.g., scanning speed, spray distance, scanning step, etc.) to achieve coating thickness homogeneity but also help to homogenize the heat transfer distribution on the coating surface. A mesh-based trajectory generation approach is introduced in this work to generate path curves on a free-form component. Then, two types of meander trajectories are generated by performing a different connection method. Additionally, this paper presents a research approach for introducing the heat transfer analysis into the trajectory planning process. Combining heat transfer analysis with trajectory planning overcomes the defects of traditional trajectory planning methods (e.g., local over-heating), which helps form the uniform temperature field by optimizing the time sequence of path curves. The influence of two different robot trajectories on the process of heat transfer is estimated by coupled FEM models which demonstrates the effectiveness of the presented optimization approach.

An Effective Hybrid Routing Algorithm in WSN: Ant Colony Optimization in combination with Hop Count Minimization.

PubMed

Jiang, Ailian; Zheng, Lihong

2018-03-29

Low cost, high reliability and easy maintenance are key criteria in the design of routing protocols for wireless sensor networks (WSNs). This paper investigates the existing ant colony optimization (ACO)-based WSN routing algorithms and the minimum hop count WSN routing algorithms by reviewing their strengths and weaknesses. We also consider the critical factors of WSNs, such as energy constraint of sensor nodes, network load balancing and dynamic network topology. Then we propose a hybrid routing algorithm that integrates ACO and a minimum hop count scheme. The proposed algorithm is able to find the optimal routing path with minimal total energy consumption and balanced energy consumption on each node. The algorithm has unique superiority in terms of searching for the optimal path, balancing the network load and the network topology maintenance. The WSN model and the proposed algorithm have been implemented using C++. Extensive simulation experimental results have shown that our algorithm outperforms several other WSN routing algorithms on such aspects that include the rate of convergence, the success rate in searching for global optimal solution, and the network lifetime.

An Effective Hybrid Routing Algorithm in WSN: Ant Colony Optimization in combination with Hop Count Minimization

PubMed Central

2018-01-01

Low cost, high reliability and easy maintenance are key criteria in the design of routing protocols for wireless sensor networks (WSNs). This paper investigates the existing ant colony optimization (ACO)-based WSN routing algorithms and the minimum hop count WSN routing algorithms by reviewing their strengths and weaknesses. We also consider the critical factors of WSNs, such as energy constraint of sensor nodes, network load balancing and dynamic network topology. Then we propose a hybrid routing algorithm that integrates ACO and a minimum hop count scheme. The proposed algorithm is able to find the optimal routing path with minimal total energy consumption and balanced energy consumption on each node. The algorithm has unique superiority in terms of searching for the optimal path, balancing the network load and the network topology maintenance. The WSN model and the proposed algorithm have been implemented using C++. Extensive simulation experimental results have shown that our algorithm outperforms several other WSN routing algorithms on such aspects that include the rate of convergence, the success rate in searching for global optimal solution, and the network lifetime. PMID:29596336

Implementation of an optimized microfluidic mixer in alumina employing femtosecond laser ablation

NASA Astrophysics Data System (ADS)

Juodėnas, M.; Tamulevičius, T.; Ulčinas, O.; Tamulevičius, S.

2018-01-01

Manipulation of liquids at the lowest levels of volume and dimension is at the forefront of materials science, chemistry and medicine, offering important time and resource saving applications. However, manipulation by mixing is troublesome at the microliter and lower scales. One approach to overcome this problem is to use passive mixers, which exploit structural obstacles within microfluidic channels or the geometry of channels themselves to enforce and enhance fluid mixing. Some applications require the manipulation and mixing of aggressive substances, which makes conventional microfluidic materials, along with their fabrication methods, inappropriate. In this work, implementation of an optimized full scale three port microfluidic mixer is presented in a slide of a material that is very hard to process but possesses extreme chemical and physical resistance—alumina. The viability of the selected femtosecond laser fabrication method as an alternative to conventional lithography methods, which are unable to process this material, is demonstrated. For the validation and optimization of the microfluidic mixer, a finite element method (FEM) based numerical modeling of the influence of the mixer geometry on its mixing performance is completed. Experimental investigation of the laminar flow geometry demonstrated very good agreement with the numerical simulation results. Such a laser ablation microfabricated passive mixer structure is intended for use in a capillary force assisted nanoparticle assembly setup (CAPA).

Young drivers' optimism bias for accident risk and driving skill: Accountability and insight experience manipulations.

PubMed

White, Melanie J; Cunningham, Lauren C; Titchener, Kirsteen

2011-07-01

This study aimed to determine whether two brief, low cost interventions would reduce young drivers' optimism bias for their driving skills and accident risk perceptions. This tendency for such drivers to perceive themselves as more skillful and less prone to driving accidents than their peers may lead to less engagement in precautionary driving behaviours and a greater engagement in more dangerous driving behaviour. 243 young drivers (aged 17-25 years) were randomly allocated to one of three groups: accountability, insight or control. All participants provided both overall and specific situation ratings of their driving skills and accident risk relative to a typical young driver. Prior to completing the questionnaire, those in the accountability condition were first advised that their driving skills and accident risk would be later assessed via a driving simulator. Those in the insight condition first underwent a difficult computer-based hazard perception task designed to provide participants with insight into their potential limitations when responding to hazards in difficult and unpredictable driving situations. Participants in the control condition completed only the questionnaire. Results showed that the accountability manipulation was effective in reducing optimism bias in terms of participants' comparative ratings of their accident risk in specific situations, though only for less experienced drivers. In contrast, among more experienced males, participants in the insight condition showed greater optimism bias for overall accident risk than their counterparts in the accountability or control groups. There were no effects of the manipulations on drivers' skills ratings. The differential effects of the two types of manipulations on optimism bias relating to one's accident risk in different subgroups of the young driver sample highlight the importance of targeting interventions for different levels of experience. Accountability interventions may be beneficial for less experienced young drivers but the results suggest exercising caution with the use of insight type interventions, particularly hazard perception style tasks, for more experienced young drivers typically still in the provisional stage of graduated licensing systems. Copyright © 2011 Elsevier Ltd. All rights reserved.

Planning Under Uncertainty: Methods and Applications

DTIC Science & Technology

2010-06-09

begun research into fundamental algorithms for optimization and re?optimization of continuous optimization problems (such as linear and quadratic... algorithm yields a 14.3% improvement over the original design while saving 68.2 % of the simulation evaluations compared to standard sample-path...They provide tools for building and justifying computational algorithms for such problems. Year. 2010 Month: 03 Final Research under this grant

Rhythmic Effects of Syntax Processing in Music and Language

PubMed Central

Jung, Harim; Sontag, Samuel; Park, YeBin S.; Loui, Psyche

2015-01-01

Music and language are human cognitive and neural functions that share many structural similarities. Past theories posit a sharing of neural resources between syntax processing in music and language (Patel, 2003), and a dynamic attention network that governs general temporal processing (Large and Jones, 1999). Both make predictions about music and language processing over time. Experiment 1 of this study investigates the relationship between rhythmic expectancy and musical and linguistic syntax in a reading time paradigm. Stimuli (adapted from Slevc et al., 2009) were sentences broken down into segments; each sentence segment was paired with a musical chord and presented at a fixed inter-onset interval. Linguistic syntax violations appeared in a garden-path design. During the critical region of the garden-path sentence, i.e., the particular segment in which the syntactic unexpectedness was processed, expectancy violations for language, music, and rhythm were each independently manipulated: musical expectation was manipulated by presenting out-of-key chords and rhythmic expectancy was manipulated by perturbing the fixed inter-onset interval such that the sentence segments and musical chords appeared either early or late. Reading times were recorded for each sentence segment and compared for linguistic, musical, and rhythmic expectancy. Results showed main effects of rhythmic expectancy and linguistic syntax expectancy on reading time. There was also an effect of rhythm on the interaction between musical and linguistic syntax: effects of violations in musical and linguistic syntax showed significant interaction only during rhythmically expected trials. To test the effects of our experimental design on rhythmic and linguistic expectancies, independently of musical syntax, Experiment 2 used the same experimental paradigm, but the musical factor was eliminated—linguistic stimuli were simply presented silently, and rhythmic expectancy was manipulated at the critical region. Experiment 2 replicated effects of rhythm and language, without an interaction. Together, results suggest that the interaction of music and language syntax processing depends on rhythmic expectancy, and support a merging of theories of music and language syntax processing with dynamic models of attentional entrainment. PMID:26635672

A real-time path rating calculation tool powered by HPC

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

If transmission path ratings are determined in real time and optimized control methods can be implemented, congestion problems can be more effectively managed using the existing transmission assets, reducing congestion costs, avoiding capital expenditures for new physical assets, increasing revenues from the existing system, and maintaining reliability. In just one illustrative case, a BPA study has shown that a 1000-MW rating increase for a transmission path generates $15M in annual revenue, even if only 25% of the increased margin can be tapped for just 25% of the year.

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.

Discrete Particle Swarm Optimization Routing Protocol for Wireless Sensor Networks with Multiple Mobile Sinks.

PubMed

Yang, Jin; Liu, Fagui; Cao, Jianneng; Wang, Liangming

2016-07-14

Mobile sinks can achieve load-balancing and energy-consumption balancing across the wireless sensor networks (WSNs). However, the frequent change of the paths between source nodes and the sinks caused by sink mobility introduces significant overhead in terms of energy and packet delays. To enhance network performance of WSNs with mobile sinks (MWSNs), we present an efficient routing strategy, which is formulated as an optimization problem and employs the particle swarm optimization algorithm (PSO) to build the optimal routing paths. However, the conventional PSO is insufficient to solve discrete routing optimization problems. Therefore, a novel greedy discrete particle swarm optimization with memory (GMDPSO) is put forward to address this problem. In the GMDPSO, particle's position and velocity of traditional PSO are redefined under discrete MWSNs scenario. Particle updating rule is also reconsidered based on the subnetwork topology of MWSNs. Besides, by improving the greedy forwarding routing, a greedy search strategy is designed to drive particles to find a better position quickly. Furthermore, searching history is memorized to accelerate convergence. Simulation results demonstrate that our new protocol significantly improves the robustness and adapts to rapid topological changes with multiple mobile sinks, while efficiently reducing the communication overhead and the energy consumption.

Manipulation of Unknown Objects to Improve the Grasp Quality Using Tactile Information.

PubMed

Montaño, Andrés; Suárez, Raúl

2018-05-03

This work presents a novel and simple approach in the area of manipulation of unknown objects considering both geometric and mechanical constraints of the robotic hand. Starting with an initial blind grasp, our method improves the grasp quality through manipulation considering the three common goals of the manipulation process: improving the hand configuration, the grasp quality and the object positioning, and, at the same time, prevents the object from falling. Tactile feedback is used to obtain local information of the contacts between the fingertips and the object, and no additional exteroceptive feedback sources are considered in the approach. The main novelty of this work lies in the fact that the grasp optimization is performed on-line as a reactive procedure using the tactile and kinematic information obtained during the manipulation. Experimental results are shown to illustrate the efficiency of the approach.

Combined control-structure optimization

NASA Technical Reports Server (NTRS)

Salama, M.; Milman, M.; Bruno, R.; Scheid, R.; Gibson, S.

1989-01-01

An approach for combined control-structure optimization keyed to enhancing early design trade-offs is outlined and illustrated by numerical examples. The approach employs a homotopic strategy and appears to be effective for generating families of designs that can be used in these early trade studies. Analytical results were obtained for classes of structure/control objectives with linear quadratic Gaussian (LQG) and linear quadratic regulator (LQR) costs. For these, researchers demonstrated that global optima can be computed for small values of the homotopy parameter. Conditions for local optima along the homotopy path were also given. Details of two numerical examples employing the LQR control cost were given showing variations of the optimal design variables along the homotopy path. The results of the second example suggest that introducing a second homotopy parameter relating the two parts of the control index in the LQG/LQR formulation might serve to enlarge the family of Pareto optima, but its effect on modifying the optimal structural shapes may be analogous to the original parameter lambda.

Optimization for Service Routes of Pallet Service Center Based on the Pallet Pool Mode

PubMed Central

He, Shiwei; Song, Rui

2016-01-01

Service routes optimization (SRO) of pallet service center should meet customers' demand firstly and then, through the reasonable method of lines organization, realize the shortest path of vehicle driving. The routes optimization of pallet service center is similar to the distribution problems of vehicle routing problem (VRP) and Chinese postman problem (CPP), but it has its own characteristics. Based on the relevant research results, the conditions of determining the number of vehicles, the one way of the route, the constraints of loading, and time windows are fully considered, and a chance constrained programming model with stochastic constraints is constructed taking the shortest path of all vehicles for a delivering (recycling) operation as an objective. For the characteristics of the model, a hybrid intelligent algorithm including stochastic simulation, neural network, and immune clonal algorithm is designed to solve the model. Finally, the validity and rationality of the optimization model and algorithm are verified by the case. PMID:27528865

Sensitivity Analysis of Situational Awareness Measures

NASA Technical Reports Server (NTRS)

Shively, R. J.; Davison, H. J.; Burdick, M. D.; Rutkowski, Michael (Technical Monitor)

2000-01-01

A great deal of effort has been invested in attempts to define situational awareness, and subsequently to measure this construct. However, relatively less work has focused on the sensitivity of these measures to manipulations that affect the SA of the pilot. This investigation was designed to manipulate SA and examine the sensitivity of commonly used measures of SA. In this experiment, we tested the most commonly accepted measures of SA: SAGAT, objective performance measures, and SART, against different levels of SA manipulation to determine the sensitivity of such measures in the rotorcraft flight environment. SAGAT is a measure in which the simulation blanks in the middle of a trial and the pilot is asked specific, situation-relevant questions about the state of the aircraft or the objective of a particular maneuver. In this experiment, after the pilot responded verbally to several questions, the trial continued from the point frozen. SART is a post-trial questionnaire that asked for subjective SA ratings from the pilot at certain points in the previous flight. The objective performance measures included: contacts with hazards (power lines and towers) that impeded the flight path, lateral and vertical anticipation of these hazards, response time to detection of other air traffic, and response time until an aberrant fuel gauge was detected. An SA manipulation of the flight environment was chosen that undisputedly affects a pilot's SA-- visibility. Four variations of weather conditions (clear, light rain, haze, and fog) resulted in a different level of visibility for each trial. Pilot SA was measured by either SAGAT or the objective performance measures within each level of visibility. This enabled us to not only determine the sensitivity within a measure, but also between the measures. The SART questionnaire and the NASA-TLX, a measure of workload, were distributed after every trial. Using the newly developed rotorcraft part-task laboratory (RPTL) at NASA Ames Research Center, each pilot flew eight trials, four using SAGAT and four using performance measures. Each set of four trials differed by level of visibility as well. The flight paths were very similar in appearance and hazard number, allowing comparison between flight paths. The pilots were tasked with flying along a road at an assigned altitude and speed while avoiding any hazards that they happened upon. The attempt here was not to find a single best measure of SA, but rather to begin an investigation of the sensitivity of common measures of SA. Upon completion of this study, its results, in combination with future studies, should allow us to develop an empirically based taxonomy of SA measures and the contexts for their appropriate use.

Rapid near-optimal trajectory generation and guidance law development for single-stage-to-orbit airbreathing vehicles

NASA Technical Reports Server (NTRS)

Calise, A. J.; Flandro, G. A.; Corban, J. E.

1990-01-01

General problems associated with on-board trajectory optimization, propulsion system cycle selection, and with the synthesis of guidance laws were addressed for an ascent to low-earth-orbit of an air-breathing single-stage-to-orbit vehicle. The NASA Generic Hypersonic Aerodynamic Model Example and the Langley Accelerator aerodynamic sets were acquired and implemented. Work related to the development of purely analytic aerodynamic models was also performed at a low level. A generic model of a multi-mode propulsion system was developed that includes turbojet, ramjet, scramjet, and rocket engine cycles. Provisions were made in the dynamic model for a component of thrust normal to the flight path. Computational results, which characterize the nonlinear sensitivity of scramjet performance to changes in vehicle angle of attack, were obtained and incorporated into the engine model. Additional trajectory constraints were introduced: maximum dynamic pressure; maximum aerodynamic heating rate per unit area; angle of attack and lift limits; and limits on acceleration both along and normal to the flight path. The remainder of the effort focused on required modifications to a previously derived algorithm when the model complexity cited above was added. In particular, analytic switching conditions were derived which, under appropriate assumptions, govern optimal transition from one propulsion mode to another for two cases: the case in which engine cycle operations can overlap, and the case in which engine cycle operations are mutually exclusive. The resulting guidance algorithm was implemented in software and exercised extensively. It was found that the approximations associated with the assumed time scale separation employed in this work are reasonable except over the Mach range from roughly 5 to 8. This phenomenon is due to the very large thrust capability of scramjets in this Mach regime when sized to meet the requirement for ascent to orbit. By accounting for flight path angle and flight path angle rate in construction of the flight path over this Mach range, the resulting algorithm provides the means for rapid near-optimal trajectory generation and propulsion cycle selection over the entire Mach range from take-off to orbit.

Friction measurements on InAs NWs by AFM manipulation

NASA Astrophysics Data System (ADS)

Pettersson, Hakan; Conache, Gabriela; Gray, Struan; Bordag, Michael; Ribayrol, Aline; Froberg, Linus; Samuelson, Lars; Montelius, Lars

2008-03-01

We discuss a new approach to measure the friction force between elastically deformed nanowires and a surface. The wires are bent, using an AFM, into an equilibrium shape determined by elastic restoring forces within the wire and friction between the wire and the surface. From measurements of the radius of curvature of the bent wires, elasticity theory allows the friction force per unit length to be calculated. We have studied friction properties of InAs nanowires deposited on SiO2, silanized SiO2 and Si3N4 substrates. The wires were typically from 0.5 to a few microns long, with diameters varying between 20 and 80 nm. Manipulation is done in a `Retrace Lift' mode, where feedback is turned off for the reverse scan and the tip follows a nominal path. The effective manipulation force during the reverse scan can be changed by varying an offset in the height of the tip over the surface. We will report on interesting static- and sliding friction experiments with nanowires on the different substrates, including how the friction force per unit length varies with the diameter of the wires.

Acoustic manipulation of oscillating spherical bodies: Emergence of axial negative acoustic radiation force

NASA Astrophysics Data System (ADS)

Rajabi, Majid; Mojahed, Alireza

2016-11-01

In this paper, emergence of negative axial acoustic radiation force on a rigid oscillating spherical body is investigated for acoustic manipulation purposes. The problem of plane acoustic wave scattering from an oscillating spherical body submerged in an ideal acoustic fluid medium is solved. For the case of oscillating direction collinear with the wave propagation wave number vector (desired path), it has been shown that the acoustic radiation force, as a result of nonlinear acoustic wave interaction with bodies can be expressed as a linear function of incident wave field and the oscillation properties of the oscillator (i.e., amplitude and phase of oscillation). The negative (i.e., pulling effects) and positive (i.e., pushing effects) radiation force situations are divided in oscillation complex plane with a specific frequency-dependant straight line. This characteristic line defines the radiation force cancellation state. In order to investigate the stability of the mentioned manipulation strategy, the case of misaligned oscillation of sphere with the wave propagation direction is studied. The proposed methodology may suggest a novel concept of single-beam acoustic handling techniques based on smart carriers.

FACTOR - FACTOR II. Departmental Program and Model Documentation 71-3.

ERIC Educational Resources Information Center

Wilson, Stanley; Billingsley, Ray

This computer program is designed to optimize a Cobb-Douglas type of production function. The user of this program may choose isoquants and/or the expansion path for a Cobb-Douglas type of production function with up to nine resources. An expansion path is the combination of quantities of each resource that minimizes the cost at each production…

The most likely voltage path and large deviations approximations for integrate-and-fire neurons.

PubMed

Paninski, Liam

2006-08-01

We develop theory and numerical methods for computing the most likely subthreshold voltage path of a noisy integrate-and-fire (IF) neuron, given observations of the neuron's superthreshold spiking activity. This optimal voltage path satisfies a second-order ordinary differential (Euler-Lagrange) equation which may be solved analytically in a number of special cases, and which may be solved numerically in general via a simple "shooting" algorithm. Our results are applicable for both linear and nonlinear subthreshold dynamics, and in certain cases may be extended to correlated subthreshold noise sources. We also show how this optimal voltage may be used to obtain approximations to (1) the likelihood that an IF cell with a given set of parameters was responsible for the observed spike train; and (2) the instantaneous firing rate and interspike interval distribution of a given noisy IF cell. The latter probability approximations are based on the classical Freidlin-Wentzell theory of large deviations principles for stochastic differential equations. We close by comparing this most likely voltage path to the true observed subthreshold voltage trace in a case when intracellular voltage recordings are available in vitro.

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.

Two-condition within-participant statistical mediation analysis: A path-analytic framework.

PubMed

Montoya, Amanda K; Hayes, Andrew F

2017-03-01

Researchers interested in testing mediation often use designs where participants are measured on a dependent variable Y and a mediator M in both of 2 different circumstances. The dominant approach to assessing mediation in such a design, proposed by Judd, Kenny, and McClelland (2001), relies on a series of hypothesis tests about components of the mediation model and is not based on an estimate of or formal inference about the indirect effect. In this article we recast Judd et al.'s approach in the path-analytic framework that is now commonly used in between-participant mediation analysis. By so doing, it is apparent how to estimate the indirect effect of a within-participant manipulation on some outcome through a mediator as the product of paths of influence. This path-analytic approach eliminates the need for discrete hypothesis tests about components of the model to support a claim of mediation, as Judd et al.'s method requires, because it relies only on an inference about the product of paths-the indirect effect. We generalize methods of inference for the indirect effect widely used in between-participant designs to this within-participant version of mediation analysis, including bootstrap confidence intervals and Monte Carlo confidence intervals. Using this path-analytic approach, we extend the method to models with multiple mediators operating in parallel and serially and discuss the comparison of indirect effects in these more complex models. We offer macros and code for SPSS, SAS, and Mplus that conduct these analyses. (PsycINFO Database Record (c) 2017 APA, all rights reserved).

Maximum cycle work output optimization for generalized radiative law Otto cycle engines

NASA Astrophysics Data System (ADS)

Xia, Shaojun; Chen, Lingen; Sun, Fengrui

2016-11-01

An Otto cycle internal combustion engine which includes thermal and friction losses is investigated by finite-time thermodynamics, and the optimization objective is the maximum cycle work output. The thermal energy transfer from the working substance to the cylinder inner wall follows the generalized radiative law (q∝Δ (Tn)). Under the condition that all of the fuel consumption, the compression ratio and the cycle period are given, the optimal piston trajectories for both the examples with unlimited and limited accelerations on every stroke are determined, and the cycle-period distribution among all strokes is also optimized. Numerical calculation results for the case of radiative law are provided and compared with those obtained for the cases of Newtonian law and linear phenomenological law. The results indicate that the optimal piston trajectory on each stroke contains three sections, which consist of an original maximum-acceleration and a terminal maximum-deceleration parts; for the case of radiative law, optimizing the piston motion path can achieve an improvement of more than 20% in both the cycle-work output and the second-law efficiency of the Otto cycle compared with the conventional near-sinusoidal operation, and heat transfer mechanisms have both qualitative and quantitative influences on the optimal paths of piston movements.

Plasmonic optical nanotweezers

NASA Astrophysics Data System (ADS)

Kotb, Rehab; El Maklizi, Mahmoud; Ismail, Yehea; Swillam, Mohamed A.

2017-02-01

Plasmonic grating structures can be used in many applications such as nanolithography and optical trapping. In this paper, we used plasmonic grating as optical tweezers to trap and manipulate dielectric nano-particles. Different plasmonic grating structures with single, double, and triple slits have been investigated and analyzed. The three configurations are optimized and compared to find the best candidate to trap and manipulate nanoparticles. The three optimized structures results in capability to super focusing and beaming the light effectively beyond the diffraction limit. A high transverse gradient optical force is obtained using the triple slit configuration that managed to significantly enhance the field and its gradient. Therefore, it has been chosen as an efficient optical tweezers. This structure managed to trap sub10nm particles efficiently. The resultant 50KT potential well traps the nano particles stably. The proposed structure is used also to manipulate the nano-particles by simply changing the angle of the incident light. We managed to control the movement of nano particle over an area of (5μm x 5μm) precisely. The proposed structure has the advantage of trapping and manipulating the particles outside the structure (not inside the structure such as the most proposed optical tweezers). As a result, it can be used in many applications such as drug delivery and biomedical analysis.

Optimizing Cognitive Load for Learning from Computer-Based Science Simulations

ERIC Educational Resources Information Center

Lee, Hyunjeong; Plass, Jan L.; Homer, Bruce D.

2006-01-01

How can cognitive load in visual displays of computer simulations be optimized? Middle-school chemistry students (N = 257) learned with a simulation of the ideal gas law. Visual complexity was manipulated by separating the display of the simulations in two screens (low complexity) or presenting all information on one screen (high complexity). The…

Cooperating or fighting with control noise in the optimal manipulation of quantum dynamics

NASA Astrophysics Data System (ADS)

Shuang, Feng; Rabitz, Herschel

2004-11-01

This paper investigates the impact of control field noise on the optimal manipulation of quantum dynamics. Simulations are performed on several multilevel quantum systems with the goal of population transfer in the presence of significant control noise. The noise enters as run-to-run variations in the control amplitude and phase with the observation being an ensemble average over many runs as is commonly done in the laboratory. A genetic algorithm with an improved elitism operator is used to find the optimal field that either fights against or cooperates with control field noise. When seeking a high control yield it is possible to find fields that successfully fight with the noise while attaining good quality stable results. When seeking modest control yields, fields can be found which are optimally shaped to cooperate with the noise and thereby drive the dynamics more efficiently. In general, noise reduces the coherence of the dynamics, but the results indicate that population transfer objectives can be met by appropriately either fighting or cooperating with noise, even when it is intense.

Cooperating or fighting with control noise in the optimal manipulation of quantum dynamics.

PubMed

Shuang, Feng; Rabitz, Herschel

2004-11-15

This paper investigates the impact of control field noise on the optimal manipulation of quantum dynamics. Simulations are performed on several multilevel quantum systems with the goal of population transfer in the presence of significant control noise. The noise enters as run-to-run variations in the control amplitude and phase with the observation being an ensemble average over many runs as is commonly done in the laboratory. A genetic algorithm with an improved elitism operator is used to find the optimal field that either fights against or cooperates with control field noise. When seeking a high control yield it is possible to find fields that successfully fight with the noise while attaining good quality stable results. When seeking modest control yields, fields can be found which are optimally shaped to cooperate with the noise and thereby drive the dynamics more efficiently. In general, noise reduces the coherence of the dynamics, but the results indicate that population transfer objectives can be met by appropriately either fighting or cooperating with noise, even when it is intense.

Realization of zero-field skyrmions with high-density via electromagnetic manipulation in Pt/Co/Ta multilayers

NASA Astrophysics Data System (ADS)

He, Min; Peng, Licong; Zhu, Zhaozhao; Li, Gang; Cai, Jianwang; Li, Jianqi; Wei, Hongxiang; Gu, Lin; Wang, Shouguo; Zhao, Tongyun; Shen, Baogen; Zhang, Ying

2017-11-01

Taking advantage of the electron-current ability to generate, stabilize, and manipulate skyrmions prompts the application of skyrmion multilayers in room-temperature spintronic devices. In this study, the robust high-density skyrmions are electromagnetically generated from Pt/Co/Ta multilayers using Lorentz transmission electron microscopy. The skyrmion density is tunable and can be significantly enhanced. Remarkably, these generated skyrmions after optimized manipulation sustain at zero field with both the in-plane current and perpendicular magnetic field being switched off. The skyrmion generation and manipulation method demonstrated in this study opens up an alternative way to engineer skyrmion-based devices. The results also provide key data for further theoretical study to discover the nature of the interaction between the electric current and different spin configurations.

ADMAP (automatic data manipulation program)

NASA Technical Reports Server (NTRS)

Mann, F. I.

1971-01-01

Instructions are presented on the use of ADMAP, (automatic data manipulation program) an aerospace data manipulation computer program. The program was developed to aid in processing, reducing, plotting, and publishing electric propulsion trajectory data generated by the low thrust optimization program, HILTOP. The program has the option of generating SC4020 electric plots, and therefore requires the SC4020 routines to be available at excution time (even if not used). Several general routines are present, including a cubic spline interpolation routine, electric plotter dash line drawing routine, and single parameter and double parameter sorting routines. Many routines are tailored for the manipulation and plotting of electric propulsion data, including an automatic scale selection routine, an automatic curve labelling routine, and an automatic graph titling routine. Data are accepted from either punched cards or magnetic tape.

Manipulator trajectories during orbital servicing mission: numerical simulations and experiments on microgravity simulator

NASA Astrophysics Data System (ADS)

Rybus, T.; Seweryn, K.

2018-06-01

It is considered to use a manipulator-equipped satellite for performing On-Orbit Servicing (OOS) or Active Debris Removal (ADR) missions. In this paper, several possible approaches are reviewed for end-effector (EE) trajectory planning in the Cartesian space, such as application of the Bézier curves for singularity avoidance and method for trajectory optimization. The results of numerical simulations for a satellite equipped with a 7 degree-of-freedom (DoF) manipulator and results of experiments performed on a planar air-bearing microgravity simulator for a simplified two-dimensional (2D) case with a 2-DoF manipulator are presented. Differences between the free-floating case and the case where Attitude and Orbit Control Systems (AOCS) keep constant position and orientation of the satellite are also shown.

Ion Elevators and Escalators in Multilevel Structures for Lossless Ion Manipulations

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

Ibrahim, Yehia M.; Hamid, Ahmed M.; Cox, Jonathan T.

2017-01-19

We describe two approaches based upon ion ‘elevator’ and ‘escalator’ components that allow moving ions to different levels in structures for lossless ion manipulations (SLIM). Guided by ion motion simulations we designed elevator and escalator components providing essentially lossless transmission in multi-level designs based upon ion current measurements. The ion elevator design allowed ions to efficiently bridge a 4 mm gap between levels. The component was integrated in a SLIM and coupled to a QTOF mass spectrometer using an ion funnel interface to evaluate the m/z range transmitted as compared to transmission within a level (e.g. in a linear section).more » Mass spectra for singly-charged ions of m/z 600-2700 produced similar mass spectra for both elevator and straight (linear motion) components. In the ion escalator design, traveling waves (TW) were utilized to transport ions efficiently between two SLIM levels. Ion current measurements and ion mobility (IM) spectrometry analysis illustrated that ions can be transported between TW-SLIM levels with no significant loss of either ions or IM resolution. These developments provide a path for the development of multilevel designs providing e.g. much longer IM path lengths, more compact designs, and the implementation of much more complex SLIM devices in which e.g. different levels may operate at different temperatures or with different gases.« less

Shared control of a medical robot with haptic guidance.

PubMed

Xiong, Linfei; Chng, Chin Boon; Chui, Chee Kong; Yu, Peiwu; Li, Yao

2017-01-01

Tele-operation of robotic surgery reduces the radiation exposure during the interventional radiological operations. However, endoscope vision without force feedback on the surgical tool increases the difficulty for precise manipulation and the risk of tissue damage. The shared control of vision and force provides a novel approach of enhanced control with haptic guidance, which could lead to subtle dexterity and better maneuvrability during MIS surgery. The paper provides an innovative shared control method for robotic minimally invasive surgery system, in which vision and haptic feedback are incorporated to provide guidance cues to the clinician during surgery. The incremental potential field (IPF) method is utilized to generate a guidance path based on the anatomy of tissue and surgical tool interaction. Haptic guidance is provided at the master end to assist the clinician during tele-operative surgical robotic task. The approach has been validated with path following and virtual tumor targeting experiments. The experiment results demonstrate that comparing with vision only guidance, the shared control with vision and haptics improved the accuracy and efficiency of surgical robotic manipulation, where the tool-position error distance and execution time are reduced. The validation experiment demonstrates that the shared control approach could help the surgical robot system provide stable assistance and precise performance to execute the designated surgical task. The methodology could also be implemented with other surgical robot with different surgical tools and applications.

Industrial robot

NASA Astrophysics Data System (ADS)

Prakashan, A.; Mukunda, H. S.; Samuel, S. D.; Colaco, J. C.

1992-11-01

This paper addresses the design and development of a four degree of freedom industrial manipulator, with three liner axes in the positioning mechanism and one rotary axis in the orientation mechanism. The positioning mechanism joints are driven with dc servo motors fitted with incremental shaft encoders. The rotary joint of the orientation mechanism is driven by a stepping motor. The manipulator is controlled by an IBM 386 PC/AT. Microcomputer based interface cards have been developed for independent joint control. PID controllers for dc motors have been designed. Kinematic modeling, dynamic modeling, and path planning have been carried out to generate the control sequence to accomplish a given task with reference to source and destination state constraints. This project has been sponsored by the Department of Science and Technology, Government of India, New Delhi, and has been executed in collaboration with M/s Larsen & Toubro Ltd, Mysore, India.

Fast selective trapping and release of picoliter droplets in a 3D microfluidic PDMS multi-trap system with bubbles.

PubMed

Rambach, Richard W; Biswas, Preetika; Yadav, Ashutosh; Garstecki, Piotr; Franke, Thomas

2018-02-12

The selective manipulation and incubation of individual picoliter drops in high-throughput droplet based microfluidic devices still remains challenging. We used a surface acoustic wave (SAW) to induce a bubble in a 3D designed multi-trap polydimethylsiloxane (PDMS) device to manipulate multiple droplets and demonstrate the selection, incubation and on-demand release of aqueous droplets from a continuous oil flow. By controlling the position of the acoustic actuation, individual droplets are addressed and selectively released from a droplet stream of 460 drops per s. A complete trapping and releasing cycle can be as short as 70 ms and has no upper limit for incubation time. We characterize the fluidic function of the hybrid device in terms of electric power, pulse duration and acoustic path.

Towards manipulating relativistic laser pulses with micro-tube plasma lenses

PubMed Central

Ji, L. L.; Snyder, J.; Pukhov, A.; Freeman, R. R.; Akli, K. U.

2016-01-01

Efficient coupling of intense laser pulses to solid-density matter is critical to many applications including ion acceleration for cancer therapy. At relativistic intensities, the focus has been mainly on investigating various laser beams irradiating initially overdense flat interfaces with little or no control over the interaction. Here, we propose a novel approach that leverages recent advancements in 3D direct laser writing (DLW) of materials and high contrast lasers to manipulate the laser-matter interactions on the micro-scales. We demonstrate, via simulations, that usable intensities ≥1023 Wcm−2 could be achieved with current tabletop lasers coupled to micro-engineered plasma lenses. We show that these plasma optical elements act as a lens to focus laser light. These results open new paths to engineering light-matter interactions at ultra-relativistic intensities. PMID:26979657

On-chip generation of heralded photon-number states

NASA Astrophysics Data System (ADS)

Vergyris, Panagiotis; Meany, Thomas; Lunghi, Tommaso; Sauder, Gregory; Downes, James; Steel, M. J.; Withford, Michael J.; Alibart, Olivier; Tanzilli, Sébastien

2016-10-01

Beyond the use of genuine monolithic integrated optical platforms, we report here a hybrid strategy enabling on-chip generation of configurable heralded two-photon states. More specifically, we combine two different fabrication techniques, i.e., non-linear waveguides on lithium niobate for efficient photon-pair generation and femtosecond-laser-direct-written waveguides on glass for photon manipulation. Through real-time device manipulation capabilities, a variety of path-coded heralded two-photon states can be produced, ranging from product to entangled states. Those states are engineered with high levels of purity, assessed by fidelities of 99.5 ± 8% and 95.0 ± 8%, respectively, obtained via quantum interferometric measurements. Our strategy therefore stands as a milestone for further exploiting entanglement-based protocols, relying on engineered quantum states, and enabled by scalable and compatible photonic circuits.

On-chip generation of heralded photon-number states

PubMed Central

Vergyris, Panagiotis; Meany, Thomas; Lunghi, Tommaso; Sauder, Gregory; Downes, James; Steel, M. J.; Withford, Michael J.; Alibart, Olivier; Tanzilli, Sébastien

2016-01-01

Beyond the use of genuine monolithic integrated optical platforms, we report here a hybrid strategy enabling on-chip generation of configurable heralded two-photon states. More specifically, we combine two different fabrication techniques, i.e., non-linear waveguides on lithium niobate for efficient photon-pair generation and femtosecond-laser-direct-written waveguides on glass for photon manipulation. Through real-time device manipulation capabilities, a variety of path-coded heralded two-photon states can be produced, ranging from product to entangled states. Those states are engineered with high levels of purity, assessed by fidelities of 99.5 ± 8% and 95.0 ± 8%, respectively, obtained via quantum interferometric measurements. Our strategy therefore stands as a milestone for further exploiting entanglement-based protocols, relying on engineered quantum states, and enabled by scalable and compatible photonic circuits. PMID:27775062

Intelligent Robotic Systems Study (IRSS), phase 4

NASA Technical Reports Server (NTRS)

1991-01-01

Under the Intelligent Robotics Systems Study (IRSS), a generalized robotic control architecture was developed for use with the ProtoFlight Manipulator Arm (PFMA). Based upon the NASREM system design concept, the controller built for the PFMA provides localized position based force control, teleoperation, and advanced path recording and playback capabilities. The PFMA has six computer controllable degrees of freedom (DOF) plus a 7th manually indexable DOF, making the manipulator a pseudo 7 DOF mechanism. Joints on the PFMA are driven via 7 pulse width modulated amplifiers. Digital control of the PFMA is implemented using a variety of single board computers. There were two major activities under the IRSS phase 4 study: (1) enhancement of the PFMA control system software functionality; and (2) evaluation of operating modes via a teleoperation performance study. These activities are described and results are given.

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.

The effect of path length and display size on memory for spatial information.

PubMed

Guérard, Katherine; Tremblay, Sébastien

2012-01-01

In serial memory for spatial information, some studies showed that recall performance suffers when the distance between successive locations increases relatively to the size of the display in which they are presented (the path length effect; e.g., Parmentier et al., 2005) but not when distance is increased by enlarging the size of the display (e.g., Smyth & Scholey, 1994). In the present study, we examined the effect of varying the absolute and relative distance between to-be-remembered items on memory for spatial information. We manipulated path length using small (15″) and large (64″) screens within the same design. In two experiments, we showed that distance was disruptive mainly when it is varied relatively to a fixed reference frame, though increasing the size of the display also had a small deleterious effect on recall. The insertion of a retention interval did not influence these effects, suggesting that rehearsal plays a minor role in mediating the effects of distance on serial spatial memory. We discuss the potential role of perceptual organization in light of the pattern of results.

Conjugate gradient optimization programs for shuttle reentry

NASA Technical Reports Server (NTRS)

Powers, W. F.; Jacobson, R. A.; Leonard, D. A.

1972-01-01

Two computer programs for shuttle reentry trajectory optimization are listed and described. Both programs use the conjugate gradient method as the optimization procedure. The Phase 1 Program is developed in cartesian coordinates for a rotating spherical earth, and crossrange, downrange, maximum deceleration, total heating, and terminal speed, altitude, and flight path angle are included in the performance index. The programs make extensive use of subroutines so that they may be easily adapted to other atmospheric trajectory optimization problems.

Statistical evaluation of a project to estimate fish trajectories through the intakes of Kaplan hydropower turbines

NASA Astrophysics Data System (ADS)

Sutton, Virginia Kay

This paper examines statistical issues associated with estimating paths of juvenile salmon through the intakes of Kaplan turbines. Passive sensors, hydrophones, detecting signals from ultrasonic transmitters implanted in individual fish released into the preturbine region were used to obtain the information to estimate fish paths through the intake. Aim and location of the sensors affects the spatial region in which the transmitters can be detected, and formulas relating this region to sensor aiming directions are derived. Cramer-Rao lower bounds for the variance of estimators of fish location are used to optimize placement of each sensor. Finally, a statistical methodology is developed for analyzing angular data collected from optimally placed sensors.

Development of the PEBLebl Traveling Salesman Problem Computerized Testbed

ERIC Educational Resources Information Center

Mueller, Shane T.; Perelman, Brandon S.; Tan, Yin Yin; Thanasuan, Kejkaew

2015-01-01

The traveling salesman problem (TSP) is a combinatorial optimization problem that requires finding the shortest path through a set of points ("cities") that returns to the starting point. Because humans provide heuristic near-optimal solutions to Euclidean versions of the problem, it has sometimes been used to investigate human visual…

Algorithms for constructing optimal paths and statistical analysis of passenger traffic

NASA Astrophysics Data System (ADS)

Trofimov, S. P.; Druzhinina, N. G.; Trofimova, O. G.

2018-01-01

Several existing information systems of urban passenger transport (UPT) are considered. Author’s UPT network model is presented. To a passenger a new service is offered that is the best path from one stop to another stop at a specified time. The algorithm and software implementation for finding the optimal path are presented. The algorithm uses the current UPT schedule. The article also describes the algorithm of statistical analysis of trip payments by the electronic E-cards. The algorithm allows obtaining the density of passenger traffic during the day. This density is independent of the network topology and UPT schedules. The resulting density of the traffic flow can solve a number of practical problems. In particular, the forecast for the overflow of passenger transport in the «rush» hours, the quantitative comparison of different topologies transport networks, constructing of the best UPT timetable. The efficiency of the proposed integrated approach is demonstrated by the example of the model town with arbitrary dimensions.

Hop Optimization and Relay Node Selection in Multi-hop Wireless Ad-Hoc Networks

NASA Astrophysics Data System (ADS)

Li, Xiaohua(Edward)

In this paper we propose an efficient approach to determine the optimal hops for multi-hop ad hoc wireless networks. Based on the assumption that nodes use successive interference cancellation (SIC) and maximal ratio combining (MRC) to deal with mutual interference and to utilize all the received signal energy, we show that the signal-to-interference-plus-noise ratio (SINR) of a node is determined only by the nodes before it, not the nodes after it, along a packet forwarding path. Based on this observation, we propose an iterative procedure to select the relay nodes and to calculate the path SINR as well as capacity of an arbitrary multi-hop packet forwarding path. The complexity of the algorithm is extremely low, and scaling well with network size. The algorithm is applicable in arbitrarily large networks. Its performance is demonstrated as desirable by simulations. The algorithm can be helpful in analyzing the performance of multi-hop wireless networks.

AUCTION MECHANISMS FOR IMPLEMENTING TRADABLE NETWORK PERMIT MARKETS

NASA Astrophysics Data System (ADS)

Wada, Kentaro; Akamatsu, Takashi

This paper proposes a new auction mechanism for implementing the tradable network permit markets. Assuming that each user makes a trip from an origin to a destination along a path in a specific time period, we design an auction mechanism that enables each user to purchase a bundle of permits corresponding to a set of links in the user's preferred path. The objective of the proposed mechanism is to achieve a socially optimal state with minimal revelation of users' private information. In order to achieve this, the mechanism employs an evolutionary approach that has an auction phase and a path capacity adjustment phase, which are repeated on a day-to-day basis. We prove that the proposed mechanism has the following desirable properties: (1) truthful bidding is the dominant strategy for each user and (2) the proposed mechanism converges to an approximate socially optimal state in the sense that the achieved value of the social surplus reaches its maximum value when the number of users is large.

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

Active Vibration Control of a Large Flexible Manipulator by Inertial Force and Joint Torque. Ph.D. Thesis

NASA Technical Reports Server (NTRS)

Lee, Soo Han

1988-01-01

The efficiency and positional accuracy of a lightweight flexible manipulator are limited by its flexural vibrations, which last after a gross motion is completed. The vibration delays subsequent operations. In the proposed work, the vibration is suppressed by inertial force of a small arm in addition to the joint actuators and passive damping treatment. The proposed approach is: (1) Dynamic modeling of a combined system, a large flexible manipulator and a small arm, (2) Determination of optimal sensor location and controller algorithm, and (3) Verification of the fitness of model and the performance of controller.

Dynamics and control of robot for capturing objects in space

NASA Astrophysics Data System (ADS)

Huang, Panfeng

Space robots are expected to perform intricate tasks in future space services, such as satellite maintenance, refueling, and replacing the orbital replacement unit (ORU). To realize these missions, the capturing operation may not be avoided. Such operations will encounter some challenges because space robots have some unique characteristics unfound on ground-based robots, such as, dynamic singularities, dynamic coupling between manipulator and space base, limited energy supply and working without a fixed base, and so on. In addition, since contacts and impacts may not be avoided during capturing operation. Therefore, dynamics and control problems of space robot for capturing objects are significant research topics if the robots are to be deployed for the space services. A typical servicing operation mainly includes three phases: capturing the object, berthing and docking the object, then repairing the target. Therefore, this thesis will focus on resolving some challenging problems during capturing the object, berthing and docking, and so on. In this thesis, I study and analyze the dynamics and control problems of space robot for capturing objects. This work has potential impact in space robotic applications. I first study the contact and impact dynamics of space robot and objects. I specifically focus on analyzing the impact dynamics and mapping the relationship of influence and speed. Then, I develop the fundamental theory for planning the minimum-collision based trajectory of space robot and designing the configuration of space robot at the moment of capture. To compensate for the attitude of the space base during the capturing approach operation, a new balance control concept which can effectively balance the attitude of the space base using the dynamic couplings is developed. The developed balance control concept helps to understand of the nature of space dynamic coupling, and can be readily applied to compensate or minimize the disturbance to the space base. After capturing the object, the space robot must complete the following two tasks: one is to berth the object, and the other is to re-orientate the attitude of the whole robot system for communication and power supply. Therefore, I propose a method to accomplish these two tasks simultaneously using manipulator motion only. The ultimate goal of space services is to realize the capture and manipulation autonomously. Therefore, I propose an affective approach based on learning human skill to track and capture the objects automatically in space. With human-teaching demonstration, the space robot is able to learn and abstract human tracking and capturing skill using an efficient neural-network learning architecture that combines flexible Cascade Neural Networks with Node Decoupled Extended Kalman Filtering (CNN-NDEKF). The simulation results attest that this approach is useful and feasible in tracking trajectory planning and capturing of space robot. Finally I propose a novel approach based on Genetic Algorithms (GAs) to optimize the approach trajectory of space robots in order to realize effective and stable operations. I complete the minimum-torque path planning in order to save the limited energy in space, and design the minimum jerk trajectory for the stabilization of the space manipulator and its space base. These optimal algorithms are very important and useful for the application of space robot.

Optimizing Department of Defense Acquisition Development Test and Evaluation Scheduling

DTIC Science & Technology

2015-06-01

CPM Critical Path Method DOD Department of Defense DT&E development test and evaluation EMD engineering and manufacturing development GAMS...these, including the Program Evaluation Review Technique (PERT), the Critical Path Method ( CPM ), and the resource- constrained project-scheduling...problem (RCPSP). These are of particular interest to this thesis as the current scheduling method uses elements of the PERT/ CPM , and the test

Shortest path problem on a grid network with unordered intermediate points

NASA Astrophysics Data System (ADS)

Saw, Veekeong; Rahman, Amirah; Eng Ong, Wen

2017-10-01

We consider a shortest path problem with single cost factor on a grid network with unordered intermediate points. A two stage heuristic algorithm is proposed to find a feasible solution path within a reasonable amount of time. To evaluate the performance of the proposed algorithm, computational experiments are performed on grid maps of varying size and number of intermediate points. Preliminary results for the problem are reported. Numerical comparisons against brute forcing show that the proposed algorithm consistently yields solutions that are within 10% of the optimal solution and uses significantly less computation time.